# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12695 | qja0950 | Gondola (IOI14_gondola) | C++98 | 12 ms | 3432 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"
int CheckV[250052];
int valid(int n, int inputSeq[])
{
int first = -1;
for(int i=0; i<n; i++) {
int now = inputSeq[i];
if(now > n) continue;
first = i;
break;
}
if(first == -1) return 1;
for(int i=0; i<n; i++) {
int now = inputSeq[i];
CheckV[now]++;
if(CheckV[now] > 1) return 0;
}
for(int i=0; i<n; i++) {
int index = (first + i) % n;
int value = (inputSeq[first] + i - 1) % n + 1;
int now = inputSeq[index];
if(now > n) continue;
if(now != value) return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |