| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1240946 | aren_dance | Team Coding (EGOI24_teamcoding) | C++20 | 33 ms | 1092 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N=5e5;
int c[N];
int pref[N];
int main()
{
int n,k;cin>>n>>k;
int x;
for(int i=0;i<n;++i){
cin>>c[i];
}
for(int i=1;i<n;++i){
cin>>x;
}
int answ=0;
for(int i=n-1;i>=0;--i){
pref[c[i]]++;
answ=max(answ,pref[c[i]]);
}
cout<<answ<<" "<<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... | ||||
