Submission #936540

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936540	2024-03-02T06:46:24 Z	WongChun1234	Group Photo (JOI21_ho_t3)	C++14	100 / 100	589 ms	792 KB

Main

#include<bits/stdc++.h>
using namespace std;
const int N=5050;
int n,a[N],bit[2][N],pos[N],las[N][N],curr,dp[N];
void upd(int b,int id){
	for (;id<N;id+=id&-id) bit[b][id]++;
}
int qry(int b,int id){
	int ret=0;
	for (;id;id-=id&-id) ret+=bit[b][id];
	return ret;
}
int main(){
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>a[i];
		pos[a[i]]=i;
	}
	dp[0]=0;
	for (int i=1;i<=n;i++){
		for (int j=0;j<=n;j++) bit[0][j]=bit[1][j]=0;
		dp[i]=INT_MAX;
		for (int j=n;j>i;j--) upd(0,pos[j]);
		curr=0;
		for (int j=i;j;j--){
			curr+=qry(0,pos[j])+qry(1,n-pos[j]+1);
			dp[i]=min(dp[i],dp[j-1]+curr);
			//cout<<j<<"->"<<i<<" "<<curr<<"\n";
			upd(1,n-pos[j]+1);
		}
		//cout<<i<<": "<<dp[i]<<"\n";
	}
	cout<<dp[n]<<"\n";
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

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

Subtask #4
20.0 / 20.0

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

Subtask #5
36.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	444 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	8 ms	348 KB	Output is correct
32	Correct	7 ms	348 KB	Output is correct
33	Correct	7 ms	348 KB	Output is correct
34	Correct	9 ms	604 KB	Output is correct
35	Correct	7 ms	348 KB	Output is correct
36	Correct	8 ms	348 KB	Output is correct
37	Correct	7 ms	348 KB	Output is correct
38	Correct	8 ms	348 KB	Output is correct
39	Correct	7 ms	600 KB	Output is correct
40	Correct	9 ms	488 KB	Output is correct
41	Correct	553 ms	784 KB	Output is correct
42	Correct	556 ms	536 KB	Output is correct
43	Correct	549 ms	540 KB	Output is correct
44	Correct	546 ms	348 KB	Output is correct
45	Correct	544 ms	520 KB	Output is correct
46	Correct	544 ms	520 KB	Output is correct
47	Correct	565 ms	600 KB	Output is correct
48	Correct	569 ms	536 KB	Output is correct
49	Correct	553 ms	520 KB	Output is correct
50	Correct	556 ms	788 KB	Output is correct
51	Correct	552 ms	792 KB	Output is correct
52	Correct	554 ms	348 KB	Output is correct
53	Correct	549 ms	596 KB	Output is correct
54	Correct	589 ms	596 KB	Output is correct
55	Correct	548 ms	540 KB	Output is correct

Submission #936540

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