oj.uz

Submission #1047120

# Submission time Handle Problem Language Result Execution time Memory
1047120 2024-08-07T09:05:13 Z EntityPlantt Infinite Race (EGOI24_infiniterace2) C++17
0 / 100
 10 ms 1880 KB 
#include <iostream>
using namespace std;

const int N = 2e5 + 5;
int cnt[N], mx[N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, q, x;
	cin >> n >> q;
	while (q--) {
		cin >> x;
		if (x < 0) cnt[-x] = max(0, cnt[-x] - 1);
		else mx[x] = max(mx[x], cnt[x]++);
	}
	x = 0;
	for (int i = 1; i < n; i++) x = max(x, mx[i]);
	cout << x;
	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 0 ms 348 KB Output is correct
4 Incorrect 8 ms 468 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 1 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 10 ms 1880 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 6 ms 348 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 348 KB Output is correct
4 Incorrect 0 ms 348 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 0 ms 348 KB Output is correct
4 Incorrect 8 ms 468 KB Output isn't correct
5 Halted 0 ms 0 KB -