Submission #230291

#TimeUsernameProblemLanguageResultExecution timeMemory
230291jhtanGondola (IOI14_gondola)C++14
20 / 100
18 ms640 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { // subtask 1, 5 points int r = 1; for(int i=1; i<n; i++) { if(inputSeq[i] == 1 && inputSeq[i-1] != n) { r = 0; break; } if(inputSeq[i] != 1 && inputSeq[i-1] + 1 != inputSeq[i]) { r = 0; break; } } if(inputSeq[0] != 1 && inputSeq[n-1] + 1 != inputSeq[0]) r = 0; return r; } //---------------------- 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...