| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1148489 | Ghulam_Junaid | Team Coding (EGOI24_teamcoding) | C++20 | 57 ms | 3912 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int a[n], par[n];
for (int i = 0; i < n; i ++)
cin >> a[i];
for (int i = 1; i < n; i ++)
cin >> par[i];
int mx = 0;
map<int, int> cnt;
for (int i = n - 1; i >= 0; i --){
cnt[a[i]]++;
mx = max(mx, cnt[a[i]]);
}
cout << mx << " 0" << endl;
}| # | 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... | ||||
