Submission #1231396

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231396		alexander707070	Prize (CEOI22_prize)	C++20	0 / 100	118 ms	82856 KiB

Main

#include<bits/stdc++.h>
#define MAXN 500007

using namespace std;

struct answer{
    long long d1,d2,e1,e2;
}ans[MAXN];

struct path{
    int lca,a,b;
    long long da,db;
}s[MAXN];

int n,k,q,T,p,rootv,rootw,a,b;
vector<int> v[MAXN],w[MAXN];

vector<int> tree[MAXN];

vector<int> sp,euler;
bool vis[MAXN];
int root,dep[MAXN],parent[MAXN];
int len[MAXN],par[MAXN];

long long val[MAXN],dist[MAXN],pref[MAXN];
pair<long long,long long> res[MAXN];
vector< pair<int,long long> > g[MAXN];

void dfs(int x,int p){

    len[x]=len[p]+1;
    par[x]=p;

    if(int(sp.size())<k){
        sp.push_back(x);
        vis[x]=true;
    }

    for(int i:v[x]){
        if(i==p)continue;
        dfs(i,x);
    }
}

int dfs2(int x,int p){

    vector<int> ch;
    for(int i:w[x]){
        int curr=dfs2(i,x);
        if(curr!=0)ch.push_back(curr);
    }

    if(!vis[x]){
        if(ch.empty())return 0;
        if(ch.size()==1)return ch[0];
    }

    for(int f:ch)tree[x].push_back(f);
    return x;
}

void dfs3(int x,int p){
    dep[x]=dep[p]+1;
    parent[x]=p;

    if(vis[x])euler.push_back(x);
    for(int i:tree[x])dfs3(i,x);
}

int lca(int x,int y){
    if(dep[x]<dep[y])swap(x,y);
    while(dep[x]>dep[y])x=parent[x];

    while(x!=y){
        x=parent[x];
        y=parent[y];
    }

    return x;
}

int lca2(int x,int y){
    if(len[x]<len[y])swap(x,y);
    while(len[x]>len[y])x=par[x];

    while(x!=y){
        x=par[x];
        y=par[y];
    }

    return x;
}

bool cmp(path fr,path sc){
    return dep[fr.lca] > dep[sc.lca];
}

void solve_up(int x,long long d){
    if(x==0)return;

    if(dist[x]==0){
        dist[x]=d; return;
    }

    solve_up(parent[x],d-dist[x]);
}

pair<long long,long long> dists(int x,int y){
    int xx=x,yy=y;

    long long s1=0,s2=0;

    if(len[x]<len[y])swap(x,y);
    while(len[x]>len[y]){
        x=par[x];
    }

    while(x!=y){
        x=par[x]; y=par[y];
    }

    s1=pref[xx]+pref[yy]-2*pref[x];
    x=xx; y=yy;

    if(dep[x]<dep[y])swap(x,y);
    while(dep[x]>dep[y]){
        s2+=dist[x];
        x=parent[x];
    }

    while(x!=y){
        s2+=dist[x]+dist[y];
        x=parent[x]; y=parent[y];
    }

    return {s1,s2};
}

void dfs4(int x,long long d){
    pref[x]=d;
    vis[x]=true;

    for(auto nxt:g[x]){
        if(vis[nxt.first])continue;
        dfs4(nxt.first,d+nxt.second);
    }
}

int main(){
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>k>>q>>T;

    for(int i=1;i<=n;i++){
        cin>>p;
        if(p!=-1)v[p].push_back(i);
        else rootv=i;
    }

    return 0;

    dfs(rootv,0);

    for(int i=1;i<=n;i++){
        cin>>p;
        if(p!=-1)w[p].push_back(i);
        else rootw=i;
    }

    root=dfs2(rootw,0);
    dfs3(root,0);

    for(int i:sp)cout<<i<<" ";
    cout<<"\n";
    for(int i=0;i<k-1;i++)cout<<"? "<<euler[i]<<" "<<euler[i+1]<<"\n";
    cout<<"!\n";

    cout<<flush;
    fflush(stdout);

    for(int i=0;i<k-1;i++){

        cin>>ans[i].d1>>ans[i].d2>>ans[i].e1>>ans[i].e2;
        s[i]={lca(euler[i],euler[i+1]),euler[i],euler[i+1],ans[i].e1,ans[i].e2};
    }

    sort(s,s+k-1,cmp);

    for(int i=0;i<k-1;i++){
        solve_up(s[i].a,s[i].da);
        solve_up(s[i].b,s[i].db);
    }

    for(int i=0;i<k-1;i++){
        int c=lca2(euler[i],euler[i+1]);

        g[c].push_back({euler[i],ans[i].d1});
        g[euler[i]].push_back({c,-ans[i].d1});

        g[c].push_back({euler[i+1],ans[i].d2});
        g[euler[i+1]].push_back({c,-ans[i].d2});
    }

    for(int i=1;i<=n;i++)vis[i]=false;
    dfs4(rootv,0);

    for(int i=1;i<=T;i++){
        cin>>a>>b;
        res[i]=dists(a,b);
    }

    for(int i=1;i<=T;i++){
        cout<<res[i].first<<" "<<res[i].second<<"\n";
    }

    cout<<flush;
    fflush(stdout);
    
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 19
• Subtask 4: 0 / 22
• Subtask 5: 0 / 24