Submission #1099331

#TimeUsernameProblemLanguageResultExecution timeMemory
1099331dmn223Infinite Race (EGOI24_infiniterace2)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>
using namespace std;
map<int,int>m;
int n, q, x, r;
int a[200001], b[200001];
int main()
{
    cin >> n >> q;
    while(q--)
    {
        cin >> x;
        m[x]++;
        if(m[x] > 1)
        {
            r = max(r, m[x]);
        }
        
    }
    cout << r;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...