답안 #529544

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
529544	2022-02-23T06:47:10 Z	abc864197532	Group Photo (JOI21_ho_t3)	C++17	100 / 100	706 ms	196564 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif
const int N = 200000;

int main () {
	owo;
	int n;
	cin >> n;
	vector <int> p(n);
	for (int i = 0; i < n; ++i)
		cin >> p[i], --p[i];
	vector <int> dp(n + 1, 1 << 30);
	vector <vector <int>> cost(n + 1, vector <int> (n + 1, 0));
	vector <vector <int>> inversion(n + 1, vector <int> (n + 1, 0));
	for (int i = 0; i < n; ++i) {
		for (int j = i + 1; j < n; ++j) {
			if (p[i] > p[j])
				inversion[p[j]][p[i] + 1]++;
		}
	}
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			inversion[i][j + 1] += inversion[i][j];
		}
	}
	vector <int> q(n);
	for (int r = 1; r <= n; ++r) {
		int t = 0;
		for (int i = 0; i < n; ++i) if (p[i] < r)
			q[p[i]] = t++;
		for (int l = r - 1; ~l; --l) {
			cost[l][r] = cost[l + 1][r] + r - q[l] - 1 - inversion[l][r];
		}
	}
	dp[0] = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < i; ++j) {
			// max at postion j
			dp[i] = min(dp[i], dp[j] + cost[j][i]);
		}
	}
	cout << dp[n] << endl;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	588 KB	Output is correct
22	Correct	1 ms	588 KB	Output is correct
23	Correct	1 ms	588 KB	Output is correct
24	Correct	1 ms	588 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 KB	Output is correct
27	Correct	1 ms	588 KB	Output is correct
28	Correct	1 ms	588 KB	Output is correct
29	Correct	1 ms	588 KB	Output is correct
30	Correct	1 ms	588 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	588 KB	Output is correct
22	Correct	1 ms	588 KB	Output is correct
23	Correct	1 ms	588 KB	Output is correct
24	Correct	1 ms	588 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 KB	Output is correct
27	Correct	1 ms	588 KB	Output is correct
28	Correct	1 ms	588 KB	Output is correct
29	Correct	1 ms	588 KB	Output is correct
30	Correct	1 ms	588 KB	Output is correct
31	Correct	10 ms	5324 KB	Output is correct
32	Correct	9 ms	5392 KB	Output is correct
33	Correct	9 ms	5324 KB	Output is correct
34	Correct	8 ms	5324 KB	Output is correct
35	Correct	9 ms	5400 KB	Output is correct
36	Correct	9 ms	5400 KB	Output is correct
37	Correct	7 ms	5324 KB	Output is correct
38	Correct	7 ms	5324 KB	Output is correct
39	Correct	8 ms	5324 KB	Output is correct
40	Correct	8 ms	5324 KB	Output is correct

Subtask #5
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	588 KB	Output is correct
22	Correct	1 ms	588 KB	Output is correct
23	Correct	1 ms	588 KB	Output is correct
24	Correct	1 ms	588 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 KB	Output is correct
27	Correct	1 ms	588 KB	Output is correct
28	Correct	1 ms	588 KB	Output is correct
29	Correct	1 ms	588 KB	Output is correct
30	Correct	1 ms	588 KB	Output is correct
31	Correct	10 ms	5324 KB	Output is correct
32	Correct	9 ms	5392 KB	Output is correct
33	Correct	9 ms	5324 KB	Output is correct
34	Correct	8 ms	5324 KB	Output is correct
35	Correct	9 ms	5400 KB	Output is correct
36	Correct	9 ms	5400 KB	Output is correct
37	Correct	7 ms	5324 KB	Output is correct
38	Correct	7 ms	5324 KB	Output is correct
39	Correct	8 ms	5324 KB	Output is correct
40	Correct	8 ms	5324 KB	Output is correct
41	Correct	706 ms	196200 KB	Output is correct
42	Correct	611 ms	196424 KB	Output is correct
43	Correct	671 ms	196456 KB	Output is correct
44	Correct	657 ms	196484 KB	Output is correct
45	Correct	627 ms	196420 KB	Output is correct
46	Correct	641 ms	196424 KB	Output is correct
47	Correct	626 ms	196504 KB	Output is correct
48	Correct	651 ms	196496 KB	Output is correct
49	Correct	628 ms	196492 KB	Output is correct
50	Correct	622 ms	196420 KB	Output is correct
51	Correct	657 ms	196504 KB	Output is correct
52	Correct	638 ms	196496 KB	Output is correct
53	Correct	618 ms	196436 KB	Output is correct
54	Correct	605 ms	196496 KB	Output is correct
55	Correct	656 ms	196564 KB	Output is correct

답안 #529544

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 20.0 / 20.0

Subtask #5 36.0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
20.0 / 20.0

Subtask #5
36.0 / 36.0