oj.uz

Submission #153757

# Submission time Handle Problem Language Result Execution time Memory
153757 2019-09-15T20:13:08 Z tutis Cats or Dogs (JOI18_catdog) C++17
100 / 100
 2481 ms 36472 KB 
/*input
3
1 2 1
2 3 1
3 1 2
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 101010;
vector<ll>adj[maxn];
ll pa[maxn], sz[maxn];
void dfs(ll i, ll p)
{
	if (p != 0)
		adj[i].erase(find(adj[i].begin(), adj[i].end(), p));
	pa[i] = p;
	sz[i] = 1;
	pair<ll, ll>mx = { -1, -1};
	for (ll t = 0; t < (ll)adj[i].size(); t++)
	{
		ll 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]);
}
ll timer = 1;
ll nr[maxn], head[maxn], tail[maxn];
void hld(ll i, ll h)
{
	nr[i] = timer++;
	head[i] = h;
	tail[h] = i;
	for (ll t = 0; t < (ll)adj[i].size(); t++)
	{
		ll j = adj[i][t];
		hld(j, t == 0 ? h : j);
	}
}
struct line
{
	ll 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;
	ll l, r;
	ST *left, *right;
	ST(ll l, ll 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(ll x, ll 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(ll x, ll 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);
}
ll C[maxn], D[maxn], V[maxn];
void fix(ll v)
{
	while (true)
	{
		ll 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], maxn, 0);
		medis.set(nr[v], maxn, 1);
		if (V[v] != 1)
			medis.set(nr[v], C[v], 1);
		if (V[v] != -1)
			medis.set(nr[v], 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 24 ms 18552 KB Output is correct
2 Correct 24 ms 18552 KB Output is correct
3 Correct 24 ms 18552 KB Output is correct
4 Correct 24 ms 18552 KB Output is correct
5 Correct 24 ms 18552 KB Output is correct
6 Correct 24 ms 18552 KB Output is correct
7 Correct 24 ms 18552 KB Output is correct
8 Correct 24 ms 18552 KB Output is correct
9 Correct 24 ms 18552 KB Output is correct
10 Correct 24 ms 18552 KB Output is correct
11 Correct 24 ms 18552 KB Output is correct
12 Correct 28 ms 18552 KB Output is correct
13 Correct 28 ms 18552 KB Output is correct
14 Correct 24 ms 18552 KB Output is correct
15 Correct 24 ms 18552 KB Output is correct
16 Correct 25 ms 18552 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 18552 KB Output is correct
2 Correct 24 ms 18552 KB Output is correct
3 Correct 24 ms 18552 KB Output is correct
4 Correct 24 ms 18552 KB Output is correct
5 Correct 24 ms 18552 KB Output is correct
6 Correct 24 ms 18552 KB Output is correct
7 Correct 24 ms 18552 KB Output is correct
8 Correct 24 ms 18552 KB Output is correct
9 Correct 24 ms 18552 KB Output is correct
10 Correct 24 ms 18552 KB Output is correct
11 Correct 24 ms 18552 KB Output is correct
12 Correct 28 ms 18552 KB Output is correct
13 Correct 28 ms 18552 KB Output is correct
14 Correct 24 ms 18552 KB Output is correct
15 Correct 24 ms 18552 KB Output is correct
16 Correct 25 ms 18552 KB Output is correct
17 Correct 31 ms 18700 KB Output is correct
18 Correct 32 ms 18680 KB Output is correct
19 Correct 27 ms 18680 KB Output is correct
20 Correct 24 ms 18552 KB Output is correct
21 Correct 27 ms 18552 KB Output is correct
22 Correct 30 ms 18552 KB Output is correct
23 Correct 34 ms 18680 KB Output is correct
24 Correct 36 ms 18680 KB Output is correct
25 Correct 30 ms 18552 KB Output is correct
26 Correct 27 ms 18552 KB Output is correct
27 Correct 26 ms 18552 KB Output is correct
28 Correct 28 ms 18680 KB Output is correct
29 Correct 29 ms 18680 KB Output is correct
30 Correct 31 ms 18552 KB Output is correct
31 Correct 25 ms 18680 KB Output is correct
32 Correct 29 ms 18624 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 18552 KB Output is correct
2 Correct 24 ms 18552 KB Output is correct
3 Correct 24 ms 18552 KB Output is correct
4 Correct 24 ms 18552 KB Output is correct
5 Correct 24 ms 18552 KB Output is correct
6 Correct 24 ms 18552 KB Output is correct
7 Correct 24 ms 18552 KB Output is correct
8 Correct 24 ms 18552 KB Output is correct
9 Correct 24 ms 18552 KB Output is correct
10 Correct 24 ms 18552 KB Output is correct
11 Correct 24 ms 18552 KB Output is correct
12 Correct 28 ms 18552 KB Output is correct
13 Correct 28 ms 18552 KB Output is correct
14 Correct 24 ms 18552 KB Output is correct
15 Correct 24 ms 18552 KB Output is correct
16 Correct 25 ms 18552 KB Output is correct
17 Correct 31 ms 18700 KB Output is correct
18 Correct 32 ms 18680 KB Output is correct
19 Correct 27 ms 18680 KB Output is correct
20 Correct 24 ms 18552 KB Output is correct
21 Correct 27 ms 18552 KB Output is correct
22 Correct 30 ms 18552 KB Output is correct
23 Correct 34 ms 18680 KB Output is correct
24 Correct 36 ms 18680 KB Output is correct
25 Correct 30 ms 18552 KB Output is correct
26 Correct 27 ms 18552 KB Output is correct
27 Correct 26 ms 18552 KB Output is correct
28 Correct 28 ms 18680 KB Output is correct
29 Correct 29 ms 18680 KB Output is correct
30 Correct 31 ms 18552 KB Output is correct
31 Correct 25 ms 18680 KB Output is correct
32 Correct 29 ms 18624 KB Output is correct
33 Correct 1487 ms 26188 KB Output is correct
34 Correct 399 ms 26616 KB Output is correct
35 Correct 1395 ms 24532 KB Output is correct
36 Correct 2168 ms 30752 KB Output is correct
37 Correct 49 ms 22392 KB Output is correct
38 Correct 2445 ms 32148 KB Output is correct
39 Correct 2384 ms 32148 KB Output is correct
40 Correct 2327 ms 32156 KB Output is correct
41 Correct 2481 ms 32164 KB Output is correct
42 Correct 2239 ms 32168 KB Output is correct
43 Correct 2368 ms 32196 KB Output is correct
44 Correct 2126 ms 32052 KB Output is correct
45 Correct 2274 ms 32164 KB Output is correct
46 Correct 2246 ms 32156 KB Output is correct
47 Correct 2332 ms 32152 KB Output is correct
48 Correct 541 ms 27388 KB Output is correct
49 Correct 541 ms 29280 KB Output is correct
50 Correct 236 ms 21200 KB Output is correct
51 Correct 242 ms 23052 KB Output is correct
52 Correct 111 ms 20980 KB Output is correct
53 Correct 929 ms 30808 KB Output is correct
54 Correct 788 ms 24360 KB Output is correct
55 Correct 2001 ms 28296 KB Output is correct
56 Correct 1320 ms 25304 KB Output is correct
57 Correct 1704 ms 29004 KB Output is correct
58 Correct 98 ms 22824 KB Output is correct
59 Correct 247 ms 22140 KB Output is correct
60 Correct 480 ms 27204 KB Output is correct
61 Correct 525 ms 27588 KB Output is correct
62 Correct 291 ms 25676 KB Output is correct
63 Correct 147 ms 25976 KB Output is correct
64 Correct 164 ms 27876 KB Output is correct
65 Correct 174 ms 32964 KB Output is correct
66 Correct 329 ms 22140 KB Output is correct
67 Correct 227 ms 28664 KB Output is correct
68 Correct 494 ms 32888 KB Output is correct
69 Correct 182 ms 19960 KB Output is correct
70 Correct 67 ms 18808 KB Output is correct
71 Correct 265 ms 25464 KB Output is correct
72 Correct 313 ms 31268 KB Output is correct
73 Correct 760 ms 36472 KB Output is correct
74 Correct 784 ms 32168 KB Output is correct
75 Correct 571 ms 36380 KB Output is correct
76 Correct 567 ms 34856 KB Output is correct
77 Correct 779 ms 32540 KB Output is correct