Submission #127703

#TimeUsernameProblemLanguageResultExecution timeMemory
127703tinjyuGondola (IOI14_gondola)C++14
20 / 100
17 ms3196 KiB
#include "gondola.h" #include <iostream> using namespace std; int valid(int n, int a[]) { int tmp=-1,mi=500005,tag[500005]; for(int i=0;i<=500000;i++)tag[i]=0; for(int i=0;i<n;i++) { if(tag[a[i]]==1)return 0; tag[a[i]]++; } for(int i=0;i<n;i++) if(a[i]<=n && a[i]<mi) { tmp=i; mi=a[i]; } if(tmp==-1)return 1; int p=n-1,i=tmp,t=mi; while(p--) { i++; i%=n; t++; if(a[i]<=n && a[i]!=t)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...