# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015258 | parsadox2 | 곤돌라 (IOI14_gondola) | C++17 | 32 ms | 5576 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 mn_pos = 0;
for(int i = 1 ; i < n ; i++) if(inputSeq[i] < inputSeq[mn_pos])
mn_pos = i;
vector <int> vec;
for(int i = mn_pos ; i < n ; i++)
vec.push_back(inputSeq[i]);
for(int i = 0 ; i < mn_pos ; i++)
vec.push_back(inputSeq[i]);
set <int> st;
for(auto u : vec)
st.insert(u);
if(st.size() != n)
return 0;
bool flg = true;
for(int i = 1 ; i < n ; i++) if(vec[i] <= n && vec[i] - vec[0] != i)
flg = false;
return flg;
}
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... |