Submission #1025415

#TimeUsernameProblemLanguageResultExecution timeMemory
1025415vjudge1곤돌라 (IOI14_gondola)C++17
10 / 100
8 ms1364 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int PS=-1; for(int i=0;i<n;i++){ if(inputSeq[i]>n) continue; int k=n+i-inputSeq[i]; k%=n; if(PS==-1) PS=k; if(PS-k) 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...