Submission #718202

#TimeUsernameProblemLanguageResultExecution timeMemory
718202thimote75Gondola (IOI14_gondola)C++14
10 / 100
12 ms1056 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int jStart = -1; for (int i = 0; i < n; i ++) { if (inputSeq[i] > n) continue ; jStart = i; break; } if (jStart == -1) return 1; int start = jStart - inputSeq[jStart] + 1; if (start < 0) start += n; for (int mu = 0; mu < n; mu ++) { int nu = (start + mu); if (nu >= n) nu -= n; if (inputSeq[nu] > n) continue ; if (inputSeq[nu] != mu + 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...