| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351359 | trigon | Infinite Race (EGOI24_infiniterace2) | C++20 | 1094 ms | 1192 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> ahead(n,false);
int q;
cin >> q;
int ans=0;
while(q--){
int x;
cin >> x;
if(x>0){
if(ahead[x]==true){
ans+=1;
for(int i=0;i<n;i++){
ahead[i]=false;}
}
ahead[x]=true;
}
else{
ahead[-x]=false;
}
}
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... | ||||
