oj.uz

Submission #438657

# Submission time Handle Problem Language Result Execution time Memory
438657 2021-06-28T11:34:51 Z soroush Power Plant (JOI20_power) C++17
47 / 100
 1500 ms 14436 KB 
#include <bits/stdc++.h>

using namespace std;

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

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e5 + 10;
const ll mod = 1e9+7;

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n;
string s;
vector < int > adj[maxn];

int dfs(int v , int par){
	int res = 0;
	for(int u : adj[v])if(u ^ par)
		res += dfs(u , v);
	if(s[v] == '1')
		res = max(res - 1 , 1);
	return res;
}

int solve(int v){
	int res = 0;
	for(auto u : adj[v])
		res = max(res , dfs(u , v));
	return res + 1;
}

int32_t main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin >> n;
	for(int i = 1 ; i < n ; i ++){
		int u , v;
		cin >> u >> v;
		u -- , v --;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	cin >> s;
	int ans = 0;
	for(int i = 0 ; i < n ; i ++)if(s[i] == '1')
		ans = max(ans , solve(i));
	cout << ans;
	return(0);
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 4 ms 4940 KB Output is correct
6 Correct 4 ms 5016 KB Output is correct
7 Correct 4 ms 4920 KB Output is correct
8 Correct 5 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 5 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4904 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4956 KB Output is correct
20 Correct 4 ms 5020 KB Output is correct
21 Correct 4 ms 4940 KB Output is correct
22 Correct 71 ms 5076 KB Output is correct
23 Correct 67 ms 5080 KB Output is correct
24 Correct 56 ms 5068 KB Output is correct
25 Correct 43 ms 5068 KB Output is correct
26 Correct 21 ms 5108 KB Output is correct
27 Correct 12 ms 5028 KB Output is correct
28 Correct 5 ms 5068 KB Output is correct
29 Correct 88 ms 5196 KB Output is correct
30 Correct 48 ms 5196 KB Output is correct
31 Correct 68 ms 5188 KB Output is correct
32 Correct 44 ms 5068 KB Output is correct
33 Correct 64 ms 5068 KB Output is correct
34 Correct 38 ms 5068 KB Output is correct
35 Correct 20 ms 5068 KB Output is correct
36 Correct 11 ms 5024 KB Output is correct
37 Correct 46 ms 5032 KB Output is correct
38 Correct 34 ms 5068 KB Output is correct
39 Correct 78 ms 5140 KB Output is correct
40 Correct 43 ms 5028 KB Output is correct
41 Correct 30 ms 5028 KB Output is correct
42 Correct 41 ms 5044 KB Output is correct
43 Correct 12 ms 5068 KB Output is correct
44 Correct 60 ms 5068 KB Output is correct
45 Correct 54 ms 5108 KB Output is correct
46 Correct 41 ms 5032 KB Output is correct
47 Correct 20 ms 5024 KB Output is correct
48 Correct 56 ms 5068 KB Output is correct
49 Correct 60 ms 5160 KB Output is correct
50 Correct 61 ms 5128 KB Output is correct
51 Correct 59 ms 5188 KB Output is correct
52 Correct 61 ms 5068 KB Output is correct
53 Correct 59 ms 5068 KB Output is correct
54 Correct 58 ms 5068 KB Output is correct
55 Correct 64 ms 5028 KB Output is correct
56 Correct 5 ms 5068 KB Output is correct
57 Correct 5 ms 5152 KB Output is correct
58 Correct 31 ms 5120 KB Output is correct
59 Correct 30 ms 5120 KB Output is correct
60 Correct 6 ms 5196 KB Output is correct
61 Correct 5 ms 5068 KB Output is correct
62 Correct 5 ms 5196 KB Output is correct
63 Correct 53 ms 5076 KB Output is correct

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 4 ms 4940 KB Output is correct
6 Correct 4 ms 5016 KB Output is correct
7 Correct 4 ms 4920 KB Output is correct
8 Correct 5 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 5 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4904 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4956 KB Output is correct
20 Correct 4 ms 5020 KB Output is correct
21 Correct 4 ms 4940 KB Output is correct
22 Correct 71 ms 5076 KB Output is correct
23 Correct 67 ms 5080 KB Output is correct
24 Correct 56 ms 5068 KB Output is correct
25 Correct 43 ms 5068 KB Output is correct
26 Correct 21 ms 5108 KB Output is correct
27 Correct 12 ms 5028 KB Output is correct
28 Correct 5 ms 5068 KB Output is correct
29 Correct 88 ms 5196 KB Output is correct
30 Correct 48 ms 5196 KB Output is correct
31 Correct 68 ms 5188 KB Output is correct
32 Correct 44 ms 5068 KB Output is correct
33 Correct 64 ms 5068 KB Output is correct
34 Correct 38 ms 5068 KB Output is correct
35 Correct 20 ms 5068 KB Output is correct
36 Correct 11 ms 5024 KB Output is correct
37 Correct 46 ms 5032 KB Output is correct
38 Correct 34 ms 5068 KB Output is correct
39 Correct 78 ms 5140 KB Output is correct
40 Correct 43 ms 5028 KB Output is correct
41 Correct 30 ms 5028 KB Output is correct
42 Correct 41 ms 5044 KB Output is correct
43 Correct 12 ms 5068 KB Output is correct
44 Correct 60 ms 5068 KB Output is correct
45 Correct 54 ms 5108 KB Output is correct
46 Correct 41 ms 5032 KB Output is correct
47 Correct 20 ms 5024 KB Output is correct
48 Correct 56 ms 5068 KB Output is correct
49 Correct 60 ms 5160 KB Output is correct
50 Correct 61 ms 5128 KB Output is correct
51 Correct 59 ms 5188 KB Output is correct
52 Correct 61 ms 5068 KB Output is correct
53 Correct 59 ms 5068 KB Output is correct
54 Correct 58 ms 5068 KB Output is correct
55 Correct 64 ms 5028 KB Output is correct
56 Correct 5 ms 5068 KB Output is correct
57 Correct 5 ms 5152 KB Output is correct
58 Correct 31 ms 5120 KB Output is correct
59 Correct 30 ms 5120 KB Output is correct
60 Correct 6 ms 5196 KB Output is correct
61 Correct 5 ms 5068 KB Output is correct
62 Correct 5 ms 5196 KB Output is correct
63 Correct 53 ms 5076 KB Output is correct
64 Execution timed out 1564 ms 14436 KB Time limit exceeded
65 Halted 0 ms 0 KB -