제출 #379207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379207		Mounir	곤돌라 (IOI14_gondola)	C++14	90 / 100	1095 ms	4968 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define chmax(x, v) x = max(x, v)
using namespace std;
 
int valid(int n, int inputSeq[]) {
	vector<int> restant;
	map<int, bool> vu;
	for (int ind = 0; ind < n; ++ind){
		if (vu[inputSeq[ind]])
			return 0;
		vu[inputSeq[ind]] = true;
		if (inputSeq[ind] <= n)
			restant.pb(ind);
	}
 
	for (int ind = 0; ind < sz(restant) - 1; ++ind){
		int a = restant[ind] - inputSeq[restant[ind]], b = restant[ind + 1] - inputSeq[restant[ind + 1]];
		a += n; a %= n;
		b += n; b %= n;
 
		if (a != b)
			return 0;
	}
	return 1;
}
 
//----------------------
 
struct Element {
	int ind, val;
 
	bool operator < (const Element &autre) const {
		return val < autre.val;
	}
};
 
int get(int id, int deb, int n){
	if (id > deb)
		return id - deb;
	else
		return n - deb + id;
}
 
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int maxi = 0, deb = 0;
	set<Element> reste;
	for (int ind = 0; ind < n; ++ind){
		chmax(maxi, gondolaSeq[ind]);
		if (gondolaSeq[ind] > n){
			//cout << "val " << ind << " " << gondolaSeq[ind] << endl;
			reste.insert({ind, gondolaSeq[ind]});
		}
		else
			deb = (ind -gondolaSeq[ind] + n)%n;
	}
 
	vector<int> actu(n);
	for (int i = 0; i < n; ++i)
		actu[i] = get(i, deb, n);
 
	for (int tour = n + 1; tour <= maxi; ++tour){
		int id = reste.begin()->ind;
		replacementSeq[tour - n - 1] = actu[id];
		actu[id] = tour;
		reste.erase(reste.begin());
		if (tour != gondolaSeq[id])
			reste.insert({id, tour});
	}
	return maxi - n;
}
 
//----------------------
 
const int MOD = 1e9 + 9;
 
int countReplacement(int n, int inputSeq[]){
	long long nb = 1;
	int maxi = 0, deb = 0;
	bool entier = true;
	priority_queue<int, vector<int>, greater<int>> reste;
	for (int ind = 0; ind < n; ++ind){
		chmax(maxi, inputSeq[ind]);
		if (inputSeq[ind] > n)
			reste.push(inputSeq[ind]);
		else entier = false;
	}
 
	vector<int> actu(n);
	for (int i = 0; i < n; ++i)
		actu[i] = get(i, deb, n);
 
	for (int tour = n + 1; tour <= maxi; ++tour){
		while (!reste.empty() && reste.top() < tour)
			reste.pop();
		if (reste.top() == tour)
			reste.pop();
		else{
			//cout << "val " << tour << " " << sz(reste) << " " << reste.top() << endl;
			nb = (nb * sz(reste))%MOD;
		}
	}

	if (entier)
		nb = (nb * n)%MOD;

	return (valid(n, inputSeq) * (nb + MOD)%MOD)%MOD;
}

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