# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254536 | b00n0rp | Gondola (IOI14_gondola) | C++17 | 67 ms | 5112 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;
#define ll long long
int valid(int n, int inputSeq[]){
set<int> s;
for(int i = 0; i < n; i ++){
s.insert(inputSeq[i]);
}
if(s.size() != n) return 0;
for(int i = 0; i < n; i ++){
if(inputSeq[i] <= n){
for(int j = (i+1)%n; j != i; j = (j+1)%n){
if(inputSeq[j] > n) continue;
if(inputSeq[j] != ((inputSeq[i]+(j-i)+n-1)%n)+1) return 0;
}
return 1;
}
}
return 1;
}
//----------------------
int a[100005];
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
bool flag = 0;
for(int i = 0; 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... |