oj.uz

Submission #1099330

# Submission time Handle Problem Language Result Execution time Memory
1099330 2024-10-11T07:46:37 Z dmn223 Infinite Race (EGOI24_infiniterace2) C++14
0 / 100
 86 ms 9728 KB 
#include <bits/stdc++.h>
using namespace std;
map<int,int>m;
int n, q, x, r;
int a[200001], b[200001];
int main()
{
    cin >> n >> q;
    while(q--)
    {
        cin >> x;
        if(x > 0)
        {
            m[x]++;
            if(m[x] > 1)
            {
                a[x]++;
                r = max(r, a[x]);
            }
        }
    }
    cout << r;
    return 0;
}

Subtask #1
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 22 ms 860 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 18 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 86 ms 9728 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 19 ms 448 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Incorrect 0 ms 356 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 22 ms 860 KB Output isn't correct
5 Halted 0 ms 0 KB -