Submission #1148301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148301		SyedSohaib_123	Infinite Race (EGOI24_infiniterace2)	C++20	100 / 100	79 ms	19012 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define append push_back
#define int long long

const int N=2e5+10,LG=21;
int mod=998244353;

int cnt[N],tot[N],bk[N],x[N];

void solve(int tst){
    int n,q;
    cin>>n>>q;
    int ans=0;
    for(int i=1;i<n;i++) cnt[i]=bk[i]=0;
    int last=0;
    map<int,int>seen;
    for(int i=1;i<=q;i++){
        int a;cin>>a;
        if(a<0){
            a=-a;
            x[a]=bk[a];
            seen[a]=0;
            bk[a]=0;
            tot[a]+=max(0ll,cnt[a]),ans=max(ans,tot[a]);
            cnt[a]=0;
        }
        else{
            if(seen[a]){
                seen.clear();
                ans++;
            }
            seen[a]=1;
        }
    }
    // for(int i=1;i<n;i++) tot[i]+=max(0ll,cnt[i]),ans=max(ans,tot[i]);
    cout<<ans<<endl;
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    // cin >> t;
    for(int i=1;i<=t;i++)
        solve(i);
}

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