# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382702 | Trunkty | Gondola (IOI14_gondola) | C++14 | 291 ms | 3184 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 <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include "gondola.h"
using namespace std;
int valid(int n, int inputSeq[]){
vector<int> ck={};
for(int i=0;i<n;i++){
ck.push_back(inputSeq[i]);
}
sort(ck.begin(),ck.end());
for(int i=1;i<ck.size();i++){
if(ck[i]==ck[i-1]){
return 0;
}
}
int ind=0;
for(int i=0;i<n;i++){
if(inputSeq[i]<=n){
ind = i-(inputSeq[i]-1);
if(ind<0){
ind += n;
}
break;
}
}
int now = 1;
for(int i=ind;i<n;i++){
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... |