Submission #589113

#TimeUsernameProblemLanguageResultExecution timeMemory
589113BT21tataGondola (IOI14_gondola)C++17
10 / 100
17 ms980 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int a[]) { int val=-1; for(int i=0; i<n; i++) { if(a[i]<=n) { if(val==-1) { val=a[i]+1; if(val==n+1) val=1; } else { if(a[i]!=val) { //cout<<i<<' '<<a[i]<<' '<<val<<endl; return 0; } else { val=a[i]+1; if(val==n+1) val=1; } } } else { if(val!=-1) { val++; if(val==n+1) val=1; } } } 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...