oj.uz

Submission #1013391

# Submission time Handle Problem Language Result Execution time Memory
1013391 2024-07-03T13:47:42 Z GrindMachine Designated Cities (JOI19_designated_cities) C++17
100 / 100
 887 ms 59712 KB 
#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) (int)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(...) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/66022?#comment-501121

*/

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

vector<array<ll,3>> adj[N];
vector<pll> farthest(N);
vector<ll> leaf_add(N);
vector<ll> ans(N);
vector<ll> sub_id(N);
vector<ll> subsiz(N);
vector<bool> rem(N);
vector<ll> in_sum(N);
vector<ll> nodes;

void dfs1(ll u, ll p, ll s){
    nodes.pb(u);
    sub_id[u] = s;
    farthest[u] = {0,u};
    leaf_add[u] = 0;
    subsiz[u] = 1;

    for(auto [v,x,y] : adj[u]){
        if(v == p or rem[v]) conts;
        dfs1(v,u,s==-1?v:s);
        subsiz[u] += subsiz[v];
        auto px = farthest[v];
        px.ff += x;
        leaf_add[px.ss] += x;
        amax(farthest[u],px);
    }
}

ll dfs2(ll u, ll p, ll nodes){
    for(auto [v,x,y] : adj[u]){
        if(v == p or rem[v]) conts;
        if(subsiz[v] > nodes/2){
            return dfs2(v,u,nodes);
        }
    }
    return u;
}

void dfs3(ll u, ll p){
    in_sum[u] = 0;
    for(auto [v,x,y] : adj[u]){
        if(v == p) conts;
        in_sum[u] += y;
        dfs3(v,u);
        in_sum[u] += in_sum[v];
    }
}

void dfs4(ll u, ll p){
    for(auto [v,x,y] : adj[u]){
        if(v == p) conts;
        in_sum[v] = in_sum[u]-y+x;
        dfs4(v,u);
    }
}

void go(ll u){
    nodes.clear();
    dfs1(u,-1,-1);
    ll c = dfs2(u,-1,sz(nodes));
    nodes.clear();
    dfs1(c,-1,-1);

    vector<pll> ord;
    trav(u,nodes){
        ord.pb({leaf_add[u],sub_id[u]});
    }
    sort(rall(ord));

    // pick centroid
    {
        ll cost = in_sum[c];
        ll pick = 1;
        amax(ans[pick],cost);

        for(auto [x,id] : ord){
            pick++;
            cost += x;
            amax(ans[pick],cost);
        }
    }

    // pick nodes (actually leaves) from at least 2 diff subtrees
    if(sz(ord) >= 2){
        ll cost = in_sum[c];
        ll pick = 1;
        ll first = -1;
        rep(i,sz(ord)){
            if(ord[i].ss != ord[0].ss){
                first = i;
                break;
            }
        }

        if(first != -1){
            cost += ord[first].ff;
            ord.erase(ord.begin()+first);

            for(auto [x,id] : ord){
                cost += x;
                pick++;
                amax(ans[pick],cost);
            }
        }
    }

    rem[c] = 1;
    for(auto [v,x,y] : adj[c]){
        if(rem[v]) conts;
        go(v);
    }
}

