oj.uz

답안 #797007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797007 2023-07-29T04:05:00 Z GrindMachine Power Plant (JOI20_power) C++17
100 / 100
 350 ms 145244 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 dfs1(ll u, ll p){
    dp[u].fill(0);

    trav(v,adj[u]){
        if(v == p) conts;
        dfs1(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);
    }

    ll siz = sz(adj[u]);
    vector<array<ll,3>> pref(siz+5), suff(siz+5);
    
    rep1(i,siz){
        pref[i] = pref[i-1];
        ll v = adj[u][i-1];
        if(v == p) conts;
        pref[i] = merge(pref[i-1],dp[v]);
    }

    rev(i,siz,1){
        suff[i] = suff[i+1];
        ll v = adj[u][i-1];
        if(v == p) conts;
        suff[i] = merge(suff[i+1],dp[v]);
    }

    rep1(i,siz){
        ll v = adj[u][i-1];
        if(v == p) conts;
        
        auto curr = from_up[u];
        curr = merge(curr,pref[i-1]);
        curr = merge(curr,suff[i+1]);

        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';
    }

    dfs1(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 4 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 3 ms 8148 KB Output is correct
8 Correct 3 ms 8148 KB Output is correct
9 Correct 3 ms 8148 KB Output is correct
10 Correct 5 ms 8148 KB Output is correct
11 Correct 3 ms 8148 KB Output is correct
12 Correct 3 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 3 ms 8148 KB Output is correct
17 Correct 3 ms 8148 KB Output is correct
18 Correct 4 ms 8148 KB Output is correct
19 Correct 3 ms 8148 KB Output is correct
20 Correct 3 ms 8148 KB Output is correct
21 Correct 3 ms 8128 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 4 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 3 ms 8148 KB Output is correct
8 Correct 3 ms 8148 KB Output is correct
9 Correct 3 ms 8148 KB Output is correct
10 Correct 5 ms 8148 KB Output is correct
11 Correct 3 ms 8148 KB Output is correct
12 Correct 3 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 3 ms 8148 KB Output is correct
17 Correct 3 ms 8148 KB Output is correct
18 Correct 4 ms 8148 KB Output is correct
19 Correct 3 ms 8148 KB Output is correct
20 Correct 3 ms 8148 KB Output is correct
21 Correct 3 ms 8128 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 5 ms 8276 KB Output is correct
27 Correct 5 ms 8276 KB Output is correct
28 Correct 4 ms 8276 KB Output is correct
29 Correct 7 ms 9300 KB Output is correct
30 Correct 5 ms 9044 KB Output is correct
31 Correct 6 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 8276 KB Output is correct
36 Correct 4 ms 8276 KB Output is correct
37 Correct 4 ms 8276 KB Output is correct
38 Correct 4 ms 8276 KB Output is correct
39 Correct 5 ms 8788 KB Output is correct
40 Correct 5 ms 8696 KB Output is correct
41 Correct 5 ms 8916 KB Output is correct
42 Correct 5 ms 8532 KB Output is correct
43 Correct 5 ms 8532 KB Output is correct
44 Correct 5 ms 8660 KB Output is correct
45 Correct 5 ms 8532 KB Output is correct
46 Correct 5 ms 8404 KB Output is correct
47 Correct 4 ms 8404 KB Output is correct
48 Correct 5 ms 8916 KB Output is correct
49 Correct 5 ms 9044 KB Output is correct
50 Correct 4 ms 8660 KB Output is correct
51 Correct 4 ms 8532 KB Output is correct
52 Correct 4 ms 8404 KB Output is correct
53 Correct 4 ms 8532 KB Output is correct
54 Correct 5 ms 8532 KB Output is correct
55 Correct 4 ms 8404 KB Output is correct
56 Correct 5 ms 8404 KB Output is correct
57 Correct 5 ms 9428 KB Output is correct
58 Correct 5 ms 8404 KB Output is correct
59 Correct 4 ms 8404 KB Output is correct
60 Correct 7 ms 8916 KB Output is correct
61 Correct 5 ms 8400 KB Output is correct
62 Correct 6 ms 9172 KB Output is correct
63 Correct 4 ms 8276 KB Output is correct

Subtask #3
53.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 4 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 3 ms 8148 KB Output is correct
8 Correct 3 ms 8148 KB Output is correct
9 Correct 3 ms 8148 KB Output is correct
10 Correct 5 ms 8148 KB Output is correct
11 Correct 3 ms 8148 KB Output is correct
12 Correct 3 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 3 ms 8148 KB Output is correct
17 Correct 3 ms 8148 KB Output is correct
18 Correct 4 ms 8148 KB Output is correct
19 Correct 3 ms 8148 KB Output is correct
20 Correct 3 ms 8148 KB Output is correct
21 Correct 3 ms 8128 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 5 ms 8276 KB Output is correct
27 Correct 5 ms 8276 KB Output is correct
28 Correct 4 ms 8276 KB Output is correct
29 Correct 7 ms 9300 KB Output is correct
30 Correct 5 ms 9044 KB Output is correct
31 Correct 6 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 8276 KB Output is correct
36 Correct 4 ms 8276 KB Output is correct
37 Correct 4 ms 8276 KB Output is correct
38 Correct 4 ms 8276 KB Output is correct
39 Correct 5 ms 8788 KB Output is correct
40 Correct 5 ms 8696 KB Output is correct
41 Correct 5 ms 8916 KB Output is correct
42 Correct 5 ms 8532 KB Output is correct
43 Correct 5 ms 8532 KB Output is correct
44 Correct 5 ms 8660 KB Output is correct
45 Correct 5 ms 8532 KB Output is correct
46 Correct 5 ms 8404 KB Output is correct
47 Correct 4 ms 8404 KB Output is correct
48 Correct 5 ms 8916 KB Output is correct
49 Correct 5 ms 9044 KB Output is correct
50 Correct 4 ms 8660 KB Output is correct
51 Correct 4 ms 8532 KB Output is correct
52 Correct 4 ms 8404 KB Output is correct
53 Correct 4 ms 8532 KB Output is correct
54 Correct 5 ms 8532 KB Output is correct
55 Correct 4 ms 8404 KB Output is correct
56 Correct 5 ms 8404 KB Output is correct
57 Correct 5 ms 9428 KB Output is correct
58 Correct 5 ms 8404 KB Output is correct
59 Correct 4 ms 8404 KB Output is correct
60 Correct 7 ms 8916 KB Output is correct
61 Correct 5 ms 8400 KB Output is correct
62 Correct 6 ms 9172 KB Output is correct
63 Correct 4 ms 8276 KB Output is correct
64 Correct 189 ms 25092 KB Output is correct
65 Correct 217 ms 25136 KB Output is correct
66 Correct 209 ms 25116 KB Output is correct
67 Correct 208 ms 25048 KB Output is correct
68 Correct 189 ms 25108 KB Output is correct
69 Correct 185 ms 25068 KB Output is correct
70 Correct 183 ms 24964 KB Output is correct
71 Correct 188 ms 25132 KB Output is correct
72 Correct 191 ms 25088 KB Output is correct
73 Correct 350 ms 133276 KB Output is correct
74 Correct 315 ms 132776 KB Output is correct
75 Correct 208 ms 26212 KB Output is correct
76 Correct 198 ms 26136 KB Output is correct
77 Correct 195 ms 24912 KB Output is correct
78 Correct 213 ms 24912 KB Output is correct
79 Correct 191 ms 24916 KB Output is correct
80 Correct 183 ms 24912 KB Output is correct
81 Correct 176 ms 29508 KB Output is correct
82 Correct 194 ms 29892 KB Output is correct
83 Correct 279 ms 74240 KB Output is correct
84 Correct 271 ms 93508 KB Output is correct
85 Correct 271 ms 90660 KB Output is correct
86 Correct 213 ms 40524 KB Output is correct
87 Correct 203 ms 35020 KB Output is correct
88 Correct 209 ms 33924 KB Output is correct
89 Correct 210 ms 34140 KB Output is correct
90 Correct 207 ms 32144 KB Output is correct
91 Correct 228 ms 34296 KB Output is correct
92 Correct 212 ms 37252 KB Output is correct
93 Correct 236 ms 62552 KB Output is correct
94 Correct 257 ms 73988 KB Output is correct
95 Correct 243 ms 64528 KB Output is correct
96 Correct 242 ms 47768 KB Output is correct
97 Correct 207 ms 33440 KB Output is correct
98 Correct 204 ms 28488 KB Output is correct
99 Correct 199 ms 27868 KB Output is correct
100 Correct 231 ms 56916 KB Output is correct
101 Correct 215 ms 38380 KB Output is correct
102 Correct 198 ms 30556 KB Output is correct
103 Correct 194 ms 28636 KB Output is correct
104 Correct 125 ms 37588 KB Output is correct
105 Correct 301 ms 108484 KB Output is correct
106 Correct 140 ms 37500 KB Output is correct
107 Correct 137 ms 37396 KB Output is correct
108 Correct 301 ms 142412 KB Output is correct
109 Correct 136 ms 37556 KB Output is correct
110 Correct 301 ms 145244 KB Output is correct
111 Correct 182 ms 27500 KB Output is correct