oj.uz

Submission #38709

# Submission time Handle Problem Language Result Execution time Memory
38709 2018-01-06T09:32:52 Z 14kg Gondola (IOI14_gondola) C++11
75 / 100
 126 ms 11772 KB 
#include "gondola.h"
#include <map>
#include <set>
#define N 100000
#define MOD 1000000009

using namespace std;
int n, g_num, replace_num[N], out_temp[N];
long long count_tot = 1;
map<int, int> valid_w;
set<int> check;

bool valid_check(int x) {
	set<int>::iterator it = check.lower_bound(x);

	if (it == check.end() || *it != x) return false;
	return true;
}
int valid(int _n, int in[]) {
	bool g_check = false;
	
	n = _n;
	for (int i = 0; i < n; i++) {
		if (g_check) {
			g_num = g_num == n ? 1 : g_num + 1;
		}
		if (valid_check(in[i])) return 0;
		valid_w[in[i]] = i, check.insert(in[i]);

		if (in[i] <= n) {
			if (g_check && g_num != in[i]) return 0;
			else if (!g_check) {
				g_check = true, g_num = in[i];
			}
		}
	}
	return 1;
}

int replacement(int _n, int in[], int out[]) {
	int out_len = 0, w, k = _n + 1;
	long long cnt = 0;

	if (!valid(_n, in)) return -1;

	for (int i = 0; i < n; i++) {
		g_num = g_num == n ? 1 : g_num + 1;
		replace_num[i] = g_num;
		if (in[i] > n) cnt++;
	}

	if (cnt == n) count_tot *= (long long)n;
	for (int i = 0; i < n; i++) {
		w = replace_num[i];
		while (k <= in[i]) {
			if (!valid_check(k)) {
				out[out_len++] = w;
				w = k++;
				count_tot *= cnt, count_tot %= MOD;
			}
			else if (valid_w[k] == i) {
				out[out_len++] = w;
				w = k++, cnt--;
			}
			else {
				out[out_len++] = replace_num[valid_w[k]];
				k++, cnt--;
			}
		}
	} return out_len;
}

int countReplacement(int _n, int in[]) {
	if (replacement(_n, in, out_temp) < 0) return 0;
	return (int)count_tot;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3324 KB Output is correct
2 Correct 0 ms 3324 KB Output is correct
3 Correct 0 ms 3324 KB Output is correct
4 Correct 0 ms 3324 KB Output is correct
5 Correct 0 ms 3324 KB Output is correct
6 Correct 23 ms 6888 KB Output is correct
7 Correct 13 ms 3324 KB Output is correct
8 Correct 59 ms 10056 KB Output is correct
9 Correct 9 ms 5436 KB Output is correct
10 Correct 69 ms 11112 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3324 KB Output is correct
2 Correct 0 ms 3324 KB Output is correct
3 Correct 0 ms 3324 KB Output is correct
4 Correct 0 ms 3324 KB Output is correct
5 Correct 0 ms 3324 KB Output is correct
6 Correct 26 ms 6888 KB Output is correct
7 Correct 23 ms 3324 KB Output is correct
8 Correct 53 ms 10056 KB Output is correct
9 Correct 16 ms 5436 KB Output is correct
10 Correct 63 ms 11112 KB Output is correct
11 Correct 0 ms 3324 KB Output is correct
12 Correct 0 ms 3324 KB Output is correct
13 Correct 9 ms 3324 KB Output is correct
14 Correct 0 ms 3324 KB Output is correct
15 Correct 13 ms 3324 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3324 KB Output is correct
2 Correct 0 ms 3324 KB Output is correct
3 Correct 0 ms 3324 KB Output is correct
4 Correct 0 ms 3324 KB Output is correct
5 Correct 0 ms 3324 KB Output is correct
6 Correct 0 ms 3324 KB Output is correct
7 Correct 0 ms 3456 KB Output is correct
8 Correct 0 ms 3324 KB Output is correct
9 Correct 0 ms 3324 KB Output is correct
10 Correct 0 ms 3324 KB Output is correct
11 Correct 66 ms 10716 KB Output is correct
12 Correct 66 ms 11772 KB Output is correct
13 Correct 73 ms 6624 KB Output is correct
14 Correct 73 ms 10716 KB Output is correct
15 Correct 39 ms 4908 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3324 KB Output is correct
2 Correct 0 ms 3324 KB Output is correct
3 Correct 0 ms 3324 KB Output is correct
4 Correct 0 ms 3324 KB Output is correct
5 Correct 0 ms 3324 KB Output is correct
6 Correct 0 ms 3324 KB Output is correct
7 Correct 0 ms 3324 KB Output is correct
8 Correct 0 ms 3324 KB Output is correct
9 Correct 116 ms 10188 KB Output is correct
10 Correct 99 ms 9000 KB Output is correct
11 Runtime error 39 ms 5436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3324 KB Output is correct
2 Correct 0 ms 3324 KB Output is correct
3 Correct 0 ms 3324 KB Output is correct
4 Correct 0 ms 3324 KB Output is correct
5 Correct 0 ms 3324 KB Output is correct
6 Correct 0 ms 3324 KB Output is correct
7 Correct 0 ms 3324 KB Output is correct
8 Correct 0 ms 3324 KB Output is correct
9 Correct 126 ms 10188 KB Output is correct
10 Correct 86 ms 9000 KB Output is correct
11 Runtime error 29 ms 5436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -