oj.uz

Submission #634658

# Submission time Handle Problem Language Result Execution time Memory
634658 2022-08-24T16:34:05 Z PoPularPlusPlus Power Plant (JOI20_power) C++17
100 / 100
 170 ms 22620 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

const int N = 200003;

vector<int> adj[N];
string s;
int ans;

int dfs(int node , int par){
	if(s[node-1] == '0'){
		int sum = 0;
		for(int i : adj[node]){
			if(i!=par){
				sum += dfs(i,node);
			}
		}
		return sum;
	}
	int mx = 0;
	int sum = 0;
	for(int i : adj[node]){
		if(i != par){
		   int x = dfs(i , node);
		   mx = max(mx , x);
		   sum += x;
		}
	}
	ans = max(ans , mx + 1);
	return max(1 , sum - 1);
}

void solve(){
	int n;
	cin >> n;
	for(int i = 0; i < n-1; i++){
		int a , b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	cin >> s;
	ans = 0;
	ans = max(ans , dfs(1,1));
	cout << ans << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4996 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4996 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 5 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 4 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 ms 4976 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 5 ms 5028 KB Output is correct
46 Correct 4 ms 5064 KB Output is correct
47 Correct 5 ms 5076 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 5 ms 5076 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 5 ms 5076 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 5 ms 5112 KB Output is correct
54 Correct 4 ms 5076 KB Output is correct
55 Correct 4 ms 5076 KB Output is correct
56 Correct 3 ms 5076 KB Output is correct
57 Correct 3 ms 5076 KB Output is correct
58 Correct 3 ms 5076 KB Output is correct
59 Correct 3 ms 5076 KB Output is correct
60 Correct 3 ms 5076 KB Output is correct
61 Correct 3 ms 5076 KB Output is correct
62 Correct 4 ms 5080 KB Output is correct
63 Correct 3 ms 5076 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4996 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 5 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 4 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 ms 4976 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 5 ms 5028 KB Output is correct
46 Correct 4 ms 5064 KB Output is correct
47 Correct 5 ms 5076 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 5 ms 5076 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 5 ms 5076 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 5 ms 5112 KB Output is correct
54 Correct 4 ms 5076 KB Output is correct
55 Correct 4 ms 5076 KB Output is correct
56 Correct 3 ms 5076 KB Output is correct
57 Correct 3 ms 5076 KB Output is correct
58 Correct 3 ms 5076 KB Output is correct
59 Correct 3 ms 5076 KB Output is correct
60 Correct 3 ms 5076 KB Output is correct
61 Correct 3 ms 5076 KB Output is correct
62 Correct 4 ms 5080 KB Output is correct
63 Correct 3 ms 5076 KB Output is correct
64 Correct 141 ms 11756 KB Output is correct
65 Correct 122 ms 11740 KB Output is correct
66 Correct 111 ms 11756 KB Output is correct
67 Correct 127 ms 11820 KB Output is correct
68 Correct 106 ms 11804 KB Output is correct
69 Correct 126 ms 11744 KB Output is correct
70 Correct 98 ms 11736 KB Output is correct
71 Correct 102 ms 11796 KB Output is correct
72 Correct 107 ms 11828 KB Output is correct
73 Correct 159 ms 21724 KB Output is correct
74 Correct 145 ms 21640 KB Output is correct
75 Correct 102 ms 11660 KB Output is correct
76 Correct 120 ms 11712 KB Output is correct
77 Correct 123 ms 11692 KB Output is correct
78 Correct 111 ms 11724 KB Output is correct
79 Correct 100 ms 11712 KB Output is correct
80 Correct 110 ms 11812 KB Output is correct
81 Correct 98 ms 12052 KB Output is correct
82 Correct 148 ms 11836 KB Output is correct
83 Correct 161 ms 15720 KB Output is correct
84 Correct 120 ms 17476 KB Output is correct
85 Correct 112 ms 17212 KB Output is correct
86 Correct 146 ms 12660 KB Output is correct
87 Correct 105 ms 12276 KB Output is correct
88 Correct 101 ms 12748 KB Output is correct
89 Correct 100 ms 12820 KB Output is correct
90 Correct 123 ms 12576 KB Output is correct
91 Correct 123 ms 12780 KB Output is correct
92 Correct 101 ms 12964 KB Output is correct
93 Correct 111 ms 14916 KB Output is correct
94 Correct 115 ms 16528 KB Output is correct
95 Correct 119 ms 15168 KB Output is correct
96 Correct 105 ms 13744 KB Output is correct
97 Correct 104 ms 12600 KB Output is correct
98 Correct 122 ms 12260 KB Output is correct
99 Correct 122 ms 12080 KB Output is correct
100 Correct 125 ms 14584 KB Output is correct
101 Correct 115 ms 12848 KB Output is correct
102 Correct 117 ms 12372 KB Output is correct
103 Correct 104 ms 12224 KB Output is correct
104 Correct 62 ms 12344 KB Output is correct
105 Correct 139 ms 19196 KB Output is correct
106 Correct 60 ms 12428 KB Output is correct
107 Correct 61 ms 12436 KB Output is correct
108 Correct 124 ms 22348 KB Output is correct
109 Correct 62 ms 12416 KB Output is correct
110 Correct 170 ms 22620 KB Output is correct
111 Correct 132 ms 11636 KB Output is correct