# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
355607 | Mefarnis | Gondola (IOI14_gondola) | C++14 | 34 ms | 5100 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 <bits/stdc++.h>
#include "gondola.h"
#define maxn 100003
#define maxn 250001
using namespace std;
int valid(int n, int inputSeq[]) {
int minIdx = -1;
set<int> s;
for( int i = 0 ; i < n ; i++ )
if(inputSeq[i] <= n) {
if(s.find(inputSeq[i]) != s.end())
return 0;
s.insert(inputSeq[i]);
if(minIdx == -1 || inputSeq[i] < inputSeq[minIdx])
minIdx = i;
}
if(minIdx == -1)
return 1;
for( int i = 0 ; i < n ; i++ )
if(inputSeq[i] <= n) {
int d = (i-minIdx+n) % n;
if(inputSeq[minIdx]+d != inputSeq[i])
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... |