Submission #363539

#	Time	Username	Problem	Language	Result	Execution time	Memory
363539		silverfish	Gondola (IOI14_gondola)	C++14	20 / 100	52 ms	5228 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

int valid(int n, int a[]){
	bool ok = 1, first = 1;
	int diff = -1;
	map<int, int> cnt;
	for(int i = 0; i < n; ++i){
		if(cnt[a[i]]) ok = 0;
		++cnt[a[i]];
		if(a[i] <= n){
			if(first) {
				diff = (a[i]-(i+1)+n)%n;
				first = 0;
				continue;
			}
			//cerr << i+1 << ' ' << (n+a[i]-diff)%n << endl;
			if(i != (a[i]-diff-1+n)%n) ok = 0;
		}
	}

	return ok;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  return -2;
}

//----------------------

int countReplacement(int n, int inputSeq[]){
  return -3;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10