Submission #127702

#TimeUsernameProblemLanguageResultExecution timeMemory
127702zozderGondola (IOI14_gondola)C++14
10 / 100
14 ms632 KiB
#include "gondola.h" #include <iostream> using namespace std; int valid(int n, int inputSeq[]) { int minn=n,minl=n; for(int i=1;i<=n;i++)if(inputSeq[i]<minn&&0<inputSeq[i]&&inputSeq[i]<=n) { minn=inputSeq[i]; minl=i; } int t=1,m=n; while(m>0) { if(minl>n)minl=1; if(inputSeq[minl]!=minn&&0<inputSeq[minl]&&inputSeq[minl]<=n)t=0; m--; minl++; minn++; } return t; } 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...