Submission #127708

#TimeUsernameProblemLanguageResultExecution timeMemory
127708zozderGondola (IOI14_gondola)C++14
20 / 100
16 ms1660 KiB
#include "gondola.h" #include <iostream> using namespace std; int valid(int n, int inputSeq[]) { int minn=1000,minl=n; int tag[250001]; for(int i=1;i<=250000;i++)tag[i]=0; for(int i=0;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=0; if((inputSeq[minl]!=minn&&0<inputSeq[minl]&&inputSeq[minl]<=n)||tag[inputSeq[minl]]==1)t=0; tag[inputSeq[minl]]=1; // cout<<minn<<","<<minl<<","<<inputSeq[minl]<<","<<tag[inputSeq[minl]]<<endl; 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...