# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396797 | ly20 | Gondola (IOI14_gondola) | C++17 | 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;
int valid(int n, int seq[])
{
bool vl = true;
int id0 = n;
map <int, int> freq;
for(int i = 0; i < n; i++) {
freq[seq[i]]++;
if(freq[seq[i]] > 1) vl = false;
if(seq[i] > n) continue;
if(id0 == n) {
id0 = seq[i] - i;
}
else {
if(id0 != seq[i] - i) vl = false;
}
}
if(vl) return true;
else return false;
}
//----------------------
int replacement(int n, int seq[], int resp[])
{
return -2;
}
//----------------------
int countReplacement(int n, int seq[])
{
return -3;
}