제출 #136222

#제출 시각아이디문제언어결과실행 시간메모리
136222vinceGondola (IOI14_gondola)C++14
10 / 100
14 ms1184 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int num = -1; for(int i = 0; i < 2*n; i++) { int idx = i%n; if(inputSeq[idx] <= n && num == -1) num = inputSeq[idx]; if(inputSeq[idx] <= n & num != inputSeq[idx]) return 0; if(num != -1) { num++; if(num == n+1) num -= n; } } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:12:26: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
         if(inputSeq[idx] <= n & num != inputSeq[idx])
            ~~~~~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...