# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58773 | muradeyn | Gondola (IOI14_gondola) | C++14 | 55 ms | 8392 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[])
{
std::set<int>st;
int ls = -1,in;
for (int i = 0;i<n;i++) {
st.insert(inputSeq[i]);
if (inputSeq[i] <= n) {
if (ls == -1) {
in = i;
ls = inputSeq[i];
continue;
}
if (inputSeq[i] < ls) {
if (inputSeq[i] != 1)return 0;
else if (ls - inputSeq[i] != n - i + in)return 0;
}
else {
if (inputSeq[i] - ls != i - in)return 0;
}
in = i;
ls = inputSeq[i];
}
}
if (st.size() != n)return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
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... |