| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1240750 | aren_dance | Infinite Race (EGOI24_infiniterace2) | C++20 | 32 ms | 580 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N=5e5;
int a[N];
bool fl[N];
int main()
{
int n,k;
cin>>n>>k;
int answ=0;
while(k--){
int x;
cin>>x;
if(x<0){
fl[-x]=0;
continue;
}
if(fl[x]==0){
fl[x]=1;
continue;
}
a[x]++;
}
for(int i=1;i<=n;++i){
answ=max(answ,a[i]);
}
cout<<answ;
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... | ||||
