Submission #91192

#	Time	Username	Problem	Language	Result	Execution time	Memory
91192		arman_ferdous	Gondola (IOI14_gondola)	C++17	100 / 100	59 ms	16572 KiB

gondola

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

set<int> st;
int valid(int n, int inputSeq[]) {
	int last = -1, start = -1, num = 1000000;
	for(int i = 0; i < n; i++) {
		st.insert(inputSeq[i]);
		if(inputSeq[i] > n) inputSeq[i] = -1;
		else {
			last = i;
			if(inputSeq[i] < num) 
				start = i, num = inputSeq[i];
		}
	}
	if(st.size() != n) return 0;
	if(last == -1) return 1;
	for(int i = start; i < n; i++)
		if(inputSeq[i] + 1 && inputSeq[i] != num + i - start)
			return 0;
	int at0 = inputSeq[last] + n - last;
	for(int i = 0; i < start; i++)
		if(inputSeq[i] + 1 && inputSeq[i] != at0 + i)
			return 0;

  	return 1;
}

int init[100001];
vector< pair<int,int> > v;
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int start = -1;
 	for(int i = 0; i < n; i++) if(gondolaSeq[i] <= n) {
		start = i - gondolaSeq[i] + 1;
		if(start < 0) start += n;
		break;
	} if(start == -1) start = 0;
	int cur = 1;
 	for(int i = start; i < n; i++) init[i] = cur++;
 	for(int i = 0; i < start; i++) init[i] = cur++;

 	for(int i = 0; i < n; i++) if(gondolaSeq[i] > n)
 		v.push_back({gondolaSeq[i], i});
 	sort(v.begin(), v.end());

 	int ptr = 0;
 	for(auto it : v) {
 		while(cur <= it.first) {
 			replacementSeq[ptr++] = init[it.second];
 			init[it.second] = cur;
 			cur++;
 		}
 	} return ptr;
}

typedef long long ll;
const int MOD = 1e9+9;

ll powmod(ll a, ll b) {
	ll ret = 1;
	while(b > 0) {
		if(b & 1) ret = (ret * a) % MOD;
		a = (a * a) % MOD;
		b >>= 1;
	} return ret;
}

int tmp[100001];
vector<int> vals;
int countReplacement(int n, int inputSeq[]) {
	for(int i = 0; i < n; i++) 
		tmp[i] = inputSeq[i];
	if(!valid(n,tmp)) return 0;
	
	int start = -1, last = n;
	ll slot = 0;
	for(int i = 0; i < n; i++) {
		if(inputSeq[i] > n) {
			slot++;
			vals.push_back(inputSeq[i]);
		}
		else start = 1;
	} sort(vals.begin(), vals.end());

	ll ret = (start == -1 ? n : 1);
	for(int x : vals) {
		ll choices = x - last - 1;
		ret = ret * powmod(slot, choices) % MOD;
		last = x;
		slot--;
	} return ret;
}

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:17:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(st.size() != n) return 0;
     ~~~~~~~~~~^~~~

• 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