oj.uz

Submission #768179

# Submission time Handle Problem Language Result Execution time Memory
768179 2023-06-27T16:28:37 Z green_gold_dog Sequence (APIO23_sequence) C++17
35 / 100
 1174 ms 74568 KB 
#include "sequence.h"

#include <bits/stdc++.h>

using namespace std;

typedef int ll;

ll sequence(ll n, vector<ll> a) {
	if (n <= 2000) {
		ll ans = 1;
		for (ll i = 0; i < n; i++) {
			unordered_map<ll, ll> col;
			multiset<ll> now1, now2;
			now2.insert(a[i]);
			col[a[i]]++;
			for (ll j = i + 1; j < n; j++) {
				if (a[j] <= *now2.begin()) {
					now1.insert(a[j]);
				} else {
					now2.insert(a[j]);
				}
				col[a[j]]++;
				while (now1.size() < now2.size()) {
					now1.insert(*now2.begin());
					now2.erase(now2.begin());
				}
				while (now1.size() > now2.size()) {
					now2.insert(*now1.rbegin());
					now1.erase(now1.find(*now1.rbegin()));
				}
				if (ans < col[*now2.begin()]) {
					ans = col[*now2.begin()];
				}
				if (now1.size() == now2.size()) {
					if (ans < col[*now1.rbegin()]) {
						ans = col[*now1.rbegin()];
					}
				}
			}
		}
		return ans;
	} else {
		ll ans = 1;
		ll lst = -1, c = 0;
		for (auto i : a) {
			if (i == lst) {
				c++;
			} else {
				if (ans < c) {
					ans = c;
				}
				lst = i;
				c = 1;
			}
		}
		if (ans < c) {
			ans = c;
		}
		map<ll, ll> col, fir, last;
		for (ll i = 0; i < n; i++) {
			col[a[i]]++;
			last[a[i]] = i;
		}
		for (ll i = n - 1; i >= 0; i--) {
			fir[a[i]] = i;
		}
		for (auto i : a) {
			ll cb = last[i] - fir[i] + 1 - col[i];
			ll cm = n - cb - col[i];
			if (cm + col[i] >= cb) {
				if (ans < col[i]) {
					ans = col[i];
				}
			}
		}
		return ans;
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 493 ms 468 KB Output is correct
14 Correct 482 ms 480 KB Output is correct
15 Correct 344 ms 340 KB Output is correct
16 Correct 339 ms 384 KB Output is correct
17 Correct 339 ms 388 KB Output is correct
18 Correct 427 ms 468 KB Output is correct
19 Correct 489 ms 440 KB Output is correct
20 Correct 468 ms 440 KB Output is correct
21 Correct 483 ms 340 KB Output is correct
22 Correct 476 ms 432 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 395 ms 48736 KB Output is correct
3 Correct 484 ms 48840 KB Output is correct
4 Correct 44 ms 4184 KB Output is correct
5 Correct 462 ms 44120 KB Output is correct
6 Correct 369 ms 44104 KB Output is correct
7 Correct 60 ms 4176 KB Output is correct
8 Correct 59 ms 4180 KB Output is correct
9 Correct 42 ms 4180 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 48 ms 4204 KB Output is correct
3 Incorrect 51 ms 4172 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

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

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 493 ms 468 KB Output is correct
14 Correct 482 ms 480 KB Output is correct
15 Correct 344 ms 340 KB Output is correct
16 Correct 339 ms 384 KB Output is correct
17 Correct 339 ms 388 KB Output is correct
18 Correct 427 ms 468 KB Output is correct
19 Correct 489 ms 440 KB Output is correct
20 Correct 468 ms 440 KB Output is correct
21 Correct 483 ms 340 KB Output is correct
22 Correct 476 ms 432 KB Output is correct
23 Incorrect 102 ms 7920 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 493 ms 468 KB Output is correct
14 Correct 482 ms 480 KB Output is correct
15 Correct 344 ms 340 KB Output is correct
16 Correct 339 ms 384 KB Output is correct
17 Correct 339 ms 388 KB Output is correct
18 Correct 427 ms 468 KB Output is correct
19 Correct 489 ms 440 KB Output is correct
20 Correct 468 ms 440 KB Output is correct
21 Correct 483 ms 340 KB Output is correct
22 Correct 476 ms 432 KB Output is correct
23 Correct 395 ms 48736 KB Output is correct
24 Correct 484 ms 48840 KB Output is correct
25 Correct 44 ms 4184 KB Output is correct
26 Correct 462 ms 44120 KB Output is correct
27 Correct 369 ms 44104 KB Output is correct
28 Correct 60 ms 4176 KB Output is correct
29 Correct 59 ms 4180 KB Output is correct
30 Correct 42 ms 4180 KB Output is correct
31 Correct 48 ms 4204 KB Output is correct
32 Incorrect 51 ms 4172 KB Output isn't correct
33 Halted 0 ms 0 KB -