# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238307 | lakshith_ | 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 <bits/stdc++.h>
using namespace std;
int valid(int n,int input[]){
int start = -1;
for(int i=0;i<n;i++)if(input[i]<=n){
start = i;
break;
}
if(start==-1)return 1;
int prev = input[start];
for(int i=start+1;i<n;i++){
// cout << input[i] <<"\t" << prev << "\n";
if(input[i]<=n&&input[i]!=prev+1)return 0;
if(prev+1==n)prev = 0;
else
prev++;
}
for(int i=0;i<=start;i++){
cout << input[i] <<"\t" << prev << "\n";
if(input[i]<=n&&input[i]!=prev+1)return 0;
prev++;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return 0;
}
int countReplacement(int n, int inputSeq[]){
return 0;
}
/*
int main(){
io_setup();
while(true){
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++)cin >> arr[i];
cout << valid(n,arr) << "\n";
}
}*/