oj.uz

Submission #865187

# Submission time Handle Problem Language Result Execution time Memory
865187 2023-10-24T06:23:15 Z LittleOrange Designated Cities (JOI19_designated_cities) C++17
39 / 100
 264 ms 55632 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct obj{
    ll to,c0,c1;// to, back
};
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    ll n,q;
    cin >> n;
    vector<vector<obj>> con(n);
    ll tot = 0;
    for(ll i = 1;i<n;i++){
        ll a,b,c,d;
        cin >> a >> b >> c >> d;a--;b--;
        con[a].push_back({b,c,d});
        con[b].push_back({a,d,c});
        tot += c+d;
    }
    ll leaf_cnt = 0;
    for(auto &o : con) if (o.size()==1) leaf_cnt++;
    cin >> q;
    bool use16 = true;
    if (n<=16&&use16){
        vector<ll> ans(n+1,tot);
        //vector<ll> ch(n+1,0);
        ll cur = tot;
        vector<vector<ll>> used(n,vector<ll>(n,0));
        function<void(ll,ll)> dfs;
        dfs = [&](ll i, ll p){
            for(obj l : con[i]){
                if (l.to!=p){
                    if (!used[i][l.to]){
                        used[i][l.to] = 1;
                        cur -= l.c1;
                    }
                    dfs(l.to,i);
                }
            }
        };
        for(ll x = 1;x<(1<<n);x++){
            cur = tot;
            for(ll i = 0;i<n;i++) for(ll j = 0;j<n;j++) used[i][j] = 0;
            ll lvl = __builtin_popcountll(x);
            for(ll i = 0;i<n;i++) if(x>>i&1) dfs(i,-1);
            //if (cur<ans[lvl]) ch[lvl] = x;
            ans[lvl] = min(ans[lvl],cur);
        }
        while(q--){
            ll e;
            cin >> e;
            cout << ans[e] << "\n";
            //for(ll i = 0;i<n;i++) cout << (ch[e]>>i&1);
            //cout << "\n";
        }
        return 0;
    }
    vector<ll> dp(n,0);
    {
        function<ll(ll,ll)> dfs;
        dfs = [&](ll i, ll p){
            ll cur = 0;
            for(obj l : con[i]){
                if (l.to!=p){
                    cur += l.c1 + dfs(l.to,i);
                }
            }
            return cur;
        };
        dp[0] = dfs(0,-1);
    }
    {
        function<void(ll,ll,ll)> dfs;
        dfs = [&](ll i, ll p, ll v){
            dp[i] = v;
            for(obj l : con[i]){
                if (l.to!=p){
                    dfs(l.to,i,v+l.c0-l.c1);
                }
            }
        };
        dfs(0,-1,dp[0]);
    }
    ll ans_1 = tot;
    for(ll i : dp) ans_1 = min(tot-i,ans_1);
    ll ans_2 = tot, tg0=-1,tg1=-1;
    vector<ll> go(n,0),ch(n,0),tg(n,0);
    {
        function<void(ll,ll)> dfs;
        dfs = [&](ll i, ll p){
            tg[i] = i;
            ll de = 0;
            for(obj l : con[i]){
                if (l.to!=p){
                    dfs(l.to,i);
                    go[i] += go[l.to]+l.c0;
                    if (go[l.to]+l.c0 - ch[l.to]>de) tg[i] = tg[l.to];
                    de = max(de,go[l.to]+l.c0 - ch[l.to]);
                }
            }
            ch[i] = go[i] - de;
        };
        dfs(0,-1);
    }
    {
        function<void(ll,ll,ll)> dfs;
        dfs = [&](ll i, ll p, ll v){
            ll w = v;
            for(obj l : con[i]){
                if (l.to!=p){
                    w += go[l.to]+l.c0;
                }
            }
            ll a = 0,b = 0,t0=-1,t1=-1;
            for(obj l : con[i]){
                if (l.to!=p){
                    dfs(l.to,i,w-(go[l.to]+l.c0)+l.c1);
                    ll cur = go[l.to]+l.c0 - ch[l.to];
                    if (cur>=a){
                        t1 = t0;
                        t0 = tg[l.to];
                        b = a;
                        a = cur;
                    }else if(cur>=b){
                        t1 = tg[l.to];
                        b = cur;
                    }
                }
            }
            if (t1!=-1){
                if (w-a-b<ans_2){
                    tg0 = t0;
                    tg1 = t1;
                }
                ans_2 = min(ans_2, w-a-b);
            }else if (p==-1){
                if (w-a<ans_2){
                    tg0 = t0;
                    tg1 = i;
                }
                ans_2 = min(ans_2, w-a);
            }
        };
        dfs(0,-1, 0);
    }
    //cout << "tgs: " << tg0+1 << " " << tg1+1 << "\n";
    vector<ll> ans(n+1,-1);
    ans[1] = ans_1;
    ans[2] = ans_2;
    for(ll i = leaf_cnt;i<=n;i++) ans[i] = 0;
    if (n<=2000){
        vector<ll> pre(n,-1), tag(n,0);
        {
            function<void(ll,ll)> dfs;
            dfs = [&](ll i, ll p){
                pre[i] = p;
                for(obj l : con[i]){
                    if (l.to!=p){
                        dfs(l.to,i);
                    }
                }
            };
            dfs(tg0,-1);
        }
        {
            ll cur = tg1;
            tag[cur] = 1;
            while(cur != tg0){
                cur = pre[cur];
                tag[cur] = 1;
            }
        }
        ll it = 3;
        while(it<=leaf_cnt){
            vector<ll> h(n,0);
            ll cur = 0, value = 0, cur_ans = 0;
            function<void(ll,ll)> dfs;
            dfs = [&](ll i, ll v){
                h[i] = tag[i]?0:v;
                for(obj l : con[i]){
                    if (l.to!=pre[i]){
                        dfs(l.to,l.c0+h[i]);
                        if (!tag[l.to]) cur_ans += l.c0;
                    }
                }
                if (h[i]>value){
                    value = h[i];
                    cur = i;
                }
            };
            dfs(tg0,0);
            ans[it-1] = cur_ans;
            tag[cur] = 1;
            while(cur != tg0){
                cur = pre[cur];
                tag[cur] = 1;
            }
            it++;
        }
    }
    while(q--){
        ll e;
        cin >> e;
        cout << ans[e] << "\n";
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 67 ms 348 KB Output is correct
3 Correct 74 ms 348 KB Output is correct
4 Correct 63 ms 432 KB Output is correct
5 Correct 64 ms 428 KB Output is correct
6 Correct 66 ms 348 KB Output is correct
7 Correct 71 ms 348 KB Output is correct
8 Correct 65 ms 344 KB Output is correct
9 Correct 62 ms 348 KB Output is correct
10 Correct 71 ms 436 KB Output is correct
11 Correct 61 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 232 ms 26056 KB Output is correct
3 Correct 258 ms 51540 KB Output is correct
4 Correct 182 ms 26192 KB Output is correct
5 Correct 184 ms 26032 KB Output is correct
6 Correct 200 ms 29524 KB Output is correct
7 Correct 143 ms 24836 KB Output is correct
8 Correct 264 ms 52196 KB Output is correct
9 Correct 100 ms 23804 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 224 ms 25916 KB Output is correct
3 Correct 262 ms 55632 KB Output is correct
4 Correct 184 ms 25940 KB Output is correct
5 Correct 189 ms 25836 KB Output is correct
6 Correct 209 ms 30276 KB Output is correct
7 Correct 100 ms 24068 KB Output is correct
8 Correct 243 ms 42324 KB Output is correct
9 Correct 106 ms 24060 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 67 ms 348 KB Output is correct
3 Correct 74 ms 348 KB Output is correct
4 Correct 63 ms 432 KB Output is correct
5 Correct 64 ms 428 KB Output is correct
6 Correct 66 ms 348 KB Output is correct
7 Correct 71 ms 348 KB Output is correct
8 Correct 65 ms 344 KB Output is correct
9 Correct 62 ms 348 KB Output is correct
10 Correct 71 ms 436 KB Output is correct
11 Correct 61 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 25 ms 760 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 24 ms 824 KB Output is correct
16 Correct 24 ms 604 KB Output is correct
17 Correct 24 ms 604 KB Output is correct
18 Correct 24 ms 604 KB Output is correct
19 Correct 24 ms 604 KB Output is correct
20 Correct 26 ms 600 KB Output is correct
21 Correct 24 ms 600 KB Output is correct
22 Correct 25 ms 860 KB Output is correct
23 Correct 27 ms 600 KB Output is correct
24 Correct 39 ms 604 KB Output is correct
25 Correct 10 ms 1112 KB Output is correct
26 Correct 43 ms 796 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 232 ms 26056 KB Output is correct
3 Correct 258 ms 51540 KB Output is correct
4 Correct 182 ms 26192 KB Output is correct
5 Correct 184 ms 26032 KB Output is correct
6 Correct 200 ms 29524 KB Output is correct
7 Correct 143 ms 24836 KB Output is correct
8 Correct 264 ms 52196 KB Output is correct
9 Correct 100 ms 23804 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 224 ms 25916 KB Output is correct
12 Correct 262 ms 55632 KB Output is correct
13 Correct 184 ms 25940 KB Output is correct
14 Correct 189 ms 25836 KB Output is correct
15 Correct 209 ms 30276 KB Output is correct
16 Correct 100 ms 24068 KB Output is correct
17 Correct 243 ms 42324 KB Output is correct
18 Correct 106 ms 24060 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Incorrect 228 ms 25960 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 67 ms 348 KB Output is correct
3 Correct 74 ms 348 KB Output is correct
4 Correct 63 ms 432 KB Output is correct
5 Correct 64 ms 428 KB Output is correct
6 Correct 66 ms 348 KB Output is correct
7 Correct 71 ms 348 KB Output is correct
8 Correct 65 ms 344 KB Output is correct
9 Correct 62 ms 348 KB Output is correct
10 Correct 71 ms 436 KB Output is correct
11 Correct 61 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 232 ms 26056 KB Output is correct
14 Correct 258 ms 51540 KB Output is correct
15 Correct 182 ms 26192 KB Output is correct
16 Correct 184 ms 26032 KB Output is correct
17 Correct 200 ms 29524 KB Output is correct
18 Correct 143 ms 24836 KB Output is correct
19 Correct 264 ms 52196 KB Output is correct
20 Correct 100 ms 23804 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 224 ms 25916 KB Output is correct
23 Correct 262 ms 55632 KB Output is correct
24 Correct 184 ms 25940 KB Output is correct
25 Correct 189 ms 25836 KB Output is correct
26 Correct 209 ms 30276 KB Output is correct
27 Correct 100 ms 24068 KB Output is correct
28 Correct 243 ms 42324 KB Output is correct
29 Correct 106 ms 24060 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 25 ms 760 KB Output is correct
32 Correct 2 ms 856 KB Output is correct
33 Correct 24 ms 824 KB Output is correct
34 Correct 24 ms 604 KB Output is correct
35 Correct 24 ms 604 KB Output is correct
36 Correct 24 ms 604 KB Output is correct
37 Correct 24 ms 604 KB Output is correct
38 Correct 26 ms 600 KB Output is correct
39 Correct 24 ms 600 KB Output is correct
40 Correct 25 ms 860 KB Output is correct
41 Correct 27 ms 600 KB Output is correct
42 Correct 39 ms 604 KB Output is correct
43 Correct 10 ms 1112 KB Output is correct
44 Correct 43 ms 796 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Incorrect 228 ms 25960 KB Output isn't correct
47 Halted 0 ms 0 KB -