Submission #307730

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