oj.uz

답안 #796967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796967 2023-07-29T01:39:55 Z GrindMachine Power Plant (JOI20_power) C++17
47 / 100
 1500 ms 15564 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);
vector<ll> dp(N);

void dfs(ll u, ll p, ll r){
    dp[u] = 0;

    ll dp1[3], dp2[3];
    memset(dp1,0,sizeof dp1);
    memset(dp2,0,sizeof dp2);

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

        memset(dp2,0,sizeof dp2);

        rep(j,3){
            rep(k,2){
                ll j2 = min(j+k,2);
                ll add = 0;
                if(k) add = dp[v];
                amax(dp2[j2],dp1[j]+add);
            }
        }

        rep(j,3) dp1[j] = dp2[j];
    }

    if(u != r){
        dp[u] = max(dp1[1],dp1[2]);

        if(a[u]){
            dp[u]--;
            amax(dp[u],1ll);
        }   
    }
    else{
        dp[u] = max(dp1[1]+1,dp1[2]-1);
    }

    amax(dp[u],0ll);
}

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

    ll ans = 0;

    rep1(r,n){
        if(!a[r]) conts;
        // if(r != 2) conts;

        dfs(r,-1,r);
        amax(ans,dp[r]);
    }

    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 3 ms 8148 KB Output is correct
2 Correct 3 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 3 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 3 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 3 ms 8148 KB Output is correct
14 Correct 4 ms 8092 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8092 KB Output is correct
17 Correct 4 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 8144 KB Output is correct
21 Correct 3 ms 8148 KB Output is correct

Subtask #2
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8148 KB Output is correct
2 Correct 3 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 3 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 3 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 3 ms 8148 KB Output is correct
14 Correct 4 ms 8092 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8092 KB Output is correct
17 Correct 4 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 8144 KB Output is correct
21 Correct 3 ms 8148 KB Output is correct
22 Correct 96 ms 8220 KB Output is correct
23 Correct 82 ms 8148 KB Output is correct
24 Correct 73 ms 8232 KB Output is correct
25 Correct 49 ms 8148 KB Output is correct
26 Correct 26 ms 8248 KB Output is correct
27 Correct 12 ms 8148 KB Output is correct
28 Correct 4 ms 8148 KB Output is correct
29 Correct 105 ms 8504 KB Output is correct
30 Correct 57 ms 8404 KB Output is correct
31 Correct 82 ms 8148 KB Output is correct
32 Correct 49 ms 8148 KB Output is correct
33 Correct 83 ms 8228 KB Output is correct
34 Correct 49 ms 8268 KB Output is correct
35 Correct 26 ms 8148 KB Output is correct
36 Correct 12 ms 8164 KB Output is correct
37 Correct 65 ms 8148 KB Output is correct
38 Correct 49 ms 8148 KB Output is correct
39 Correct 96 ms 8276 KB Output is correct
40 Correct 61 ms 8372 KB Output is correct
41 Correct 29 ms 8276 KB Output is correct
42 Correct 66 ms 8284 KB Output is correct
43 Correct 13 ms 8264 KB Output is correct
44 Correct 82 ms 8276 KB Output is correct
45 Correct 68 ms 8276 KB Output is correct
46 Correct 48 ms 8276 KB Output is correct
47 Correct 25 ms 8276 KB Output is correct
48 Correct 83 ms 8276 KB Output is correct
49 Correct 82 ms 8276 KB Output is correct
50 Correct 82 ms 8276 KB Output is correct
51 Correct 83 ms 8304 KB Output is correct
52 Correct 80 ms 8148 KB Output is correct
53 Correct 64 ms 8328 KB Output is correct
54 Correct 85 ms 8276 KB Output is correct
55 Correct 84 ms 8148 KB Output is correct
56 Correct 5 ms 8148 KB Output is correct
57 Correct 4 ms 8404 KB Output is correct
58 Correct 64 ms 8148 KB Output is correct
59 Correct 64 ms 8148 KB Output is correct
60 Correct 4 ms 8404 KB Output is correct
61 Correct 4 ms 8148 KB Output is correct
62 Correct 5 ms 8404 KB Output is correct
63 Correct 77 ms 8148 KB Output is correct

Subtask #3
0.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8148 KB Output is correct
2 Correct 3 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 3 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 3 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 3 ms 8148 KB Output is correct
14 Correct 4 ms 8092 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8092 KB Output is correct
17 Correct 4 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 8144 KB Output is correct
21 Correct 3 ms 8148 KB Output is correct
22 Correct 96 ms 8220 KB Output is correct
23 Correct 82 ms 8148 KB Output is correct
24 Correct 73 ms 8232 KB Output is correct
25 Correct 49 ms 8148 KB Output is correct
26 Correct 26 ms 8248 KB Output is correct
27 Correct 12 ms 8148 KB Output is correct
28 Correct 4 ms 8148 KB Output is correct
29 Correct 105 ms 8504 KB Output is correct
30 Correct 57 ms 8404 KB Output is correct
31 Correct 82 ms 8148 KB Output is correct
32 Correct 49 ms 8148 KB Output is correct
33 Correct 83 ms 8228 KB Output is correct
34 Correct 49 ms 8268 KB Output is correct
35 Correct 26 ms 8148 KB Output is correct
36 Correct 12 ms 8164 KB Output is correct
37 Correct 65 ms 8148 KB Output is correct
38 Correct 49 ms 8148 KB Output is correct
39 Correct 96 ms 8276 KB Output is correct
40 Correct 61 ms 8372 KB Output is correct
41 Correct 29 ms 8276 KB Output is correct
42 Correct 66 ms 8284 KB Output is correct
43 Correct 13 ms 8264 KB Output is correct
44 Correct 82 ms 8276 KB Output is correct
45 Correct 68 ms 8276 KB Output is correct
46 Correct 48 ms 8276 KB Output is correct
47 Correct 25 ms 8276 KB Output is correct
48 Correct 83 ms 8276 KB Output is correct
49 Correct 82 ms 8276 KB Output is correct
50 Correct 82 ms 8276 KB Output is correct
51 Correct 83 ms 8304 KB Output is correct
52 Correct 80 ms 8148 KB Output is correct
53 Correct 64 ms 8328 KB Output is correct
54 Correct 85 ms 8276 KB Output is correct
55 Correct 84 ms 8148 KB Output is correct
56 Correct 5 ms 8148 KB Output is correct
57 Correct 4 ms 8404 KB Output is correct
58 Correct 64 ms 8148 KB Output is correct
59 Correct 64 ms 8148 KB Output is correct
60 Correct 4 ms 8404 KB Output is correct
61 Correct 4 ms 8148 KB Output is correct
62 Correct 5 ms 8404 KB Output is correct
63 Correct 77 ms 8148 KB Output is correct
64 Execution timed out 1592 ms 15564 KB Time limit exceeded
65 Halted 0 ms 0 KB -