oj.uz

답안 #230685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
230685 2020-05-11T06:42:18 Z monus1042 곤돌라 (IOI14_gondola) C++17
100 / 100
 50 ms 6280 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define eb emplace_back
#define all(x) x.begin(), x.end()
typedef long long ll;

const ll modu=1e9+9;

int valid(int n, int inputSeq[])
{
	unordered_set<int> ch;
	for (int i=0; i<n; i++){
		ch.insert(inputSeq[i]);
	}
	if ((int)ch.size()==n){
		int fi=1000000, se=1000000;
		for (int i=0; i<n; i++){
			if (1<=inputSeq[i] && inputSeq[i]<=n && inputSeq[i]<fi){
				fi=inputSeq[i];
				se=i;
			}
		}
		if (fi==1000000){
			return 1;
		}else{
			bool check=1;
			for (int i=se, track=fi; i<se+n; i++, track++){
				if (1<=inputSeq[i%n] && inputSeq[i%n]<=n){
					if (inputSeq[i%n] == track){
						
					}else{
						check=0;
						break;
					}
				}
			}
			if (check) return 1;
			return 0;
		}
	}else{
		return 0;
	}
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vii delta;
	int cnt=0;
	for (int i=0; i<n; i++){
		if (1<=gondolaSeq[i] && gondolaSeq[i]<=n){
			cnt++;
		}
	}
	if (!cnt){
		for (int i=0; i<n; i++){
			delta.eb(ii(gondolaSeq[i], i+1)); //del, #
		}
		sort(all(delta));

		vi ret;
		int curr=n+1;
		for (int i=0; i<n; i++){
			while(1){
				if (curr>delta[i].first) break;
				ret.eb(delta[i].second);
				delta[i].second=curr;
				curr++;
			}
		}
		int si=ret.size();
		for (int i=0; i<si; i++){
			replacementSeq[i]=ret[i];
		}
		return si;
	}else if (cnt==n){
		return 0;
	}else{
		//cout<<"XD\n";
		int mini=1000000, pos=0;
		for (int i=0; i<n; i++){
			if (gondolaSeq[i]<mini){
				mini=gondolaSeq[i];
				pos=i;
			}
		}
		int diff=mini-1;
		pos-=diff;
		pos%=n;
		pos+=n;
		pos%=n;

		//cout<<pos<<endl;
		vi ret;
		for (int i=pos, track=1; i<n+pos; i++, ++track){
			if (gondolaSeq[i%n]>n)
				delta.eb(ii(gondolaSeq[i%n], track));
		}

		sort(all(delta));
		//cout<<delta[0].second<<endl;
		int curr=n+1, dels=delta.size();
		for (int i=0; i<dels; i++){
			while(1){
				if (curr>delta[i].first) break;
				ret.eb(delta[i].second);
				delta[i].second=curr;
				curr++;
			}
		}
		int si=ret.size();
		for (int i=0; i<si; i++){
			replacementSeq[i]=ret[i];
		}
		return si;
	}
}

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

ll supapower(ll b, ll ex){
	if (!ex)
		return 1;
	if (ex&1)
		return (supapower((b*b)%modu, ex/2) * b) % modu;
	return supapower((b*b)%modu, ex/2) % modu;
}

int countReplacement(int n, int inputSeq[])
{
	unordered_set<int> ch;
	for (int i=0; i<n; i++){
		ch.insert(inputSeq[i]);
	}
	bool alldiff=0, fcase=1;
	if ((int)ch.size()==n){
		int fi=1000000, se=1000000;
		for (int i=0; i<n; i++){
			if (1<=inputSeq[i] && inputSeq[i]<=n && inputSeq[i]<fi){
				fi=inputSeq[i];
				se=i;
			}
		}
		if (fi==1000000){
			alldiff=1;
		}else{
			//bool check=1;
			for (int i=se, track=fi; i<se+n; i++, track++){
				if (1<=inputSeq[i%n] && inputSeq[i%n]<=n){
					if (inputSeq[i%n] == track){
						
					}else{
						fcase=0;
						break;
					}
				}
			}
		}
	}else{
		return 0;
	}

	if (fcase == alldiff && !alldiff)
		return 0;

	ll ans=1;
	vi aux;
	for (int i=0; i<n; i++){
		if (inputSeq[i]>n){
			aux.eb(inputSeq[i]);
		}
	}

	int ss=aux.size();
	sort(all(aux));
	for (int i=0; i<ss; i++){
		ll di;
		if (!i){
			di=aux[i]-n-1;
		}else{
			di=aux[i] - aux[i-1] -1;
		}
		if (di>0){
			ans*=supapower((ll)ss-i, (ll)di);
			ans%=modu;
		}
	}
	if (alldiff)
		ans*=(ll)n;

	ans%=modu;
	
	return (int)ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 14 ms 2096 KB Output is correct
7 Correct 27 ms 3632 KB Output is correct
8 Correct 21 ms 3728 KB Output is correct
9 Correct 10 ms 1280 KB Output is correct
10 Correct 25 ms 4104 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 14 ms 2096 KB Output is correct
7 Correct 27 ms 3632 KB Output is correct
8 Correct 22 ms 3728 KB Output is correct
9 Correct 10 ms 1280 KB Output is correct
10 Correct 28 ms 4112 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 16 ms 1968 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 30 ms 4240 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 16 ms 640 KB Output is correct
12 Correct 17 ms 640 KB Output is correct
13 Correct 21 ms 1404 KB Output is correct
14 Correct 15 ms 640 KB Output is correct
15 Correct 28 ms 2240 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 34 ms 4752 KB Output is correct
10 Correct 28 ms 4112 KB Output is correct
11 Correct 13 ms 1664 KB Output is correct
12 Correct 16 ms 2096 KB Output is correct
13 Correct 7 ms 768 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 35 ms 4752 KB Output is correct
10 Correct 28 ms 4104 KB Output is correct
11 Correct 13 ms 1664 KB Output is correct
12 Correct 16 ms 2096 KB Output is correct
13 Correct 7 ms 768 KB Output is correct
14 Correct 43 ms 5768 KB Output is correct
15 Correct 50 ms 6280 KB Output is correct
16 Correct 12 ms 1536 KB Output is correct
17 Correct 33 ms 4488 KB Output is correct
18 Correct 20 ms 2736 KB Output is correct