# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
819550 | Yey | 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>
#include "gondola.h"
#define ll long long
#define mod 1000000007
using namespace std;
int replacement(int n, int gondolaSeq[], int replacementSeq[]);
int countReplacement(int n, int inputSeq[]);
int valid(int n,int inputSeq[]){
int mn = INT_MAX;
int id;
for(int i = 0 ; i < n ; i++){
if( mn > inputSeq[i] ){
mn = inputSeq[i];
id = i;
}
}
if( mn > n ) return 1;
vector<int> v;
mn--;
id = (id-mn)%n+n;
id %= n;
for(int i = id ; i < n ; i++) v.push_back(inputSeq[i]);
for(int i = 0 ; i < id ; i++) v.push_back(inputSeq[i]);
for(int i = 0 ; i < n ; i++){
if( v[i] <= n && v[i] != i+1 ) return 0;
}
return 1;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//~ cin>>n;
//~ for(int i = 0 ; i < n ; i++){
//~ cin>>inputSeq[i];
//~ }
//~ cout<<valid(n)<<"\n";
//~ ll T = 1;
//~ //cin>>T;
//~ for(int i = 0 ; i < T ; i++){
//~ solve();
//~ }
}