# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
579768 | 1ne | 곤돌라 (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;
//#include "gondola.h"
int valid(int n, int inputSeq[])
{
int index = -1;
for (int i = 0;i<n;++i){
if (inputSeq[i] <=n){
index = i;
}
}
map<int,int>visited;
if (index == -1)return 1;
for (int i = 0;i<n;++i){
int j = (i + index)%n;
int temp = inputSeq[index] + i;
if (temp > n)temp = temp % n;
if (visited[temp] || visited[inputSeq[j]])return 0;
visited[temp] = true;
visited[inputSeq[j]] = true;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}