oj.uz

Submission #153763

# Submission time Handle Problem Language Result Execution time Memory
153763 2019-09-15T20:28:07 Z tutis Cats or Dogs (JOI18_catdog) C++17
100 / 100
 1602 ms 29560 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 101010;
vector<int>adj[maxn];
int pa[maxn], sz[maxn];
void dfs(int i, int p)
{
	if (p != 0)
		adj[i].erase(find(adj[i].begin(), adj[i].end(), p));
	pa[i] = p;
	sz[i] = 1;
	pair<int, int>mx = { -1, -1};
	for (int t = 0; t < (int)adj[i].size(); t++)
	{
		int j = adj[i][t];
		dfs(j, i);
		sz[i] += sz[j];
		mx = max(mx, {sz[j], t});
	}
	if (mx.second != -1)
		swap(adj[i][0], adj[i][mx.second]);
}
int timer = 1;
int nr[maxn], head[maxn], tail[maxn];
void hld(int i, 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];
		hld(j, 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, 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 18 ms 12280 KB Output is correct
2 Correct 19 ms 12300 KB Output is correct
3 Correct 18 ms 12280 KB Output is correct
4 Correct 18 ms 12152 KB Output is correct
5 Correct 19 ms 12152 KB Output is correct
6 Correct 19 ms 12280 KB Output is correct
7 Correct 19 ms 12152 KB Output is correct
8 Correct 18 ms 12152 KB Output is correct
9 Correct 18 ms 12152 KB Output is correct
10 Correct 18 ms 12152 KB Output is correct
11 Correct 18 ms 12148 KB Output is correct
12 Correct 19 ms 12340 KB Output is correct
13 Correct 18 ms 12212 KB Output is correct
14 Correct 18 ms 12172 KB Output is correct
15 Correct 18 ms 12264 KB Output is correct
16 Correct 19 ms 12200 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 12280 KB Output is correct
2 Correct 19 ms 12300 KB Output is correct
3 Correct 18 ms 12280 KB Output is correct
4 Correct 18 ms 12152 KB Output is correct
5 Correct 19 ms 12152 KB Output is correct
6 Correct 19 ms 12280 KB Output is correct
7 Correct 19 ms 12152 KB Output is correct
8 Correct 18 ms 12152 KB Output is correct
9 Correct 18 ms 12152 KB Output is correct
10 Correct 18 ms 12152 KB Output is correct
11 Correct 18 ms 12148 KB Output is correct
12 Correct 19 ms 12340 KB Output is correct
13 Correct 18 ms 12212 KB Output is correct
14 Correct 18 ms 12172 KB Output is correct
15 Correct 18 ms 12264 KB Output is correct
16 Correct 19 ms 12200 KB Output is correct
17 Correct 24 ms 12280 KB Output is correct
18 Correct 24 ms 12280 KB Output is correct
19 Correct 21 ms 12280 KB Output is correct
20 Correct 18 ms 12280 KB Output is correct
21 Correct 21 ms 12252 KB Output is correct
22 Correct 21 ms 12280 KB Output is correct
23 Correct 25 ms 12280 KB Output is correct
24 Correct 24 ms 12280 KB Output is correct
25 Correct 25 ms 12280 KB Output is correct
26 Correct 20 ms 12280 KB Output is correct
27 Correct 21 ms 12280 KB Output is correct
28 Correct 21 ms 12408 KB Output is correct
29 Correct 24 ms 12408 KB Output is correct
30 Correct 20 ms 12280 KB Output is correct
31 Correct 19 ms 12280 KB Output is correct
32 Correct 25 ms 12280 KB Output is correct
33 Correct 994 ms 17604 KB Output is correct
34 Correct 275 ms 17784 KB Output is correct
35 Correct 942 ms 16620 KB Output is correct
36 Correct 1452 ms 20888 KB Output is correct
37 Correct 41 ms 14968 KB Output is correct
38 Correct 1601 ms 21712 KB Output is correct
39 Correct 1602 ms 21836 KB Output is correct
40 Correct 1554 ms 21848 KB Output is correct
41 Correct 1539 ms 21848 KB Output is correct
42 Correct 1562 ms 21864 KB Output is correct
43 Correct 1533 ms 21716 KB Output is correct
44 Correct 1519 ms 21720 KB Output is correct
45 Correct 1585 ms 21744 KB Output is correct
46 Correct 1544 ms 21752 KB Output is correct
47 Correct 1520 ms 21844 KB Output is correct
48 Correct 352 ms 18752 KB Output is correct
49 Correct 370 ms 20128 KB Output is correct
50 Correct 162 ms 14432 KB Output is correct
51 Correct 163 ms 15552 KB Output is correct
52 Correct 76 ms 14028 KB Output is correct
53 Correct 584 ms 20288 KB Output is correct
54 Correct 495 ms 16048 KB Output is correct
55 Correct 1316 ms 19068 KB Output is correct
56 Correct 829 ms 17020 KB Output is correct
57 Correct 1028 ms 20252 KB Output is correct
58 Correct 66 ms 15604 KB Output is correct
59 Correct 163 ms 15352 KB Output is correct
60 Correct 332 ms 19320 KB Output is correct
61 Correct 361 ms 19632 KB Output is correct
62 Correct 212 ms 18384 KB Output is correct
63 Correct 118 ms 19320 KB Output is correct
64 Correct 122 ms 21340 KB Output is correct
65 Correct 133 ms 25976 KB Output is correct
66 Correct 233 ms 15944 KB Output is correct
67 Correct 173 ms 22136 KB Output is correct
68 Correct 357 ms 25848 KB Output is correct
69 Correct 132 ms 13948 KB Output is correct
70 Correct 47 ms 12408 KB Output is correct
71 Correct 191 ms 19064 KB Output is correct
72 Correct 247 ms 24568 KB Output is correct
73 Correct 539 ms 29560 KB Output is correct
74 Correct 564 ms 25360 KB Output is correct
75 Correct 447 ms 29432 KB Output is correct
76 Correct 431 ms 28020 KB Output is correct
77 Correct 568 ms 25744 KB Output is correct