oj.uz

답안 #1020853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020853 2024-07-12T10:30:39 Z vjudge1 Izbori (COCI22_izbori) C++17
110 / 110
 649 ms 106008 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;
		// for left
		int sz = (m - l + 1);
		sum[v * 2] += lz * sz;
		tri[v * 2] += lz * sz * (sz + 1) / 2;
		lazy[v * 2] += lz;
		// for right
		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});
		// cout << "update: " << l << " " << r << " " << val << "\n";
		return range_upd(1, 1, n, l, r, val);
	}
	void range_upd(int v, int l, int r, int ul, int ur, int val) {
		// cout << v << " " << l << " " << r << " " << ul << " " << ur << " " << val << endl;
		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;
		// cout << "query: " << l+1 << " = ";
		int ret = sumq(1, 1, n, l + 1, n);
		// cout << ret << ".\n";
		return ret;
	}
	int sumq(int v, int l, int r, int ql, int qr) {
		if(l >= ql and r <= qr) {
			return sum[v];
		}
		push(v, l, r);
		int m = (l + r) / 2;
		int ret = 0;
		if(ql <= m) {
			ret += sumq(v * 2, l, m, ql, qr);
		}
		if(qr > m) {
			ret += sumq(v * 2 + 1, m + 1, r, ql, qr);
		}
		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;
		// cout << "HEY: " << ret / sz << " " << l << " " << r << "\n";
  		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) {
			// cout << l - n / 2 << " " << r - n / 2 << " " << tri[v] << " " << sum[v] << "\n";
			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;
			// cout << m - n / 2 << " " << ql - n / 2 << " " << lsize << ". ";
		}
		// cout << l - n / 2 << " " << r - n / 2 << " " << ret.first << " " << ret.second << "\n";
		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) {
		// cout << color++ << ":\n";
		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);
				// cout << l << " " << r << " " << ans - huh << "\n";
				// if(l == -7 and r == -2) return 0;
				t.update(l, r, 1);
			}
			else {
				t.update(pre[i], pre[i], 1);
				ans += t.normquery(pre[i - 1]);
				// cout << pre[i] << " " << t.normquery(pre[i - 1]) << "\n";
			}
		}
		t.reverse_updates();
		// cout << "\n\n";
	}
	cout << ans;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:150: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]
  150 |   for(int i = 1; i < it.size(); i++) {
      |                  ~~^~~~~~~~~~~
Main.cpp:157: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]
  157 |   for(int i = 0; i < comp.size(); i++) {
      |                  ~~^~~~~~~~~~~~~
Main.cpp:165:9: warning: unused variable 'huh' [-Wunused-variable]
  165 |     int huh = ans;
      |         ^~~
Main.cpp:145:15: warning: unused variable 'color' [-Wunused-variable]
  145 |  int ans = 0, color = 0;
      |               ^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 604 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 2 ms 1260 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 3 ms 1368 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 2 ms 1372 KB Output is correct
17 Correct 1 ms 1256 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 67776 KB Output is correct
2 Correct 157 ms 86960 KB Output is correct
3 Correct 96 ms 52116 KB Output is correct
4 Correct 170 ms 94508 KB Output is correct
5 Correct 175 ms 97228 KB Output is correct
6 Correct 189 ms 103100 KB Output is correct
7 Correct 185 ms 102928 KB Output is correct
8 Correct 183 ms 102932 KB Output is correct
9 Correct 199 ms 102932 KB Output is correct
10 Correct 198 ms 102936 KB Output is correct
11 Correct 136 ms 104488 KB Output is correct

Subtask #4
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 2 ms 1260 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 3 ms 1368 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 2 ms 1372 KB Output is correct
17 Correct 1 ms 1256 KB Output is correct
18 Correct 119 ms 67776 KB Output is correct
19 Correct 157 ms 86960 KB Output is correct
20 Correct 96 ms 52116 KB Output is correct
21 Correct 170 ms 94508 KB Output is correct
22 Correct 175 ms 97228 KB Output is correct
23 Correct 189 ms 103100 KB Output is correct
24 Correct 185 ms 102928 KB Output is correct
25 Correct 183 ms 102932 KB Output is correct
26 Correct 199 ms 102932 KB Output is correct
27 Correct 198 ms 102936 KB Output is correct
28 Correct 136 ms 104488 KB Output is correct
29 Correct 143 ms 106008 KB Output is correct
30 Correct 128 ms 17412 KB Output is correct
31 Correct 261 ms 34828 KB Output is correct
32 Correct 649 ms 85964 KB Output is correct
33 Correct 288 ms 37208 KB Output is correct
34 Correct 281 ms 39028 KB Output is correct
35 Correct 175 ms 25336 KB Output is correct
36 Correct 108 ms 15188 KB Output is correct
37 Correct 130 ms 18404 KB Output is correct
38 Correct 236 ms 96632 KB Output is correct
39 Correct 253 ms 96532 KB Output is correct
40 Correct 239 ms 96532 KB Output is correct
41 Correct 229 ms 96788 KB Output is correct
42 Correct 238 ms 96788 KB Output is correct
43 Correct 348 ms 95080 KB Output is correct
44 Correct 282 ms 95252 KB Output is correct
45 Correct 275 ms 95372 KB Output is correct
46 Correct 268 ms 95228 KB Output is correct
47 Correct 286 ms 95256 KB Output is correct
48 Correct 385 ms 91004 KB Output is correct
49 Correct 356 ms 90968 KB Output is correct
50 Correct 351 ms 91628 KB Output is correct
51 Correct 382 ms 91704 KB Output is correct
52 Correct 370 ms 90648 KB Output is correct
53 Correct 379 ms 90388 KB Output is correct
54 Correct 392 ms 90648 KB Output is correct