oj.uz

답안 #797005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797005 2023-07-29T04:00:43 Z GrindMachine Power Plant (JOI20_power) C++17
47 / 100
 1500 ms 59592 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read edi long time ago, dont exactly remember the approach in the edi

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
vector<ll> a(N);
array<ll,3> dp[N];
vector<ll> best(N);

array<ll,3> merge(array<ll,3> v1, array<ll,3> v2){
    array<ll,3> v3;
    v3.fill(0);

    rep(i,3){
        rep(j,3){
            ll j2 = min(i+(j>0),2);
            amax(v3[j2],v1[i]+v2[j]);
        }
    }

    return v3;
}

void dfs(ll u, ll p){
    dp[u].fill(0);

    trav(v,adj[u]){
        if(v == p) conts;
        dfs(v,u);
        dp[u] = merge(dp[u],dp[v]);
    }

    if(a[u]){
        best[u] = max(dp[u][1]+1,dp[u][2]-1);

        dp[u][1]--;
        dp[u][2]--;
        amax(dp[u][1],1ll);
        amax(dp[u][2],1ll);
    }
}

array<ll,3> from_up[N];

void dfs2(ll u, ll p){
    if(u == 1){
        from_up[u].fill(0);
    }

    auto here = from_up[u];
    trav(v,adj[u]){
        if(v == p) conts;
        here = merge(here,dp[v]);
    }

    if(a[u]){
        best[u] = max(here[1]+1,here[2]-1);
    }

    trav(v,adj[u]){
        if(v == p) conts;
        
        auto curr = from_up[u];

        trav(w,adj[u]){
            if(w != v and w != p){
                curr = merge(curr,dp[w]);
            }
        }    

        if(a[u]){
            curr[1]--;
            curr[2]--;
            amax(curr[1],1ll);
            amax(curr[2],1ll);
        }

        amax(curr[1],curr[2]);

        from_up[v] = curr;

        dfs2(v,u);
    }
}

void solve(int test_case)
{
    ll n; cin >> n;
    rep1(i,n-1){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }    

    rep1(i,n){
        char ch; cin >> ch;
        a[i] = ch-'0';
    }

    dfs(1,-1);
    dfs2(1,-1);

    ll ans = 0;
    rep1(i,n) amax(ans,best[i]);

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
0.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 3 ms 8148 KB Output is correct
4 Correct 3 ms 8148 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 3 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 3 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 4 ms 8148 KB Output is correct
11 Correct 3 ms 8148 KB Output is correct
12 Correct 4 ms 8148 KB Output is correct
13 Correct 4 ms 8148 KB Output is correct
14 Correct 4 ms 8148 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8148 KB Output is correct
17 Correct 3 ms 8148 KB Output is correct
18 Correct 3 ms 8148 KB Output is correct
19 Correct 3 ms 8148 KB Output is correct
20 Correct 4 ms 8148 KB Output is correct
21 Correct 3 ms 8148 KB Output is correct
22 Correct 4 ms 8276 KB Output is correct
23 Correct 4 ms 8276 KB Output is correct
24 Correct 4 ms 8276 KB Output is correct
25 Correct 4 ms 8276 KB Output is correct
26 Correct 4 ms 8228 KB Output is correct
27 Correct 5 ms 8276 KB Output is correct
28 Correct 5 ms 8312 KB Output is correct
29 Correct 4 ms 8532 KB Output is correct
30 Correct 4 ms 8532 KB Output is correct
31 Correct 4 ms 8276 KB Output is correct
32 Correct 4 ms 8276 KB Output is correct
33 Correct 4 ms 8276 KB Output is correct
34 Correct 4 ms 8276 KB Output is correct
35 Correct 4 ms 8212 KB Output is correct
36 Correct 4 ms 8276 KB Output is correct
37 Correct 24 ms 8276 KB Output is correct
38 Correct 9 ms 8276 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 4 ms 8404 KB Output is correct
41 Correct 4 ms 8404 KB Output is correct
42 Correct 4 ms 8404 KB Output is correct
43 Correct 4 ms 8276 KB Output is correct
44 Correct 5 ms 8320 KB Output is correct
45 Correct 5 ms 8336 KB Output is correct
46 Correct 5 ms 8276 KB Output is correct
47 Correct 5 ms 8276 KB Output is correct
48 Correct 24 ms 8532 KB Output is correct
49 Correct 12 ms 8532 KB Output is correct
50 Correct 9 ms 8368 KB Output is correct
51 Correct 7 ms 8404 KB Output is correct
52 Correct 4 ms 8276 KB Output is correct
53 Correct 10 ms 8404 KB Output is correct
54 Correct 5 ms 8404 KB Output is correct
55 Correct 4 ms 8276 KB Output is correct
56 Correct 83 ms 8276 KB Output is correct
57 Correct 4 ms 8660 KB Output is correct
58 Correct 83 ms 8328 KB Output is correct
59 Correct 86 ms 8276 KB Output is correct
60 Correct 4 ms 8404 KB Output is correct
61 Correct 86 ms 8276 KB Output is correct
62 Correct 4 ms 8532 KB Output is correct
63 Correct 4 ms 8276 KB Output is correct
64 Correct 183 ms 24808 KB Output is correct
65 Correct 174 ms 27596 KB Output is correct
66 Correct 177 ms 27596 KB Output is correct
67 Correct 180 ms 27656 KB Output is correct
68 Correct 184 ms 27644 KB Output is correct
69 Correct 179 ms 27552 KB Output is correct
70 Correct 164 ms 27640 KB Output is correct
71 Correct 181 ms 27644 KB Output is correct
72 Correct 164 ms 27544 KB Output is correct
73 Correct 207 ms 59592 KB Output is correct
74 Correct 213 ms 59436 KB Output is correct
75 Correct 174 ms 28832 KB Output is correct
76 Correct 175 ms 28828 KB Output is correct
77 Correct 174 ms 27600 KB Output is correct
78 Correct 189 ms 27724 KB Output is correct
79 Correct 165 ms 27596 KB Output is correct
80 Correct 162 ms 27540 KB Output is correct
81 Execution timed out 1571 ms 25756 KB Time limit exceeded
82 Halted 0 ms 0 KB -