oj.uz

Submission #153727

# Submission time Handle Problem Language Result Execution time Memory
153727 2019-09-15T14:21:03 Z tutis Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 11976 KB 
/*input
3
1 2 1
2 3 1
3 1 2
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int V[101010], C[101010], D[101010];
vector<int>adj[101010];
int pa[101010];
void dfs(int i, int p)
{
	auto it = find(adj[i].begin(), adj[i].end(), p);
	if (it != adj[i].end())
		adj[i].erase(it);
	pa[i] = p;
	for (int j : adj[i])
	{
		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, 1);
}
void recalc(int v)
{
	int C_ = C[v];
	int D_ = D[v];
	C[v] = D[v] = 0;
	for (int w : adj[v])
	{
		C[v] += C[w];
		D[v] += D[w];
	}
	if (V[v] == -1)
	{
		D[v] = 101010;
	}
	if (V[v] == 1)
	{
		C[v] = 101010;
	}
	C[v] = min(C[v], D[v] + 1);
	D[v] = min(D[v], C[v] + 1);
	if (v != 1 && (C_ != C[v] || D_ != D[v]))
		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 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 2684 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 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2724 KB Output is correct
16 Correct 5 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 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 2684 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 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2724 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 5 ms 2812 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 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 4 ms 2680 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 4 ms 2680 KB Output is correct
27 Correct 5 ms 2680 KB Output is correct
28 Correct 5 ms 2780 KB Output is correct
29 Correct 6 ms 2808 KB Output is correct
30 Correct 5 ms 2680 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 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 2684 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 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2724 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 5 ms 2812 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 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 4 ms 2680 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 4 ms 2680 KB Output is correct
27 Correct 5 ms 2680 KB Output is correct
28 Correct 5 ms 2780 KB Output is correct
29 Correct 6 ms 2808 KB Output is correct
30 Correct 5 ms 2680 KB Output is correct
31 Correct 5 ms 2808 KB Output is correct
32 Correct 5 ms 2808 KB Output is correct
33 Correct 147 ms 7880 KB Output is correct
34 Correct 74 ms 7508 KB Output is correct
35 Correct 185 ms 6892 KB Output is correct
36 Correct 265 ms 11068 KB Output is correct
37 Correct 22 ms 4984 KB Output is correct
38 Correct 279 ms 11888 KB Output is correct
39 Correct 276 ms 11912 KB Output is correct
40 Correct 325 ms 11752 KB Output is correct
41 Correct 306 ms 11876 KB Output is correct
42 Correct 374 ms 11884 KB Output is correct
43 Correct 302 ms 11832 KB Output is correct
44 Correct 331 ms 11784 KB Output is correct
45 Correct 415 ms 11876 KB Output is correct
46 Correct 306 ms 11908 KB Output is correct
47 Correct 275 ms 11976 KB Output is correct
48 Execution timed out 3028 ms 9092 KB Time limit exceeded
49 Halted 0 ms 0 KB -