oj.uz

Submission #792685

# Submission time Handle Problem Language Result Execution time Memory
792685 2023-07-25T08:05:02 Z GEN 이지후(#10086) Line Town (CCO23_day1problem3) C++17
15 / 25
 2000 ms 31716 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = array<lint, 2>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAXN = 500005;

struct bit {
	int tree[MAXN];
	void add(int x, int v) {
		for (int i = x + 2; i < MAXN; i += i & -i)
			tree[i] += v;
	}
	int query(int x) {
		int ret = 0;
		for (int i = x + 2; i; i -= i & -i)
			ret += tree[i];
		return ret;
	}
} bit, bit2;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	vector<pi> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i][0];
		if (i % 2 == 1)
			a[i][0] *= -1;
		a[i][1] = i;
	}
	sort(all(a), [&](const pi &a, const pi &b) { return pi{abs(a[0]), a[1]} < pi{abs(b[0]), b[1]}; });
	lint dp[2] = {0, lint(1e18)};
	for (int i = 0; i < n; i++)
		bit.add(i, 1);
	for (int i = n - 1; i >= 0;) {
		int j = i;
		while (j >= 0 && abs(a[i][0]) == abs(a[j][0])) {
			bit.add(a[j][1], -1);
			j--;
		}
		if (abs(a[i][0]) == 0)
			break;
		vector<array<lint, 3>> values[2];
		for (int k = j + 1; k <= i; k++) {
			int L = bit.query(a[k][1]);
			int R = j + 1 - L;
			if (a[k][0] > 0)
				values[0].push_back({L, R, (int)a[k][1]});
			else
				values[1].push_back({L, R, (int)a[k][1]});
		}
		for (int i = 0; i < 2; i++) {
			for (int j = 1; j < sz(values[i]); j++) {
				values[i][j][0] += values[i][j - 1][0];
			}
			for (int j = sz(values[i]) - 2; j >= 0; j--) {
				values[i][j][1] += values[i][j + 1][1];
			}
		}
		lint nxt[2] = {lint(1e18), lint(1e18)};
		for (int j = 0; j < 2; j++) {
			int LS = (j + 1) % 2;
			int RS = (j + i) % 2;
			int len = sz(values[0]) + sz(values[1]);
			vector<int> seq0(len), seq1(len);
			{
				int pl[2] = {};
				int pr[2] = {sz(values[0]), sz(values[1])};
				for (int x = 0; x < len; x++) {
					int pos = (LS + x) % 2;
					if (pl[pos] < sz(values[pos])) {
						seq0[x] = values[pos][pl[pos]][2];
					}
					pl[pos]++;
				}
				for (int x = len - 1; x >= 0; x--) {
					int pos = (RS + len - 1 - x) % 2;
					pr[pos]--;
					if (pr[pos] >= 0)
						seq1[x] = values[pos][pr[pos]][2];
				}
			}
			for (int k = 0; k <= len; k++) {
				int pl[2] = {};
				int pr[2] = {sz(values[0]), sz(values[1])};
				pl[LS] += (k + 1) / 2;
				pl[LS ^ 1] += k / 2;
				pr[RS] -= (len - k + 1) / 2;
				pr[RS ^ 1] -= (len - k) / 2;
				if (pl[0] == pr[0] && pl[1] == pr[1]) {
					vector<int> seq;
					for (int i = 0; i < k; i++)
						seq.push_back(seq0[i]);
					for (int i = k; i < len; i++)
						seq.push_back(seq1[i]);
					lint cost = 0;
					for (int i = 0; i < sz(seq); i++) {
						bit2.add(seq[i], +1);
						cost += i + 1 - bit2.query(seq[i]);
					}
					for (int i = 0; i < sz(seq); i++) {
						bit2.add(seq[i], -1);
					}
					for (int i = 0; i < 2; i++) {
						if (pl[i])
							cost += values[i][pl[i] - 1][0];
						if (pl[i] < sz(values[i]))
							cost += values[i][pl[i]][1];
					}
					nxt[j ^ (k % 2)] = min(nxt[j ^ (k % 2)], dp[j] + cost);
				}
			}
		}
		dp[0] = nxt[0];
		dp[1] = nxt[1];
		i = j;
		// cout << dp[0] << " " << dp[1] << endl;
	}
	lint ans = min(dp[0], dp[1]);
	if (ans > 1e12)
		ans = -1;
	cout << ans << "\n";
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 114 ms 516 KB Output is correct
5 Correct 97 ms 508 KB Output is correct
6 Correct 216 ms 508 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 230 ms 504 KB Output is correct
9 Correct 161 ms 504 KB Output is correct
10 Correct 166 ms 504 KB Output is correct
11 Correct 161 ms 508 KB Output is correct
12 Correct 173 ms 508 KB Output is correct
13 Correct 78 ms 512 KB Output is correct

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 114 ms 516 KB Output is correct
5 Correct 97 ms 508 KB Output is correct
6 Correct 216 ms 508 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 230 ms 504 KB Output is correct
9 Correct 161 ms 504 KB Output is correct
10 Correct 166 ms 504 KB Output is correct
11 Correct 161 ms 508 KB Output is correct
12 Correct 173 ms 508 KB Output is correct
13 Correct 78 ms 512 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Execution timed out 2076 ms 31716 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 114 ms 516 KB Output is correct
5 Correct 97 ms 508 KB Output is correct
6 Correct 216 ms 508 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 230 ms 504 KB Output is correct
9 Correct 161 ms 504 KB Output is correct
10 Correct 166 ms 504 KB Output is correct
11 Correct 161 ms 508 KB Output is correct
12 Correct 173 ms 508 KB Output is correct
13 Correct 78 ms 512 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 284 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 44 ms 468 KB Output is correct
18 Correct 47 ms 468 KB Output is correct
19 Correct 55 ms 500 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 170 ms 496 KB Output is correct
22 Correct 159 ms 504 KB Output is correct
23 Correct 39 ms 468 KB Output is correct
24 Correct 39 ms 468 KB Output is correct
25 Correct 39 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 84 ms 496 KB Output is correct
28 Correct 70 ms 492 KB Output is correct
29 Correct 149 ms 492 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 114 ms 516 KB Output is correct
5 Correct 97 ms 508 KB Output is correct
6 Correct 216 ms 508 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 230 ms 504 KB Output is correct
9 Correct 161 ms 504 KB Output is correct
10 Correct 166 ms 504 KB Output is correct
11 Correct 161 ms 508 KB Output is correct
12 Correct 173 ms 508 KB Output is correct
13 Correct 78 ms 512 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Execution timed out 2076 ms 31716 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

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

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 368 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 444 KB Output is correct
14 Correct 192 ms 12324 KB Output is correct
15 Correct 247 ms 12148 KB Output is correct
16 Correct 271 ms 12124 KB Output is correct
17 Correct 231 ms 12148 KB Output is correct
18 Correct 231 ms 12184 KB Output is correct
19 Correct 249 ms 12232 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 360 KB Output is correct
22 Correct 232 ms 12220 KB Output is correct
23 Correct 210 ms 12344 KB Output is correct
24 Correct 165 ms 12176 KB Output is correct

