제출 #30939

#제출 시각아이디문제언어결과실행 시간메모리
30939kajebiiiGondola (IOI14_gondola)C++14
20 / 100
16 ms2484 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int ix = -1, cnt = 0; for(int i=0; i<n; i++) if(inputSeq[i] == 1) { ix = i; cnt++; } if(cnt != 1) return 0; for(int i=0; i<n; i++) if(inputSeq[(ix+i)%n] != (i+1)) return 0; return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
#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...