oj.uz

Submission #1020870

# Submission time Handle Problem Language Result Execution time Memory
1020870 2024-07-12T10:38:44 Z Onur_Ilgaz Izbori (COCI22_izbori) C++17
110 / 110
 679 ms 104176 KB 
#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;

struct segtree {
	int n;
	vector <int> sum, lazy, tri;
	vector <array<int, 3> > updates;
	void init(int size) {
		n = size;
		sum.resize(n * 8);
		lazy.resize(n * 8);
		tri.resize(n * 8);
	}
	inline void push(int v, int l, int r) {
		if(!lazy[v]) return;
		int m = (l + r) / 2;
		int lz = lazy[v];
		lazy[v] = 0;
		int sz = (m - l + 1);
		sum[v * 2] += lz * sz;
		tri[v * 2] += lz * sz * (sz + 1) / 2;
		lazy[v * 2] += lz;
		sz = (r - m);
		sum[v * 2 + 1] += lz * sz;
		tri[v * 2 + 1] += lz * sz * (sz + 1) / 2;
		lazy[v * 2 + 1] += lz;
	}
	void update(int l, int r, int val) {
		l += n / 2, r += n / 2;
		updates.push_back({l, r, val});
		return range_upd(1, 1, n, l, r, val);
	}
	void range_upd(int v, int l, int r, int ul, int ur, int val) {
		if(l >= ul and r <= ur) {
			lazy[v] += val;
			int sz = (r - l + 1);
			sum[v] += val * sz;
			tri[v] += val * sz * (sz + 1) / 2;
			return;
		}
		push(v, l, r);
		int m = (l + r) / 2;
		if(ul <= m) {
			range_upd(v * 2, l, m, ul, ur, val);
		}
		if(ur > m) {
			range_upd(v * 2 + 1, m + 1, r, ul, ur, val);
		}
		sum[v] = sum[v * 2] + sum[v * 2 + 1];
		tri[v] = tri[v * 2] + tri[v * 2 + 1] + (m - l + 1) * sum[v * 2 + 1];
	}

	int normquery(int l) {
		l += n / 2;
		int ret = triquery(1, 1, n, l + 1, n).second;
		return ret;
	}
	int mega_brain_query(int l, int r) {
		int ret = normquery(r);
		l += n / 2, r += n / 2;
		int sz = r - l + 1;
		ret *= sz;
  		return ret + triquery(1, 1, n, l + 1, r).first;
	}
	pair<int, int> triquery(int v, int l, int r, int ql, int qr) {
		if(l >= ql and r <= qr) {
			return {tri[v], sum[v]};
		}
		push(v, l, r);
		int m = (l + r) / 2;
		pair<int, int> ret = {0, 0};
		if(ql <= m) {
			auto tmp = triquery(v * 2, l, m, ql, qr);
			ret = tmp;
		}
		if(qr > m) {
			int lsize = max(0ll, m - max(ql, l) + 1);
			auto tmp = triquery(v * 2 + 1, m + 1, r, ql, qr);
			ret.first += tmp.first + lsize * tmp.second;
			ret.second += tmp.second;
		}
		return ret;
	}
	void reverse_updates() {
		for(auto [l, r, val]:updates) {
			range_upd(1, 1, n, l, r, -val);
		}
		updates.clear();
	}
}t;