Subtask #7
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 114 ms 516 KB Output is correct
5 Correct 97 ms 508 KB Output is correct
6 Correct 216 ms 508 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 230 ms 504 KB Output is correct
9 Correct 161 ms 504 KB Output is correct
10 Correct 166 ms 504 KB Output is correct
11 Correct 161 ms 508 KB Output is correct
12 Correct 173 ms 508 KB Output is correct
13 Correct 78 ms 512 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 284 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 44 ms 468 KB Output is correct
18 Correct 47 ms 468 KB Output is correct
19 Correct 55 ms 500 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 170 ms 496 KB Output is correct
22 Correct 159 ms 504 KB Output is correct
23 Correct 39 ms 468 KB Output is correct
24 Correct 39 ms 468 KB Output is correct
25 Correct 39 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 84 ms 496 KB Output is correct
28 Correct 70 ms 492 KB Output is correct
29 Correct 149 ms 492 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 368 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 444 KB Output is correct
46 Correct 2 ms 340 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 3 ms 340 KB Output is correct
50 Correct 10 ms 452 KB Output is correct
51 Correct 20 ms 492 KB Output is correct
52 Correct 39 ms 484 KB Output is correct
53 Correct 29 ms 468 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 71 ms 512 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 114 ms 516 KB Output is correct
5 Correct 97 ms 508 KB Output is correct
6 Correct 216 ms 508 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 230 ms 504 KB Output is correct
9 Correct 161 ms 504 KB Output is correct
10 Correct 166 ms 504 KB Output is correct
11 Correct 161 ms 508 KB Output is correct
12 Correct 173 ms 508 KB Output is correct
13 Correct 78 ms 512 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Execution timed out 2076 ms 31716 KB Time limit exceeded
16 Halted 0 ms 0 KB -