Submission #384809

#TimeUsernameProblemLanguageResultExecution timeMemory
384809angularAndSplinteredGondola (IOI14_gondola)C++14
20 / 100
12 ms1132 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { auto nxt = [&] (int x) { if (x + 1 > n) return 1; return x + 1; }; for (int i = 0; i < n; i += 1) if (inputSeq[(i + 1) % n] != nxt(inputSeq[i])) return false; return true; } //---------------------- 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...