제출 #101895

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101895		eriksuenderhauf	곤돌라 (IOI14_gondola)	C++11	100 / 100	24 ms	2688 KiB

gondola

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "gondola.h"
//#include "grader.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 9;
const int INF = 1e9 + 7;
const int MAXN = 3e5 + 5;
const double eps = 1e-9;
int arr[MAXN], nx[MAXN];

int valid(int n, int inputSeq[]) {
	int ind = n;
	for (int i = 0; i < n; i++)
		if (inputSeq[i] <= n) {
			ind = i;
			break;
		}
	if (ind < n)
		for (int j = 0; j < n; j++)
			if (inputSeq[j] <= n && (inputSeq[ind] + j) % n != (inputSeq[j] + ind) % n)
				return 0;
	
	sort(inputSeq, inputSeq + n);
	for (int i = 1; i < n; i++)
		if (inputSeq[i] == inputSeq[i - 1])
			return 0;
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int ind = n;
	for (int i = 0; i < n; i++)
		arr[gondolaSeq[i]] = i + 1;
	for (int i = 0; i < n; i++)
		if (gondolaSeq[i] <= n) {
			ind = i;
			break;
		}
	for (int i = 0; i < n; i++)
		if (ind == n)
			nx[i] = i + 1;
		else
			nx[i] = (gondolaSeq[ind] + i - ind + n - 1) % n + 1;
	int mx = 0;
	for (int i = 0; i < n; i++)
		mx = max(mx, gondolaSeq[i]);
	for (int i = n + 1; i <= mx; i++) {
		if (arr[i] != 0) {
			replacementSeq[i - n - 1] = nx[arr[i] - 1];
			nx[arr[i] - 1] = i;
		} else {
			replacementSeq[i - n - 1] = nx[arr[mx] - 1];
			nx[arr[mx] - 1] = i;
		}
	}
	return mx - n;
}

int pw(ll a, int b) {
	ll ret = 1;
	while (b > 0)
		if (b & 1)
			ret = (ret * a) % MOD, b--;
		else
			a = (a * a) % MOD, b /= 2;
	return (int) ret;
}

int countReplacement(int n, int inputSeq[]) {
	if (!valid(n, inputSeq))
		return 0;
	sort(inputSeq, inputSeq + n);
	ll ret = 1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n)
			continue;
		int ex = n;
		if (i > 0)
			ex = max(ex, inputSeq[i - 1]);
		ll val = pw(n - i, inputSeq[i] - ex - 1);
		ret = (ret * val) % MOD;
	}
	if (inputSeq[0] > n)
		ret = (ret * n) % MOD;
	return (int) ret;
}

• 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: 10 / 10