제출 #278120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
278120		amiratou	곤돌라 (IOI14_gondola)	C++14	75 / 100	71 ms	5368 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define sz(x) (ll)(x.size())
const ll MOD =(ll)(1e9+9);
ll val[100005],p[250005],dp[100005][2];
set<ll> here;

int valid(int n, int inputSeq[])
{
	ll idx=-1;
	for (ll i = 0; i < n; ++i){
		if(here.find(inputSeq[i])!=here.end())return 0;
		here.insert(inputSeq[i]);
		if(inputSeq[i]<=n)idx=i;
	}
	if(idx==-1)return 1;
	ll h=inputSeq[idx];
	for (ll i = 0; i < n; ++i)
		val[(idx+i)%n]=((h-1+i)%n)+1;
	for (ll i = 0; i < n; ++i)
		if(inputSeq[i]<=n && inputSeq[i]!=val[i])return 0;
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	ll flag=-1;
	for (ll i = 0; i < n; ++i)
		if(gondolaSeq[i]<=n)flag=i;
	priority_queue<ll,vector<ll>,greater<ll> > pq;
	if(flag!=-1){
		ll g=gondolaSeq[flag];
		for (ll i = 0; i < n; ++i){
			ll r=((g-1+i)%n)+1;
			if(gondolaSeq[(flag+i)%n]!=r)pq.push(gondolaSeq[(flag+i)%n]),p[gondolaSeq[(flag+i)%n]]=r;
		}
	}
	else{
		for (ll i = 0; i < n; ++i)
			p[gondolaSeq[i]]=i+1,pq.push(gondolaSeq[i]);
	}
	ll h=n+1,idx=0;
	while(!pq.empty()){
		ll f=pq.top();
		pq.pop();
		replacementSeq[idx++]=p[f];
		while(h<f)replacementSeq[idx++]=h++;
		h++;
	}
	return idx;
}

//----------------------
ll binpow(ll a,ll b){
	if(!b)return 1;
	ll h=binpow(a,b>>1LL);
	h*=h;
	if(h>=MOD)h%=MOD;
	if(b&1LL)h*=a;
	if(h>=MOD)h%=MOD;
	return (ll)(h);
}

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n,inputSeq))return 0;
	ll idx=-1;
	for (ll i = 0; i < n; ++i)
		if(inputSeq[i]<=n)idx=i;
	if(idx==-1)return 1;
	ll h=inputSeq[idx];
	for (ll i = 0; i < n; ++i)
		val[(idx+i)%n]=((h-1+i)%n)+1;
	vector<ll> vec={n};
	for (ll i = 0; i < n; ++i)
		if(inputSeq[i]>n)
			vec.push_back(inputSeq[i]);
	ll ans=1;
	sort(vec.begin(),vec.end());
	for (ll i = 1; i < sz(vec); ++i)
		ans=(ans*binpow(sz(vec)-i,vec[i]-vec[i-1]-1))%MOD;
	return 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: 0 / 15
• Subtask 10: 0 / 10