| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 335353 | 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>
using namespace std;
int valid(int n, int inputSeq[])
{
set<int> S;
int temp = n+1;
for(int i = 0; i < n; i++) if(inputSeq[i] <= n)
{
temp = inputSeq[i];
break;
if(S.find(temp) != S.end()) return 0;
S.insert(temp);
}
if(temp == n+1) return 1;
for(int i = 0; i < n; i++) if(inputSeq[i] <= n)
{
inputSeq[i] = (inputSeq[i] - temp + n) % n;
}
temp = -1;
for(int i = 0; i < n; i++)
{
if(inputSeq[i] > n) continue;
if(temp != -1 && inputSeq[i] <= inputSeq[temp]) return 0;
temp = i;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return 0;
}
int countReplacement(int n, int inputSeq[])
{
return 0;
}
