Submission #60492

#TimeUsernameProblemLanguageResultExecution timeMemory
60492hamzqq9Gondola (IOI14_gondola)C++14
20 / 100
23 ms1916 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int fr[250001]={0}; int fixed=0; for(int i=0;i<n;i++) { if(inputSeq[i]<=n) { fixed=i; break ; } } int tot=2,big=0; int cur=inputSeq[fixed]; for(int i=fixed;(tot-=(i==fixed));i=(i+1)%n,cur++) { if(cur>n) cur-=n; if(inputSeq[i]>n) { fr[inputSeq[i]]++; big++; continue ; } if(inputSeq[i]!=cur) return 0; } for(int i=n+1;i<250001;i++) { if(fr[i]>1) 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...