| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 978364 | Amaarsaa | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 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 Can(int n, int b[]) {
sort ( b , b + n);
for (int i = 1; i < n; i ++) if ( b[i]== b[i - 1]) return 0;
return 1;
}
int valid(int n, int a[]) {
int cnt = 0, mn = n + 1, ind = 0;
for (int i = 0; i < n; i ++) {
if ( a[i] <=n) {
cnt ++;
if ( mn >= a[i]) {
mn = a[i];
ind = i;
}
}
}
if ( cnt == 0) {
if (!Can(n, a)) return 0;
return 1;
}
int last = a[ind];
cnt --;
for (int j = 0; j < n; j ++) {
if (a[ind] <= n && a[ind] > last) {
last = a[ind];
cnt --;
}
ind = (ind + 1) % n;
}
if (!Can(n, a)) return 0;
if ( cnt == 0) return 1;
return 0;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
