oj.uz

Submission #792659

# Submission time Handle Problem Language Result Execution time Memory
792659 2023-07-25T07:53:54 Z GEN 이지후(#10086) Line Town (CCO23_day1problem3) C++17
12 / 25
 132 ms 40320 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 = 2005;

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;

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 = n - 1; i >= 0;) {
		int j = i;
		while (j >= 0 && abs(a[i][0]) == abs(a[j][0]))
			j--;
		if (abs(a[i][0]) == 0)
			break;
		vector<array<int, 3>> values[2];
		for (int k = j + 1; k <= i; k++) {
			int L = 0, R = 0;
			for (int l = 0; l <= j; l++) {
				if (a[l][1] < a[k][1])
					L++;
				else
					R++;
			}
			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]});
		}
		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]);
			for (int k = 0; k <= len; k++) {
				int pl[2] = {};
				int pr[2] = {sz(values[0]), sz(values[1])};
				lint invs = 0;
				vector<int> seq, seqR;
				for (int l = 0; l < k; l++) {
					int pos = (LS + l) % 2;
					if (pl[pos] < sz(values[pos]))
						seq.push_back(values[pos][pl[pos]][2]);
					pl[pos]++;
				}
				for (int l = 0; l < len - k; l++) {
					int pos = (RS + l) % 2;
					pr[pos]--;
					if (pr[pos] >= 0)
						seqR.push_back(values[pos][pr[pos]][2]);
				}
				reverse(all(seqR));
				for (auto &x : seqR)
					seq.push_back(x);
				if (pl[0] == pr[0] && pl[1] == pr[1]) {
					lint cost = 0;
					for (int i = 0; i < sz(seq); i++) {
						bit.add(seq[i], +1);
						cost += i + 1 - bit.query(seq[i]);
					}
					for (int i = 0; i < sz(seq); i++) {
						bit.add(seq[i], -1);
					}
					for (int i = 0; i < 2; i++) {
						for (int j = 0; j < sz(values[i]); j++) {
							if (j < pl[i])
								cost += values[i][j][0];
							else
								cost += values[i][j][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";
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:66:10: warning: unused variable 'invs' [-Wunused-variable]
   66 |     lint invs = 0;
      |          ^~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 75 ms 404 KB Output is correct
5 Correct 88 ms 396 KB Output is correct
6 Correct 132 ms 392 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 124 ms 400 KB Output is correct
9 Correct 81 ms 408 KB Output is correct
10 Correct 85 ms 340 KB Output is correct
11 Correct 81 ms 396 KB Output is correct
12 Correct 81 ms 340 KB Output is correct
13 Correct 57 ms 468 KB Output is correct

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 75 ms 404 KB Output is correct
5 Correct 88 ms 396 KB Output is correct
6 Correct 132 ms 392 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 124 ms 400 KB Output is correct
9 Correct 81 ms 408 KB Output is correct
10 Correct 85 ms 340 KB Output is correct
11 Correct 81 ms 396 KB Output is correct
12 Correct 81 ms 340 KB Output is correct
13 Correct 57 ms 468 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Runtime error 71 ms 40320 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 75 ms 404 KB Output is correct
5 Correct 88 ms 396 KB Output is correct
6 Correct 132 ms 392 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 124 ms 400 KB Output is correct
9 Correct 81 ms 408 KB Output is correct
10 Correct 85 ms 340 KB Output is correct
11 Correct 81 ms 396 KB Output is correct
12 Correct 81 ms 340 KB Output is correct
13 Correct 57 ms 468 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 23 ms 392 KB Output is correct
18 Correct 24 ms 340 KB Output is correct
19 Correct 29 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 93 ms 400 KB Output is correct
22 Correct 80 ms 404 KB Output is correct
23 Correct 22 ms 360 KB Output is correct
24 Correct 24 ms 384 KB Output is correct
25 Correct 21 ms 340 KB Output is correct
26 Correct 7 ms 340 KB Output is correct
27 Correct 38 ms 416 KB Output is correct
28 Correct 39 ms 340 KB Output is correct
29 Correct 64 ms 416 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 75 ms 404 KB Output is correct
5 Correct 88 ms 396 KB Output is correct
6 Correct 132 ms 392 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 124 ms 400 KB Output is correct
9 Correct 81 ms 408 KB Output is correct
10 Correct 85 ms 340 KB Output is correct
11 Correct 81 ms 396 KB Output is correct
12 Correct 81 ms 340 KB Output is correct
13 Correct 57 ms 468 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Runtime error 71 ms 40320 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

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

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Runtime error 61 ms 16336 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #7
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 75 ms 404 KB Output is correct
5 Correct 88 ms 396 KB Output is correct
6 Correct 132 ms 392 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 124 ms 400 KB Output is correct
9 Correct 81 ms 408 KB Output is correct
10 Correct 85 ms 340 KB Output is correct
11 Correct 81 ms 396 KB Output is correct
12 Correct 81 ms 340 KB Output is correct
13 Correct 57 ms 468 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 23 ms 392 KB Output is correct
18 Correct 24 ms 340 KB Output is correct
19 Correct 29 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 93 ms 400 KB Output is correct
22 Correct 80 ms 404 KB Output is correct
23 Correct 22 ms 360 KB Output is correct
24 Correct 24 ms 384 KB Output is correct
25 Correct 21 ms 340 KB Output is correct
26 Correct 7 ms 340 KB Output is correct
27 Correct 38 ms 416 KB Output is correct
28 Correct 39 ms 340 KB Output is correct
29 Correct 64 ms 416 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 6 ms 340 KB Output is correct
38 Correct 6 ms 340 KB Output is correct
39 Correct 6 ms 340 KB Output is correct
40 Correct 6 ms 340 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 3 ms 340 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 6 ms 364 KB Output is correct
47 Correct 6 ms 340 KB Output is correct
48 Correct 6 ms 340 KB Output is correct
49 Correct 7 ms 340 KB Output is correct
50 Correct 10 ms 468 KB Output is correct
51 Correct 15 ms 340 KB Output is correct
52 Correct 22 ms 340 KB Output is correct
53 Correct 18 ms 388 KB Output is correct
54 Correct 3 ms 340 KB Output is correct
55 Correct 39 ms 340 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 75 ms 404 KB Output is correct
5 Correct 88 ms 396 KB Output is correct
6 Correct 132 ms 392 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 124 ms 400 KB Output is correct
9 Correct 81 ms 408 KB Output is correct
10 Correct 85 ms 340 KB Output is correct
11 Correct 81 ms 396 KB Output is correct
12 Correct 81 ms 340 KB Output is correct
13 Correct 57 ms 468 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Runtime error 71 ms 40320 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -