# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001717 | codexistent | 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 <iostream>
#include <set>
#include <gondola.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
int diff(int n, int a, int b){
if(b >= a) return b - a;
else return (n - a) + b;
}
int valid(int n, int inputSeq[]){
pair<int, int> prev = {-1, 0};
set<int> s;
FOR(i, 0, n - 1){
if(inputSeq[i] <= n){
if(prev.first == -1){
prev = {i, inputSeq[i]};
}else{
if(prev.second + diff(n, prev.first, i) != inputSeq[i]) return 0;
prev = {i, inputSeq[i]};
}
}else{
if(s.find(inputSeq[i]) != s.end()) return 0;
s.insert(inputSeq[i]);
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return 1;
}
int countReplacement(int n, int inputSeq[]){
return 1;
}
int main(){
int t, x;
cin >> t >> x;
const int n = x;
int arr[n];
FOR(i, 0, n - 1) cin >> arr[i];
if(t <= 3) valid(x, arr);
else if(t <= 6) {
int rep[n];
replacement(x, arr, rep);
}else{
countReplacement(x, arr);
}
}