답안 #330940

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330940	2020-11-27T00:06:54 Z	eggag32	Power Plant (JOI20_power)	C++17	47 / 100	2 ms	620 KB

power

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int mxN = 2005;
 
template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }
 
int n;
int dp[mxN][2];
string s;
vi g[mxN];
 
void dfs(int cur, int prev){
	if(s[cur] == '1') dp[cur][0] = 1;
	int tot = 0, mx = 0;
	for(int x : g[cur]) if(x != prev){
		dfs(x, cur);
		tot += dp[x][0];
		mx = max(mx, dp[x][0]);
	}
	dp[cur][0] = max(tot - (s[cur] == '1'), dp[cur][0]);
	if(s[cur] == '1') dp[cur][1] = mx + 1;
}
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	cin >> n;
	int cnt = 0;
	rep(i, n - 1){
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	cin >> s;
	rep(i, n) cnt += (s[i] == '1');
	int ans = 0, mn = 0;
	if(cnt == 2) mn = 2;
	dfs(0, -1);
	rep(i, n) ans = max({ans, dp[i][0], dp[i][1]});
	cout << max(mn, ans) << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Make sure that max is large enough (2e9, 4e18)
	- Special cases
Be careful!
*/

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct

Subtask #2
41.0 / 41.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	492 KB	Output is correct
23	Correct	1 ms	492 KB	Output is correct
24	Correct	1 ms	492 KB	Output is correct
25	Correct	1 ms	492 KB	Output is correct
26	Correct	1 ms	492 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	2 ms	620 KB	Output is correct
30	Correct	1 ms	620 KB	Output is correct
31	Correct	1 ms	492 KB	Output is correct
32	Correct	2 ms	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	2 ms	492 KB	Output is correct
35	Correct	2 ms	512 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	1 ms	492 KB	Output is correct
39	Correct	2 ms	492 KB	Output is correct
40	Correct	2 ms	492 KB	Output is correct
41	Correct	1 ms	492 KB	Output is correct
42	Correct	1 ms	492 KB	Output is correct
43	Correct	1 ms	492 KB	Output is correct
44	Correct	1 ms	492 KB	Output is correct
45	Correct	1 ms	492 KB	Output is correct
46	Correct	1 ms	492 KB	Output is correct
47	Correct	1 ms	492 KB	Output is correct
48	Correct	1 ms	620 KB	Output is correct
49	Correct	1 ms	620 KB	Output is correct
50	Correct	1 ms	492 KB	Output is correct
51	Correct	1 ms	492 KB	Output is correct
52	Correct	2 ms	492 KB	Output is correct
53	Correct	1 ms	492 KB	Output is correct
54	Correct	1 ms	492 KB	Output is correct
55	Correct	1 ms	492 KB	Output is correct
56	Correct	1 ms	492 KB	Output is correct
57	Correct	1 ms	620 KB	Output is correct
58	Correct	1 ms	492 KB	Output is correct
59	Correct	1 ms	492 KB	Output is correct
60	Correct	1 ms	620 KB	Output is correct
61	Correct	1 ms	492 KB	Output is correct
62	Correct	1 ms	620 KB	Output is correct
63	Correct	1 ms	492 KB	Output is correct

Subtask #3
0.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	492 KB	Output is correct
23	Correct	1 ms	492 KB	Output is correct
24	Correct	1 ms	492 KB	Output is correct
25	Correct	1 ms	492 KB	Output is correct
26	Correct	1 ms	492 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	2 ms	620 KB	Output is correct
30	Correct	1 ms	620 KB	Output is correct
31	Correct	1 ms	492 KB	Output is correct
32	Correct	2 ms	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	2 ms	492 KB	Output is correct
35	Correct	2 ms	512 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	1 ms	492 KB	Output is correct
39	Correct	2 ms	492 KB	Output is correct
40	Correct	2 ms	492 KB	Output is correct
41	Correct	1 ms	492 KB	Output is correct
42	Correct	1 ms	492 KB	Output is correct
43	Correct	1 ms	492 KB	Output is correct
44	Correct	1 ms	492 KB	Output is correct
45	Correct	1 ms	492 KB	Output is correct
46	Correct	1 ms	492 KB	Output is correct
47	Correct	1 ms	492 KB	Output is correct
48	Correct	1 ms	620 KB	Output is correct
49	Correct	1 ms	620 KB	Output is correct
50	Correct	1 ms	492 KB	Output is correct
51	Correct	1 ms	492 KB	Output is correct
52	Correct	2 ms	492 KB	Output is correct
53	Correct	1 ms	492 KB	Output is correct
54	Correct	1 ms	492 KB	Output is correct
55	Correct	1 ms	492 KB	Output is correct
56	Correct	1 ms	492 KB	Output is correct
57	Correct	1 ms	620 KB	Output is correct
58	Correct	1 ms	492 KB	Output is correct
59	Correct	1 ms	492 KB	Output is correct
60	Correct	1 ms	620 KB	Output is correct
61	Correct	1 ms	492 KB	Output is correct
62	Correct	1 ms	620 KB	Output is correct
63	Correct	1 ms	492 KB	Output is correct
64	Runtime error	1 ms	620 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
65	Halted	0 ms	0 KB	-

답안 #330940

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 41.0 / 41.0

Subtask #3 0.0 / 53.0

Subtask #1
6.0 / 6.0

Subtask #2
41.0 / 41.0

Subtask #3
0.0 / 53.0