oj.uz

Submission #878356

# Submission time Handle Problem Language Result Execution time Memory
878356 2023-11-24T08:35:57 Z Mr_Ph Paths (RMI21_paths) C++17
100 / 100
 385 ms 30888 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
ll mod=(ll)1e9+7;
ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
vector<vector<pair<int,int>>>adj;
int n,k;
int length[200002];
pair<int,int> ans[2][200002];
pair<int,int>dfs(int node,int parent,int w)
{
    // cout<<"HI"<<endl;
    pair<int,int>xd= {0,0};
    for(auto i:adj[node])
    {
        if(i.first==parent)
            continue;
        pair<int,int>mx=dfs(i.first,node,i.second);
        // mx.first+=w;
        pair<int,int>mx1=mx;
        mx1=ans[0][i.first];
        mx1.first+=i.second;
        if(mx>ans[0][node])
            ans[1][node]=ans[0][node],ans[0][node]=mx1;
        else
            ans[1][node]=max(mx1,ans[1][node]);
        xd=max(xd,mx);
    }
    if(adj[node].sz==1)
    {
        length[node]=w;
        ans[0][node]= {0,node};
        return {w,node};
    }
    length[ans[0][node].second]+=w;
    xd.first+=w;
    //ans[0][node].first+=w;
    return xd;
}
ordered_set<pair<int,int>>st;
int lol;
int fans[200002];
void re(int x)
{
    int pog=st.order_of_key({length[x],x});
    if(pog>=k)lol-=length[x];
    st.erase({length[x],x});
}
void add(int x,bool del)
{
    st.insert({length[x],x});
    int pog=st.order_of_key({length[x],x});
    if(del){
        if(pog>=k)
            lol+=length[x];
        else lol+=(*st.find_by_order(k)).first;
    }
    else{
        if(pog>=k)
        {
            lol+=length[x];
            if(k>0)
            lol-=(*st.find_by_order(k-1)).first;
        }
    }
}
void dfs1(int node,int parent,int w,pair<int,int>prv)
{
    if(parent!=0){
    prv.first+=w;
    int pog=st.order_of_key({length[ans[0][node].second],ans[0][node].second});
    re(ans[0][node].second);
    length[ans[0][node].second]-=w;
    add(ans[0][node].second,pog>=k);
    fans[node]=lol;
    }
    for(auto i:adj[node])
    {
        if(i.first==parent)continue;
        pair<int,int>nxt=prv;
        if(ans[0][i.first].second==ans[0][node].second)
            nxt=max(ans[1][node],nxt);
        else nxt=max(ans[0][node],nxt);
        int pog=st.order_of_key({length[nxt.second],nxt.second});
        re(nxt.second);
        length[nxt.second]+=i.second;
        add(nxt.second,pog>=k);
        dfs1(i.first,node,i.second,nxt);
        pog=st.order_of_key({length[nxt.second],nxt.second});
        re(nxt.second);
        length[nxt.second]-=i.second;
        add(nxt.second,pog>=k);
    }
    if(parent!=0){
    int pog=st.order_of_key({length[ans[0][node].second],ans[0][node].second});
    re(ans[0][node].second);
    length[ans[0][node].second]+=w;
    add(ans[0][node].second,pog>=k);
    }
}
void preprocess() {}
void solve()
{
    cin>>n>>k;
    adj.resize(n+1);
    for(int i=0; i<n-1; i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    dfs(1,0,0);
    for(int i=1; i<=n; i++)
        st.insert({length[i],i});
    int cnt=0;
    k=max(0ll,(int)st.sz-k);
    for(auto i:st)
    {
        if(cnt>=k)
            lol+=i.first;
        cnt++;
    }
      fans[1]=lol;
    dfs1(1,0,0,{0,0});
    for(int i=1;i<=n;i++)cout<<fans[i]<<endl;
}
signed main()
{
    // freopen("meta_game_input.txt","r",stdin);
    // freopen("otput.txt","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 3 ms 6744 KB Output is correct
10 Correct 3 ms 6800 KB Output is correct
11 Correct 3 ms 6748 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 3 ms 6744 KB Output is correct
10 Correct 3 ms 6800 KB Output is correct
11 Correct 3 ms 6748 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 5 ms 6744 KB Output is correct
14 Correct 5 ms 7004 KB Output is correct
15 Correct 5 ms 6896 KB Output is correct
16 Correct 5 ms 6748 KB Output is correct
17 Correct 5 ms 6748 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 5 ms 6748 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 25888 KB Output is correct
2 Correct 349 ms 29116 KB Output is correct
3 Correct 315 ms 25808 KB Output is correct
4 Correct 366 ms 25792 KB Output is correct
5 Correct 355 ms 27092 KB Output is correct
6 Correct 347 ms 25696 KB Output is correct

Subtask #6
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 3 ms 6744 KB Output is correct
10 Correct 3 ms 6800 KB Output is correct
11 Correct 3 ms 6748 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 5 ms 6744 KB Output is correct
14 Correct 5 ms 7004 KB Output is correct
15 Correct 5 ms 6896 KB Output is correct
16 Correct 5 ms 6748 KB Output is correct
17 Correct 5 ms 6748 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 5 ms 6748 KB Output is correct
20 Correct 385 ms 25888 KB Output is correct
21 Correct 349 ms 29116 KB Output is correct
22 Correct 315 ms 25808 KB Output is correct
23 Correct 366 ms 25792 KB Output is correct
24 Correct 355 ms 27092 KB Output is correct
25 Correct 347 ms 25696 KB Output is correct
26 Correct 372 ms 26192 KB Output is correct
27 Correct 348 ms 29012 KB Output is correct
28 Correct 354 ms 30032 KB Output is correct
29 Correct 311 ms 26016 KB Output is correct
30 Correct 345 ms 26216 KB Output is correct
31 Correct 332 ms 25424 KB Output is correct
32 Correct 345 ms 27472 KB Output is correct
33 Correct 354 ms 26196 KB Output is correct
34 Correct 313 ms 26196 KB Output is correct
35 Correct 379 ms 26024 KB Output is correct
36 Correct 331 ms 30888 KB Output is correct