Submission #1173611

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173611		imarn	Team Coding (EGOI24_teamcoding)	C++20	100 / 100	195 ms	107412 KiB

Main

#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define t3 tuple<int,int,int>
#define sz(x) (ll)x.size()
#define cd complex<double>
using namespace std;
const int mxn=1e5+5,K=320;
vector<int>g[mxn],dc[mxn],cc[mxn];
vector<pii>dcc[mxn];
int d[mxn]{0},ti[mxn]{0},to[mxn]{0},cu=0,cnt[mxn]{0},c[mxn],sz[mxn]{0},dp[mxn]{0};
int fw[mxn]{0},ans[mxn]{0},ans2[mxn]{0};
void add(int i,int amt){
    for(;i<mxn;i+=i&-i)fw[i]+=amt;
}
int qr(int i,int rs=0){
    for(;i;i-=i&-i)rs+=fw[i];
    return rs;
}
bool ok[mxn]{0};
void dfs(int u){
    ti[u]=++cu;
    if(!cnt[c[u]])ok[u]=1;
    cnt[c[u]]++;
    for(auto v:g[u]){
        d[v]=d[u]+1;dfs(v);
    }to[u]=cu;cnt[c[u]]--;
    dc[c[u]].pb(d[u]);
}
deque<int>dq[mxn];
void sol1(int u){
    for(auto v:g[u]){
        sol1(v);
        if(dq[v].size()>dq[u].size())swap(dq[v],dq[u]);
        for(int j=0;j<dq[v].size();j++)dq[u][j]+=dq[v][j];
        while(!dq[v].empty())dq[v].pop_back();
    }
    if(sz[c[u]]<K&&ok[u]){
        for(auto [dep,val]:dcc[c[u]]){
            if(dep>d[u]&&dep<=dq[u].size()+d[u]){
                ans2[u]+=min(val,dq[u][dep-d[u]-1]);
            }
        }ans2[u]++;
    }dq[u].push_front(1);
}
void dfs2(int u){
    for(auto v:g[u]){
        sol1(v);
        if(dq[v].size()>dq[u].size())swap(dq[v],dq[u]);
        for(int j=0;j<dq[v].size();j++)dq[u][j]+=dq[v][j];
        while(!dq[v].empty())dq[v].pop_back();
    }dq[u].push_front(1);
}
void sol2(int i){
    memset(dp,0,sizeof dp);
    for(auto [dep,val] : dcc[i])dp[dep]=val;
    for(auto u : cc[i]){
        if(!ok[u])continue;
        dfs2(u);
        for(int j=1;j<dq[u].size();j++)ans2[u]+=min(dp[d[u]+j],dq[u][j]);
        while(!dq[u].empty())dq[u].pop_back();
        ans2[u]++;
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,k;cin>>n>>k;
    for(int i=0;i<n;i++)cin>>c[i],sz[c[i]]++,cc[c[i]].pb(i);
    for(int i=1;i<=n-1;i++){
        int x;cin>>x;g[x].pb(i);
    }
    dfs(0);
    for(int i=0;i<k;i++){
        sort(all(dc[i]));
        if(dc[i].empty())continue;
        int mem=dc[i][0],cur=0;
        for(auto it:dc[i]){
            if(it==mem)cur++;
            else {dcc[i].pb({mem,cur});cur=1;mem=it;}
        }dcc[i].pb({mem,cur});
    }
    for(int i=0;i<k;i++){
        for(auto it : cc[i])add(ti[it],1);
        for(auto it : cc[i])ans[it]=qr(to[it])-qr(ti[it]-1);
        for(auto it : cc[i])add(ti[it],-1);
    }sol1(0);while(!dq[0].empty())dq[0].pop_back();
    for(int i=0;i<k;i++){
        if(sz[i]>=K)sol2(i);
    }
    int rs1=0,rs2=0;
    for(int i=0;i<n;i++){
        if(ans2[i]>rs1)rs1=ans2[i],rs2=ans2[i]-ans[i];
        else if(rs1==ans2[i])rs2=min(rs2,ans2[i]-ans[i]);
    }cout<<rs1<<' '<<rs2;
}

• Subtask 1: 12 / 12
• Subtask 2: 19 / 19
• Subtask 3: 27 / 27
• Subtask 4: 23 / 23
• Subtask 5: 19 / 19