oj.uz

Submission #547246

# Submission time Handle Problem Language Result Execution time Memory
547246 2022-04-10T04:15:04 Z MilosMilutinovic Keys (IOI21_keys) C++17
100 / 100
 923 ms 81224 KB 
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

using namespace std;

typedef vector<int> vi;

#define N   600001

int que[N], que_[N], head, tail, *ej[N], *ec[N], eo[N];
int ds[N], gg[N], *ej_[N], eo_[N], ff[N], col[N];
int n, id, tt[N], *wi[N], wo[N], vis[N], td;

void append_(int i, int j) {
	int o = eo_[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		ej_[i] = (int *) realloc(ej_[i], o * 2 * sizeof ej_[i]);
	ej_[i][o] = j;
}

void append(int i, int j, int c) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof ej[i]),
		ec[i] = (int *) realloc(ec[i], o * 2 * sizeof ec[i]);
	ej[i][o] = j, ec[i][o] = c;
}

int find(int i) {
	return ds[i] == i ? i : (ds[i] = find(ds[i]));
}

void join(int i, int j) {
	i = find(i);
	j = find(j);
	if (i == j)
		return;
	ds[i] = j;
}

void upd(int i) {
	ff[i] = 1, que_[td++] = i;
	while (wo[i] > 0) {
		int i_ = wi[i][--wo[i]];

		if (!vis[i_])
			vis[i_] = 1, que[tail++] = i_;
	}
}

int st;

void add(int i) {
	int o;

	upd(col[i]);
	vis[i] = 1;
	if (find(i) != find(st))
		return;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o], c = ec[i][o];

		if (vis[j])
			continue;
		if (ff[c] == 1)
			que[tail++] = j, vis[j] = 1;
		else
			que_[td++] = c, wi[c][wo[c]++] = j;
	}
}

void bfs(int i) {
	int i_, o;

	st = i, head = tail = td = 0;
	que[tail++] = i;
	while (head < tail) {
		i_ = que[head++];

		if (find(i_) != find(i)) {
			id = i_;
			break;
		}
		add(i_);
	}
	for (i_ = 0; i_ < tail; i_++)
		vis[que[i_]] = 0;
	for (i_ = 0; i_ < td; i_++)
		ff[que_[i_]] = 0, wo[que_[i_]] = 0;
}

vi find_reachable(vi aa, vi ii_, vi jj_, vi cc) {
	static int ii[N], jj[N], hh[N];
	int m = ii_.size(), i, j, i_, mn, op, cnt;
	vi ans(n = aa.size());

	for (i = 0; i < n; i++)
		ej_[i] = (int *) malloc(2 * sizeof *ej_[i]),
		ej[i] = (int *) malloc(2 * sizeof *ej[i]),
		ec[i] = (int *) malloc(2 * sizeof *ec[i]);
	for (i = 0; i < m; i++)
		append(ii_[i], jj_[i], cc[i]), append(jj_[i], ii_[i], cc[i]);
	for (i = 0; i < n; i++)
		ds[i] = i, gg[i] = 0;
	for (i = 0; i < n; i++)
		col[i] = aa[i], tt[aa[i]]++;
	for (i = 0; i < m; i++)
		tt[cc[i]]++;
	for (i = 0; i < N; i++)
		if (tt[i] >= 1)
			wi[i] = (int *) malloc(2 * tt[i] * sizeof *wi[i]), wo[i] = 0;
	cnt = 0;
	for (i_ = 0; i_ < 20; i_++) {
		op = 0;

		for (i = 0; i < n; i++)
			if (find(i) == i && gg[i] == 0) {
				id = -1;
				bfs(i);
				if (id == -1) {
					gg[i] = 1, hh[cnt++] = i;
					for (j = 0; j < tail; j++)
						append_(i, que[j]);
				} else
					ii[op] = i, jj[op++] = id;
			}
		for (i = 0; i < op; i++)
			join(ii[i], jj[i]);
	}
	for (i = 0, mn = n + 1; i < cnt; i++)
		mn = min(mn, eo_[hh[i]]);
	for (i = 0; i < cnt; i++)
		if (eo_[hh[i]] == mn)
			for (j = 0; j < eo_[hh[i]]; j++)
				ans[ej_[hh[i]][j]] = 1;
	return ans;
}

Compilation message

keys.cpp: In function 'void append_(int, int)':
keys.cpp:19:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   19 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
keys.cpp: In function 'void append(int, int, int)':
keys.cpp:27:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   27 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
keys.cpp: In function 'void bfs(int)':
keys.cpp:77:10: warning: unused variable 'o' [-Wunused-variable]
   77 |  int i_, o;
      |          ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 3 ms 852 KB Output is correct
28 Correct 3 ms 852 KB Output is correct
29 Correct 3 ms 852 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 3 ms 724 KB Output is correct
37 Correct 2 ms 736 KB Output is correct
38 Correct 2 ms 852 KB Output is correct
39 Correct 4 ms 852 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 2 ms 724 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 255 ms 40040 KB Output is correct
11 Correct 237 ms 61124 KB Output is correct
12 Correct 49 ms 12416 KB Output is correct
13 Correct 285 ms 60876 KB Output is correct
14 Correct 227 ms 67064 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 3 ms 852 KB Output is correct
28 Correct 3 ms 852 KB Output is correct
29 Correct 3 ms 852 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 3 ms 724 KB Output is correct
37 Correct 2 ms 736 KB Output is correct
38 Correct 2 ms 852 KB Output is correct
39 Correct 4 ms 852 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 255 ms 40040 KB Output is correct
43 Correct 237 ms 61124 KB Output is correct
44 Correct 49 ms 12416 KB Output is correct
45 Correct 285 ms 60876 KB Output is correct
46 Correct 227 ms 67064 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 178 ms 65508 KB Output is correct
51 Correct 207 ms 68072 KB Output is correct
52 Correct 279 ms 56648 KB Output is correct
53 Correct 236 ms 56672 KB Output is correct
54 Correct 279 ms 56648 KB Output is correct
55 Correct 292 ms 48724 KB Output is correct
56 Correct 329 ms 77760 KB Output is correct
57 Correct 233 ms 81224 KB Output is correct
58 Correct 257 ms 81080 KB Output is correct
59 Correct 345 ms 65920 KB Output is correct
60 Correct 347 ms 62440 KB Output is correct
61 Correct 347 ms 65956 KB Output is correct
62 Correct 923 ms 53032 KB Output is correct
63 Correct 206 ms 58340 KB Output is correct
64 Correct 4 ms 1620 KB Output is correct
65 Correct 4 ms 1620 KB Output is correct
66 Correct 914 ms 52900 KB Output is correct
67 Correct 20 ms 7636 KB Output is correct
68 Correct 33 ms 12340 KB Output is correct
69 Correct 353 ms 65892 KB Output is correct
70 Correct 65 ms 23860 KB Output is correct
71 Correct 196 ms 68724 KB Output is correct
72 Correct 360 ms 65920 KB Output is correct
73 Correct 881 ms 52972 KB Output is correct