# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798620 | Liudas | Gondola (IOI14_gondola) | C++17 | 21 ms | 5632 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"
using namespace std;
int valid(int N, int seq[]){
vector<int> s(2 * N);
set<int> ss;
int val = true;
for(int i = 0; i < N; i ++){
ss.insert(seq[i]);
s[i] = seq[i];
s[i + N] = seq[i];
}
if(ss.size()!=N)val = false;
int start = min_element(s.begin(), s.begin() + N) - s.begin();
int last = 0;
for(int i = start; i < start + N; i ++){
if(s[i] <= N){
if(last < s[i])last = s[i];
else val = false;
}
}
return val;
}
int replacement(int N, int seq[], int rseq[]){
return 0;
}
int countReplacement(int N, int seq[]){
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... |