oj.uz

Submission #1099325

# Submission time Handle Problem Language Result Execution time Memory
1099325 2024-10-11T07:34:22 Z dmn223 Infinite Race (EGOI24_infiniterace2) C++17
0 / 100
 35 ms 1876 KB 
#include <bits/stdc++.h>
using namespace std;
map<int,int>m;
int n, q, x, r = -1e9;
bool a[200001], b[200001];
int main()
{
    cin >> n >> q;
    while(q--)
    {
        cin >> x;
        if(x > 0)
        {
            if(a[x] == true)
            {
                m[x + 200000]++;
                r = max(r, m[x + 200000]);
            }
            else a[x] = true;
        }
        else
        {

                m[-x]--;
                r = max(r, m[-x]);

        }
    }
    cout << r;
    return 0;
}

Subtask #1
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 18 ms 832 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 444 KB Output is correct
5 Correct 35 ms 1876 KB Output is correct
6 Incorrect 1 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -