oj.uz

Submission #218866

# Submission time Handle Problem Language Result Execution time Memory
218866 2020-04-02T22:42:32 Z Kenzo_1114 Gondola (IOI14_gondola) C++17
60 / 100
 29 ms 3328 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
const long long int MOD = 1e9 + 9;

int correct[MAXN], pos[3 * MAXN];
bool marc[3 * MAXN], all = false;

void calc(int n, int seq[])
{
	int id = -1;
	for(int i = 0; i < n; i++)
		if(seq[i] <= n)
		{	id = i; break;	}

	if(id != -1)	correct[id] = seq[id];
	else	id = 0,	correct[id] = 1, all = true;

	for(int i = id + 1; i < n; i++)
	{	
		correct[i] = correct[i - 1] + 1;
		if(correct[i] > n)	correct[i] = 1;
	}

	for(int i = id - 1; i >= 0; i--)
	{
		correct[i] = correct[i + 1] - 1;
		if(correct[i] < 1)	correct[i] = n;
	}
}

int valid(int n, int seq[])
{
	calc(n, seq);

	int ans = 1;

	for(int i = 0; i < n; i++)
	{
		if(seq[i] <= n && correct[i] != seq[i])	ans = 0;
		if(seq[i] > n && marc[seq[i]])	ans = 0;
		marc[seq[i]] = true;
	}

	for(int i = 0; i < 3 * MAXN; i++)	marc[i] = false;

	return ans;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	calc(n, gondolaSeq);

	for(int i = 0; i < 3 * MAXN; i++)	pos[i] = -1;

	int mx = n;
	for(int i = 0; i < n; i++)
		if(gondolaSeq[i] > n)
			pos[gondolaSeq[i]] = i, mx = max(mx, gondolaSeq[i]);

	for(int i = mx - 1; i > n; i--)
		if(pos[i] == -1)	
			pos[i] = pos[i + 1];

	int l = 0;	
	for(int i = n + 1; i <= mx; i++)
	{
		replacementSeq[l] = correct[pos[i]];
		correct[pos[i]] = i;
		l++;
	}

	return l;
}

long long int fe(long long int num, int exp)
{
	if(exp == 0)	return 1;
	if(exp == 1)	return num;

	long long int aux = fe(num, exp / 2);
	aux *= aux, aux %= MOD;

	if(exp % 2)	return aux % MOD;
	return (aux * num) % MOD;
}

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n, inputSeq))	return 0;

	vector<long long int> v;	

	for(int i = 0; i < n; i++)
		if(inputSeq[i] > n)
			v.push_back(inputSeq[i]);

	sort(v.begin(), v.end());

	long long int ans = 1;
	long long int sz = v.size(), last = n;
	for(int i = 0; i < v.size(); i++)
	{
//		printf("num = %lld  exp = %lld\n", sz, v[i] - 1- last);
		ans *= fe(sz, v[i] - 1 - last);
		ans %= MOD;
		last = v[i];
		sz--;
	}	

	if(all)	ans *= n, ans %= MOD;

	return (int) ans;
}
/*
int N, SEQ[MAXN];

int main ()
{
	scanf("%d", &N);

	for(int i = 0; i < N; i++)	scanf("%d", &SEQ[i]);

	printf("valid = %d\n", valid(N, SEQ));

	printf("cont = %lld\n", countReplacement(N, SEQ));
}
*/

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:103:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v.size(); i++)
                 ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 672 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 18 ms 1280 KB Output is correct
8 Correct 15 ms 1152 KB Output is correct
9 Correct 8 ms 768 KB Output is correct
10 Correct 16 ms 1280 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 19 ms 1280 KB Output is correct
8 Correct 14 ms 1152 KB Output is correct
9 Correct 8 ms 768 KB Output is correct
10 Correct 16 ms 1280 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 18 ms 1280 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 5 ms 1536 KB Output is correct
3 Correct 5 ms 1536 KB Output is correct
4 Correct 5 ms 1536 KB Output is correct
5 Correct 5 ms 1536 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 6 ms 1664 KB Output is correct
3 Correct 5 ms 1536 KB Output is correct
4 Correct 5 ms 1536 KB Output is correct
5 Correct 5 ms 1536 KB Output is correct
6 Correct 5 ms 1536 KB Output is correct
7 Correct 5 ms 1536 KB Output is correct
8 Correct 6 ms 1536 KB Output is correct
9 Correct 6 ms 1536 KB Output is correct
10 Correct 6 ms 1536 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 5 ms 1536 KB Output is correct
3 Correct 5 ms 1536 KB Output is correct
4 Correct 5 ms 1536 KB Output is correct
5 Correct 5 ms 1536 KB Output is correct
6 Correct 5 ms 1536 KB Output is correct
7 Correct 5 ms 1536 KB Output is correct
8 Correct 6 ms 1536 KB Output is correct
9 Correct 6 ms 1536 KB Output is correct
10 Correct 6 ms 1536 KB Output is correct
11 Correct 16 ms 2176 KB Output is correct
12 Correct 29 ms 2176 KB Output is correct
13 Correct 19 ms 2432 KB Output is correct
14 Correct 16 ms 2176 KB Output is correct
15 Correct 26 ms 3328 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Incorrect 5 ms 640 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Incorrect 5 ms 640 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Incorrect 5 ms 640 KB Output isn't correct
6 Halted 0 ms 0 KB -