Submission #494055

# Submission time Handle Problem Language Result Execution time Memory
494055 2021-12-14T06:03:24 Z rk42745417 Group Photo (JOI21_ho_t3) C++17
100 / 100
719 ms 196648 KB
/*
--------------              |   / |                     |  /
      |                     | /
      |             *       |/          |    |         ------            *
      |                     |           |    |        /      \
      |             |       |\          |    |       |       |\          |
   \  |             |       | \         |    |       |       | \         |
    \ |             |       |  \        |    |        \     /   \        |
     V              |       |   \        \__/|         -----     \       |
*/
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << "\e[1;31m" << #x << " = " << (x) << "\e[0m\n"
#define print(x) emilia_mata_tenshi(#x, begin(x), end(x))
template<typename T> void emilia_mata_tenshi(const char *s, T l, T r) {
	cerr << "\e[1;33m" << s << " = [";
	while(l != r) {
		cerr << *l;
		cerr << (++l == r ? ']' : ',');
	}
	cerr << "\e[0m\n";
}

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(NULL);
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using uint = uint32_t;
const double EPS  = 1e-7;
const int INF     = 0x3F3F3F3F;
const ll LINF     = 4611686018427387903;
const int MOD     = 1e9+7;
static auto Lamy_is_cute = []() {
	EmiliaMyWife
	return 48763;
}();
/*--------------------------------------------------------------------------------------*/

signed main() {
	int n;
	cin >> n;
	vector<vector<int>> sum(n + 1, vector<int>(n + 1)), cost = sum;
	vector<int> arr(n + 1), pos(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> arr[i];
		sum[i][arr[i]]++;
		pos[arr[i]] = i;
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
		}
	}
	auto que = [&](int x1, int y1, int x2, int y2) {
		if(x1 > x2 || y1 > y2)
			return 0;
		return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];
	};
	for(int i = 1; i <= n; i++) {
		for(int j = i; j <= n; j++) {
			cost[i][j] = cost[i][j - 1];
			cost[i][j] += que(1, i, pos[j] - 1, n);
			cost[i][j] -= que(pos[j] + 1, i, n, j);
		}
	}
	vector<int> dp(n + 1, INF);
	dp[0] = 0;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= i; j++)
			dp[i] = min(dp[i], dp[j - 1] + cost[j][i]);
	}
	cout << dp[n] << '\n';
}
# 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 1 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 1 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 0 ms 204 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 1 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 0 ms 204 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 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 568 KB Output is correct
26 Correct 1 ms 564 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 564 KB Output is correct
30 Correct 1 ms 588 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 1 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 0 ms 204 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 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 568 KB Output is correct
26 Correct 1 ms 564 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 564 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 8 ms 5392 KB Output is correct
32 Correct 8 ms 5396 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 9 ms 5324 KB Output is correct
35 Correct 8 ms 5404 KB Output is correct
36 Correct 10 ms 5304 KB Output is correct
37 Correct 7 ms 5324 KB Output is correct
38 Correct 8 ms 5324 KB Output is correct
39 Correct 7 ms 5324 KB Output is correct
40 Correct 7 ms 5324 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 1 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 0 ms 204 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 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 568 KB Output is correct
26 Correct 1 ms 564 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 564 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 8 ms 5392 KB Output is correct
32 Correct 8 ms 5396 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 9 ms 5324 KB Output is correct
35 Correct 8 ms 5404 KB Output is correct
36 Correct 10 ms 5304 KB Output is correct
37 Correct 7 ms 5324 KB Output is correct
38 Correct 8 ms 5324 KB Output is correct
39 Correct 7 ms 5324 KB Output is correct
40 Correct 7 ms 5324 KB Output is correct
41 Correct 650 ms 196228 KB Output is correct
42 Correct 652 ms 196472 KB Output is correct
43 Correct 653 ms 196444 KB Output is correct
44 Correct 682 ms 196460 KB Output is correct
45 Correct 676 ms 196532 KB Output is correct
46 Correct 652 ms 196420 KB Output is correct
47 Correct 642 ms 196632 KB Output is correct
48 Correct 661 ms 196504 KB Output is correct
49 Correct 669 ms 196608 KB Output is correct
50 Correct 661 ms 196496 KB Output is correct
51 Correct 647 ms 196472 KB Output is correct
52 Correct 658 ms 196568 KB Output is correct
53 Correct 653 ms 196476 KB Output is correct
54 Correct 719 ms 196496 KB Output is correct
55 Correct 638 ms 196648 KB Output is correct