oj.uz

Submission #129477

# Submission time Handle Problem Language Result Execution time Memory
129477 2019-07-12T09:41:30 Z antimirage Gondola (IOI14_gondola) C++14
75 / 100
 28 ms 6264 KB 
#include "gondola.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 1e6 + 5;
 
int b[N], ind[N], mx, sz, cnt[N], mod = 1e9 + 9;
 
int valid(int n, int a[]) {
	int pos = -1;
	
	for (int i = 0; i < n; i++) {
		if (a[i] <= n) {
			pos = i;
		}
		cnt[a[i]]++;
		
		if (cnt[a[i]] > 1)
			return 0;
	}
	if (pos == -1) {
		return 1;
	} else {
		assert(a[pos] <= n);
		int cn = a[pos];
		for (int i = (pos + 1) % n; i != pos; i = (i + 1) % n) {
			cn++;
			if (cn > n)
				cn -= n;
			if (a[i] > n) {
				continue;
			}
			if (a[i] != cn) {
				return 0;
			}
		}
	}
	return 1;
}
int replacement(int n, int a[], int ans[]) {
	memset(ind, -1, sizeof(ind));
	int pos = -1;
	
	for (int i = 0; i < n; i++) {
		if (a[i] <= n) {
			pos = i;
		}
		if (a[i] > a[mx]) {
			mx = i;
		}
		ind[a[i]] = i;
	}
	if (pos == -1) {
		for (int i = 0; i < n; i++) {
			b[i] = i + 1;
		}
	}
	else {
		int cn = a[pos];
		b[pos] = a[pos];
		for (int i = (pos + 1) % n; i != pos; i = (i + 1) % n) {
			cn++;
			if (cn > n)
				cn -= n;
			b[i] = cn;
		}
	}
	for (int i = n + 1; i <= a[mx]; i++) {
		if (ind[i] == -1) {
			ans[sz++] = b[mx];
			b[mx] = i;
		}
		else {
			ans[sz++] = b[ind[i]];
			b[ind[i]] = i;
		}
	}
	return sz;
}
long long binpow (long long a, int b) {
	if (b == 0)
		return 1;
	if (b & 1)
		return a * 1ll * binpow(a, b - 1) % mod;
	int asd = binpow(a, b >> 1);
	return asd * 1ll * asd % mod;
}
int countReplacement(int n, int a[]) {
	memset(ind, -1, sizeof(ind));
	if (valid(n, a) == 0)
		return 0;
		
	int pos = -1;
	
	long long res = 1;
	
	for (int i = 0; i < n; i++) {
		if (a[i] <= n) {
			pos = i;
		}
		ind[a[i]] = i;
	}
	if (pos == -1) {
		for (int i = 0; i < n; i++) {
			b[i] = i + 1;
		}
		res = n;
	} else {
		int cn = a[pos];
		b[pos] = a[pos];
		for (int i = (pos + 1) % n; i != pos; i = (i + 1) % n) {
			cn++;
			if (cn > n)
				cn -= n;
			b[i] = cn;
		}
	}
	sort(a, a + n);
	
	for (int i = 0; i < n; i++) {
		if (a[i] <= n) continue;
		res *= binpow((n - i), (i == 0 ? a[i] - n - 1 : a[i] - a[i - 1] - 1) );
		res %= mod;
		
	}
	return res;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 760 KB Output is correct
7 Correct 14 ms 1144 KB Output is correct
8 Correct 12 ms 1016 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1144 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 7 ms 760 KB Output is correct
7 Correct 13 ms 1144 KB Output is correct
8 Correct 12 ms 1016 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1144 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 8 ms 1324 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 15 ms 1272 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4220 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 6 ms 4216 KB Output is correct
8 Correct 6 ms 4344 KB Output is correct
9 Correct 5 ms 4216 KB Output is correct
10 Correct 6 ms 4344 KB Output is correct
11 Correct 17 ms 4984 KB Output is correct
12 Correct 17 ms 5112 KB Output is correct
13 Correct 19 ms 5368 KB Output is correct
14 Correct 16 ms 4984 KB Output is correct
15 Correct 26 ms 6264 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4260 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 5 ms 4188 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Incorrect 27 ms 5624 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4264 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Incorrect 28 ms 5708 KB Output isn't correct
10 Halted 0 ms 0 KB -