oj.uz

Submission #153761

# Submission time Handle Problem Language Result Execution time Memory
153761 2019-09-15T20:24:31 Z tutis Cats or Dogs (JOI18_catdog) C++17
100 / 100
 1596 ms 29764 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() {}
};
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];
void fix(int v)
{
	while (true)
	{
		int w = head[v];
		line X = medis.get(nr[w], nr[tail[w]]);
		C[pa[w]] -= min({X.cd, X.cc, X.dc + 1, X.dd + 1});
		D[pa[w]] -= min({X.cd + 1, X.cc + 1, X.dc, X.dd});
		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]] += min({X.cd, X.cc, X.dc + 1, X.dd + 1});
		D[pa[w]] += min({X.cd + 1, X.cc + 1, X.dc, X.dd});
		if (v == 1)break;
		if (v != w)
			v = w;
		else
			v = pa[v];
	}
}
int cat(int v)
{
	V[v] = -1;
	fix(v);
	return min(C[0], D[0]);
}
int dog(int v)
{
	V[v] = 1;
	fix(v);
	return min(C[0], D[0]);
}
int neighbor(int v)
{
	V[v] = 0;
	fix(v);
	return min(C[0], D[0]);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 12280 KB Output is correct
2 Correct 20 ms 12280 KB Output is correct
3 Correct 20 ms 12152 KB Output is correct
4 Correct 11 ms 12280 KB Output is correct
5 Correct 21 ms 12152 KB Output is correct
6 Correct 21 ms 12152 KB Output is correct
7 Correct 21 ms 12152 KB Output is correct
8 Correct 52 ms 12232 KB Output is correct
9 Correct 21 ms 12152 KB Output is correct
10 Correct 19 ms 12280 KB Output is correct
11 Correct 21 ms 12152 KB Output is correct
12 Correct 18 ms 12156 KB Output is correct
13 Correct 21 ms 12280 KB Output is correct
14 Correct 18 ms 12152 KB Output is correct
15 Correct 21 ms 12280 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 20 ms 12280 KB Output is correct
2 Correct 20 ms 12280 KB Output is correct
3 Correct 20 ms 12152 KB Output is correct
4 Correct 11 ms 12280 KB Output is correct
5 Correct 21 ms 12152 KB Output is correct
6 Correct 21 ms 12152 KB Output is correct
7 Correct 21 ms 12152 KB Output is correct
8 Correct 52 ms 12232 KB Output is correct
9 Correct 21 ms 12152 KB Output is correct
10 Correct 19 ms 12280 KB Output is correct
11 Correct 21 ms 12152 KB Output is correct
12 Correct 18 ms 12156 KB Output is correct
13 Correct 21 ms 12280 KB Output is correct
14 Correct 18 ms 12152 KB Output is correct
15 Correct 21 ms 12280 KB Output is correct
16 Correct 19 ms 12152 KB Output is correct
17 Correct 54 ms 12256 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 20 ms 12280 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 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 12408 KB Output is correct
29 Correct 24 ms 12280 KB Output is correct
30 Correct 21 ms 12280 KB Output is correct
31 Correct 19 ms 12284 KB Output is correct
32 Correct 21 ms 12280 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 12280 KB Output is correct
2 Correct 20 ms 12280 KB Output is correct
3 Correct 20 ms 12152 KB Output is correct
4 Correct 11 ms 12280 KB Output is correct
5 Correct 21 ms 12152 KB Output is correct
6 Correct 21 ms 12152 KB Output is correct
7 Correct 21 ms 12152 KB Output is correct
8 Correct 52 ms 12232 KB Output is correct
9 Correct 21 ms 12152 KB Output is correct
10 Correct 19 ms 12280 KB Output is correct
11 Correct 21 ms 12152 KB Output is correct
12 Correct 18 ms 12156 KB Output is correct
13 Correct 21 ms 12280 KB Output is correct
14 Correct 18 ms 12152 KB Output is correct
15 Correct 21 ms 12280 KB Output is correct
16 Correct 19 ms 12152 KB Output is correct
17 Correct 54 ms 12256 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 20 ms 12280 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 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 12408 KB Output is correct
29 Correct 24 ms 12280 KB Output is correct
30 Correct 21 ms 12280 KB Output is correct
31 Correct 19 ms 12284 KB Output is correct
32 Correct 21 ms 12280 KB Output is correct
33 Correct 1040 ms 18096 KB Output is correct
34 Correct 271 ms 18040 KB Output is correct
35 Correct 932 ms 16964 KB Output is correct
36 Correct 1448 ms 22080 KB Output is correct
37 Correct 40 ms 14968 KB Output is correct
38 Correct 1581 ms 22992 KB Output is correct
39 Correct 1556 ms 22996 KB Output is correct
40 Correct 1570 ms 23012 KB Output is correct
41 Correct 1586 ms 23016 KB Output is correct
42 Correct 1596 ms 23008 KB Output is correct
43 Correct 1536 ms 22996 KB Output is correct
44 Correct 1420 ms 23008 KB Output is correct
45 Correct 1482 ms 22872 KB Output is correct
46 Correct 1565 ms 22628 KB Output is correct
47 Correct 1546 ms 22596 KB Output is correct
48 Correct 360 ms 19260 KB Output is correct
49 Correct 381 ms 20624 KB Output is correct
50 Correct 164 ms 14456 KB Output is correct
51 Correct 172 ms 15708 KB Output is correct
52 Correct 77 ms 14072 KB Output is correct
53 Correct 601 ms 21100 KB Output is correct
54 Correct 516 ms 16532 KB Output is correct
55 Correct 1345 ms 19568 KB Output is correct
56 Correct 855 ms 17312 KB Output is correct
57 Correct 1056 ms 20896 KB Output is correct
58 Correct 66 ms 15732 KB Output is correct
59 Correct 164 ms 15548 KB Output is correct
60 Correct 332 ms 19960 KB Output is correct
61 Correct 369 ms 20320 KB Output is correct
62 Correct 214 ms 18640 KB Output is correct
63 Correct 122 ms 19572 KB Output is correct
64 Correct 124 ms 21400 KB Output is correct
65 Correct 138 ms 26348 KB Output is correct
66 Correct 233 ms 15988 KB Output is correct
67 Correct 176 ms 22264 KB Output is correct
68 Correct 364 ms 26068 KB Output is correct
69 Correct 132 ms 13844 KB Output is correct
70 Correct 47 ms 12408 KB Output is correct
71 Correct 191 ms 19064 KB Output is correct
72 Correct 246 ms 24696 KB Output is correct
73 Correct 518 ms 29560 KB Output is correct
74 Correct 555 ms 25364 KB Output is correct
75 Correct 430 ms 29764 KB Output is correct
76 Correct 435 ms 28276 KB Output is correct
77 Correct 564 ms 25960 KB Output is correct