제출 #1172628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172628		ezzzay	Team Coding (EGOI24_teamcoding)	C++20	23 / 100	4107 ms	527880 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=3e5;
vector<int>v[N];
int lvl[N];
int col[N];
map<int,int>cnt[N];
int par[N];
vector<pair<int,int>>vc[N];
pair<int,int>ans;
bool vis[N];
bool ld[N];
void df(int a ){
    if(vis[col[a]]==0){
        ld[a]=1;
    }
    vis[col[a]]=1;
    cnt[lvl[a]][col[a]]++;
    for(auto b:v[a]){
        lvl[b]=lvl[a]+1;
        df(b);
    }
}
void dfs(int a ){
    pair<int,int>t={1,0};
    int c=col[a];
    unordered_map<int,int>mp,pm;
    int h=0;
    vc[a].pb({lvl[a],col[a]});
    for(auto b:v[a]){
        dfs(b);
        if(v[b].size()>v[a].size()){
            swap(v[b],v[a]);
        }
        for(auto p:vc[b]){
            vc[a].pb(p);
            
            h=max(h,p.ff);
            if(p.ss==c){
                mp[p.ff]++;
            }
            else{
                pm[p.ff]++;
            }
            
           
        }
    }
    for(int i=lvl[a]+1; i<=h;i++){
        t.ff+=mp[i];
        t.ff+=min(pm[i],(cnt[i][c]-mp[i]));
        t.ss-=min(pm[i],(cnt[i][c]-mp[i]));
    }
    ans=max(ans,t);
}

signed main(){
    int n,k;
    cin>>n>>k;
    int mx=0;
    for(int i=0;i<n;i++){
        cin>>col[i];
    }
    for(int i=1;i<n;i++){
        cin>>par[i];
        v[par[i]].pb(i);
    }
    df(0);
    dfs(0);
    cout<<ans.ff<<" "<<-ans.ss<<endl;
    
}

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