| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1221517 | gry3125 | Team Coding (EGOI24_teamcoding) | C++20 | 60 ms | 4168 KiB |
#include <bits/stdc++.h>
#define f0r(i,n) for(int i=0;i<n;i++)
typedef long long int ll;
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int> la(n), b(n);
for (int i = 0; i < n; i++) cin >> la[i];
for (int i = 1; i < n; i++) cin >> b[i];
map<int,int> cnt; int mx = 0;
for (int i = n-1; i >= 0; i--) {
cnt[la[i]]++; mx = max(mx, cnt[la[i]]);
}
cout << mx << " " << 0;
return 0;
}| # | 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... | ||||
