답안 #594678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594678	2022-07-12T19:48:04 Z	SOCIOPATE	Power Plant (JOI20_power)	C++17	100 / 100	150 ms	31564 KB

power

#include <bits/stdc++.h>
#include <iostream>
#include <cstdlib>
#include <iomanip>
#include <vector>
#include <cmath>
#include <assert.h>
#include <ctime>
#include <math.h>
#include <queue>
#include <string>
#include <numeric>
#include <fstream>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <stack>
#include <random>
#include <list>
#include <bitset>
#include <algorithm>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

#define pll pair<ll, ll>
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define ff first
#define ss second
#define all(v) v.begin(),v.end()

typedef tree<
    pii,
    null_type,
    less<pii>,
    rb_tree_tag,
    tree_order_statistics_node_update> ordset;


#pragma GCC optimize("-O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Os")

ll INF = 2e18;

//mt19937 gen(time(0));

ll gcd(ll n, ll m){
    while(n != 0 && m != 0){
        if(n > m) n %= m;
        else m %= n;
    }
    return n + m;
}

ll lcm(ll n, ll m){
    ll nod = gcd(n, m);
    return n / nod * m;
}

ll mod = 1e9 + 7;

ll binpow(ll n, ll m){
    if(m == 0) return 1;
    if(m % 2ll == 1) {
        return (binpow(n, m - 1ll) * 1ll * n) % mod;
    }
    ll b = binpow(n, m / 2);
    return (b * 1ll * b) % mod;

}

vector<vector<int>> a;
vector<int> dp;

int ans = 0;

string s;

void dfs(int v, int p){
    int mx = 0;
    for(int u : a[v]){
        if(u == p) continue;
        dfs(u, v);
        dp[v] += dp[u];
        mx = max(mx, dp[u]);
    }
    if(s[v] == '0'){
        ans = max(ans, dp[v]);
        return;
    }
    ans = max(ans, mx + 1);
    dp[v] = max(1, dp[v] - 1);
    ans = max(ans, dp[v]);

}

void solve(){
    int n;
    cin >> n;
    a.resize(n);
    dp.resize(n, 0);
    for(int i = 0; i < n - 1; i++){
        int u, v;
        cin >> u >> v;
        u--; v--;
        a[u].push_back(v);
        a[v].push_back(u);
    }
    cin >> s;
    int cnt = 0;
    for(int i = 0; i < n; i++) if(s[i] == '1') cnt++;
    ans = min(cnt, 2);
    dfs(0, -1);
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
	int tt;
    //cin >> tt;
	tt = 1;
	while (tt--) {
		solve();
	}
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	320 KB	Output is correct
15	Correct	1 ms	216 KB	Output is correct
16	Correct	1 ms	316 KB	Output is correct
17	Correct	0 ms	324 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	320 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	464 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	596 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	460 KB	Output is correct
40	Correct	1 ms	468 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	1 ms	416 KB	Output is correct
43	Correct	1 ms	432 KB	Output is correct
44	Correct	1 ms	468 KB	Output is correct
45	Correct	1 ms	468 KB	Output is correct
46	Correct	1 ms	468 KB	Output is correct
47	Correct	1 ms	468 KB	Output is correct
48	Correct	1 ms	460 KB	Output is correct
49	Correct	1 ms	468 KB	Output is correct
50	Correct	1 ms	468 KB	Output is correct
51	Correct	1 ms	432 KB	Output is correct
52	Correct	1 ms	468 KB	Output is correct
53	Correct	1 ms	468 KB	Output is correct
54	Correct	1 ms	468 KB	Output is correct
55	Correct	1 ms	468 KB	Output is correct
56	Correct	1 ms	460 KB	Output is correct
57	Correct	1 ms	588 KB	Output is correct
58	Correct	1 ms	468 KB	Output is correct
59	Correct	1 ms	468 KB	Output is correct
60	Correct	1 ms	468 KB	Output is correct
61	Correct	1 ms	468 KB	Output is correct
62	Correct	1 ms	468 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	150 ms	15284 KB	Output is correct
65	Correct	114 ms	15264 KB	Output is correct
66	Correct	128 ms	15324 KB	Output is correct
67	Correct	124 ms	15320 KB	Output is correct
68	Correct	109 ms	15340 KB	Output is correct
69	Correct	120 ms	15332 KB	Output is correct
70	Correct	109 ms	15228 KB	Output is correct
71	Correct	138 ms	15368 KB	Output is correct
72	Correct	112 ms	15220 KB	Output is correct
73	Correct	129 ms	30256 KB	Output is correct
74	Correct	140 ms	30216 KB	Output is correct
75	Correct	136 ms	15356 KB	Output is correct
76	Correct	121 ms	15220 KB	Output is correct
77	Correct	135 ms	15228 KB	Output is correct
78	Correct	127 ms	15244 KB	Output is correct
79	Correct	133 ms	15192 KB	Output is correct
80	Correct	124 ms	15232 KB	Output is correct
81	Correct	91 ms	15476 KB	Output is correct
82	Correct	100 ms	15324 KB	Output is correct
83	Correct	134 ms	21248 KB	Output is correct
84	Correct	136 ms	23868 KB	Output is correct
85	Correct	125 ms	23528 KB	Output is correct
86	Correct	127 ms	16712 KB	Output is correct
87	Correct	130 ms	16124 KB	Output is correct
88	Correct	132 ms	16560 KB	Output is correct
89	Correct	139 ms	16596 KB	Output is correct
90	Correct	112 ms	16224 KB	Output is correct
91	Correct	108 ms	16500 KB	Output is correct
92	Correct	117 ms	17000 KB	Output is correct
93	Correct	100 ms	19908 KB	Output is correct
94	Correct	109 ms	21980 KB	Output is correct
95	Correct	104 ms	20364 KB	Output is correct
96	Correct	110 ms	18136 KB	Output is correct
97	Correct	138 ms	16312 KB	Output is correct
98	Correct	109 ms	15688 KB	Output is correct
99	Correct	125 ms	15564 KB	Output is correct
100	Correct	115 ms	19360 KB	Output is correct
101	Correct	110 ms	16856 KB	Output is correct
102	Correct	126 ms	16064 KB	Output is correct
103	Correct	119 ms	15752 KB	Output is correct
104	Correct	64 ms	15988 KB	Output is correct
105	Correct	146 ms	26512 KB	Output is correct
106	Correct	95 ms	15944 KB	Output is correct
107	Correct	68 ms	16032 KB	Output is correct
108	Correct	133 ms	31260 KB	Output is correct
109	Correct	71 ms	16064 KB	Output is correct
110	Correct	130 ms	31564 KB	Output is correct
111	Correct	114 ms	15216 KB	Output is correct

답안 #594678

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 41.0 / 41.0

Subtask #3 53.0 / 53.0

Subtask #1
6.0 / 6.0

Subtask #2
41.0 / 41.0

Subtask #3
53.0 / 53.0