oj.uz

Submission #153746

# Submission time Handle Problem Language Result Execution time Memory
153746 2019-09-15T17:57:50 Z tutis Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 10856 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;
int V[101010], C[101010], D[101010];
int Sc[101010], Sd[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);
}
int ans = 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 ans + min(C[1], D[1]);
}
int dog(int v)
{
	V[v] = 1;
	recalc(v);
	return ans + min(C[1], D[1]);
}
int neighbor(int v)
{
	V[v] = 0;
	recalc(v);
	return ans + min(C[1], D[1]);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 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 4 ms 2684 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 5 ms 2684 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 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 4 ms 2684 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 5 ms 2684 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2808 KB Output is correct
20 Correct 4 ms 2808 KB Output is correct
21 Correct 4 ms 2808 KB Output is correct
22 Correct 5 ms 2780 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 2680 KB Output is correct
26 Correct 6 ms 2728 KB Output is correct
27 Correct 6 ms 2680 KB Output is correct
28 Correct 5 ms 2812 KB Output is correct
29 Correct 7 ms 2808 KB Output is correct
30 Correct 4 ms 2684 KB Output is correct
31 Correct 4 ms 2812 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 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 4 ms 2684 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 5 ms 2684 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2808 KB Output is correct
20 Correct 4 ms 2808 KB Output is correct
21 Correct 4 ms 2808 KB Output is correct
22 Correct 5 ms 2780 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 2680 KB Output is correct
26 Correct 6 ms 2728 KB Output is correct
27 Correct 6 ms 2680 KB Output is correct
28 Correct 5 ms 2812 KB Output is correct
29 Correct 7 ms 2808 KB Output is correct
30 Correct 4 ms 2684 KB Output is correct
31 Correct 4 ms 2812 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct
33 Correct 159 ms 7116 KB Output is correct
34 Correct 79 ms 7036 KB Output is correct
35 Correct 216 ms 6256 KB Output is correct
36 Correct 276 ms 10044 KB Output is correct
37 Correct 22 ms 4856 KB Output is correct
38 Correct 285 ms 10764 KB Output is correct
39 Correct 298 ms 10800 KB Output is correct
40 Correct 361 ms 10804 KB Output is correct
41 Correct 344 ms 10792 KB Output is correct
42 Correct 409 ms 10784 KB Output is correct
43 Correct 326 ms 10792 KB Output is correct
44 Correct 363 ms 10728 KB Output is correct
45 Correct 503 ms 10700 KB Output is correct
46 Correct 341 ms 10728 KB Output is correct
47 Correct 287 ms 10856 KB Output is correct
48 Correct 64 ms 8136 KB Output is correct
49 Correct 74 ms 9248 KB Output is correct
50 Correct 24 ms 4348 KB Output is correct
51 Correct 32 ms 5340 KB Output is correct
52 Correct 19 ms 4092 KB Output is correct
53 Correct 160 ms 9708 KB Output is correct
54 Correct 96 ms 6064 KB Output is correct
55 Correct 255 ms 8532 KB Output is correct
56 Correct 155 ms 6560 KB Output is correct
57 Correct 240 ms 9524 KB Output is correct
58 Correct 25 ms 5292 KB Output is correct
59 Correct 31 ms 5240 KB Output is correct
60 Correct 69 ms 8572 KB Output is correct
61 Correct 74 ms 8928 KB Output is correct
62 Correct 50 ms 7376 KB Output is correct
63 Execution timed out 3043 ms 7112 KB Time limit exceeded
64 Halted 0 ms 0 KB -