# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
734892 | sandry24 | Gondola (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;
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#include "gondola.h"
int freq[250001];
int valid(int n, int inputSeq[]){
int index_under_n = -1;
for(int i = 0; i < n; i++){
freq[inputSeq[i]]++;
if(freq[inputSeq[i]] > 1)
return 0;
if(inputSeq[i] <= n)
index_under_n = i;
}
if(index_under_n == -1)
return 1;
int index = (index_under_n == n-1 ? 0 : index_under_n + 1);
int next = (inputSeq[index_under_n] == n ? 1 : inputSeq[index_under_n] + 1);
while(index != index_under_n){
if(inputSeq[index] < n){
if(inputSeq[index] != next){
return 0;
}
}
index = (index == n-1 ? 0 : index + 1);
next = (next == n ? 1 : next + 1);
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]);
int countReplacement(int n, int inputSeq[]);
void solve(){
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
cin >> a[i];
cout << valid(n, a) << '\n';
}
int main(){
//freopen("input.txt", "r", stdin);
//freopen("test.out", "w", stdout);
//ios::sync_with_stdio(0); cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}