oj.uz

답안 #153725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153725 2019-09-15T14:15:49 Z tutis Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 12132 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)
{
	C[v] = D[v] = 0;
	for (int w : adj[v])
	{
		C[v] += min(C[w], D[w] + 1);
		D[v] += min(D[w], C[w] + 1);
	}
	if (V[v] == -1)
	{
		D[v] = 101010;
	}
	if (V[v] == 1)
	{
		C[v] = 101010;
	}
	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

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

Subtask #2
30.0 / 30.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2808 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 5 ms 2680 KB Output is correct
7 Correct 4 ms 2652 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 5 ms 2680 KB Output is correct
12 Correct 4 ms 2808 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 4 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 2680 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 2784 KB Output is correct
25 Correct 5 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 4 ms 2680 KB Output is correct
28 Correct 5 ms 2808 KB Output is correct
29 Correct 7 ms 2852 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 288 ms 7888 KB Output is correct
34 Correct 115 ms 7404 KB Output is correct
35 Correct 379 ms 6948 KB Output is correct
36 Correct 500 ms 11116 KB Output is correct
37 Correct 22 ms 4984 KB Output is correct
38 Correct 523 ms 11968 KB Output is correct
39 Correct 539 ms 11980 KB Output is correct
40 Correct 642 ms 11924 KB Output is correct
41 Correct 604 ms 11912 KB Output is correct
42 Correct 789 ms 11916 KB Output is correct
43 Correct 625 ms 12132 KB Output is correct
44 Correct 740 ms 11904 KB Output is correct
45 Correct 935 ms 11908 KB Output is correct
46 Correct 629 ms 11880 KB Output is correct
47 Correct 537 ms 11908 KB Output is correct
48 Execution timed out 3005 ms 9100 KB Time limit exceeded
49 Halted 0 ms 0 KB -