Submission #285563

#	Time	Username	Problem	Language	Result	Execution time	Memory
285563		emanIaicepsa	Gondola (IOI14_gondola)	C++14	100 / 100	112 ms	6008 KiB

gondola

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

int valid(int n, int inputSeq[]){
	for(int i=0;i<n;i++) inputSeq[i]--;
	map<int,int> used;
	int pos0 = -1;
	for(int i=0;i<n;i++){
		if(inputSeq[i] < n) pos0 = (i - inputSeq[i] + n) % n;
		if(used[inputSeq[i]]) return 0;
		used[inputSeq[i]] = 1;
	}
	if(pos0 == -1) return 1;
	for(int i=0;i<n;i++){
		if(inputSeq[i] < n){
			if((pos0 + inputSeq[i]) % n != i) return 0;
		}
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	vector<int> pos(250000, -1);
	int mx = 0;
	for(int i=0;i<n;i++) gondolaSeq[i]--, pos[gondolaSeq[i]] = i, mx = max(mx, gondolaSeq[i]);
	int pos0 = 0, ans = 0;
	for(int i=0;i<n;i++){
		if(gondolaSeq[i] < n) pos0 = (i - gondolaSeq[i] + n) % n;
	}
	/* for(int i=0;i<2*n;i++) cout<<pos[i]<<'\n'; */ 
	int prev = n;
	for(int i=n;i<=mx;i++){
		if(pos[i] != -1){
			replacementSeq[ans++] = (pos[i] - pos0 + n) % n + 1;
			for(int j=prev;j<i;j++) replacementSeq[ans++] = j + 1;
			prev = i+1;
		}
	}
	return ans;
}

#define ll long long
//----------------------
const ll mod = 1000000009;

ll power(ll x,ll y){
	ll ans = 1, mul = x;
	while(y){
		if(y&1) ans = ans * mul % mod;
		mul = mul * mul % mod;
		y>>=1;
	}
	return ans;
}

int countReplacement(int n, int inputSeq[]){
	if(!valid(n, inputSeq)) return 0;
	for(int i=0;i<n;i++) inputSeq[i]++;
	set<ll> s;
	bool has = 0;
	for(int i=0;i<n;i++){
		s.insert(inputSeq[i]);
		if(inputSeq[i] <= n) has = 1;
	}
	while(!s.empty() && *s.begin() <= n) s.erase(s.begin());
	ll prev = n+1, ans = 1;
	if(!has) ans = n;
	
	while(!s.empty()){
		ll x = *s.begin(), siz = s.size();
		s.erase(s.begin());
		ans = ans * power(siz, x-prev) % mod; 
		prev = x + 1;
	}
	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: 15 / 15
• Subtask 10: 10 / 10