Submission #1223797

#TimeUsernameProblemLanguageResultExecution timeMemory
1223797asli_bgTeam Coding (EGOI24_teamcoding)C++20
12 / 100
17 ms13896 KiB
#include<bits/stdc++.h>
using namespace std;

#define sp <<' '<<
#define se second
#define fi first
#define pb push_back

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define DEBUG(x) cout<<#x sp x<<endl

#define mid (l+r)/2

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;

const int MAXN=2e5+5;

int n,k;
vi a;

int p[MAXN];

vi adj[MAXN];

int say[MAXN];

pii ans;

void dfs(int nd,int ata){
    for(auto kom:adj[nd]){
        if(kom==ata) continue;
        dfs(kom,nd);
    }

    say[a[nd]]++;
    if(ans.fi<say[a[nd]]){
        ans={say[a[nd]],0};
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    
    cin>>n>>k;
    a.resize(n+1);
    FORE(i,1,n+1) cin>>a[i];

    FORE(i,2,n+1){
        cin>>p[i];
        p[i]++;
        adj[p[i]].pb(i);
    }

    ans={1,0};
    dfs(1,-1);

    cout<<ans.fi sp ans.se<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...