Submission #529543

# Submission time Handle Problem Language Result Execution time Memory
529543 2022-02-23T06:41:45 Z abc864197532 Group Photo (JOI21_ho_t3) C++17
64 / 100
5000 ms 98316 KB
#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 <int> inversion(n);
	for (int r = 1; r <= n; ++r) {
		vector <int> ord;
		for (int i = 0; i < n; ++i) if (p[i] < r)
			ord.pb(p[i]);
		for (int i = 0; i < ord.size(); ++i) {
			inversion[ord[i]] = 0;
			for (int j = 0; j < i; ++j)
				inversion[ord[i]] += ord[j] > ord[i];
		}
		for (int l = r - 1; ~l; --l) {
			int pos = find(all(ord), l) - ord.begin();
			cost[l][r] = cost[l + 1][r] + int(ord.size()) - pos - 1 - inversion[l];
		}
	}
	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;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:41:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for (int i = 0; i < ord.size(); ++i) {
      |                   ~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 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 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 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 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 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 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 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 6 ms 472 KB Output is correct
22 Correct 5 ms 460 KB Output is correct
23 Correct 5 ms 460 KB Output is correct
24 Correct 5 ms 460 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 5 ms 460 KB Output is correct
27 Correct 5 ms 472 KB Output is correct
28 Correct 5 ms 460 KB Output is correct
29 Correct 5 ms 460 KB Output is correct
30 Correct 5 ms 476 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 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 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 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 6 ms 472 KB Output is correct
22 Correct 5 ms 460 KB Output is correct
23 Correct 5 ms 460 KB Output is correct
24 Correct 5 ms 460 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 5 ms 460 KB Output is correct
27 Correct 5 ms 472 KB Output is correct
28 Correct 5 ms 460 KB Output is correct
29 Correct 5 ms 460 KB Output is correct
30 Correct 5 ms 476 KB Output is correct
31 Correct 267 ms 2840 KB Output is correct
32 Correct 264 ms 2848 KB Output is correct
33 Correct 271 ms 2764 KB Output is correct
34 Correct 267 ms 2764 KB Output is correct
35 Correct 266 ms 2860 KB Output is correct
36 Correct 269 ms 2856 KB Output is correct
37 Correct 266 ms 2868 KB Output is correct
38 Correct 269 ms 2976 KB Output is correct
39 Correct 266 ms 2864 KB Output is correct
40 Correct 268 ms 2764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 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 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 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 6 ms 472 KB Output is correct
22 Correct 5 ms 460 KB Output is correct
23 Correct 5 ms 460 KB Output is correct
24 Correct 5 ms 460 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 5 ms 460 KB Output is correct
27 Correct 5 ms 472 KB Output is correct
28 Correct 5 ms 460 KB Output is correct
29 Correct 5 ms 460 KB Output is correct
30 Correct 5 ms 476 KB Output is correct
31 Correct 267 ms 2840 KB Output is correct
32 Correct 264 ms 2848 KB Output is correct
33 Correct 271 ms 2764 KB Output is correct
34 Correct 267 ms 2764 KB Output is correct
35 Correct 266 ms 2860 KB Output is correct
36 Correct 269 ms 2856 KB Output is correct
37 Correct 266 ms 2868 KB Output is correct
38 Correct 269 ms 2976 KB Output is correct
39 Correct 266 ms 2864 KB Output is correct
40 Correct 268 ms 2764 KB Output is correct
41 Execution timed out 5068 ms 98316 KB Time limit exceeded
42 Halted 0 ms 0 KB -