# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1148236 | Jawad_Akbar_JJ | Infinite Race (EGOI24_infiniterace2) | C++20 | 59 ms | 1204 KiB |
#include <iostream>
using namespace std;
int Pos[200005];
int main(){
int n, m, cur = 1, x, Ans = 0;
cin>>n>>m;
for (int i=1;i<=m;i++){
cin>>x;
if (x < 0)
Pos[-x] = 0;
else{
if (Pos[x] == cur)
Ans++, cur++;
Pos[x] = cur;
}
}
cout<<Ans<<'\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... |