제출 #1356545

#제출 시각아이디문제언어결과실행 시간메모리
1356545sallyTeam Coding (EGOI24_teamcoding)C++20
12 / 100
25 ms1584 KiB
#include<iostream>
#include<vector>
using namespace std;
const int mx = 1e5+5;
vector<int> p(mx);
vector<int> lan(mx);
vector<int> col(mx, 0);
int N, K;
int main() {
    cin>>N>>K;
    for(int i=0; i<N; i++) {cin>>lan[i]; col[lan[i]]++;}
    for(int i=1; i<N; i++) cin>>p[i];
    p[0] = -1;
    int ans = 0;
    for(int i=0; i<N; i++) ans = max(ans, col[i]);
    cout<<ans<<' '<<0;
}
#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...