oj.uz

Submission #673488

# Submission time Handle Problem Language Result Execution time Memory
673488 2022-12-20T17:16:43 Z rainboy Meetings (JOI19_meetings) C++17
100 / 100
 821 ms 8768 KB 
#include "meetings.h"
#include <string.h>

const int N = 2000;

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int ej[N][N], eo[N], pp[N], qq[N], sz[N], uu[N], ii[N], jj[N], qu[N], cnt; char used[N];

void append(int i, int j) {
	ej[i][eo[i]++] = j;
}

void remove_(int i, int j) {
	int o;

	for (o = eo[i]; o--; )
		if (ej[i][o] == j) {
			eo[i]--;
			while (o < eo[i])
				ej[i][o] = ej[i][o + 1], o++;
			return;
		}
}

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;
		while (j < k)
			if (sz[ii[j]] == sz[i_])
				j++;
			else if (sz[ii[j]] > sz[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

void dfs(int p, int i) {
	pp[i] = p, sz[i] = 1;
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		if (j != p) {
			dfs(i, j);
			sz[i] += sz[j];
		}
	}
	sort(ej[i], 0, eo[i]);
	qq[i] = sz[i] == 1 ? -1 : (ej[i][0] == p ? ej[i][1] : ej[i][0]);
	uu[i] = sz[i] == 1 ? i : uu[qq[i]];
}

void up(int i) {
	if (qq[i] != -1)
		up(qq[i]);
	qu[cnt++] = i;
}

void down(int i) {
	qu[cnt++] = i;
	if (qq[i] != -1)
		down(qq[i]);
}

void Solve(int n) {
	for (int i = 0; i < n; i++)
		ii[i] = i;
	for (int j = 0; j < n; j++) {
		int i = rand_() % (j + 1), tmp;
		tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
	}
	memset(eo, 0, n * sizeof *eo);
	memset(used, 0, n * sizeof *used);
	append(ii[0], ii[1]), append(ii[1], ii[0]), used[ii[0]] = used[ii[1]] = 1;
	int r = ii[0];
	for (int i = 2; i < n; i++) {
		int w = ii[i];
		if (used[w])
			continue;
		dfs(-1, r);
		int u = r;
		while (1) {
			int m = 0;
			for (int o = 0; o < eo[u]; o++) {
				int j = ej[u][o];
				if (j != pp[u])
					jj[m++] = j;
			}
			for (int h = u == r ? 0 : 1; h < m; h += 2)
				if (h + 1 < m) {
					int x = Query(uu[jj[h]], uu[jj[h + 1]], w);
					if (x == u)
						continue;
					if (!used[x]) {
						cnt = 0, up(jj[h]), qu[cnt++] = u, down(jj[h + 1]);
						int lower = 0, upper = cnt - 1;
						while (1) {
							int g = (lower + upper) / 2;
							x = Query(qu[g], qu[g + 1], w);
							if (x == qu[g])
								upper = g;
							else if (x == qu[g + 1])
								lower = g + 1;
							else {
								remove_(qu[g], qu[g + 1]), remove_(qu[g + 1], qu[g]);
								append(qu[g], x), append(x, qu[g]);
								append(qu[g + 1], x), append(x, qu[g + 1]);
								if (w != x)
									append(w, x), append(x, w);
								used[w] = used[x] = 1;
								goto out;
							}
						}
					}
					u = x;
					goto nxt;
				} else {
					int x = Query(uu[jj[h]], u, w);
					if (x == u)
						continue;
					if (!used[x]) {
						cnt = 0, up(jj[h]), qu[cnt++] = u;
						int lower = 0, upper = cnt - 1;
						while (1) {
							int g = (lower + upper) / 2;
							x = Query(qu[g], qu[g + 1], w);
							if (x == qu[g])
								upper = g;
							else if (x == qu[g + 1])
								lower = g + 1;
							else {
								remove_(qu[g], qu[g + 1]), remove_(qu[g + 1], qu[g]);
								append(qu[g], x), append(x, qu[g]);
								append(qu[g + 1], x), append(x, qu[g + 1]);
								if (w != x)
									append(w, x), append(x, w);
								used[w] = used[x] = 1;
								goto out;
							}
						}
					}
					u = x;
					goto nxt;
				}
			append(u, w), append(w, u), used[w] = 1;
			break;
nxt:;
		}
out:;
	}
	for (int i = 0; i < n; i++)
		for (int o = eo[i]; o--; ) {
			int j = ej[i][o];
			if (i < j)
				Bridge(i, j);
		}
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 5 ms 1560 KB Output is correct
28 Correct 5 ms 1488 KB Output is correct
29 Correct 5 ms 1580 KB Output is correct
30 Correct 5 ms 1488 KB Output is correct
31 Correct 4 ms 1616 KB Output is correct
32 Correct 6 ms 1488 KB Output is correct
33 Correct 8 ms 1600 KB Output is correct
34 Correct 8 ms 1488 KB Output is correct
35 Correct 8 ms 1616 KB Output is correct
36 Correct 5 ms 1488 KB Output is correct
37 Correct 10 ms 1524 KB Output is correct
38 Correct 10 ms 1616 KB Output is correct
39 Correct 9 ms 1528 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 8768 KB Output is correct
2 Correct 346 ms 8648 KB Output is correct
3 Correct 363 ms 8548 KB Output is correct
4 Correct 326 ms 8688 KB Output is correct
5 Correct 245 ms 8648 KB Output is correct
6 Correct 313 ms 8652 KB Output is correct
7 Correct 352 ms 8624 KB Output is correct
8 Correct 423 ms 8584 KB Output is correct
9 Correct 387 ms 8568 KB Output is correct
10 Correct 371 ms 8692 KB Output is correct
11 Correct 390 ms 8648 KB Output is correct
12 Correct 335 ms 8704 KB Output is correct
13 Correct 223 ms 8604 KB Output is correct
14 Correct 290 ms 8696 KB Output is correct
15 Correct 242 ms 8580 KB Output is correct
16 Correct 316 ms 8656 KB Output is correct
17 Correct 374 ms 8636 KB Output is correct
18 Correct 251 ms 8684 KB Output is correct
19 Correct 242 ms 8564 KB Output is correct
20 Correct 340 ms 8724 KB Output is correct
21 Correct 321 ms 8600 KB Output is correct
22 Correct 319 ms 8620 KB Output is correct
23 Correct 301 ms 8608 KB Output is correct
24 Correct 315 ms 8600 KB Output is correct
25 Correct 295 ms 8768 KB Output is correct
26 Correct 285 ms 8644 KB Output is correct
27 Correct 305 ms 8724 KB Output is correct
28 Correct 423 ms 8576 KB Output is correct
29 Correct 337 ms 8588 KB Output is correct
30 Correct 364 ms 8588 KB Output is correct
31 Correct 405 ms 8692 KB Output is correct
32 Correct 821 ms 8760 KB Output is correct
33 Correct 591 ms 8704 KB Output is correct
34 Correct 7 ms 1536 KB Output is correct
35 Correct 5 ms 1576 KB Output is correct
36 Correct 6 ms 1488 KB Output is correct
37 Correct 6 ms 1488 KB Output is correct
38 Correct 5 ms 1488 KB Output is correct
39 Correct 6 ms 1512 KB Output is correct
40 Correct 7 ms 1488 KB Output is correct
41 Correct 8 ms 1616 KB Output is correct
42 Correct 8 ms 1616 KB Output is correct
43 Correct 5 ms 1468 KB Output is correct
44 Correct 10 ms 1508 KB Output is correct
45 Correct 11 ms 1616 KB Output is correct
46 Correct 9 ms 1616 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 0 ms 464 KB Output is correct
49 Correct 1 ms 464 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 0 ms 464 KB Output is correct
52 Correct 1 ms 464 KB Output is correct
53 Correct 1 ms 464 KB Output is correct
54 Correct 1 ms 464 KB Output is correct
55 Correct 1 ms 464 KB Output is correct
56 Correct 0 ms 464 KB Output is correct
57 Correct 1 ms 464 KB Output is correct
58 Correct 1 ms 464 KB Output is correct
59 Correct 1 ms 464 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 0 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct