Submission #105077

#TimeUsernameProblemLanguageResultExecution timeMemory
105077WLZ곤돌라 (IOI14_gondola)C++17
10 / 100
16 ms1152 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int pos = -1; for (int i = 0; i < n; i++) { if (inputSeq[i] <= n) { pos = i; break; } } if (pos == -1) { return 1; } int cur = inputSeq[pos] - pos; if (cur < 1) { cur = n - cur; } for (int i = 0; i < n; i++) { if (inputSeq[i] <= n && inputSeq[i] != cur) { return 0; } cur++; if (cur > n) { cur = 1; } } 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...