# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1189496 | Agageldi | Gondola (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include "bits/stdc++.h"
#include "grader.cpp"
#include "gondola.h"
using namespace std;
#define N 200005
vector <int> v;
int vis[N];
int valid(int n, int inputSeq[])
{
for(int i = 0; i < n; i++) {
if(vis[inputSeq[i]]) return 0;
if(inputSeq[i] >= 1 && inputSeq[i] <= n) {
v.push_back(i);
}
vis[inputSeq[i]] = 1;
}
v.push_back(v[0]);
for(int i = 0; i < (int)v.size() - 1; i++) {
int x1 = abs(inputSeq[v[i]] - inputSeq[v[i + 1]]);
int x2 = abs(v[i] - v[i + 1]);
if(min(x2,n - x2) != min(x1, n - x1)) return 0;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
int countReplacement(int n, int inputSeq[])
{
return -3;
}