oj.uz

Submission #783213

# Submission time Handle Problem Language Result Execution time Memory
783213 2023-07-14T17:56:39 Z zsombor Gondola (IOI14_gondola) C++17
60 / 100
 18 ms 5332 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include "gondola.h"
using namespace std;
using ll = long long;

ll MOD = 1e9 + 9;

int valid(int n, int g[]) {
	vector <bool> volt(1e6 + 1, false);
	for (int i = 0; i < n; i++) {
		if (volt[g[i]]) return 0;
		volt[g[i]] = true;
	}
	int p = 0;
	for (int i = 0; i < n; i++) if (g[i] <= n) p = (g[i] - i + n) % n;
	for (int i = 0; i < n; i++) if (g[i] <= n && (g[i] - i + n) % n != p) return 0;
	return 1;
}

int replacement(int n, int g[], int r[]) {
	int p = 0, cnt = 0, mx = 0;
	vector <int> rev(1e6 + 1, -1);
	vector <int> cur(n, 0);
	for (int i = 0; i < n; i++) {
		if (g[i] <= n) { p = (g[i] - i + n) % n; cnt++; }
		mx = max(mx, g[i]);
		rev[g[i]] = i;
	}
	for (int i = 0; i < n; i++) cur[i] = (i + p) % n;
	cur[(n - p) % n] = n;
	for (int i = n + 1; i <= mx; i++) {
		if (rev[i] == -1) { r[i - n - 1] = cur[rev[mx]]; cur[rev[mx]] = i; }
		else { r[i - n - 1] = cur[rev[i]]; cur[rev[i]] = i; }
	}
	return mx - n;
}

ll pow(ll a, int b) {
	ll ret = 1;
	for (int i = 30; i >= 0; i--) {
		ret *= ret; ret %= MOD;
		if (b & (1 << i)) { ret *= a; ret %= MOD; }
	}
	return ret;
}

int countReplacement(int n, int g[]) {
	if (!valid(n, g)) return 0;
	ll cnt = 0, ans = 1;
	sort(g, g + n);
	for (int i = 0; i < n; i++) if (g[i] <= n) cnt++;
	if (cnt == 0) ans = n;
	if (cnt == n) return 1;
	ans *= pow(n - cnt, g[cnt] - n - 1);
	ans %= MOD;
	for (int i = cnt + 1; i < n; i++) {
		ans *= pow(n - cnt - i, g[i] - g[i - 1] - 1);
		ans %= MOD;
	}
	return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 7 ms 1236 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 7 ms 1204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 10 ms 1256 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 7 ms 1232 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 3 ms 700 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 8 ms 1068 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4172 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 10 ms 5292 KB Output is correct
12 Correct 9 ms 5332 KB Output is correct
13 Correct 14 ms 4948 KB Output is correct
14 Correct 8 ms 5180 KB Output is correct
15 Correct 18 ms 5076 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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