oj.uz

Submission #628815

# Submission time Handle Problem Language Result Execution time Memory
628815 2022-08-13T17:33:10 Z vovamr Izbori (COCI22_izbori) C++17
40 / 110
 3000 ms 17992 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);
}

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);

	const int b = 1200;

	ve<int> p(n);
	for (int el = 0; el < sz(al); ++el) {
		if (sz(occ[el]) > b) {
			oset<int> st; st.insert(0);
			for (int i = 0; i < n; ++i) {
				p[i] = (a[i] == el ? 1 : -1);
				if (i) p[i] += p[i - 1];

				ans += st.order_of_key(p[i]);
				st.insert(p[i]);
			}
		}
		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 4 ms 4948 KB Output is correct
2 Correct 4 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 4956 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 13556 KB Output is correct
2 Correct 151 ms 15924 KB Output is correct
3 Correct 109 ms 11372 KB Output is correct
4 Correct 155 ms 16464 KB Output is correct
5 Correct 194 ms 16920 KB Output is correct
6 Correct 195 ms 17676 KB Output is correct
7 Correct 180 ms 17604 KB Output is correct
8 Correct 171 ms 17472 KB Output is correct
9 Correct 218 ms 17600 KB Output is correct
10 Correct 191 ms 17604 KB Output is correct
11 Correct 162 ms 17544 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 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 4956 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 6 ms 5076 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 6 ms 5076 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 5 ms 5076 KB Output is correct
15 Correct 4 ms 5076 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 4 ms 5076 KB Output is correct
18 Correct 122 ms 13556 KB Output is correct
19 Correct 151 ms 15924 KB Output is correct
20 Correct 109 ms 11372 KB Output is correct
21 Correct 155 ms 16464 KB Output is correct
22 Correct 194 ms 16920 KB Output is correct
23 Correct 195 ms 17676 KB Output is correct
24 Correct 180 ms 17604 KB Output is correct
25 Correct 171 ms 17472 KB Output is correct
26 Correct 218 ms 17600 KB Output is correct
27 Correct 191 ms 17604 KB Output is correct
28 Correct 162 ms 17544 KB Output is correct
29 Correct 207 ms 17520 KB Output is correct
30 Correct 16 ms 6488 KB Output is correct
31 Correct 32 ms 7824 KB Output is correct
32 Correct 87 ms 10984 KB Output is correct
33 Correct 33 ms 7988 KB Output is correct
34 Correct 34 ms 8128 KB Output is correct
35 Correct 23 ms 7148 KB Output is correct
36 Correct 20 ms 6332 KB Output is correct
37 Correct 18 ms 6644 KB Output is correct
38 Correct 353 ms 17768 KB Output is correct
39 Correct 323 ms 17764 KB Output is correct
40 Correct 362 ms 17764 KB Output is correct
41 Correct 331 ms 17776 KB Output is correct
42 Correct 367 ms 17776 KB Output is correct
43 Correct 693 ms 17876 KB Output is correct
44 Correct 701 ms 17744 KB Output is correct
45 Correct 797 ms 17876 KB Output is correct
46 Correct 794 ms 17872 KB Output is correct
47 Correct 677 ms 17876 KB Output is correct
48 Correct 551 ms 17628 KB Output is correct
49 Correct 569 ms 17576 KB Output is correct
50 Execution timed out 3091 ms 17992 KB Time limit exceeded
51 Halted 0 ms 0 KB -