oj.uz

Submission #973142

# Submission time Handle Problem Language Result Execution time Memory
973142 2024-05-01T14:27:37 Z bachhoangxuan Road Closures (APIO21_roads) C++17
12 / 100
 241 ms 62300 KB 
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
const ll inf = 1e18;

struct Segtree{
    int sz;
    vector<ll> tree;
    vector<int> cnt;
    vector<pii> com;
    Segtree(){}
    void add(pii val){
        com.push_back(val);
    }
    void build(int l,int r,int id){
        if(l==r){
            tree[id]=com[l-1].fi;
            cnt[id]=1;
            return;
        }
        int mid=(l+r)>>1;
        build(l,mid,id<<1);build(mid+1,r,id<<1|1);
        tree[id]=tree[id<<1]+tree[id<<1|1];
        cnt[id]=cnt[id<<1]+cnt[id<<1|1];
    }
    void update(int l,int r,int id,int p){
        if(l==r){
            tree[id]=cnt[id]=0;
            return;
        }
        int mid=(l+r)>>1;
        if(p<=mid) update(l,mid,id<<1,p);
        else update(mid+1,r,id<<1|1,p);
        tree[id]=tree[id<<1]+tree[id<<1|1];
        cnt[id]=cnt[id<<1]+cnt[id<<1|1];
    }
    ll query(int l,int r,int id,int k){
        if(l==r) return (k>=1)*tree[id];
        int mid=(l+r)>>1;
        if(cnt[id<<1]<k) return tree[id<<1]+query(mid+1,r,id<<1|1,k-cnt[id<<1]);
        else return query(l,mid,id<<1,k);
    }
    void build(){
        sort(com.begin(),com.end(),greater<pii>());
        sz=(int)com.size();
        tree.assign(4*sz,0);
        cnt.assign(4*sz,0);
        build(1,sz,1);
    }
    void del(pii x){
        int pos=lower_bound(com.begin(),com.end(),x,greater<pii>())-com.begin()+1;
        update(1,sz,1,pos);
    }
    ll query(int k){
        return query(1,sz,1,k);
    }
};

std::vector<ll> minimum_closure_costs(int N, vector<int> U,
                                             vector<int> V,
                                             vector<int> W) {
    vector<ll> res(N),total(N);
    vector<vector<pii>> edge(N),adj(N);
    vector<vector<int>> pos(N);
    vector<Segtree> ST(N);
    vector<bool> add(N,false),vis(N,false);

    for(int i=0;i<N-1;i++){
        edge[U[i]].push_back({V[i],W[i]});
        edge[V[i]].push_back({U[i],W[i]});
    }
    for(int i=0;i<N;i++){
        pos[(int)edge[i].size()].push_back(i);
        for(auto [v,w]:edge[i]) ST[i].add({w,v}),total[i]+=w;
        ST[i].build();
    }
    vector<int> cc;
    vector<array<ll,2>> dp(N);
    for(int k=N-1;k>=0;k--){
        for(int u:pos[k]){
            cc.push_back(u);
            for(auto [v,w]:edge[u]){
                total[v]-=w;
                ST[v].del({w,u});
                if(add[v]){
                    adj[u].push_back({v,w});
                    adj[v].push_back({u,w});
                }
            }
            add[u]=true;
        }
        function<void(int)> dfs = [&](int u){
            int C=0;vis[u]=true;
            dp[u][0]=dp[u][1]=inf;
            ll num=total[u];
            vector<ll> val;
            for(auto [v,w]:adj[u]){
                if(vis[v]){C=w;continue;}
                dfs(v);num+=dp[v][0];
                if(dp[v][0]>dp[v][1]) val.push_back(dp[v][0]-dp[v][1]);
            }
            sort(val.begin(),val.end(),greater<ll>());
            for(int i=0;i<=(int)val.size();i++){
                ll cur=num;
                if(i) cur-=val[i-1];
                if(i<=k) dp[u][0]=min(dp[u][0],cur-ST[u].query(k-i)+C);
                if(i<k) dp[u][1]=min(dp[u][1],cur-ST[u].query(k-1-i));
            }
        };
        for(int u:cc) vis[u]=false;
        for(int u:cc) if(!vis[u]){
            dfs(u);
            res[k]+=min(dp[u][0],dp[u][1]);
        }
    }
    return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 3 ms 1372 KB Output is correct
4 Correct 2 ms 1372 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 1112 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 75 ms 28552 KB Output is correct
13 Correct 142 ms 47208 KB Output is correct
14 Correct 134 ms 42308 KB Output is correct
15 Correct 144 ms 46632 KB Output is correct
16 Correct 170 ms 47196 KB Output is correct
17 Correct 130 ms 47428 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 113 ms 43076 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 91 ms 51660 KB Output is correct
3 Correct 103 ms 58312 KB Output is correct
4 Correct 115 ms 62300 KB Output is correct
5 Correct 110 ms 62156 KB Output is correct
6 Correct 2 ms 1368 KB Output is correct
7 Correct 2 ms 1624 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 62 ms 37328 KB Output is correct
13 Correct 105 ms 62160 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 95 ms 56000 KB Output is correct
16 Correct 117 ms 62140 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 241 ms 43392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 241 ms 43392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 3 ms 1372 KB Output is correct
4 Correct 2 ms 1372 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 1112 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 75 ms 28552 KB Output is correct
13 Correct 142 ms 47208 KB Output is correct
14 Correct 134 ms 42308 KB Output is correct
15 Correct 144 ms 46632 KB Output is correct
16 Correct 170 ms 47196 KB Output is correct
17 Correct 130 ms 47428 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 113 ms 43076 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 91 ms 51660 KB Output is correct
22 Correct 103 ms 58312 KB Output is correct
23 Correct 115 ms 62300 KB Output is correct
24 Correct 110 ms 62156 KB Output is correct
25 Correct 2 ms 1368 KB Output is correct
26 Correct 2 ms 1624 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 62 ms 37328 KB Output is correct
32 Correct 105 ms 62160 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 95 ms 56000 KB Output is correct
35 Correct 117 ms 62140 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Incorrect 1 ms 348 KB Output isn't correct
40 Halted 0 ms 0 KB -