oj.uz

Submission #628827

# Submission time Handle Problem Language Result Execution time Memory
628827 2022-08-13T17:55:39 Z vovamr Izbori (COCI22_izbori) C++17
110 / 110
 1133 ms 11292 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }
 
const int N = 2e5 + 10;
int a[N]; ll ans = 0;
ve<int> occ[N];
 
inline static ll F(const int &l, const int &r) { return (l + r) * 1ll * (r - l + 1) / 2ll; }
inline void cnt(const int &l1, const int &r1, 
		const int &l2, const int &r2,
		const int &C) {
	int R = min(r2, r1 + C - 1);
	int L = max(l2, l1 + C);
	ans += max(0, R - l2 + 1) * 1ll * (r1 + 1);
	ans -= l1 * 1ll * max(0, min(R, l1 + C - 1) - l2 + 1);
	ans += max(0, R - L + 1) * 1ll * C;
	if (L <= R) ans -= F(L + 1, R + 1);
}
 
const int Z = 2e5 + 5;
const int M = 4e5 + 10; int f[M];
inline void upd(int i, int x) { i += 2 + Z; for (; i < M; i += i & -i) f[i] += x; }
inline int get(int i) { i += 2 + Z; int ans = 0; for (; i; i -= i & -i){ans+=f[i];} return ans; }
 
inline void solve() {
	int n;
	cin >> n;
	ve<int> al;
	for (int i = 0; i < n; ++i) cin >> a[i], al.pb(a[i]);
	sort(all(al)), al.erase(unique(all(al)), al.end());
	for (int i = 0; i < n; ++i) a[i] = lower_bound(all(al), a[i]) - al.begin();
	for (int i = 0; i < n; ++i) occ[a[i]].pb(i);
 
	int b = 0;
	{
		ll s1 = 0;
		ll c = n * (31 - __builtin_ctz(n));
 
		ve<int> hui;
		for (int i = 0; i < sz(al); ++i) hui.pb(sz(occ[i]));
		sort(all(hui));

		ll opt = c * 1ll * sz(hui);
		for (int i = 0; i < sz(hui); ) {
			int j = i;
			while (j < sz(hui) && hui[j] == hui[i]) {
				s1 += hui[j] * 1ll * hui[j];
				++j;
			}
 
			if (chmin(opt, s1 + (sz(hui) - j) * 1ll * c)) {
				b = hui[i];
			}
			i = j;
		}
	}
 
	ve<int> p(n);
	for (int el = 0; el < sz(al); ++el) {
		if (sz(occ[el]) > b) {
			for (int i = 0; i < n; ++i) {
				p[i] = (a[i] == el ? 1 : -1);
				if (i) p[i] += p[i - 1];
				ans += get(p[i] - 1) + (p[i] > 0);
				upd(p[i], +1);
			}
			for (int i = 0; i < n; ++i) upd(p[i], -1);
		}
		else {
			for (int l = 0; l < sz(occ[el]); ++l) {
				for (int r = l; r < sz(occ[el]); ++r) {
					int r1 = occ[el][l] - 1, l1 = (!l ? -1 : occ[el][l - 1]);
					int l2 = occ[el][r], r2 = (r + 1 == sz(occ[el]) ? n - 1 : occ[el][r + 1] - 1);
					cnt(l1, r1, l2, r2, 2 * (r - l + 1));
				}
			}
		}
	}
 
	cout << ans;
}
 
signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 4 ms 5076 KB Output is correct
16 Correct 4 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 7736 KB Output is correct
2 Correct 38 ms 7700 KB Output is correct
3 Correct 23 ms 6612 KB Output is correct
4 Correct 33 ms 8540 KB Output is correct
5 Correct 35 ms 8472 KB Output is correct
6 Correct 36 ms 8664 KB Output is correct
7 Correct 36 ms 8612 KB Output is correct
8 Correct 38 ms 8788 KB Output is correct
9 Correct 37 ms 8528 KB Output is correct
10 Correct 36 ms 8656 KB Output is correct
11 Correct 28 ms 9076 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 4 ms 5076 KB Output is correct
16 Correct 4 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 26 ms 7736 KB Output is correct
19 Correct 38 ms 7700 KB Output is correct
20 Correct 23 ms 6612 KB Output is correct
21 Correct 33 ms 8540 KB Output is correct
22 Correct 35 ms 8472 KB Output is correct
23 Correct 36 ms 8664 KB Output is correct
24 Correct 36 ms 8612 KB Output is correct
25 Correct 38 ms 8788 KB Output is correct
26 Correct 37 ms 8528 KB Output is correct
27 Correct 36 ms 8656 KB Output is correct
28 Correct 28 ms 9076 KB Output is correct
29 Correct 38 ms 9080 KB Output is correct
30 Correct 15 ms 6780 KB Output is correct
31 Correct 31 ms 8032 KB Output is correct
32 Correct 90 ms 11292 KB Output is correct
33 Correct 49 ms 8500 KB Output is correct
34 Correct 34 ms 8612 KB Output is correct
35 Correct 22 ms 7264 KB Output is correct
36 Correct 16 ms 6528 KB Output is correct
37 Correct 18 ms 6772 KB Output is correct
38 Correct 71 ms 9132 KB Output is correct
39 Correct 90 ms 9100 KB Output is correct
40 Correct 68 ms 9156 KB Output is correct
41 Correct 67 ms 9268 KB Output is correct
42 Correct 68 ms 9092 KB Output is correct
43 Correct 140 ms 9336 KB Output is correct
44 Correct 134 ms 9284 KB Output is correct
45 Correct 134 ms 9296 KB Output is correct
46 Correct 135 ms 9304 KB Output is correct
47 Correct 143 ms 9296 KB Output is correct
48 Correct 463 ms 8424 KB Output is correct
49 Correct 465 ms 8436 KB Output is correct
50 Correct 1133 ms 9552 KB Output is correct
51 Correct 1121 ms 10176 KB Output is correct
52 Correct 290 ms 9012 KB Output is correct
53 Correct 279 ms 8940 KB Output is correct
54 Correct 487 ms 9004 KB Output is correct