Submission #136041

#TimeUsernameProblemLanguageResultExecution timeMemory
136041arthurconmyGondola (IOI14_gondola)C++14
5 / 100
6 ms504 KiB
#include <bits/stdc++.h> #ifndef ARTHUR_LOCAL #include "gondola.h" #endif using namespace std; bool used[250001]; int valid(int n, int S[]) { pair<int,int> minn = {int(1e9),int(1e9)}; for(int i=0; i<n; i++) { if(used[S[i]]) return 0; used[S[i]]=1; minn = min(minn, make_pair(S[i],i)); } int cur = minn.first; if(cur>n) return 1; for(int j=minn.second+1; j<n; j++) { if(S[j]<cur) return 0; if(S[j]<=n) S[j]=cur; } for(int j=0; j<minn.second; j++) { if(S[j]<cur) return 0; if(S[j]<=n) S[j]=cur; } return 1; } int replacement(int n, int G[], int R[]) { return 1; } int countReplacement(int n, int I[]) { return 1; }
#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...