| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1214921 | jhe | Team Coding (EGOI24_teamcoding) | C++20 | 37 ms | 6984 KiB |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int p[100000];
vector<int> child[100000];
signed main() {
cin >> n >> k;
vector<int> colour(n);
for (int i = 0; i < n; i++) cin >> colour[i];
for (int i = 1; i < n; i++) {
cin >> p[i];
child[p[i]].push_back(i);
}
vector<int> freq(k,0);
int ans = 0;
for (int i = n-1; i >= 0; i--) {
freq[colour[i]]++;
ans = max(ans, freq[colour[i]]);
}
cout << ans << " " << 0 << "\n";
} | # | 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... | ||||
