| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 337025 | blue | Gondola (IOI14_gondola) | C++11 | 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 "gondola.h"
#include <iostream>
#include <set>
using namespace std;
int valid(int n, int inputSeq[])
{
set<int> S;
int prev = -1, prev_pos = -1;
for(int i = 0; i < n; i++)
{
if(S.find(inputSeq[i]) != S.end()) return 0;
S.insert(inputSeq[i]);
if(inputSeq[i] > n) continue;
if(prev != -1)
{
if((i - prev_pos + n) % n != (inputSeq[i] - prev + n) % n) return 0;
}
prev = inputSeq[i];
prev_pos = i;
}
return 1;
}
