oj.uz

Submission #1013378

# Submission time Handle Problem Language Result Execution time Memory
1013378 2024-07-03T13:23:01 Z GrindMachine Designated Cities (JOI19_designated_cities) C++17
23 / 100
 2000 ms 35044 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);
ll in_sum;

void dfs1(ll u, ll p){
    farthest[u] = {0,u};
    for(auto [v,x,y] : adj[u]){
        if(v == p) conts;
        in_sum += y;
        dfs1(v,u);
        auto px = farthest[v];
        px.ff += x;
        leaf_add[px.ss] += x;
        amax(farthest[u],px);
    }
}

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

    vector<ll> ans(n+5);

    rep1(i,n){
        rep1(j,n){
            farthest[j] = {0,j};
            leaf_add[j] = 0;
        }
        in_sum = 0;

        dfs1(i,-1);
        
        vector<ll> ord;
        rep1(j,n){
            ord.pb(leaf_add[j]);
        }

        sort(rall(ord));
        ll pick = 1;
        amax(ans[pick],in_sum);
        ll cost = in_sum;

        trav(x,ord){
            pick++;
            cost += x;
            amax(ans[pick],cost);
        }
    }

    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 2 ms 9816 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9816 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 2 ms 9868 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 3 ms 9816 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Execution timed out 2095 ms 34532 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Execution timed out 2085 ms 35044 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9816 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 2 ms 9868 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 3 ms 9816 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 3 ms 9816 KB Output is correct
13 Correct 118 ms 10076 KB Output is correct
14 Correct 91 ms 10072 KB Output is correct
15 Correct 123 ms 10080 KB Output is correct
16 Correct 137 ms 10100 KB Output is correct
17 Correct 133 ms 10084 KB Output is correct
18 Correct 121 ms 10108 KB Output is correct
19 Correct 115 ms 10084 KB Output is correct
20 Correct 119 ms 10076 KB Output is correct
21 Correct 120 ms 10072 KB Output is correct
22 Correct 135 ms 10076 KB Output is correct
23 Correct 126 ms 10076 KB Output is correct
24 Correct 142 ms 10076 KB Output is correct
25 Correct 101 ms 10072 KB Output is correct
26 Correct 144 ms 10076 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Execution timed out 2095 ms 34532 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9816 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 2 ms 9868 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 3 ms 9816 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 2 ms 9816 KB Output is correct
13 Execution timed out 2095 ms 34532 KB Time limit exceeded
14 Halted 0 ms 0 KB -