This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int n,k;
vi paths[2010];
int type[2010];
int level[2010];
vi colors[2010];
int children[2010][2010];
int children2[2010][2010];
void dfs1(int pos,int height){
level[pos] = height;
for(int a:paths[pos]){
dfs1(a,height+1);
}
}
void dfs(int pos,int head){
if(type[pos] == type[head]){
children2[head][pos] = 1;
}else{
children[head][level[pos]] ++;
}
for(int a:paths[pos]){
dfs(a,head);
}
}
void solve()
{
cin >> n >> k;
FOR(i,0,n)cin >> type[i];
FOR(i,0,n)colors[type[i]].pb(i);
FOR(i,1,n){
int a;cin >> a;
paths[a].pb(i);
}
dfs1(0,0);
FOR(i,0,n){
FOR(j,0,n){
children2[i][j] = 0;
children[i][j] = 0;
}
}
// FOR(i,0,n)cout << level[i] << " ";
// cout << endl;
int ans = 0,cnt = 0;
FOR(i,0,n){
dfs(i,i);
int temp = 0,temp_cnt = 0;
for(int a:colors[type[i]]){
if(children2[i][a]){
temp += 1;
}else{
if(children[i][level[a]] > 0){
children[i][level[a]]--;
temp_cnt ++;
temp += 1;
}
}
}
// cout << i << " " << temp << " " << temp_cnt << endl;
if(ans < temp){
ans = temp;
cnt = temp_cnt;
}else if(ans == temp){
cnt = min(cnt,temp_cnt);
}
}
cout << ans << " " << cnt << endl;
}
int main()
{
fastIO();
// init("test");
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
Compilation message (stderr)
Main.cpp: In function 'void init(std::string)':
Main.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
44 | freopen((name + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
45 | freopen((name + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |