oj.uz

답안 #153770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153770 2019-09-15T20:43:32 Z tutis Cats or Dogs (JOI18_catdog) C++17
100 / 100
 1608 ms 26616 KB 
#import<bits/stdc++.h>
using namespace std;
const int N = 101010;
vector<int>adj[N];
int pa[N];
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[N], head[N], tail[N];
void hld(int i, int p, int h)
{
	nr[i] = timer++;
	head[i] = h;
	tail[h] = i;
	int t = 0;
	for (int j : adj[i])
	{
		if (j != p)
			hld(j, i, t++ == 0 ? h : j);
	}
}
struct line
{
	int cc = 0, cd = N, dd = 0, dc = N;
	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, N);
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[N], D[N], V[N];
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 ? N : C[v], 1);
		medis.set(nr[v], V[v] == 2 ? N : 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, 2);
}
int dog(int v)
{
	return fix(v, 1);
}
int neighbor(int v)
{
	return fix(v, 0);
}

Compilation message

catdog.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
 #import<bits/stdc++.h>
  ^~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12152 KB Output is correct
2 Correct 18 ms 12152 KB Output is correct
3 Correct 19 ms 12148 KB Output is correct
4 Correct 19 ms 12152 KB Output is correct
5 Correct 18 ms 12152 KB Output is correct
6 Correct 19 ms 12152 KB Output is correct
7 Correct 19 ms 12152 KB Output is correct
8 Correct 18 ms 12152 KB Output is correct
9 Correct 19 ms 12280 KB Output is correct
10 Correct 19 ms 12248 KB Output is correct
11 Correct 18 ms 12152 KB Output is correct
12 Correct 18 ms 12152 KB Output is correct
13 Correct 18 ms 12152 KB Output is correct
14 Correct 19 ms 12152 KB Output is correct
15 Correct 18 ms 12152 KB Output is correct
16 Correct 18 ms 12228 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12152 KB Output is correct
2 Correct 18 ms 12152 KB Output is correct
3 Correct 19 ms 12148 KB Output is correct
4 Correct 19 ms 12152 KB Output is correct
5 Correct 18 ms 12152 KB Output is correct
6 Correct 19 ms 12152 KB Output is correct
7 Correct 19 ms 12152 KB Output is correct
8 Correct 18 ms 12152 KB Output is correct
9 Correct 19 ms 12280 KB Output is correct
10 Correct 19 ms 12248 KB Output is correct
11 Correct 18 ms 12152 KB Output is correct
12 Correct 18 ms 12152 KB Output is correct
13 Correct 18 ms 12152 KB Output is correct
14 Correct 19 ms 12152 KB Output is correct
15 Correct 18 ms 12152 KB Output is correct
16 Correct 18 ms 12228 KB Output is correct
17 Correct 24 ms 12252 KB Output is correct
18 Correct 24 ms 12280 KB Output is correct
19 Correct 21 ms 12232 KB Output is correct
20 Correct 19 ms 12152 KB Output is correct
21 Correct 21 ms 12280 KB Output is correct
22 Correct 21 ms 12252 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 12252 KB Output is correct
26 Correct 20 ms 12280 KB Output is correct
27 Correct 19 ms 12244 KB Output is correct
28 Correct 19 ms 12408 KB Output is correct
29 Correct 22 ms 12280 KB Output is correct
30 Correct 20 ms 12200 KB Output is correct
31 Correct 19 ms 12280 KB Output is correct
32 Correct 20 ms 12280 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12152 KB Output is correct
2 Correct 18 ms 12152 KB Output is correct
3 Correct 19 ms 12148 KB Output is correct
4 Correct 19 ms 12152 KB Output is correct
5 Correct 18 ms 12152 KB Output is correct
6 Correct 19 ms 12152 KB Output is correct
7 Correct 19 ms 12152 KB Output is correct
8 Correct 18 ms 12152 KB Output is correct
9 Correct 19 ms 12280 KB Output is correct
10 Correct 19 ms 12248 KB Output is correct
11 Correct 18 ms 12152 KB Output is correct
12 Correct 18 ms 12152 KB Output is correct
13 Correct 18 ms 12152 KB Output is correct
14 Correct 19 ms 12152 KB Output is correct
15 Correct 18 ms 12152 KB Output is correct
16 Correct 18 ms 12228 KB Output is correct
17 Correct 24 ms 12252 KB Output is correct
18 Correct 24 ms 12280 KB Output is correct
19 Correct 21 ms 12232 KB Output is correct
20 Correct 19 ms 12152 KB Output is correct
21 Correct 21 ms 12280 KB Output is correct
22 Correct 21 ms 12252 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 12252 KB Output is correct
26 Correct 20 ms 12280 KB Output is correct
27 Correct 19 ms 12244 KB Output is correct
28 Correct 19 ms 12408 KB Output is correct
29 Correct 22 ms 12280 KB Output is correct
30 Correct 20 ms 12200 KB Output is correct
31 Correct 19 ms 12280 KB Output is correct
32 Correct 20 ms 12280 KB Output is correct
33 Correct 984 ms 16880 KB Output is correct
34 Correct 277 ms 17016 KB Output is correct
35 Correct 928 ms 16072 KB Output is correct
36 Correct 1438 ms 20032 KB Output is correct
37 Correct 40 ms 14456 KB Output is correct
38 Correct 1564 ms 20660 KB Output is correct
39 Correct 1513 ms 20672 KB Output is correct
40 Correct 1523 ms 20672 KB Output is correct
41 Correct 1608 ms 20660 KB Output is correct
42 Correct 1538 ms 20680 KB Output is correct
43 Correct 1494 ms 20672 KB Output is correct
44 Correct 1425 ms 20808 KB Output is correct
45 Correct 1474 ms 20688 KB Output is correct
46 Correct 1538 ms 20680 KB Output is correct
47 Correct 1588 ms 20672 KB Output is correct
48 Correct 351 ms 17856 KB Output is correct
49 Correct 401 ms 19212 KB Output is correct
50 Correct 181 ms 13936 KB Output is correct
51 Correct 186 ms 15040 KB Output is correct
52 Correct 85 ms 13660 KB Output is correct
53 Correct 616 ms 19692 KB Output is correct
54 Correct 529 ms 15616 KB Output is correct
55 Correct 1363 ms 18292 KB Output is correct
56 Correct 895 ms 16228 KB Output is correct
57 Correct 1068 ms 19268 KB Output is correct
58 Correct 64 ms 15092 KB Output is correct
59 Correct 172 ms 14800 KB Output is correct
60 Correct 334 ms 18476 KB Output is correct
61 Correct 364 ms 18676 KB Output is correct
62 Correct 212 ms 17136 KB Output is correct
63 Correct 116 ms 18060 KB Output is correct
64 Correct 124 ms 19676 KB Output is correct
65 Correct 134 ms 23676 KB Output is correct
66 Correct 231 ms 15172 KB Output is correct
67 Correct 173 ms 20344 KB Output is correct
68 Correct 357 ms 23544 KB Output is correct
69 Correct 135 ms 13432 KB Output is correct
70 Correct 47 ms 12536 KB Output is correct
71 Correct 192 ms 17784 KB Output is correct
72 Correct 249 ms 22512 KB Output is correct
73 Correct 517 ms 26600 KB Output is correct
74 Correct 560 ms 23164 KB Output is correct
75 Correct 415 ms 26616 KB Output is correct
76 Correct 431 ms 25208 KB Output is correct
77 Correct 555 ms 23592 KB Output is correct