Submission #307735

#TimeUsernameProblemLanguageResultExecution timeMemory
307735juggernautGondola (IOI14_gondola)C++14
20 / 100
13 ms768 KiB
#include"gondola.h" #include<bits/stdc++.h> //#include"grader.cpp" using namespace std; bool vis[250005]; int valid(int n,int a[]){ int i=0,need; while(i<n&&a[i]>n){ if(vis[a[i]])return 0; vis[a[i]]=1; i++; } if(i==n)return 1; need=a[i]; while(i<n){ if(vis[a[i]])return 0; vis[a[i]]=1; if(a[i]<=n&&a[i]!=need)return 0; if(need==n)need=1; else need++; i++; } 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...