# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239542 | Autoratch | Gondola (IOI14_gondola) | C++14 | 30 ms | 2816 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;
const int N = 1e6 + 2;
const long long MOD = 1e9 + 9;
int repl[N];
int valid(int n,int a[])
{
int x,y = 0;
for(int i = 0;i < n;i++) if(a[i]<=n) x = i,y = a[i];
for(int i = 0;i < n;i++) if(a[i]<=n)
{
int z = y+i-x;
if(z>n) z%=n;
if(z<1) z+=n;
if(y and z!=a[i]) return 0;
}
sort(a,a+n);
for(int i = 0;i < n-1;i++) if(a[i]==a[i+1]) return 0;
return 1;
}
int replacement(int n,int a[],int ans[])
{
int x = 0,y = 1,mx = 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... |