# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064526 | sunboi | 곤돌라 (IOI14_gondola) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]){
vector<int> a;
for (int i = 0; i < n; i++){
if (inputSeq[i] == 1) a.push_back(inputSeq[i]);
else if (!a.empty()){
a.push_back(inputSeq[i]);
}
}
for (int i = 0; i < n; i++){
if (inputSeq[i] == 1) break;
a.push_back(inputSeq[i]);
}
return is_sorted(a.begin(), a.end());
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return 0;
}
int countReplacement(int n, int inputSeq[]){
return 0;
}