Submission #372320

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
372320	2021-02-27T16:03:02 Z	errorgorn	Group Photo (JOI21_ho_t3)	C++17	100 / 100	1031 ms	620 KB

Main

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

struct FEN{
	int fen[5005];
	
	FEN(){
		memset(fen,0,sizeof(fen));
	}
	
	void update(int i,int k){
		while (i<5005){
			fen[i]+=k;
			i+=i&-i;
		}
	}
	
	int query(int i){
		int res=0;
		while (i){
			res+=fen[i];
			i-=i&-i;
		}
		return res;
	}
	
	int query(int i,int j){
		return query(j)-query(i-1);
	}
} hi,lo;

int n;
int arr[5005];
int pos[5005];
ll dp[5005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	rep(x,1,n+1) cin>>arr[x];
	rep(x,1,n+1) pos[arr[x]]=x;
	
	memset(dp,63,sizeof(dp));
	
	dp[0]=0;
	rep(x,0,n){
		hi=FEN();
		lo=FEN();
		
		rep(y,x+1,n+1) hi.update(pos[y],1);
		
		ll curr=dp[x];
		rep(y,x+1,n+1){
			curr+=hi.query(1,pos[y]-1);
			curr+=lo.query(1,pos[y]-1);
			curr-=lo.query(pos[y]+1,5004);
			
			//cout<<x<<" "<<y<<" "<<curr<<endl;
			dp[y]=min(dp[y],curr);
			
			hi.update(pos[y],-1);
			lo.update(pos[y],1);
		}
	}
	
	//rep(x,0,n+1) cout<<dp[x]<<" "; cout<<endl;
	cout<<dp[n]<<endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	396 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	512 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	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	396 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	512 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	3 ms	492 KB	Output is correct
22	Correct	3 ms	492 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	3 ms	492 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	3 ms	492 KB	Output is correct
27	Correct	3 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	3 ms	492 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	396 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	512 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	3 ms	492 KB	Output is correct
22	Correct	3 ms	492 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	3 ms	492 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	3 ms	492 KB	Output is correct
27	Correct	3 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	3 ms	492 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct
31	Correct	27 ms	492 KB	Output is correct
32	Correct	27 ms	492 KB	Output is correct
33	Correct	28 ms	492 KB	Output is correct
34	Correct	27 ms	492 KB	Output is correct
35	Correct	29 ms	492 KB	Output is correct
36	Correct	27 ms	512 KB	Output is correct
37	Correct	27 ms	492 KB	Output is correct
38	Correct	27 ms	508 KB	Output is correct
39	Correct	28 ms	492 KB	Output is correct
40	Correct	27 ms	492 KB	Output is correct

Subtask #5
36.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	396 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	512 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	3 ms	492 KB	Output is correct
22	Correct	3 ms	492 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	3 ms	492 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	3 ms	492 KB	Output is correct
27	Correct	3 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	3 ms	492 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct
31	Correct	27 ms	492 KB	Output is correct
32	Correct	27 ms	492 KB	Output is correct
33	Correct	28 ms	492 KB	Output is correct
34	Correct	27 ms	492 KB	Output is correct
35	Correct	29 ms	492 KB	Output is correct
36	Correct	27 ms	512 KB	Output is correct
37	Correct	27 ms	492 KB	Output is correct
38	Correct	27 ms	508 KB	Output is correct
39	Correct	28 ms	492 KB	Output is correct
40	Correct	27 ms	492 KB	Output is correct
41	Correct	975 ms	620 KB	Output is correct
42	Correct	1031 ms	620 KB	Output is correct
43	Correct	973 ms	620 KB	Output is correct
44	Correct	979 ms	620 KB	Output is correct
45	Correct	994 ms	620 KB	Output is correct
46	Correct	976 ms	536 KB	Output is correct
47	Correct	1006 ms	620 KB	Output is correct
48	Correct	1000 ms	620 KB	Output is correct
49	Correct	1018 ms	620 KB	Output is correct
50	Correct	1000 ms	536 KB	Output is correct
51	Correct	990 ms	536 KB	Output is correct
52	Correct	1020 ms	620 KB	Output is correct
53	Correct	993 ms	492 KB	Output is correct
54	Correct	1008 ms	536 KB	Output is correct
55	Correct	989 ms	536 KB	Output is correct

Submission #372320

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