# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382455 | Trunkty | Gondola (IOI14_gondola) | C++14 | 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int valid(int n, vector<int> inputSeq){
bool check[250005];
for(int i=1;i<250005;i++){
check[i] = false;
}
for(int i:inputSeq){
if(check[i]){
return 0;
}
check[i] = true;
}
int ind=0;
for(int i=0;i<inputSeq.size();i++){
if(inputSeq[i]<=n){
ind = i-(inputSeq[i]-1);
if(ind<0){
ind += n;
}
break;
}
}
int now = 1;
for(int i=ind;i<inputSeq.size();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, vector<int> gondolaSeq, vector<int> replacementSeq){
return 0;
}
int countReplacement(int n, vector<int> inputSeq){
return 0;
}