Submission #916743

# Submission time Handle Problem Language Result Execution time Memory
916743 2024-01-26T12:46:10 Z NintsiChkhaidze Group Photo (JOI21_ho_t3) C++17
100 / 100
633 ms 196024 KB
#include <bits/stdc++.h>
#define ll long long
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define left (h<<1),l,(l + r)/2
#define right ((h<<1)|1),(l + r)/2 + 1,r
#define int ll 
using namespace std;

const int N = 5e3 + 3,inf = 1e18;

int a[N],dp[N],id[N],val[N],pr[N];
int fen[N],D[N][N];

void upd(int idx,int dl){
	while (idx <= 5000){
		fen[idx] += dl;
		idx += (idx & (-idx));
	}
}

int get(int idx){
	int s=0;
	while (idx>0){
		s += fen[idx];
		idx -= (idx & (-idx));
	}
	return s;
}
signed main() {
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);

	int n;
	cin>>n;

	for (int i = 1; i <= n; i++)
		cin >> a[i],dp[i] = inf,id[a[i]] = i;

	for (int i = 1; i <= n; i++){
		int s = 0;
		for (int l = i; l >= 1; l--){
			upd(id[l],1);
			s += (i - l + 1) - get(id[l]);
			D[l][i] = s;
		}

		for (int l = i; l >= 1; l--)
			upd(id[l],-1);

		int c=0;
		for (int j = 1; j <= n; j++){
			if (a[j] > i) ++c;
			val[j] = c; 
		}

		for (int j = 1; j <= n; j++){
			pr[j] = pr[j - 1] + val[id[j]];
		}

		for (int j = 1; j <= i; j++){
			dp[i] = min(dp[i],dp[i - j] + pr[i] - pr[i - j] + D[i - j + 1][i]);
		}
	}

	cout<<dp[n];
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8620 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8620 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 15 ms 33372 KB Output is correct
32 Correct 14 ms 33372 KB Output is correct
33 Correct 14 ms 33372 KB Output is correct
34 Correct 14 ms 33372 KB Output is correct
35 Correct 14 ms 33236 KB Output is correct
36 Correct 13 ms 33372 KB Output is correct
37 Correct 16 ms 33624 KB Output is correct
38 Correct 14 ms 33368 KB Output is correct
39 Correct 14 ms 33372 KB Output is correct
40 Correct 15 ms 33368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8620 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 15 ms 33372 KB Output is correct
32 Correct 14 ms 33372 KB Output is correct
33 Correct 14 ms 33372 KB Output is correct
34 Correct 14 ms 33372 KB Output is correct
35 Correct 14 ms 33236 KB Output is correct
36 Correct 13 ms 33372 KB Output is correct
37 Correct 16 ms 33624 KB Output is correct
38 Correct 14 ms 33368 KB Output is correct
39 Correct 14 ms 33372 KB Output is correct
40 Correct 15 ms 33368 KB Output is correct
41 Correct 603 ms 195752 KB Output is correct
42 Correct 593 ms 195672 KB Output is correct
43 Correct 594 ms 195740 KB Output is correct
44 Correct 598 ms 195832 KB Output is correct
45 Correct 599 ms 195912 KB Output is correct
46 Correct 601 ms 195680 KB Output is correct
47 Correct 596 ms 195652 KB Output is correct
48 Correct 616 ms 195684 KB Output is correct
49 Correct 601 ms 195908 KB Output is correct
50 Correct 633 ms 195656 KB Output is correct
51 Correct 602 ms 195668 KB Output is correct
52 Correct 604 ms 195756 KB Output is correct
53 Correct 602 ms 196024 KB Output is correct
54 Correct 600 ms 195932 KB Output is correct
55 Correct 595 ms 195768 KB Output is correct