# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701927 | Cyanmond | Gondola (IOI14_gondola) | C++17 | 43 ms | 6028 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>
int valid(int n, int inputSeq[]) {
for (int i = 0; i < n; ++i) {
--inputSeq[i];
}
{
// double
std::set<int> s;
for (int i = 0; i < n; ++i) {
s.insert(inputSeq[i]);
}
if (s.size() != n) {
return false;
}
}
for (int f = 0; f < n; ++f) {
if (inputSeq[f] >= n) {
continue;
}
int x = inputSeq[f];
bool answer = true;
for (int i = f + 1; i < n; ++i) {
const int y = (x + 1) % n;
if (inputSeq[i] < n and y != inputSeq[i]) {
answer = false;
}
x = y;
}
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... |