답안 #1016137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016137 2024-07-07T12:35:34 Z ByeWorld Power Plant (JOI20_power) C++14
47 / 100
1500 ms 18404 KB
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
// #define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)/2)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 3e5+10;
const int MAXA = 1e6+10;
const int INF = 1e9+10;
// const int INF2 = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmn(int &a, int b){ a = min(a, b); }
void chmx(int &a, int b){ a = max(a, b); }

int n, a[MAXN];
vector <int> adj[MAXN];

int te = 0, ANS = 0, val[MAXN];
void dfs(int nw, int par){
    val[nw] = 0;
    for(auto nx : adj[nw]){
        if(nx==par) continue;
        dfs(nx, nw);
    }
    int mx = 0;
    for(auto nx : adj[nw]){
        if(nx==par) continue;
        val[nw] += val[nx];
        chmx(mx, val[nx]);
    }
    if(a[nw]){
        val[nw] = max(val[nw]-1, 1);
        chmx(ANS, mx+1);
    }

    chmx(ANS, val[nw]);
}

signed main(){
    cin >> n;
    for(int i=1; i<=n-1; i++){
        int x, y; cin >> x >> y;
        adj[x].pb(y); adj[y].pb(x);
    }
    string x; cin >> x; int tot = 0;
    for(int i=1; i<=n; i++){
        a[i] = (int)(x[i-1]-'0'); tot += a[i];
    }

    for(int i=1; i<=n; i++){
        dfs(i, 0); 
        // cout << i << ' ' << val[i] << " val\n";
        chmx(ANS, val[i]);
    }
    cout << ANS << '\n';
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8792 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8792 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 43 ms 8540 KB Output is correct
23 Correct 40 ms 8540 KB Output is correct
24 Correct 43 ms 8536 KB Output is correct
25 Correct 41 ms 8540 KB Output is correct
26 Correct 37 ms 8540 KB Output is correct
27 Correct 40 ms 8540 KB Output is correct
28 Correct 41 ms 8536 KB Output is correct
29 Correct 80 ms 8796 KB Output is correct
30 Correct 78 ms 8792 KB Output is correct
31 Correct 47 ms 8540 KB Output is correct
32 Correct 48 ms 8536 KB Output is correct
33 Correct 48 ms 8536 KB Output is correct
34 Correct 44 ms 8540 KB Output is correct
35 Correct 75 ms 8540 KB Output is correct
36 Correct 46 ms 8536 KB Output is correct
37 Correct 37 ms 8536 KB Output is correct
38 Correct 39 ms 8540 KB Output is correct
39 Correct 59 ms 8500 KB Output is correct
40 Correct 59 ms 8648 KB Output is correct
41 Correct 56 ms 8792 KB Output is correct
42 Correct 54 ms 8760 KB Output is correct
43 Correct 57 ms 8760 KB Output is correct
44 Correct 57 ms 8540 KB Output is correct
45 Correct 61 ms 8540 KB Output is correct
46 Correct 56 ms 8540 KB Output is correct
47 Correct 51 ms 8664 KB Output is correct
48 Correct 56 ms 8656 KB Output is correct
49 Correct 65 ms 8796 KB Output is correct
50 Correct 58 ms 8792 KB Output is correct
51 Correct 60 ms 7508 KB Output is correct
52 Correct 52 ms 8744 KB Output is correct
53 Correct 53 ms 8804 KB Output is correct
54 Correct 57 ms 8536 KB Output is correct
55 Correct 49 ms 8540 KB Output is correct
56 Correct 30 ms 8536 KB Output is correct
57 Correct 92 ms 8796 KB Output is correct
58 Correct 40 ms 8540 KB Output is correct
59 Correct 32 ms 8540 KB Output is correct
60 Correct 76 ms 8792 KB Output is correct
61 Correct 32 ms 8792 KB Output is correct
62 Correct 76 ms 7732 KB Output is correct
63 Correct 40 ms 8540 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8792 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 43 ms 8540 KB Output is correct
23 Correct 40 ms 8540 KB Output is correct
24 Correct 43 ms 8536 KB Output is correct
25 Correct 41 ms 8540 KB Output is correct
26 Correct 37 ms 8540 KB Output is correct
27 Correct 40 ms 8540 KB Output is correct
28 Correct 41 ms 8536 KB Output is correct
29 Correct 80 ms 8796 KB Output is correct
30 Correct 78 ms 8792 KB Output is correct
31 Correct 47 ms 8540 KB Output is correct
32 Correct 48 ms 8536 KB Output is correct
33 Correct 48 ms 8536 KB Output is correct
34 Correct 44 ms 8540 KB Output is correct
35 Correct 75 ms 8540 KB Output is correct
36 Correct 46 ms 8536 KB Output is correct
37 Correct 37 ms 8536 KB Output is correct
38 Correct 39 ms 8540 KB Output is correct
39 Correct 59 ms 8500 KB Output is correct
40 Correct 59 ms 8648 KB Output is correct
41 Correct 56 ms 8792 KB Output is correct
42 Correct 54 ms 8760 KB Output is correct
43 Correct 57 ms 8760 KB Output is correct
44 Correct 57 ms 8540 KB Output is correct
45 Correct 61 ms 8540 KB Output is correct
46 Correct 56 ms 8540 KB Output is correct
47 Correct 51 ms 8664 KB Output is correct
48 Correct 56 ms 8656 KB Output is correct
49 Correct 65 ms 8796 KB Output is correct
50 Correct 58 ms 8792 KB Output is correct
51 Correct 60 ms 7508 KB Output is correct
52 Correct 52 ms 8744 KB Output is correct
53 Correct 53 ms 8804 KB Output is correct
54 Correct 57 ms 8536 KB Output is correct
55 Correct 49 ms 8540 KB Output is correct
56 Correct 30 ms 8536 KB Output is correct
57 Correct 92 ms 8796 KB Output is correct
58 Correct 40 ms 8540 KB Output is correct
59 Correct 32 ms 8540 KB Output is correct
60 Correct 76 ms 8792 KB Output is correct
61 Correct 32 ms 8792 KB Output is correct
62 Correct 76 ms 7732 KB Output is correct
63 Correct 40 ms 8540 KB Output is correct
64 Execution timed out 1541 ms 18404 KB Time limit exceeded
65 Halted 0 ms 0 KB -