Submission #107692

#TimeUsernameProblemLanguageResultExecution timeMemory
107692FiloSanzaGondola (IOI14_gondola)C++14
10 / 100
15 ms1024 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int N, int inputSeq[]) { vector<int> v; v.reserve(N); for(int i=0; i<N; i++) if(inputSeq[i] <= N) v.push_back(inputSeq[i]); int mini = min_element(v.begin(), v.end()) - v.begin(); for(int i=mini+1; i!=mini; i=(i+1)%v.size()){ if(i == 0 && v.back() >= v.front()) return 0; if(v[i] <= v[i-1]) return 0; } 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...