Submission #380859

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
380859	2021-03-23T10:24:01 Z	Bill_00	Group Photo (JOI21_ho_t3)	C++14	100 / 100	508 ms	165484 KB

Main

#include <bits/stdc++.h>
#define ll long long
#define N 5002
#define INF 1000000000
using namespace std;
int a[N],dp[N],pos[N];
int p[N][N],x[N][N];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> a[i];
		pos[a[i]]=i;
	}
	for(int i=1;i<=n;i++){
		for(int j=n;j>=1;j--){
			if(a[j]<=i){
				x[i][j]=x[i][j+1]+1;
			}
			else x[i][j]=x[i][j+1];
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=(n-i+1);j++){
			int pp=pos[i+j-1];
			int u=x[i-1][pp];
			p[i][j]=p[i][j-1]+pp+u-i-(x[i+j-1][pp+1]-x[i-1][pp]);
		}
	}
	for(int i=1;i<=n;i++){
		dp[i]=INF;
	}
	for(int i=1;i<=n;i++){
		for(int j=0;j<i;j++){
			dp[i]=min(dp[j]+p[j+1][i-j],dp[i]);
		}
	}
	cout << dp[n];

}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct

Subtask #3
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	2 ms	2156 KB	Output is correct
22	Correct	2 ms	2156 KB	Output is correct
23	Correct	2 ms	2156 KB	Output is correct
24	Correct	2 ms	2156 KB	Output is correct
25	Correct	2 ms	2156 KB	Output is correct
26	Correct	2 ms	2156 KB	Output is correct
27	Correct	2 ms	2156 KB	Output is correct
28	Correct	2 ms	2156 KB	Output is correct
29	Correct	3 ms	2156 KB	Output is correct
30	Correct	2 ms	2156 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	2 ms	2156 KB	Output is correct
22	Correct	2 ms	2156 KB	Output is correct
23	Correct	2 ms	2156 KB	Output is correct
24	Correct	2 ms	2156 KB	Output is correct
25	Correct	2 ms	2156 KB	Output is correct
26	Correct	2 ms	2156 KB	Output is correct
27	Correct	2 ms	2156 KB	Output is correct
28	Correct	2 ms	2156 KB	Output is correct
29	Correct	3 ms	2156 KB	Output is correct
30	Correct	2 ms	2156 KB	Output is correct
31	Correct	12 ms	10604 KB	Output is correct
32	Correct	12 ms	10604 KB	Output is correct
33	Correct	12 ms	10604 KB	Output is correct
34	Correct	13 ms	10604 KB	Output is correct
35	Correct	14 ms	10604 KB	Output is correct
36	Correct	12 ms	10604 KB	Output is correct
37	Correct	13 ms	10604 KB	Output is correct
38	Correct	12 ms	10604 KB	Output is correct
39	Correct	13 ms	10604 KB	Output is correct
40	Correct	13 ms	10604 KB	Output is correct

Subtask #5
36.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	2 ms	2156 KB	Output is correct
22	Correct	2 ms	2156 KB	Output is correct
23	Correct	2 ms	2156 KB	Output is correct
24	Correct	2 ms	2156 KB	Output is correct
25	Correct	2 ms	2156 KB	Output is correct
26	Correct	2 ms	2156 KB	Output is correct
27	Correct	2 ms	2156 KB	Output is correct
28	Correct	2 ms	2156 KB	Output is correct
29	Correct	3 ms	2156 KB	Output is correct
30	Correct	2 ms	2156 KB	Output is correct
31	Correct	12 ms	10604 KB	Output is correct
32	Correct	12 ms	10604 KB	Output is correct
33	Correct	12 ms	10604 KB	Output is correct
34	Correct	13 ms	10604 KB	Output is correct
35	Correct	14 ms	10604 KB	Output is correct
36	Correct	12 ms	10604 KB	Output is correct
37	Correct	13 ms	10604 KB	Output is correct
38	Correct	12 ms	10604 KB	Output is correct
39	Correct	13 ms	10604 KB	Output is correct
40	Correct	13 ms	10604 KB	Output is correct
41	Correct	508 ms	165360 KB	Output is correct
42	Correct	494 ms	165228 KB	Output is correct
43	Correct	491 ms	165356 KB	Output is correct
44	Correct	506 ms	165172 KB	Output is correct
45	Correct	497 ms	165228 KB	Output is correct
46	Correct	492 ms	165356 KB	Output is correct
47	Correct	500 ms	165384 KB	Output is correct
48	Correct	497 ms	165228 KB	Output is correct
49	Correct	495 ms	165228 KB	Output is correct
50	Correct	493 ms	165356 KB	Output is correct
51	Correct	495 ms	165484 KB	Output is correct
52	Correct	497 ms	165484 KB	Output is correct
53	Correct	502 ms	165356 KB	Output is correct
54	Correct	499 ms	165228 KB	Output is correct
55	Correct	499 ms	165228 KB	Output is correct

Submission #380859

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