Submission #382459

#TimeUsernameProblemLanguageResultExecution timeMemory
382459TrunktyGondola (IOI14_gondola)C++14
10 / 100
12 ms1516 KiB
#include <iostream> #include <algorithm> #include <vector> #include "gondola.h" using namespace std; int valid(int n, int inputSeq[]){ bool check[250005]; for(int i=1;i<250005;i++){ check[i] = false; } for(int i=0;i<n;i++){ if(check[i]){ return 0; } check[i] = true; } int ind=0; for(int i=0;i<n;i++){ if(inputSeq[i]<=n){ ind = i-(inputSeq[i]-1); if(ind<0){ ind += n; } break; } } int now = 1; for(int i=ind;i<n;i++){ if(inputSeq[i]<=n){ if(inputSeq[i]!=now){ return 0; } } now++; } for(int i=0;i<ind;i++){ if(inputSeq[i]<=n){ if(inputSeq[i]!=now){ return 0; } } now++; } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return 0; } int countReplacement(int n, int inputSeq[]){ return 0; }
#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...