void solve(int test_case)
{
    ll n; cin >> n;
    ll tot_sum = 0;

    rep1(i,n-1){
        ll u,v,x,y; cin >> u >> v >> x >> y;
        adj[u].pb({v,x,y}), adj[v].pb({u,y,x});
        tot_sum += x+y;
    }

    dfs3(1,-1);
    dfs4(1,-1);

    go(1);

    rep1(i,n) ans[i] = tot_sum-ans[i];

    ll q; cin >> q;
    while(q--){
        ll k; cin >> k;
        cout << ans[k] << endl;
    }
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15964 KB Output is correct
2 Correct 9 ms 15964 KB Output is correct
3 Correct 5 ms 15936 KB Output is correct
4 Correct 6 ms 15960 KB Output is correct
5 Correct 6 ms 15964 KB Output is correct
6 Correct 9 ms 15964 KB Output is correct
7 Correct 6 ms 15964 KB Output is correct
8 Correct 7 ms 16000 KB Output is correct
9 Correct 9 ms 15964 KB Output is correct
10 Correct 7 ms 15964 KB Output is correct
11 Correct 8 ms 15944 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15964 KB Output is correct
2 Correct 528 ms 37540 KB Output is correct
3 Correct 887 ms 56772 KB Output is correct
4 Correct 559 ms 42564 KB Output is correct
5 Correct 214 ms 41088 KB Output is correct
6 Correct 556 ms 45844 KB Output is correct
7 Correct 201 ms 41984 KB Output is correct
8 Correct 740 ms 57240 KB Output is correct
9 Correct 130 ms 42320 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15964 KB Output is correct
2 Correct 505 ms 37464 KB Output is correct
3 Correct 677 ms 59484 KB Output is correct
4 Correct 465 ms 42564 KB Output is correct
5 Correct 223 ms 41092 KB Output is correct
6 Correct 560 ms 46148 KB Output is correct
7 Correct 145 ms 42232 KB Output is correct
8 Correct 772 ms 52416 KB Output is correct
9 Correct 136 ms 41976 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15964 KB Output is correct
2 Correct 9 ms 15964 KB Output is correct
3 Correct 5 ms 15936 KB Output is correct
4 Correct 6 ms 15960 KB Output is correct
5 Correct 6 ms 15964 KB Output is correct
6 Correct 9 ms 15964 KB Output is correct
7 Correct 6 ms 15964 KB Output is correct
8 Correct 7 ms 16000 KB Output is correct
9 Correct 9 ms 15964 KB Output is correct
10 Correct 7 ms 15964 KB Output is correct
11 Correct 8 ms 15944 KB Output is correct
12 Correct 6 ms 15964 KB Output is correct
13 Correct 8 ms 16176 KB Output is correct
14 Correct 9 ms 16472 KB Output is correct
15 Correct 8 ms 16216 KB Output is correct
16 Correct 7 ms 16220 KB Output is correct
17 Correct 7 ms 16220 KB Output is correct
18 Correct 7 ms 16220 KB Output is correct
19 Correct 8 ms 16220 KB Output is correct
20 Correct 7 ms 16368 KB Output is correct
21 Correct 8 ms 16220 KB Output is correct
22 Correct 7 ms 16220 KB Output is correct
23 Correct 8 ms 16220 KB Output is correct
24 Correct 7 ms 16220 KB Output is correct
25 Correct 7 ms 16476 KB Output is correct
26 Correct 7 ms 16264 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15964 KB Output is correct
2 Correct 528 ms 37540 KB Output is correct
3 Correct 887 ms 56772 KB Output is correct
4 Correct 559 ms 42564 KB Output is correct
5 Correct 214 ms 41088 KB Output is correct
6 Correct 556 ms 45844 KB Output is correct
7 Correct 201 ms 41984 KB Output is correct
8 Correct 740 ms 57240 KB Output is correct
9 Correct 130 ms 42320 KB Output is correct
10 Correct 6 ms 15964 KB Output is correct
11 Correct 505 ms 37464 KB Output is correct
12 Correct 677 ms 59484 KB Output is correct
13 Correct 465 ms 42564 KB Output is correct
14 Correct 223 ms 41092 KB Output is correct
15 Correct 560 ms 46148 KB Output is correct
16 Correct 145 ms 42232 KB Output is correct
17 Correct 772 ms 52416 KB Output is correct
18 Correct 136 ms 41976 KB Output is correct
19 Correct 7 ms 15960 KB Output is correct
20 Correct 452 ms 43700 KB Output is correct
21 Correct 724 ms 59712 KB Output is correct
22 Correct 496 ms 42480 KB Output is correct
23 Correct 433 ms 44104 KB Output is correct
24 Correct 452 ms 43008 KB Output is correct
25 Correct 430 ms 44176 KB Output is correct
26 Correct 477 ms 43008 KB Output is correct
27 Correct 245 ms 41348 KB Output is correct
28 Correct 550 ms 45760 KB Output is correct
29 Correct 494 ms 44100 KB Output is correct
30 Correct 431 ms 42288 KB Output is correct
31 Correct 180 ms 41796 KB Output is correct
32 Correct 821 ms 53000 KB Output is correct
33 Correct 153 ms 42232 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15964 KB Output is correct
2 Correct 9 ms 15964 KB Output is correct
3 Correct 5 ms 15936 KB Output is correct
4 Correct 6 ms 15960 KB Output is correct
5 Correct 6 ms 15964 KB Output is correct
6 Correct 9 ms 15964 KB Output is correct
7 Correct 6 ms 15964 KB Output is correct
8 Correct 7 ms 16000 KB Output is correct
9 Correct 9 ms 15964 KB Output is correct
10 Correct 7 ms 15964 KB Output is correct
11 Correct 8 ms 15944 KB Output is correct
12 Correct 10 ms 15964 KB Output is correct
13 Correct 528 ms 37540 KB Output is correct
14 Correct 887 ms 56772 KB Output is correct
15 Correct 559 ms 42564 KB Output is correct
16 Correct 214 ms 41088 KB Output is correct
17 Correct 556 ms 45844 KB Output is correct
18 Correct 201 ms 41984 KB Output is correct
19 Correct 740 ms 57240 KB Output is correct
20 Correct 130 ms 42320 KB Output is correct
21 Correct 6 ms 15964 KB Output is correct
22 Correct 505 ms 37464 KB Output is correct
23 Correct 677 ms 59484 KB Output is correct
24 Correct 465 ms 42564 KB Output is correct
25 Correct 223 ms 41092 KB Output is correct
26 Correct 560 ms 46148 KB Output is correct
27 Correct 145 ms 42232 KB Output is correct
28 Correct 772 ms 52416 KB Output is correct
29 Correct 136 ms 41976 KB Output is correct
30 Correct 6 ms 15964 KB Output is correct
31 Correct 8 ms 16176 KB Output is correct
32 Correct 9 ms 16472 KB Output is correct
33 Correct 8 ms 16216 KB Output is correct
34 Correct 7 ms 16220 KB Output is correct
35 Correct 7 ms 16220 KB Output is correct
36 Correct 7 ms 16220 KB Output is correct
37 Correct 8 ms 16220 KB Output is correct
38 Correct 7 ms 16368 KB Output is correct
39 Correct 8 ms 16220 KB Output is correct
40 Correct 7 ms 16220 KB Output is correct
41 Correct 8 ms 16220 KB Output is correct
42 Correct 7 ms 16220 KB Output is correct
43 Correct 7 ms 16476 KB Output is correct
44 Correct 7 ms 16264 KB Output is correct
45 Correct 7 ms 15960 KB Output is correct
46 Correct 452 ms 43700 KB Output is correct
47 Correct 724 ms 59712 KB Output is correct
48 Correct 496 ms 42480 KB Output is correct
49 Correct 433 ms 44104 KB Output is correct
50 Correct 452 ms 43008 KB Output is correct
51 Correct 430 ms 44176 KB Output is correct
52 Correct 477 ms 43008 KB Output is correct
53 Correct 245 ms 41348 KB Output is correct
54 Correct 550 ms 45760 KB Output is correct
55 Correct 494 ms 44100 KB Output is correct
56 Correct 431 ms 42288 KB Output is correct
57 Correct 180 ms 41796 KB Output is correct
58 Correct 821 ms 53000 KB Output is correct
59 Correct 153 ms 42232 KB Output is correct
60 Correct 6 ms 16024 KB Output is correct
61 Correct 476 ms 43576 KB Output is correct
62 Correct 803 ms 57072 KB Output is correct
63 Correct 465 ms 42632 KB Output is correct
64 Correct 487 ms 44092 KB Output is correct
65 Correct 503 ms 43080 KB Output is correct
66 Correct 491 ms 44092 KB Output is correct
67 Correct 483 ms 43072 KB Output is correct
68 Correct 247 ms 41348 KB Output is correct
69 Correct 556 ms 45700 KB Output is correct
70 Correct 445 ms 44624 KB Output is correct
71 Correct 433 ms 42588 KB Output is correct
72 Correct 186 ms 42236 KB Output is correct
73 Correct 635 ms 51860 KB Output is correct
74 Correct 147 ms 43456 KB Output is correct