Submission #17241

#TimeUsernameProblemLanguageResultExecution timeMemory
17241erdemkirazGondola (IOI14_gondola)C++98
10 / 100
12 ms2448 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int ind = -1, x = -1; for(int i = 0; i < n; i++) { if(inputSeq[i] <= n) { ind = i; x = inputSeq[i]; break; } } if(ind == -1) return 1; for(int i = ind + 1; i < n; i++) { if(inputSeq[i] <= n and (x + i - ind - 1) % n + 1 != inputSeq[i]) 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...