Submission #1221507

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221507		gry3125	Infinite Race (EGOI24_infiniterace2)	C++20	63 / 100	40 ms	1864 KiB

Main

#include <bits/stdc++.h>
#define f0r(i,n) for(int i=0;i<n;i++)
typedef long long int ll; 
using namespace std;

int main() {
    int n, q; cin >> n >> q;
    map<int,int> idx; int mx = 0;
    vector<int> cnt(n, -1), cur(n);
    while (q--) {
        int a; cin >> a;
        if (cur[abs(a)] == 0) {
            if (a > 0) cur[abs(a)] = 1;
            else cur[abs(a)] = -1;
            cnt[abs(a)] = max(mx, cnt[abs(a)]+1);
            mx = cnt[abs(a)];
            continue;
        }
        if (cur[abs(a)] == 1 && a > 0) {
            cnt[a] = max(mx, cnt[abs(a)]+1);
            mx = cnt[abs(a)];
        }
        if (a > 0) cur[abs(a)] = 1;
        else cur[abs(a)] = -1;
    }
    cout << mx;
    return 0;
}

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