oj.uz

Submission #677028

# Submission time Handle Problem Language Result Execution time Memory
677028 2023-01-02T07:01:16 Z faribourz The Xana coup (BOI21_xanadu) C++14
100 / 100
 84 ms 13580 KB 
// Only GOD
// believe in yourself
// nemidam del be in darde donya!
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define bit(x, y) ((x >> y)&1)
#define sz(x) (int)x.size()
#define kill(x) return cout << x << '\n', void()
#define KILL(x) return cout << x << '\n', 0

const int N = 1e5+10;
const int INF = 1e9;
int dp[N][4];
bool f[N];
vector<int> G[N];
void upd1(int v, int p){
	int cnt = 0;
	bool C = 0;
	for(int u : G[v]){
		if(u == p)
			continue;
		C |= (dp[u][0] >= INF && dp[u][2] >= INF);
		if(dp[u][0] < dp[u][2]){
			dp[v][0] += dp[u][0];
		}
		else{
			dp[v][0] += dp[u][2];
			cnt++;
		}
	}
	if(C){
		dp[v][0] = INF;
		dp[v][1] = INF;
		return;
	}
	dp[v][1] = dp[v][0];
	if((f[v] && cnt%2==0) || (!f[v] && cnt % 2)){
		int mn = INF;
		for(int u : G[v]){
			if(u==p)
				continue;
			if(dp[u][0] < INF && dp[u][2] < INF){
				mn = min(mn, abs(dp[u][0] - dp[u][2]));
			}
		}
		if(mn==INF){
			dp[v][0] = INF;
		}
		else{
			dp[v][0] += mn;
		}
	}
	else{
		int mn = INF;
		for(int u : G[v]){
			if(u==p)
				continue;
			if(dp[u][0] < INF && dp[u][2] < INF){
				mn = min(mn, abs(dp[u][0] - dp[u][2]));
			}
		}
		if(mn==INF){
			dp[v][1] = INF;
		}
		else{
			dp[v][1] += mn;
		}
	}
}
void upd2(int v, int p){
	int cnt = 0;
	bool C = 0;
	for(int u : G[v]){
		if(u == p)
			continue;
		C |= (dp[u][1] >= INF && dp[u][3] >= INF);
		if(dp[u][1] < dp[u][3]){
			dp[v][2] += dp[u][1];
		}
		else{
			dp[v][2] += dp[u][3];
			cnt++;
		}
	}
	if(C){
		dp[v][2] = INF;
		dp[v][3] = INF;
		return;
	}
	dp[v][2]++;
	dp[v][3] = dp[v][2];
	if((f[v] && cnt%2==0) || (!f[v] && cnt % 2)){
		int mn = INF;
		for(int u : G[v]){
			if(u==p)
				continue;
			if(dp[u][1] < INF && dp[u][3] < INF){
				mn = min(mn, abs(dp[u][1] - dp[u][3]));
			}
		}
		if(mn==INF){
			dp[v][3] = INF;
		}
		else{
			dp[v][3] += mn;
		}
	}
	else{
		int mn = INF;
		for(int u : G[v]){
			if(u==p)
				continue;
			if(dp[u][1] < INF && dp[u][3] < INF){
				mn = min(mn, abs(dp[u][1] - dp[u][3]));
			}
		}
		if(mn==INF){
			dp[v][2] = INF;
		}
		else{
			dp[v][2] += mn;
		}
	}
}
void DFS(int v, int p = -1){
	if(sz(G[v])==1 && p != -1){
		if(f[v]){
			dp[v][0] = INF, dp[v][1] = 0, dp[v][2] = 1, dp[v][3] = INF;
		}
		else{
			dp[v][0] = 0, dp[v][1] = INF, dp[v][2] = INF, dp[v][3] = 1;
		}
		return;
	}
	for(int u : G[v])if(u != p){
		DFS(u, v);
	}
	upd1(v, p);
	upd2(v, p);
}
int32_t main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n;
	cin >> n;
	for(int i =1;i < n ;i++){
		int v, u;
		cin >> v >> u ;
		G[v].pb(u);
		G[u].pb(v);
	}	
	for(int i = 1; i <= n; i++)
		cin >> f[i];
	DFS(1);
	int mn = min(dp[1][0], dp[1][2]);
	if(mn >= INF)
		KILL("impossible");
	KILL(mn);

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2676 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2676 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2672 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 1 ms 2676 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2676 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 13428 KB Output is correct
2 Correct 44 ms 13304 KB Output is correct
3 Correct 46 ms 13392 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 13432 KB Output is correct
2 Correct 49 ms 13256 KB Output is correct
3 Correct 57 ms 13476 KB Output is correct
4 Correct 43 ms 8072 KB Output is correct
5 Correct 60 ms 7984 KB Output is correct
6 Correct 56 ms 8080 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 16 ms 4688 KB Output is correct
9 Correct 52 ms 8016 KB Output is correct
10 Correct 63 ms 8016 KB Output is correct
11 Correct 80 ms 8316 KB Output is correct
12 Correct 58 ms 8404 KB Output is correct
13 Correct 61 ms 7904 KB Output is correct
14 Correct 50 ms 8080 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2676 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2672 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 1 ms 2676 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2676 KB Output is correct
17 Correct 55 ms 13428 KB Output is correct
18 Correct 44 ms 13304 KB Output is correct
19 Correct 46 ms 13392 KB Output is correct
20 Correct 51 ms 13432 KB Output is correct
21 Correct 49 ms 13256 KB Output is correct
22 Correct 57 ms 13476 KB Output is correct
23 Correct 43 ms 8072 KB Output is correct
24 Correct 60 ms 7984 KB Output is correct
25 Correct 56 ms 8080 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 16 ms 4688 KB Output is correct
28 Correct 52 ms 8016 KB Output is correct
29 Correct 63 ms 8016 KB Output is correct
30 Correct 80 ms 8316 KB Output is correct
31 Correct 58 ms 8404 KB Output is correct
32 Correct 61 ms 7904 KB Output is correct
33 Correct 50 ms 8080 KB Output is correct
34 Correct 1 ms 2676 KB Output is correct
35 Correct 2 ms 2680 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 1 ms 2680 KB Output is correct
39 Correct 1 ms 2668 KB Output is correct
40 Correct 2 ms 2676 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2676 KB Output is correct
44 Correct 1 ms 2644 KB Output is correct
45 Correct 58 ms 13396 KB Output is correct
46 Correct 52 ms 13232 KB Output is correct
47 Correct 46 ms 13580 KB Output is correct
48 Correct 43 ms 8140 KB Output is correct
49 Correct 47 ms 8672 KB Output is correct
50 Correct 50 ms 8716 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 15 ms 4620 KB Output is correct
53 Correct 55 ms 8652 KB Output is correct
54 Correct 50 ms 8804 KB Output is correct
55 Correct 71 ms 8964 KB Output is correct
56 Correct 84 ms 9192 KB Output is correct
57 Correct 44 ms 8308 KB Output is correct
58 Correct 46 ms 8736 KB Output is correct
59 Correct 16 ms 4712 KB Output is correct
60 Correct 51 ms 8192 KB Output is correct
61 Correct 49 ms 8688 KB Output is correct
62 Correct 58 ms 8840 KB Output is correct
63 Correct 53 ms 8908 KB Output is correct
64 Correct 53 ms 8812 KB Output is correct
65 Correct 38 ms 9336 KB Output is correct
66 Correct 38 ms 9296 KB Output is correct
67 Correct 47 ms 9136 KB Output is correct
68 Correct 37 ms 9164 KB Output is correct
69 Correct 36 ms 9176 KB Output is correct
70 Correct 40 ms 9200 KB Output is correct