Submission #1106517

#	Time	Username	Problem	Language	Result	Execution time	Memory
1106517		ASN49K	Petrol stations (CEOI24_stations)	C++14	100 / 100	2950 ms	72884 KiB

Main

#include <bits/stdc++.h>
#define int long long
//#warning("nu uita de clear la aint")
using namespace std;
using i64=long long;
#define UNUSED -1
#define all(x) x.begin(),x.end()
#define pb push_back
const int mod=1e9+7,inf=1e9+1;
const i64 INF=1e18;
mt19937 rng(69);
const int N=70'000;
namespace aint
{
    const i64 MAX_VAL=1LL*inf*N;
    struct node
    {
        i64 sum;
        node*l,*r;
        node()
        {
            sum=0;
            l=r=nullptr;
        }
    };
    node* root=nullptr;
    void clear(node*& t)
    {
        if(t==nullptr)
        {
            return;
        }
        clear(t->l);
        clear(t->r);
        delete t;
        t=nullptr;
    }
    void clear()
    {
        clear(root);
    }
    i64 get_val(node* t)
    {
        if(t==nullptr)
        {
            return 0;
        }
        return t->sum;
    }
    void update(node*& t,i64 st,i64 dr,i64 poz,i64 val)
    {
        if(t==nullptr)t=new node;
        t->sum+=val;
        if(st==dr)
        {
            return;
        }
        i64 m=(st+dr)/2;
        if(poz<=m)
        {
            update(t->l,st,m,poz,val);
        }
        else
        {
            update(t->r,m+1,dr,poz,val);
        }
    }
    i64 query(node*& t,i64 st,i64 dr,i64 l,i64 r)
    {
        if(t==nullptr || st>r || dr<l)
        {
            return 0;
        }
        if(l<=st && dr<=r)
        {
            return t->sum;
        }
        i64 m=(st+dr)/2;
        return query(t->l,st,m,l,r)+query(t->r,m+1,dr,l,r);
    }

    void update(i64 poz,i64 k)
    {
        update(root,0,MAX_VAL,poz,k);
    }
    i64 query(i64 l,i64 r)
    {
        return query(root,0,MAX_VAL,l,r);
    }
}
struct edge
{
    int to,cost;
};

int n,k;
vector<pair<int,int>>sk;
i64 sol[N],h[N];
int subtree[N],carry[N],comp[N];
vector<edge>adj[N];
bitset<N>viz;

void recalc_dfs(int nod,int tt)
{
    subtree[nod]=1;
    for(auto &v:adj[nod])
    {
        int c=v.to;
        if(c!=tt && !viz[c])
        {
            recalc_dfs(c,nod);
            subtree[nod]+=subtree[c];
        }
    }
}
int get_centroid(int nod,int tt,int goal)
{
    for(auto &v:adj[nod])
    {
        int c=v.to;
        if(c!=tt && !viz[c] && subtree[c]>=goal)
        {
            return get_centroid(c,nod,goal);
        }
    }
    return nod;
}
//sa fac functie recurstiva de insert
void go_up(int nod,int tt)
{
    if(sk.size()<=1)
    {
        comp[nod]=nod;
    }
    else
    {
        comp[nod]=comp[tt];
    }


    sk.push_back({h[nod],nod});
    carry[nod]=subtree[nod]=1;
    for(auto &v:adj[nod])
    {
        int c=v.to;
        if(c!=tt && !viz[c])
        {
            h[c]=h[nod]+v.cost;
            go_up(c,nod);
            subtree[nod]+=subtree[c];
        }
    }
    if(h[nod]>k)
    {
        //next_stop_up
        carry[lower_bound(all(sk) , (pair<int,int>){h[nod]-k,0})->second]+=carry[nod];
    }
    sk.pop_back();
}
void insert(int nod,int tt,int sign)
{
    if(h[nod]>k)
    {
        return;
    }
    aint::update(k-h[nod],sign*carry[nod]);
    for(auto &v:adj[nod])
    {
        int c=v.to;
        if(c!=tt && !viz[c])
        {
            insert(c,nod,sign);
        }
    }
}
void solve(int nod,int tt,int total)
{
    sol[nod]+=1LL*(total-subtree[comp[nod]])*(carry[nod]-1);
    for(auto &v:adj[nod])
    {
        int c=v.to;
        if(c!=tt && !viz[c])
        {
            if(nod==tt)
            {
                insert(c,nod,-1);
            }
            i64 coef=aint::query(h[nod],h[c]-1);
            sol[nod]+=coef*subtree[c];
            aint::update(h[nod]+k,coef);
            solve(c,nod,total);
            aint::update(h[nod]+k,-coef);
            if(nod==tt)
            {
                insert(c,nod,1);
            }
        }
    }
}

void decomp(int nod)
{
    recalc_dfs(nod,nod);
    nod=get_centroid(nod,nod,subtree[nod]/2);
    h[nod]=0;
    go_up(nod,nod);
    insert(nod,nod,1);
    solve(nod,nod,subtree[nod]);
    aint::clear();
    viz[nod]=true;
    for(auto &c:adj[nod])
    {
        if(!viz[c.to])
        {
            decomp(c.to);
        }
    }
}
main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i < n; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        adj[x].pb({y, z});
        adj[y].pb({x, z});
    }
    decomp(0);
    for (int i = 0; i < n; i++) {
        cout << sol[i] << '\n';
    }
}

Compilation message (stderr)

Main.cpp:219:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  219 | main() {
      | ^~~~

• Subtask 0: 0 / 0
• Subtask 1: 18 / 18
• Subtask 2: 8 / 8
• Subtask 3: 10 / 10
• Subtask 4: 12 / 12
• Subtask 5: 17 / 17
• Subtask 6: 35 / 35