oj.uz

답안 #153740

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153740 2019-09-15T17:26:53 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
*/
#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)
{
	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, 0);
}
void recalc(int v)
{
	int c = C[v];
	int d = D[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 && (C[v] != c || D[v] != d))
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 4 ms 2684 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 2680 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 4 ms 2684 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 2680 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 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 4 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 4 ms 2808 KB Output is correct
27 Correct 4 ms 2680 KB Output is correct
28 Correct 5 ms 2808 KB Output is correct
29 Correct 5 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 2680 KB Output is correct

Subtask #3
0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 4 ms 2684 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 2680 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 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 4 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 4 ms 2808 KB Output is correct
27 Correct 4 ms 2680 KB Output is correct
28 Correct 5 ms 2808 KB Output is correct
29 Correct 5 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 2680 KB Output is correct
33 Correct 104 ms 7116 KB Output is correct
34 Correct 69 ms 7036 KB Output is correct
35 Correct 120 ms 6128 KB Output is correct
36 Correct 186 ms 10040 KB Output is correct
37 Correct 21 ms 4856 KB Output is correct
38 Correct 192 ms 10856 KB Output is correct
39 Correct 185 ms 10728 KB Output is correct
40 Correct 206 ms 10728 KB Output is correct
41 Correct 204 ms 10712 KB Output is correct
42 Correct 218 ms 10728 KB Output is correct
43 Correct 208 ms 10816 KB Output is correct
44 Correct 252 ms 10776 KB Output is correct
45 Correct 282 ms 10728 KB Output is correct
46 Correct 217 ms 10812 KB Output is correct
47 Correct 191 ms 10808 KB Output is correct
48 Correct 65 ms 8128 KB Output is correct
49 Correct 75 ms 9248 KB Output is correct
50 Correct 28 ms 4344 KB Output is correct
51 Correct 33 ms 5312 KB Output is correct
52 Correct 18 ms 4092 KB Output is correct
53 Correct 116 ms 9556 KB Output is correct
54 Correct 66 ms 6060 KB Output is correct
55 Correct 164 ms 8524 KB Output is correct
56 Correct 102 ms 6620 KB Output is correct
57 Correct 178 ms 9528 KB Output is correct
58 Correct 28 ms 5292 KB Output is correct
59 Correct 35 ms 5368 KB Output is correct
60 Correct 69 ms 8568 KB Output is correct
61 Correct 76 ms 8928 KB Output is correct
62 Correct 50 ms 7376 KB Output is correct
63 Execution timed out 3012 ms 7612 KB Time limit exceeded
64 Halted 0 ms 0 KB -