Submission #8887

#TimeUsernameProblemLanguageResultExecution timeMemory
8887ho94949Gondola (IOI14_gondola)C++98
10 / 100
12 ms2452 KiB
#include "gondola.h" int valid(int n, int inputSeq[]){ int firstoffset=-1; for(int i=0;i<n;i++){ if(inputSeq[i]<=n){ if(firstoffset==-1) firstoffset=(inputSeq[i]-i+n)%n; else if(firstoffset!=(inputSeq[i]-i+n)%n) 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...