# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374380 | Aryan_Raina | 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 "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ar array
const int INF = 1e15;
const int MOD = 1e9+7;
int valid(int n, int a[]) {
int rr = -1;
for (int i = 0; i < n; i++) {
if (a[i] <= n) {
if (rr == -1) rr = i;
if ((n + a[i] - a[rr]) % n != (n + i - rr) % n) return 0;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
return 0;
}
int countReplacement(int n, int inputSeq[]) {
return 0;
}