Submission #1308467

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308467		ender_shayan	Designated Cities (JOI19_designated_cities)	C++20	23 / 100	2096 ms	54856 KiB

designated_cities

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;

ll inf=1e18;
const int N=1<<18,L=21,bs=701,NN=1e6;
int n,m,k,q,par[N],parw[N],st[N],en[N],t,pos[N],l,tt=20;
vector<pii>g[N];
ll seg[N*2],lz[N*2];
ll ans;
ll anss[N],dp[N];
ll mx;
vector<int>nod;
inline void shift(int l,int r,int v){
    if(r-l==1 || lz[v]==0)return;
    int mid=(l+r)>>1;
    seg[v<<1]+=lz[v];
    seg[v<<1|1]+=lz[v];
    lz[v<<1]+=lz[v];
    lz[v<<1|1]+=lz[v];
    lz[v]=0;
}
inline void build(int l=1,int r=n+1,int v=1){
    seg[v]=0;lz[v]=0;
    if(r-l==1)return;
    int mid=(l+r)>>1;
    build(l,mid,v<<1);
    build(mid,r,v<<1|1);
}
inline void upd(int lx,int rx,int x,int l=1,int r=n+1,int v=1){
    if(lx>=r || rx<=l)return;
    if(lx<=l && r<=rx){
        seg[v]+=x;
        lz[v]+=x;
        return;
    }
    shift(l,r,v);
    int mid=(l+r)>>1;
    upd(lx,rx,x,l,mid,v<<1);
    upd(lx,rx,x,mid,r,v<<1|1);
    seg[v]=max(seg[v<<1],seg[v<<1|1]);
}
inline int get(int l=1,int r=n+1,int v=1){
    if(r-l==1)return l;
    shift(l,r,v);
    int mid=(l+r)>>1;
    if(seg[v<<1]>seg[v<<1|1])return get(l,mid,v<<1);
    return get(mid,r,v<<1|1);
}
void dfs(int v){
    st[v]=++t;pos[t]=v;
    for(pii p:g[v])if(p.F!=par[v]){
        int u=p.F;
        par[u]=v;
        parw[u]=p.S;
        ans+=p.S;
        dfs(u);
        upd(st[u],en[u]+1,p.S);
    }
    en[v]=t;
}
void DFS(int v,int p=0){
    st[v]=++t;pos[t]=v;
    for(pii pp:g[v])if(pp.F!=p){
        DFS(pp.F,v);
        dp[v]+=dp[pp.F]+pp.S;
        upd(st[pp.F],en[pp.F]+1,pp.S);
    }
    en[v]=t;
}
void DFSS(int v,int p=0,ll wp=0){
    if(p!=0)
        dp[v]=wp;
    for(pii pp:g[v])if(pp.F==p){
        dp[v]+=pp.S;
        upd(1,n+1,pp.S);
        upd(st[v],en[v]+1,-pp.S);
    }
    if(dp[v]-seg[1]<mx){
        mx=dp[v]-seg[1];
        nod.clear();
    }
    if(mx==dp[v]-seg[1])nod.pb(v);
    for(pii pp:g[v])if(pp.F!=p){
        upd(st[pp.F],en[pp.F]+1,-pp.S);
        DFSS(pp.F,v,dp[v]-pp.S);
        upd(st[pp.F],en[pp.F]+1,pp.S);
    }
    for(pii pp:g[v])if(pp.F==p){
        upd(1,n+1,-pp.S);
        upd(st[v],en[v]+1,pp.S);
    }
}
int main(){
    fast_io
    cin>>n;
    for1(n-1){
        int u,v,c,d;cin>>u>>v>>c>>d;
        g[u].pb({v,c});
        g[v].pb({u,d});
    }
    for1(n)k+=(g[i].size()==1);
    mx=inf;
    DFS(1);
    DFSS(1);
    for1(k)anss[i]=inf;
    anss[2]=mx;
    for1(n)anss[1]=min(anss[1],dp[i]);
    for(int root:nod){
        build();t=0;ans=0;
        par[root]=0;
        dfs(root);
        anss[1]=min(anss[1],ans);
        for(int j=2;j<=k;j++){
            int v=get();
            ll w=seg[1];
            ans-=w;
            v=pos[v];
            while(w!=0){
                upd(st[v],en[v]+1,-parw[v]);
                w-=parw[v];
                v=par[v];
            }
            anss[j]=min(anss[j],ans);
        }
        tt--;
        if(tt==0)break;
    }
    cin>>q;
    while(q--){
        int x;cin>>x;
        cout<<anss[min(x,k)]<<endl;
    }




}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 17 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44