Submission #536067

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
536067	2022-03-12T09:10:23 Z	victor_gao	Group Photo (JOI21_ho_t3)	C++17	44 / 100	5000 ms	376 KB

Main

#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define pii pair<int,int>
#define x first
#define y second
#define N 5015 
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int dp[N],h[N],pos[N],d[N],n;
struct BIT{
	int arr[N];
	int lowbit(int x){
		return x&-x;
	}
	void reset(){
		for (int i=0;i<=n;i++) arr[i]=0;
	}
	void change(int p,int v){
		for (;p<=n;p+=lowbit(p)){
			arr[p]+=v;
		}
	}
	int query(int x){
		int ans=0;
		for (;x>0;x-=lowbit(x)){
			ans+=arr[x];
		}
		return ans;
	}
}bit,bit2;
signed main(){
	fast
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>h[i];
		pos[h[i]]=i;
		dp[i]=1e9;
	}
	for (int i=1;i<=n;i++) bit.change(i,1);
	for (int i=0;i<=n;i++){
		if (i){
			bit.change(1,1);
			bit.change(pos[i],-1);
		}
	//	for (int j=1;j<=n;j++) cout<<bit.query(j)<<' ';
	//	cout<<'\n';
		for (int j=i+1;j<=n;j++){
			int tans=0;
			vector<pii>bk;
			for (int k=j;k>i;k--){
				int np=bit.query(pos[k]);
				tans+=abs(np-(i+j-k+1));
				bit.change(1,1);
				bit.change(pos[k],-1);
				bk.push_back({1,-1});
				bk.push_back({pos[k],1});
			}
			dp[j]=min(dp[j],dp[i]+tans);
			for (auto k:bk){
				bit.change(k.x,k.y);
			}
		}
	//	bit2.reset();
	//	cout<<dp[i]<<"\n";
	}
	cout<<dp[n]<<'\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	72 ms	340 KB	Output is correct
22	Correct	71 ms	348 KB	Output is correct
23	Correct	67 ms	340 KB	Output is correct
24	Correct	75 ms	340 KB	Output is correct
25	Correct	77 ms	340 KB	Output is correct
26	Correct	73 ms	344 KB	Output is correct
27	Correct	77 ms	344 KB	Output is correct
28	Correct	70 ms	340 KB	Output is correct
29	Correct	78 ms	344 KB	Output is correct
30	Correct	71 ms	356 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	72 ms	340 KB	Output is correct
22	Correct	71 ms	348 KB	Output is correct
23	Correct	67 ms	340 KB	Output is correct
24	Correct	75 ms	340 KB	Output is correct
25	Correct	77 ms	340 KB	Output is correct
26	Correct	73 ms	344 KB	Output is correct
27	Correct	77 ms	344 KB	Output is correct
28	Correct	70 ms	340 KB	Output is correct
29	Correct	78 ms	344 KB	Output is correct
30	Correct	71 ms	356 KB	Output is correct
31	Execution timed out	5073 ms	376 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	72 ms	340 KB	Output is correct
22	Correct	71 ms	348 KB	Output is correct
23	Correct	67 ms	340 KB	Output is correct
24	Correct	75 ms	340 KB	Output is correct
25	Correct	77 ms	340 KB	Output is correct
26	Correct	73 ms	344 KB	Output is correct
27	Correct	77 ms	344 KB	Output is correct
28	Correct	70 ms	340 KB	Output is correct
29	Correct	78 ms	344 KB	Output is correct
30	Correct	71 ms	356 KB	Output is correct
31	Execution timed out	5073 ms	376 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Submission #536067

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 0 / 20.0

Subtask #5 0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
0 / 20.0

Subtask #5
0 / 36.0