제출 #964567

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964567		4QT0R	곤돌라 (IOI14_gondola)	C++17	100 / 100	43 ms	6152 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define pii pair<int,int>
#define ll long long

ll ans=1;

int valid(int n, int inputSeq[]){
	set<int> s(inputSeq,inputSeq+n);
	if ((int)s.size()<n)return 0;
	pii mn={n+1,-1};
	for (int i = 0; i<n; i++){
		if (inputSeq[i]<mn.first)mn={inputSeq[i],i};
	}
	int cur=mn.first;
	if (cur==n+1)ans*=n;
	for (int i = mn.second+1; ++cur<=n; i++){
		if (inputSeq[i%n]<=n && inputSeq[i%n]!=cur)return 0;
	}
	return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	int st=0;
	for (int i = 0; i<n; i++){
		if (gondolaSeq[i]<=n){
			st=(i-gondolaSeq[i]+1+n)%n;
			break;
		}
	}
	vector<int> kol(n);
	for (int i = st; i<n+st; i++)kol[i-st]=gondolaSeq[i%n];
	priority_queue<pii,vector<pii>,greater<pii>> pq;
	int l=0,bro=n;
	for (int i = 0; i<n; i++){
		if (kol[i]>n)pq.push({kol[i],i+1});
	}
	while(pq.size()){
		pii now=pq.top();
		pq.pop();
		replacementSeq[l++]=now.second;
		bro++;
		while(bro<now.first)replacementSeq[l++]=bro++;
	}
	return l;
}

ll mod=1e9+9;
ll fast_pow(ll a, ll b){
	if (b==1)return a;
	if (b==0)return 1;
	ll cur=fast_pow(a,b/2);
	cur=(cur*cur)%mod;
	if (b&1)cur=(cur*a)%mod;
	return cur;
}

int countReplacement(int n, int inputSeq[]){
	if (!valid(n,inputSeq))return 0;
	priority_queue<ll,vector<ll>,greater<ll>> pq;
	for (int i = 0; i<n; i++){
		if (inputSeq[i]>n)pq.push(inputSeq[i]);
	}
	ll prv=n;
	for (int i = pq.size(); i; i--){
		ans=(ans*fast_pow(i,pq.top()-prv-1))%mod;
		prv=pq.top();
		pq.pop();
	}
	return (int)ans;
}

• 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