| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351339 | mxhrvs | Infinite Race (EGOI24_infiniterace2) | C++20 | 129 ms | 23856 KiB |
#include<bits/stdc++.h>
using namespace std;
map<int,bool> mp[(int)2e5 + 5];
signed main(){
int n,k,x;
cin >> n >> k;
int cnt = 0;
for(int i = 1; i <= k; i ++){
cin >> x;
if(x < 0) {
mp[cnt][-x] = 0;
}
else if(mp[cnt][x]){
cnt ++;
}
mp[cnt][x] = 1;
}
cout << cnt << "\n";
}| # | 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... | ||||
