# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235165 | Dakto | Infinite Race (EGOI24_infiniterace2) | C++20 | 0 ms | 400 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
map<int,int> m;
for(int i=0; i<k; i++){
int x;
cin>>x;
if(x>0){
m[x]++;
}
else{
m[x]--;
}
}
int res=0;
for(auto [k, v] : m){
res=max(res, v);
}
cout<<res << 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... |