Submission #1274890

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274890		Robert_junior	Infinite Race (EGOI24_infiniterace2)	C++20	29 / 100	135 ms	19220 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back  
#define all(x) x.begin(), x.end()
#define ins insert
#define F first
#define S second
const int N = 2e5 + 7, mod = 998244353;
void solve(){
	int n, q;
	cin>>n>>q;
	set<int>s, t;
	int ans = 0;
	for(int i = 1; i < n; i++){
	    s.ins(i);
	}
	for(int i = 1; i <= q; i++){
	    int x;
	    cin>>x;
	    if(x > 0){
	        if(s.find(x) != s.end()){
	            s.erase(s.find(x));
	            t.ins(x);
	        }
	        else{
	            for(auto it : t) s.ins(it);
	            t.clear();
	            if(s.find(x) != s.end()) s.erase(x);
	            ans++;
	        }
	    }
	    else{
	        s.ins(-x);
	    }
	}
	cout<<ans;
}
signed main(){
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
    //freopen("pieaters.in", "r", stdin);
    //freopen("pieaters.out", "w", stdout);
    int t = 1;
    //cin>>t;
    while(t--){
        solve();
    }
}

• Subtask 1: 29 / 29
• Subtask 2: 0 / 34
• Subtask 3: 0 / 22
• Subtask 4: 0 / 15