int32_t main(){
	fast
	int n;
	cin >> n;
	vector <int> arr(n);
	for(int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	auto compress = [&](vector <int> &a) {
		vector <pair<int, int> > v(a.size());
		for(int i = 0; i < n; i++) {
			v[i] = {a[i], i};
		}
		sort(v.begin(), v.end());
		for(int i = 0, ind = 0; i < n; i++) {
			if(i and v[i].first != v[i - 1].first) ind++;
			a[v[i].second] = ind;
		}
	};
	compress(arr);
	vector <vector<int> > val(n, vector<int>(1, -1));
	for(int i = 0; i < n; i++) {
		val[arr[i]].push_back(i);
	}
	t.init(n * 2);
	int ans = 0, color = 0;
	for(auto &it:val) {
		if(it.size() == 1) continue;
		vector <int> comp(1), pre;
		for(int i = 1; i < it.size(); i++) {
			int l = it[i - 1] + 1;
			if(-(it[i] - l)) comp.push_back(-(it[i] - l));
			comp.push_back(1);
		}
		if(it.back() != n - 1) comp.push_back(-(n - it.back() - 1));
		int prev = 0;
		for(int i = 0; i < comp.size(); i++) {
			pre.push_back(prev += comp[i]);
		}

		int m = comp.size();
 		for(int i = m - 1; i > 0; i--) {
			if(pre[i] < pre[i - 1]) {
				int r = pre[i - 1] - 1, l = pre[i];
				int huh = ans;
				ans += t.mega_brain_query(l + 1, r + 1);
				t.update(l, r, 1);
			}
			else {
				t.update(pre[i], pre[i], 1);
				ans += t.normquery(pre[i - 1]);
			}
		}
		t.reverse_updates();
	}
	cout << ans;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:124:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |   for(int i = 1; i < it.size(); i++) {
      |                  ~~^~~~~~~~~~~
Main.cpp:131:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |   for(int i = 0; i < comp.size(); i++) {
      |                  ~~^~~~~~~~~~~~~
Main.cpp:139:9: warning: unused variable 'huh' [-Wunused-variable]
  139 |     int huh = ans;
      |         ^~~
Main.cpp:120:15: warning: unused variable 'color' [-Wunused-variable]
  120 |  int ans = 0, color = 0;
      |               ^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 612 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 612 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 3 ms 1368 KB Output is correct
12 Correct 4 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 4 ms 1372 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 67532 KB Output is correct
2 Correct 215 ms 86704 KB Output is correct
3 Correct 120 ms 52120 KB Output is correct
4 Correct 207 ms 94256 KB Output is correct
5 Correct 216 ms 96916 KB Output is correct
6 Correct 235 ms 102576 KB Output is correct
7 Correct 242 ms 102676 KB Output is correct
8 Correct 266 ms 102424 KB Output is correct
9 Correct 233 ms 102640 KB Output is correct
10 Correct 222 ms 102680 KB Output is correct
11 Correct 152 ms 103956 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 612 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 3 ms 1368 KB Output is correct
12 Correct 4 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 4 ms 1372 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 155 ms 67532 KB Output is correct
19 Correct 215 ms 86704 KB Output is correct
20 Correct 120 ms 52120 KB Output is correct
21 Correct 207 ms 94256 KB Output is correct
22 Correct 216 ms 96916 KB Output is correct
23 Correct 235 ms 102576 KB Output is correct
24 Correct 242 ms 102676 KB Output is correct
25 Correct 266 ms 102424 KB Output is correct
26 Correct 233 ms 102640 KB Output is correct
27 Correct 222 ms 102680 KB Output is correct
28 Correct 152 ms 103956 KB Output is correct
29 Correct 180 ms 104176 KB Output is correct
30 Correct 151 ms 17156 KB Output is correct
31 Correct 286 ms 34468 KB Output is correct
32 Correct 679 ms 84684 KB Output is correct
33 Correct 306 ms 36700 KB Output is correct
34 Correct 317 ms 38480 KB Output is correct
35 Correct 191 ms 24824 KB Output is correct
36 Correct 106 ms 15064 KB Output is correct
37 Correct 156 ms 18308 KB Output is correct
38 Correct 266 ms 96220 KB Output is correct
39 Correct 281 ms 96084 KB Output is correct
40 Correct 257 ms 96276 KB Output is correct
41 Correct 343 ms 96528 KB Output is correct
42 Correct 271 ms 96300 KB Output is correct
43 Correct 345 ms 93524 KB Output is correct
44 Correct 308 ms 93316 KB Output is correct
45 Correct 336 ms 93200 KB Output is correct
46 Correct 295 ms 93456 KB Output is correct
47 Correct 333 ms 93720 KB Output is correct
48 Correct 393 ms 90196 KB Output is correct
49 Correct 436 ms 90284 KB Output is correct
50 Correct 373 ms 91152 KB Output is correct
51 Correct 413 ms 91152 KB Output is correct
52 Correct 482 ms 89976 KB Output is correct
53 Correct 442 ms 89624 KB Output is correct
54 Correct 417 ms 90084 KB Output is correct