Submission #411456

# Submission time Handle Problem Language Result Execution time Memory
411456 2021-05-25T11:17:27 Z 송준혁(#7512) The Xana coup (BOI21_xanadu) C++17
100 / 100
98 ms 18464 KB
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define MOD 1000000007
#define INF (1ll<<62)
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

int N;
int A[101010];
int D[101010][2][2];
vector<int> adj[101010];

void f(int u, int p){
	int co=N+1, ce=0;
	int lo=N+1, le=0, t;
	for (int v : adj[u]){
		if (v == p) continue;
		f(v, u);
		t = lo;
		lo = min(lo + D[v][0][0], le + D[v][0][1]);
		le = min(t + D[v][0][1], le + D[v][0][0]);
		t = co;
		co = min(co + D[v][1][0], ce + D[v][1][1]);
		ce = min(t + D[v][1][1], ce + D[v][1][0]);
	}
	D[u][!A[u]][0] = lo, D[u][A[u]][0] = le;
	D[u][A[u]][1] = co+1, D[u][!A[u]][1] = ce+1;
}

int main(){
	scanf("%d", &N);
	for (int i=1; i<N; i++){
		int u, v;
		scanf("%d %d", &u, &v);
		adj[u].pb(v), adj[v].pb(u);
	}
	for (int i=1; i<=N; i++) scanf("%d", &A[i]);
	f(1, 0);
	if (min(D[1][0][0], D[1][0][1]) > N) puts("impossible");
	else printf("%d\n", min(D[1][0][0], D[1][0][1]));
	return 0;
}

Compilation message

xanadu.cpp: In function 'int main()':
xanadu.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
xanadu.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~
xanadu.cpp:41:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  for (int i=1; i<=N; i++) scanf("%d", &A[i]);
      |                           ~~~~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 2676 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2672 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 2676 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2672 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2680 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 3 ms 2676 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 3 ms 2672 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2676 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 76 ms 18356 KB Output is correct
2 Correct 90 ms 18140 KB Output is correct
3 Correct 68 ms 18352 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 71 ms 18396 KB Output is correct
2 Correct 76 ms 18144 KB Output is correct
3 Correct 79 ms 18464 KB Output is correct
4 Correct 67 ms 8320 KB Output is correct
5 Correct 89 ms 8964 KB Output is correct
6 Correct 75 ms 9080 KB Output is correct
7 Correct 3 ms 2684 KB Output is correct
8 Correct 21 ms 4756 KB Output is correct
9 Correct 77 ms 8968 KB Output is correct
10 Correct 84 ms 9304 KB Output is correct
11 Correct 96 ms 9700 KB Output is correct
12 Correct 73 ms 9924 KB Output is correct
13 Correct 80 ms 8656 KB Output is correct
14 Correct 89 ms 9052 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 2676 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2672 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2680 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 3 ms 2676 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 3 ms 2672 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2676 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 76 ms 18356 KB Output is correct
18 Correct 90 ms 18140 KB Output is correct
19 Correct 68 ms 18352 KB Output is correct
20 Correct 71 ms 18396 KB Output is correct
21 Correct 76 ms 18144 KB Output is correct
22 Correct 79 ms 18464 KB Output is correct
23 Correct 67 ms 8320 KB Output is correct
24 Correct 89 ms 8964 KB Output is correct
25 Correct 75 ms 9080 KB Output is correct
26 Correct 3 ms 2684 KB Output is correct
27 Correct 21 ms 4756 KB Output is correct
28 Correct 77 ms 8968 KB Output is correct
29 Correct 84 ms 9304 KB Output is correct
30 Correct 96 ms 9700 KB Output is correct
31 Correct 73 ms 9924 KB Output is correct
32 Correct 80 ms 8656 KB Output is correct
33 Correct 89 ms 9052 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2676 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 3 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 3 ms 2636 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 2 ms 2636 KB Output is correct
43 Correct 2 ms 2676 KB Output is correct
44 Correct 3 ms 2672 KB Output is correct
45 Correct 68 ms 18276 KB Output is correct
46 Correct 92 ms 18116 KB Output is correct
47 Correct 73 ms 18400 KB Output is correct
48 Correct 62 ms 8372 KB Output is correct
49 Correct 78 ms 8852 KB Output is correct
50 Correct 84 ms 9052 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 30 ms 4812 KB Output is correct
53 Correct 88 ms 9028 KB Output is correct
54 Correct 72 ms 9096 KB Output is correct
55 Correct 98 ms 9672 KB Output is correct
56 Correct 86 ms 9892 KB Output is correct
57 Correct 76 ms 8724 KB Output is correct
58 Correct 71 ms 9060 KB Output is correct
59 Correct 21 ms 4784 KB Output is correct
60 Correct 62 ms 8472 KB Output is correct
61 Correct 70 ms 9028 KB Output is correct
62 Correct 68 ms 9080 KB Output is correct
63 Correct 79 ms 9208 KB Output is correct
64 Correct 72 ms 9172 KB Output is correct
65 Correct 61 ms 9540 KB Output is correct
66 Correct 77 ms 9632 KB Output is correct
67 Correct 53 ms 9404 KB Output is correct
68 Correct 54 ms 9460 KB Output is correct
69 Correct 79 ms 9404 KB Output is correct
70 Correct 57 ms 9412 KB Output is correct