Submission #153747

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
153747	2019-09-15T18:29:11 Z	tutis	Cats or Dogs (JOI18_catdog)	C++17	38 / 100	3000 ms	12804 KB

catdog

/*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;
int C[101010], D[101010], Sc[101010], Sd[101010], V[101010];
vector<int>adj[101010];
int pa[101010];
void dfs(int i, int p)
{
	pa[i] = p;
	for (int j : adj[i])
	{
		if (j != p)
			dfs(j, i);
	}
}
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);
}
void recalc(int v)
{
	Sc[pa[v]] -= C[v];
	Sd[pa[v]] -= D[v];
	C[v] = Sc[v];
	D[v] = Sd[v];
	if (V[v] == -1)
		D[v] = C[v] + 1;
	if (V[v] == 1)
		C[v] = D[v] + 1;
	C[v] = min(C[v], D[v] + 1);
	D[v] = min(D[v], C[v] + 1);
	Sc[pa[v]] += C[v];
	Sd[pa[v]] += D[v];
	if (v != 1)
		recalc(pa[v]);
}
int cat(int v)
{
	V[v] = -1;
	recalc(v);
	return min(C[1], D[1]);
}
int dog(int v)
{
	V[v] = 1;
	recalc(v);
	return min(C[1], D[1]);
}
int neighbor(int v)
{
	V[v] = 0;
	recalc(v);
	return min(C[1], D[1]);
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2680 KB	Output is correct
2	Correct	11 ms	2680 KB	Output is correct
3	Correct	5 ms	2680 KB	Output is correct
4	Correct	4 ms	2680 KB	Output is correct
5	Correct	4 ms	2680 KB	Output is correct
6	Correct	4 ms	2680 KB	Output is correct
7	Correct	4 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	4 ms	2680 KB	Output is correct
12	Correct	4 ms	2680 KB	Output is correct
13	Correct	4 ms	2680 KB	Output is correct
14	Correct	5 ms	2808 KB	Output is correct
15	Correct	4 ms	2680 KB	Output is correct
16	Correct	4 ms	2680 KB	Output is correct

Subtask #2

30.0 / 30.0

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

Subtask #3

0 / 62.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2680 KB	Output is correct
2	Correct	11 ms	2680 KB	Output is correct
3	Correct	5 ms	2680 KB	Output is correct
4	Correct	4 ms	2680 KB	Output is correct
5	Correct	4 ms	2680 KB	Output is correct
6	Correct	4 ms	2680 KB	Output is correct
7	Correct	4 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	4 ms	2680 KB	Output is correct
12	Correct	4 ms	2680 KB	Output is correct
13	Correct	4 ms	2680 KB	Output is correct
14	Correct	5 ms	2808 KB	Output is correct
15	Correct	4 ms	2680 KB	Output is correct
16	Correct	4 ms	2680 KB	Output is correct
17	Correct	5 ms	2808 KB	Output is correct
18	Correct	4 ms	2808 KB	Output is correct
19	Correct	5 ms	2808 KB	Output is correct
20	Correct	5 ms	2808 KB	Output is correct
21	Correct	5 ms	2808 KB	Output is correct
22	Correct	5 ms	2808 KB	Output is correct
23	Correct	5 ms	2808 KB	Output is correct
24	Correct	5 ms	2808 KB	Output is correct
25	Correct	5 ms	2808 KB	Output is correct
26	Correct	5 ms	2680 KB	Output is correct
27	Correct	5 ms	2808 KB	Output is correct
28	Correct	5 ms	2780 KB	Output is correct
29	Correct	7 ms	2808 KB	Output is correct
30	Correct	5 ms	2780 KB	Output is correct
31	Correct	5 ms	2808 KB	Output is correct
32	Correct	5 ms	2808 KB	Output is correct
33	Correct	158 ms	8192 KB	Output is correct
34	Correct	81 ms	8164 KB	Output is correct
35	Correct	213 ms	7232 KB	Output is correct
36	Correct	275 ms	11840 KB	Output is correct
37	Correct	22 ms	5240 KB	Output is correct
38	Correct	287 ms	12720 KB	Output is correct
39	Correct	290 ms	12804 KB	Output is correct
40	Correct	347 ms	12776 KB	Output is correct
41	Correct	316 ms	12720 KB	Output is correct
42	Correct	400 ms	12800 KB	Output is correct
43	Correct	321 ms	12688 KB	Output is correct
44	Correct	367 ms	12772 KB	Output is correct
45	Correct	473 ms	12768 KB	Output is correct
46	Correct	331 ms	12776 KB	Output is correct
47	Correct	286 ms	12716 KB	Output is correct
48	Correct	63 ms	9408 KB	Output is correct
49	Correct	72 ms	10912 KB	Output is correct
50	Correct	24 ms	4856 KB	Output is correct
51	Correct	32 ms	5980 KB	Output is correct
52	Correct	17 ms	4344 KB	Output is correct
53	Correct	159 ms	10964 KB	Output is correct
54	Correct	98 ms	6704 KB	Output is correct
55	Correct	261 ms	10096 KB	Output is correct
56	Correct	160 ms	7584 KB	Output is correct
57	Correct	237 ms	11092 KB	Output is correct
58	Correct	25 ms	5932 KB	Output is correct
59	Correct	31 ms	5852 KB	Output is correct
60	Correct	68 ms	10104 KB	Output is correct
61	Correct	74 ms	10516 KB	Output is correct
62	Correct	51 ms	8528 KB	Output is correct
63	Execution timed out	3055 ms	7752 KB	Time limit exceeded
64	Halted	0 ms	0 KB	-