Submission #1272696

#TimeUsernameProblemLanguageResultExecution timeMemory
1272696_hlod_Infinite Race (EGOI24_infiniterace2)C++20
100 / 100
49 ms1340 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin>>n;
    int q;
    cin>>q;
    vector<int>last(n,-1);
    int ans=0;
    int l=-1;
    for (int i=0;i<q;i++)
    {
        int x;
        cin>>x;
        if (x>0 && last[abs(x)-1]>=l && last[abs(x)-1]!=-1)
         {
             ans++;
             l=i;
         }
        if (x>0)
            last[x-1]=i;
        else
             last[-x-1]=-1;
    }
    cout<<ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...