# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433419 | muhammad_hokimiyon | Gondola (IOI14_gondola) | C++14 | 13 ms | 2380 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 <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
int st = 0;
for(int i = 0; i < n; i++){
if(inputSeq[i] == 1)st = i;
}
vector<int> cnt(250500, 0);
for(int i = 0; i < n; i++){
cnt[inputSeq[i]]++;
}
for(int i = 0; i <= 250500; i++){
if(cnt[i] > 1){
return 0;
}
}
for(int it = 0; it < n - 2; it++){
int p = (it + st) % n;
int nx = (it + 1 + st) % n;
if(inputSeq[p] > n || inputSeq[nx] > n){
continue;
}
if(inputSeq[nx] - inputSeq[p] != 1){
return 0;
}
}
Compilation message (stderr)
# | 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... |