Submission #38647

# Submission time Handle Problem Language Result Execution time Memory
38647 2018-01-05T10:24:47 Z 14kg Game (IOI14_game) C++11
42 / 100
1000 ms 20236 KB
#include "game.h"
#include <vector>
#include <queue>
#define N 1501

using namespace std;
int n, r[N][N], r_cnt[N];
int d[N];
vector<int> link[N];
queue<int> Q;

int d1_len, d1[N], d2_len, d2[N];

void initialize(int _n) {
	n = _n;
	for (int i = 1; i < n; i++) {
		r[i][i + 1] = r[i + 1][i] = 1;
		link[i].push_back(i + 1), link[i + 1].push_back(i);
		r_cnt[i]++, r_cnt[i + 1]++;
	}
}

int hasEdge(int x, int y) {
	int lev, empty_num1 = 0, empty_num2 = 0;

	x++, y++;
	if (r[x][y] == 0) {
		r[x][y] = r[y][x] = -2;
		r_cnt[x]++, r_cnt[y]++;
		return 0;
	}
	if (r[x][y] != 1) return r[x][y] > 0 ? 1 : 0;

	for (int i = 1; i <= n; i++) d[i] = 2;
	
	d[x] = 1, Q.push(x);
	while (!Q.empty()) {
		lev = Q.front(), Q.pop();

		for (auto i : link[lev])
			if (d[i] == 2 && i != y && (r[lev][i] == 1 || r[lev][i] == 2))
				d[i] = 1, Q.push(i);
	}

	// !!!
	d1_len = d2_len = 0;
	for (int i = 1; i <= n; i++)
		if (d[i] == 1) d1[++d1_len] = i;
		else d2[++d2_len] = i;

	for(int i=1; i<=d1_len && empty_num1==0; i++)
		if (r_cnt[d1[i]] < n - 1) {
			for (int j = 1; j <= d2_len && empty_num1==0; j++)
				if (r_cnt[d2[j]] < n - 1 && (d1[i] == x && d2[j] == y) == false && r[d1[i]][d2[j]] != -2) {
					empty_num1 = d1[i], empty_num2 = d2[j];
				}
		}

	if (empty_num1 && empty_num2) {
		int tx = empty_num1, ty = empty_num2;

		r[x][y] = r[y][x] = -2;
		r[tx][ty] = r[ty][tx] = 1;
		link[tx].push_back(ty), link[ty].push_back(tx);
		r_cnt[tx]++, r_cnt[ty]++;
		return 0;
	}
	else {
		r[x][y] = r[y][x] = 2;
		return 1;
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 19580 KB Output is correct
2 Correct 0 ms 19580 KB Output is correct
3 Correct 0 ms 19580 KB Output is correct
4 Correct 0 ms 19580 KB Output is correct
5 Correct 0 ms 19580 KB Output is correct
6 Correct 0 ms 19580 KB Output is correct
7 Correct 0 ms 19580 KB Output is correct
8 Correct 0 ms 19580 KB Output is correct
9 Correct 0 ms 19580 KB Output is correct
10 Correct 0 ms 19580 KB Output is correct
11 Correct 0 ms 19580 KB Output is correct
12 Correct 0 ms 19580 KB Output is correct
13 Correct 0 ms 19580 KB Output is correct
14 Correct 0 ms 19580 KB Output is correct
15 Correct 0 ms 19580 KB Output is correct
16 Correct 0 ms 19580 KB Output is correct
17 Correct 0 ms 19580 KB Output is correct
18 Correct 0 ms 19580 KB Output is correct
19 Correct 0 ms 19580 KB Output is correct
20 Correct 0 ms 19580 KB Output is correct
21 Correct 0 ms 19580 KB Output is correct
22 Correct 0 ms 19580 KB Output is correct
23 Correct 0 ms 19580 KB Output is correct
24 Correct 0 ms 19580 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 19580 KB Output is correct
2 Correct 0 ms 19580 KB Output is correct
3 Correct 0 ms 19580 KB Output is correct
4 Correct 0 ms 19580 KB Output is correct
5 Correct 0 ms 19580 KB Output is correct
6 Correct 0 ms 19580 KB Output is correct
7 Correct 0 ms 19580 KB Output is correct
8 Correct 0 ms 19580 KB Output is correct
9 Correct 0 ms 19580 KB Output is correct
10 Correct 0 ms 19580 KB Output is correct
11 Correct 0 ms 19580 KB Output is correct
12 Correct 0 ms 19580 KB Output is correct
13 Correct 0 ms 19580 KB Output is correct
14 Correct 0 ms 19580 KB Output is correct
15 Correct 0 ms 19580 KB Output is correct
16 Correct 0 ms 19580 KB Output is correct
17 Correct 0 ms 19580 KB Output is correct
18 Correct 0 ms 19580 KB Output is correct
19 Correct 0 ms 19580 KB Output is correct
20 Correct 0 ms 19580 KB Output is correct
21 Correct 0 ms 19580 KB Output is correct
22 Correct 0 ms 19580 KB Output is correct
23 Correct 0 ms 19580 KB Output is correct
24 Correct 0 ms 19580 KB Output is correct
25 Correct 0 ms 19580 KB Output is correct
26 Correct 0 ms 19580 KB Output is correct
27 Correct 0 ms 19580 KB Output is correct
28 Correct 0 ms 19580 KB Output is correct
29 Correct 0 ms 19580 KB Output is correct
30 Correct 0 ms 19580 KB Output is correct
31 Correct 0 ms 19580 KB Output is correct
32 Correct 0 ms 19580 KB Output is correct
33 Correct 0 ms 19580 KB Output is correct
34 Correct 3 ms 19580 KB Output is correct
35 Correct 0 ms 19580 KB Output is correct
36 Correct 0 ms 19580 KB Output is correct
37 Correct 3 ms 19580 KB Output is correct
38 Correct 3 ms 19580 KB Output is correct
39 Correct 3 ms 19580 KB Output is correct
40 Correct 0 ms 19580 KB Output is correct
41 Correct 0 ms 19580 KB Output is correct
42 Correct 3 ms 19580 KB Output is correct
43 Correct 13 ms 19580 KB Output is correct
44 Correct 0 ms 19580 KB Output is correct
45 Correct 3 ms 19580 KB Output is correct
46 Correct 0 ms 19580 KB Output is correct
47 Correct 0 ms 19580 KB Output is correct
48 Correct 3 ms 19580 KB Output is correct
49 Correct 3 ms 19580 KB Output is correct
50 Correct 3 ms 19580 KB Output is correct
51 Correct 0 ms 19580 KB Output is correct
52 Correct 3 ms 19580 KB Output is correct
53 Correct 3 ms 19580 KB Output is correct
54 Correct 3 ms 19580 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 19580 KB Output is correct
2 Correct 0 ms 19580 KB Output is correct
3 Correct 0 ms 19580 KB Output is correct
4 Correct 0 ms 19580 KB Output is correct
5 Correct 0 ms 19580 KB Output is correct
6 Correct 0 ms 19580 KB Output is correct
7 Correct 0 ms 19580 KB Output is correct
8 Correct 0 ms 19580 KB Output is correct
9 Correct 0 ms 19580 KB Output is correct
10 Correct 0 ms 19580 KB Output is correct
11 Correct 0 ms 19580 KB Output is correct
12 Correct 0 ms 19580 KB Output is correct
13 Correct 0 ms 19580 KB Output is correct
14 Correct 0 ms 19580 KB Output is correct
15 Correct 0 ms 19580 KB Output is correct
16 Correct 0 ms 19580 KB Output is correct
17 Correct 0 ms 19580 KB Output is correct
18 Correct 0 ms 19580 KB Output is correct
19 Correct 0 ms 19580 KB Output is correct
20 Correct 0 ms 19580 KB Output is correct
21 Correct 0 ms 19580 KB Output is correct
22 Correct 0 ms 19580 KB Output is correct
23 Correct 0 ms 19580 KB Output is correct
24 Correct 0 ms 19580 KB Output is correct
25 Correct 0 ms 19580 KB Output is correct
26 Correct 0 ms 19580 KB Output is correct
27 Correct 0 ms 19580 KB Output is correct
28 Correct 0 ms 19580 KB Output is correct
29 Correct 0 ms 19580 KB Output is correct
30 Correct 0 ms 19580 KB Output is correct
31 Correct 0 ms 19580 KB Output is correct
32 Correct 0 ms 19580 KB Output is correct
33 Correct 0 ms 19580 KB Output is correct
34 Correct 3 ms 19580 KB Output is correct
35 Correct 3 ms 19580 KB Output is correct
36 Correct 0 ms 19580 KB Output is correct
37 Correct 0 ms 19580 KB Output is correct
38 Correct 0 ms 19580 KB Output is correct
39 Correct 0 ms 19580 KB Output is correct
40 Correct 0 ms 19580 KB Output is correct
41 Correct 0 ms 19580 KB Output is correct
42 Correct 3 ms 19580 KB Output is correct
43 Correct 13 ms 19580 KB Output is correct
44 Correct 0 ms 19580 KB Output is correct
45 Correct 3 ms 19580 KB Output is correct
46 Correct 3 ms 19580 KB Output is correct
47 Correct 3 ms 19580 KB Output is correct
48 Correct 3 ms 19580 KB Output is correct
49 Correct 3 ms 19580 KB Output is correct
50 Correct 3 ms 19580 KB Output is correct
51 Correct 3 ms 19580 KB Output is correct
52 Correct 3 ms 19580 KB Output is correct
53 Correct 3 ms 19580 KB Output is correct
54 Correct 0 ms 19580 KB Output is correct
55 Correct 156 ms 19712 KB Output is correct
56 Correct 163 ms 19712 KB Output is correct
57 Correct 159 ms 19712 KB Output is correct
58 Correct 163 ms 19712 KB Output is correct
59 Correct 153 ms 19712 KB Output is correct
60 Correct 123 ms 19712 KB Output is correct
61 Correct 146 ms 19712 KB Output is correct
62 Correct 149 ms 19712 KB Output is correct
63 Correct 133 ms 19712 KB Output is correct
64 Execution timed out 1000 ms 20236 KB Execution timed out
65 Halted 0 ms 0 KB -