Submission #232019

#TimeUsernameProblemLanguageResultExecution timeMemory
232019pere_gil곤돌라 (IOI14_gondola)C++14
20 / 100
18 ms1152 KiB
#include "gondola.h" int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return -3; } int countReplacement(int n, int inputSeq[]){ return -3; } int valid(int n, int inputSeq[]){ int res=1; for(int i=1;i<n;i++){ if(inputSeq[i]!=1 and inputSeq[i-1]+1!=inputSeq[i]){ res=0; } if(inputSeq[i]==1 and inputSeq[i-1]!=n){ res=0; } } if(inputSeq[0]!=1 and inputSeq[n-1]+1!=inputSeq[0]){ res=0; } return res; }
#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...