| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1282569 | repmann | Gondola (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int N;
int A[200000];
int valid(int n, int a[])
{
N = n;
set <int> SET;
for(int i = 0; i < N; i++) if(!SET.insert(a[i]).second) return 0;
for(int i = 0; i < N; i++) A[i] = A[i + N] = a[i];
int index = 0;
for(int i = 1; i < N; i++) if(A[i] < A[index]) index = i;
if(A[index] > N) return 1;
for(int i = index; i < (index + N); i++)
{
if((A[i] <= N) && (A[index] != (A[i] - (i - index)))) return 0;
}
return 1;
}
int replacement(int n, int a[], int O[]);
int countReplacement(int n, int a[]);
//int main()
//{
// int n;
// cin >> n;
// int a[n];
// for(int i = 0; i < n; i++) cin >> a[i];
// cout << valid(n, a) << '\n';
//}
