oj.uz

Submission #153765

# Submission time Handle Problem Language Result Execution time Memory
153765 2019-09-15T20:32:03 Z tutis Cats or Dogs (JOI18_catdog) C++17
100 / 100
 1677 ms 27896 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 101010;
vector<int>adj[maxn];
int pa[maxn];
int dfs(int i, int p)
{
	pa[i] = p;
	int sz = 1;
	pair<int, int>mx = {0, 0};
	for (int t = 0; t < (int)adj[i].size(); t++)
	{
		int j = adj[i][t];
		if (j == p)
			continue;
		int x = dfs(j, i);
		sz += x;
		mx = max(mx, {x, t});
	}
	swap(adj[i][0], adj[i][mx.second]);
	return sz;
}
int timer = 1;
int nr[maxn], head[maxn], tail[maxn];
void hld(int i, int p, int h)
{
	nr[i] = timer++;
	head[i] = h;
	tail[h] = i;
	for (int t = 0; t < (int)adj[i].size(); t++)
	{
		int j = adj[i][t];
		if (j != p)
			hld(j, i, t == 0 ? h : j);
	}
}
struct line
{
	int cc = 0, cd = maxn, dd = 0, dc = maxn;
	line() {}
	int mn(int c)
	{
		if (c)
			return min({cd, cc, dc + 1, dd + 1});
		else
			return min({cd + 1, cc + 1, dc, dd});
	}
};
line merge(line a, line b)
{
	line c;
	c.cc = min({a.cc + b.cc, a.cc + b.dc + 1, a.cd + b.cc + 1, a.cd + b.dc});
	c.cd = min({a.cc + b.cd, a.cc + b.dd + 1, a.cd + b.cd + 1, a.cd + b.dd});
	c.dd = min({a.dc + b.cd, a.dc + b.dd + 1, a.dd + b.cd + 1, a.dd + b.dd});
	c.dc = min({a.dc + b.cc, a.dc + b.dc + 1, a.dd + b.cc + 1, a.dd + b.dc});
	return c;
}
struct ST
{
	line X;
	int l, r;
	ST *left, *right;
	ST(int l, int r): l(l), r(r)
	{
		if (l < r)
		{
			left = new ST(l, (l + r) / 2);
			right = new ST((l + r) / 2 + 1, r);
			X = merge(left->X, right->X);
		}
	}
	line get(int x, int y)
	{
		if (x <= l && r <= y)
			return X;
		if (r < x || y < l)
			return line();
		return merge(left->get(x, y), right->get(x, y));
	}
	void set(int x, int w, int c)
	{
		if (l == r)
		{
			if (c)
				X.cc = w;
			else
				X.dd = w;
		}
		else
		{
			if (x <= (l + r) / 2)
				left->set(x, w, c);
			else
				right->set(x, w, c);
			X = merge(left->X, right->X);
		}
	}
} medis(0, 101010);
void initialize(int N, vector<int> A, vector<int> B)
{
	for (int i = 0; i < N - 1; i++)
	{
		adj[A[i]].push_back(B[i]);
		adj[B[i]].push_back(A[i]);
	}
	dfs(1, 0);
	hld(1, 0, 1);
}
int C[maxn], D[maxn], V[maxn];
int fix(int v, int p)
{
	V[v] = p;
	while (true)
	{
		int w = head[v];
		line X = medis.get(nr[w], nr[tail[w]]);
		C[pa[w]] -= X.mn(1);
		D[pa[w]] -= X.mn(0);
		medis.set(nr[v], V[v] == 1 ? maxn : C[v], 1);
		medis.set(nr[v], V[v] == -1 ? maxn : D[v], 0);
		X = medis.get(nr[w], nr[tail[w]]);
		C[pa[w]] += X.mn(1);
		D[pa[w]] += X.mn(0);
		if (v == 1)break;
		if (v != w)
			v = w;
		else
			v = pa[v];
	}
	return min(C[0], D[0]);
}
int cat(int v)
{
	return fix(v, -1);
}
int dog(int v)
{
	return fix(v, 1);
}
int neighbor(int v)
{
	return fix(v, 0);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12152 KB Output is correct
2 Correct 18 ms 12152 KB Output is correct
3 Correct 19 ms 12204 KB Output is correct
4 Correct 19 ms 12280 KB Output is correct
5 Correct 19 ms 12408 KB Output is correct
6 Correct 19 ms 12280 KB Output is correct
7 Correct 19 ms 12252 KB Output is correct
8 Correct 19 ms 12228 KB Output is correct
9 Correct 19 ms 12284 KB Output is correct
10 Correct 19 ms 12280 KB Output is correct
11 Correct 18 ms 12152 KB Output is correct
12 Correct 18 ms 12252 KB Output is correct
13 Correct 19 ms 12280 KB Output is correct
14 Correct 18 ms 12152 KB Output is correct
15 Correct 21 ms 12152 KB Output is correct
16 Correct 19 ms 12152 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12152 KB Output is correct
2 Correct 18 ms 12152 KB Output is correct
3 Correct 19 ms 12204 KB Output is correct
4 Correct 19 ms 12280 KB Output is correct
5 Correct 19 ms 12408 KB Output is correct
6 Correct 19 ms 12280 KB Output is correct
7 Correct 19 ms 12252 KB Output is correct
8 Correct 19 ms 12228 KB Output is correct
9 Correct 19 ms 12284 KB Output is correct
10 Correct 19 ms 12280 KB Output is correct
11 Correct 18 ms 12152 KB Output is correct
12 Correct 18 ms 12252 KB Output is correct
13 Correct 19 ms 12280 KB Output is correct
14 Correct 18 ms 12152 KB Output is correct
15 Correct 21 ms 12152 KB Output is correct
16 Correct 19 ms 12152 KB Output is correct
17 Correct 23 ms 12280 KB Output is correct
18 Correct 24 ms 12408 KB Output is correct
19 Correct 22 ms 12280 KB Output is correct
20 Correct 19 ms 12208 KB Output is correct
21 Correct 21 ms 12388 KB Output is correct
22 Correct 23 ms 12280 KB Output is correct
23 Correct 26 ms 12280 KB Output is correct
24 Correct 24 ms 12280 KB Output is correct
25 Correct 23 ms 12280 KB Output is correct
26 Correct 21 ms 12280 KB Output is correct
27 Correct 20 ms 12280 KB Output is correct
28 Correct 20 ms 12280 KB Output is correct
29 Correct 22 ms 12280 KB Output is correct
30 Correct 20 ms 12284 KB Output is correct
31 Correct 24 ms 12280 KB Output is correct
32 Correct 23 ms 12408 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12152 KB Output is correct
2 Correct 18 ms 12152 KB Output is correct
3 Correct 19 ms 12204 KB Output is correct
4 Correct 19 ms 12280 KB Output is correct
5 Correct 19 ms 12408 KB Output is correct
6 Correct 19 ms 12280 KB Output is correct
7 Correct 19 ms 12252 KB Output is correct
8 Correct 19 ms 12228 KB Output is correct
9 Correct 19 ms 12284 KB Output is correct
10 Correct 19 ms 12280 KB Output is correct
11 Correct 18 ms 12152 KB Output is correct
12 Correct 18 ms 12252 KB Output is correct
13 Correct 19 ms 12280 KB Output is correct
14 Correct 18 ms 12152 KB Output is correct
15 Correct 21 ms 12152 KB Output is correct
16 Correct 19 ms 12152 KB Output is correct
17 Correct 23 ms 12280 KB Output is correct
18 Correct 24 ms 12408 KB Output is correct
19 Correct 22 ms 12280 KB Output is correct
20 Correct 19 ms 12208 KB Output is correct
21 Correct 21 ms 12388 KB Output is correct
22 Correct 23 ms 12280 KB Output is correct
23 Correct 26 ms 12280 KB Output is correct
24 Correct 24 ms 12280 KB Output is correct
25 Correct 23 ms 12280 KB Output is correct
26 Correct 21 ms 12280 KB Output is correct
27 Correct 20 ms 12280 KB Output is correct
28 Correct 20 ms 12280 KB Output is correct
29 Correct 22 ms 12280 KB Output is correct
30 Correct 20 ms 12284 KB Output is correct
31 Correct 24 ms 12280 KB Output is correct
32 Correct 23 ms 12408 KB Output is correct
33 Correct 986 ms 17396 KB Output is correct
34 Correct 274 ms 17456 KB Output is correct
35 Correct 916 ms 16596 KB Output is correct
36 Correct 1507 ms 20916 KB Output is correct
37 Correct 42 ms 14840 KB Output is correct
38 Correct 1632 ms 21836 KB Output is correct
39 Correct 1562 ms 21960 KB Output is correct
40 Correct 1575 ms 22012 KB Output is correct
41 Correct 1677 ms 22004 KB Output is correct
42 Correct 1550 ms 21964 KB Output is correct
43 Correct 1536 ms 21836 KB Output is correct
44 Correct 1419 ms 21864 KB Output is correct
45 Correct 1414 ms 21836 KB Output is correct
46 Correct 1482 ms 22084 KB Output is correct
47 Correct 1630 ms 22072 KB Output is correct
48 Correct 355 ms 18672 KB Output is correct
49 Correct 394 ms 20256 KB Output is correct
50 Correct 164 ms 14456 KB Output is correct
51 Correct 178 ms 15660 KB Output is correct
52 Correct 78 ms 13948 KB Output is correct
53 Correct 604 ms 20496 KB Output is correct
54 Correct 580 ms 16308 KB Output is correct
55 Correct 1332 ms 19580 KB Output is correct
56 Correct 845 ms 17236 KB Output is correct
57 Correct 1038 ms 20764 KB Output is correct
58 Correct 71 ms 15476 KB Output is correct
59 Correct 173 ms 15424 KB Output is correct
60 Correct 339 ms 19832 KB Output is correct
61 Correct 382 ms 20192 KB Output is correct
62 Correct 216 ms 17936 KB Output is correct
63 Correct 117 ms 18680 KB Output is correct
64 Correct 123 ms 20472 KB Output is correct
65 Correct 134 ms 24444 KB Output is correct
66 Correct 235 ms 15736 KB Output is correct
67 Correct 196 ms 20856 KB Output is correct
68 Correct 383 ms 24696 KB Output is correct
69 Correct 130 ms 13816 KB Output is correct
70 Correct 47 ms 12408 KB Output is correct
71 Correct 190 ms 18548 KB Output is correct
72 Correct 244 ms 23288 KB Output is correct
73 Correct 517 ms 27740 KB Output is correct
74 Correct 555 ms 24332 KB Output is correct
75 Correct 419 ms 27896 KB Output is correct
76 Correct 426 ms 26616 KB Output is correct
77 Correct 554 ms 24824 KB Output is correct