oj.uz

답안 #153762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153762 2019-09-15T20:26:23 Z tutis Cats or Dogs (JOI18_catdog) C++17
100 / 100
 1676 ms 29944 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];
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]] -= 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];
	}
	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

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 12152 KB Output is correct
2 Correct 21 ms 12152 KB Output is correct
3 Correct 21 ms 12152 KB Output is correct
4 Correct 19 ms 12152 KB Output is correct
5 Correct 19 ms 12152 KB Output is correct
6 Correct 19 ms 12152 KB Output is correct
7 Correct 18 ms 12152 KB Output is correct
8 Correct 19 ms 12280 KB Output is correct
9 Correct 18 ms 12280 KB Output is correct
10 Correct 19 ms 12152 KB Output is correct
11 Correct 19 ms 12280 KB Output is correct
12 Correct 18 ms 12152 KB Output is correct
13 Correct 18 ms 12288 KB Output is correct
14 Correct 18 ms 12280 KB Output is correct
15 Correct 18 ms 12280 KB Output is correct
16 Correct 19 ms 12280 KB Output is correct
17 Correct 24 ms 12280 KB Output is correct
18 Correct 24 ms 12280 KB Output is correct
19 Correct 22 ms 12280 KB Output is correct
20 Correct 19 ms 12280 KB Output is correct
21 Correct 21 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 20 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 22 ms 12320 KB Output is correct
30 Correct 21 ms 12280 KB Output is correct
31 Correct 22 ms 12280 KB Output is correct
32 Correct 21 ms 12280 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 12152 KB Output is correct
2 Correct 21 ms 12152 KB Output is correct
3 Correct 21 ms 12152 KB Output is correct
4 Correct 19 ms 12152 KB Output is correct
5 Correct 19 ms 12152 KB Output is correct
6 Correct 19 ms 12152 KB Output is correct
7 Correct 18 ms 12152 KB Output is correct
8 Correct 19 ms 12280 KB Output is correct
9 Correct 18 ms 12280 KB Output is correct
10 Correct 19 ms 12152 KB Output is correct
11 Correct 19 ms 12280 KB Output is correct
12 Correct 18 ms 12152 KB Output is correct
13 Correct 18 ms 12288 KB Output is correct
14 Correct 18 ms 12280 KB Output is correct
15 Correct 18 ms 12280 KB Output is correct
16 Correct 19 ms 12280 KB Output is correct
17 Correct 24 ms 12280 KB Output is correct
18 Correct 24 ms 12280 KB Output is correct
19 Correct 22 ms 12280 KB Output is correct
20 Correct 19 ms 12280 KB Output is correct
21 Correct 21 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 20 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 22 ms 12320 KB Output is correct
30 Correct 21 ms 12280 KB Output is correct
31 Correct 22 ms 12280 KB Output is correct
32 Correct 21 ms 12280 KB Output is correct
33 Correct 1018 ms 17352 KB Output is correct
34 Correct 275 ms 17528 KB Output is correct
35 Correct 929 ms 16336 KB Output is correct
36 Correct 1520 ms 20640 KB Output is correct
37 Correct 44 ms 14968 KB Output is correct
38 Correct 1638 ms 21452 KB Output is correct
39 Correct 1676 ms 21456 KB Output is correct
40 Correct 1631 ms 21476 KB Output is correct
41 Correct 1652 ms 21460 KB Output is correct
42 Correct 1626 ms 21464 KB Output is correct
43 Correct 1556 ms 21584 KB Output is correct
44 Correct 1474 ms 21584 KB Output is correct
45 Correct 1456 ms 21728 KB Output is correct
46 Correct 1515 ms 21960 KB Output is correct
47 Correct 1544 ms 21984 KB Output is correct
48 Correct 391 ms 18880 KB Output is correct
49 Correct 407 ms 20440 KB Output is correct
50 Correct 243 ms 14436 KB Output is correct
51 Correct 164 ms 15556 KB Output is correct
52 Correct 82 ms 14072 KB Output is correct
53 Correct 635 ms 20988 KB Output is correct
54 Correct 498 ms 16564 KB Output is correct
55 Correct 1289 ms 19784 KB Output is correct
56 Correct 874 ms 17296 KB Output is correct
57 Correct 1066 ms 20608 KB Output is correct
58 Correct 72 ms 15704 KB Output is correct
59 Correct 174 ms 15608 KB Output is correct
60 Correct 345 ms 19664 KB Output is correct
61 Correct 387 ms 20064 KB Output is correct
62 Correct 210 ms 18128 KB Output is correct
63 Correct 127 ms 19460 KB Output is correct
64 Correct 134 ms 21240 KB Output is correct
65 Correct 174 ms 25796 KB Output is correct
66 Correct 239 ms 15992 KB Output is correct
67 Correct 177 ms 22008 KB Output is correct
68 Correct 373 ms 26200 KB Output is correct
69 Correct 132 ms 13816 KB Output is correct
70 Correct 47 ms 12536 KB Output is correct
71 Correct 193 ms 19320 KB Output is correct
72 Correct 262 ms 24788 KB Output is correct
73 Correct 523 ms 29944 KB Output is correct
74 Correct 567 ms 25848 KB Output is correct
75 Correct 433 ms 29432 KB Output is correct
76 Correct 431 ms 27896 KB Output is correct
77 Correct 568 ms 25720 KB Output is correct