Submission #1144017


Source Code Expand

#include <cstdio>
using namespace std;
#define sci(x)     int x;   scanf("%d",&x);
#define scii(x, y) int x,y; scanf("%d%d",&x,&y);
#define REP(i, y)  for(int i=0;i<y;i++)
#define REPI(i, y) for(int i=y-1;i>-1;i--)
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
typedef long long   ll;
const int INF = 2<<30;
const int MAX_K = 110;

int main() {
  sci(N);
  scii(a,b);
  sci(K);
  int P[MAX_K];
  P[0] = a;
  P[K+1] = b;
  FOR(i,1,K+1) {
    scanf("%d",&P[i]);
  }
  bool uso_flag=false;
  for (int i=0; i<K+1; i++) {
    for (int j=i+1; j<K+2; j++) {
      if (P[i]==P[j]){
        uso_flag=true;
      }
    }
  }
  printf("%s\n", uso_flag ? "NO":"YES");
}

Submission Info

Submission Time
Task B - 嘘つきの高橋くん
User fifth_russian
Language C++14 (GCC 5.4.1)
Score 100
Code Size 690 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:3:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 #define sci(x)     int x;   scanf("%d",&x);
                                           ^
./Main.cpp:13:3: note: in expansion of macro ‘sci’
   sci(N);
   ^
./Main.cpp:4:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 #define scii(x, y) int x,y; scanf("%d%d",&x,&y);
                                                ^
./Main.cpp:14:3: note: in expansion of macro ‘scii’
   scii(a,b);
   ^
./Main.cpp:3:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 #define sci(x)     int x;   scanf("%d",&x);
                                           ^
./Main.cpp:15:3: note: in expansion of macro ‘sci’
   sci(K);
   ^
./Main.cpp:20:22: warning: ignoring return value of ‘int scanf(con...

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 29
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 128 KB
subtask0_sample_02.txt AC 1 ms 128 KB
subtask0_sample_03.txt AC 1 ms 128 KB
subtask0_sample_04.txt AC 1 ms 128 KB
subtask0_sample_05.txt AC 1 ms 128 KB
subtask1_01.txt AC 1 ms 128 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 1 ms 128 KB
subtask1_04.txt AC 1 ms 128 KB
subtask1_05.txt AC 1 ms 128 KB
subtask1_06.txt AC 1 ms 128 KB
subtask1_07.txt AC 1 ms 128 KB
subtask1_08.txt AC 1 ms 128 KB
subtask1_09.txt AC 1 ms 128 KB
subtask1_10.txt AC 1 ms 128 KB
subtask1_11.txt AC 1 ms 128 KB
subtask1_12.txt AC 1 ms 128 KB
subtask1_13.txt AC 1 ms 128 KB
subtask1_14.txt AC 1 ms 128 KB
subtask1_15.txt AC 1 ms 128 KB
subtask1_16.txt AC 1 ms 128 KB
subtask1_17.txt AC 1 ms 128 KB
subtask1_18.txt AC 1 ms 128 KB
subtask1_19.txt AC 1 ms 128 KB
subtask1_20.txt AC 1 ms 128 KB
subtask1_21.txt AC 1 ms 128 KB
subtask1_22.txt AC 1 ms 128 KB
subtask1_23.txt AC 1 ms 128 KB
subtask1_24.txt AC 1 ms 128 KB