oj.uz

Submission #937087

# Submission time Handle Problem Language Result Execution time Memory
937087 2024-03-03T13:02:53 Z koukirocks Group Photo (JOI21_ho_t3) C++17
100 / 100
 355 ms 852 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
 
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=5e3+10,P=998244353;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;

int n;
int a[MAX];
ll dp[MAX];
int BIT[MAX];

void update(int x,int val) {
	while (x<MAX) {
		BIT[x]+=val;
		x+=(-x&x);
	}
}

int query(int x) {
	int ans=0;
	while (x) {
		ans+=BIT[x];
		x-=(-x&x);
	}
	return ans;
}

int main() {
	speed;
	cin>>n;
	for (int i=1;i<=n;i++) {
		cin>>a[i];
	}
	for (int i=1;i<=n;i++) {
		vector<int> arr;
		arr.push_back(0);
		for (int j=1;j<=n;j++) {
			if (a[j]>=n-i+1) arr.push_back(a[j]-(n-i));
		}
		vector<int> pos(i+1);
		for (int j=1;j<=i;j++) pos[arr[j]]=j;
		memset(BIT,0,sizeof(BIT));
		ll now=0;
		ll ans=oo;
		for (int j=1;j<=i;j++) {
			now-=j-1;
			now+=query(pos[j]);
			update(pos[j],1);
			now+=pos[j]-1;
			ans=min(ans,now+dp[i-j]);
		}
		dp[i]=ans;
//		cout<<dp[i]<<" ";
	}
	cout<<dp[n]<<"\n";
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 484 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 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 348 KB Output is correct
25 Correct 1 ms 348 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 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 484 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 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 348 KB Output is correct
25 Correct 1 ms 348 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 11 ms 348 KB Output is correct
32 Correct 9 ms 348 KB Output is correct
33 Correct 9 ms 540 KB Output is correct
34 Correct 9 ms 348 KB Output is correct
35 Correct 9 ms 348 KB Output is correct
36 Correct 11 ms 348 KB Output is correct
37 Correct 9 ms 348 KB Output is correct
38 Correct 9 ms 348 KB Output is correct
39 Correct 9 ms 348 KB Output is correct
40 Correct 9 ms 544 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 484 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 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 348 KB Output is correct
25 Correct 1 ms 348 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 11 ms 348 KB Output is correct
32 Correct 9 ms 348 KB Output is correct
33 Correct 9 ms 540 KB Output is correct
34 Correct 9 ms 348 KB Output is correct
35 Correct 9 ms 348 KB Output is correct
36 Correct 11 ms 348 KB Output is correct
37 Correct 9 ms 348 KB Output is correct
38 Correct 9 ms 348 KB Output is correct
39 Correct 9 ms 348 KB Output is correct
40 Correct 9 ms 544 KB Output is correct
41 Correct 332 ms 568 KB Output is correct
42 Correct 335 ms 596 KB Output is correct
43 Correct 351 ms 608 KB Output is correct
44 Correct 334 ms 596 KB Output is correct
45 Correct 331 ms 592 KB Output is correct
46 Correct 336 ms 852 KB Output is correct
47 Correct 355 ms 572 KB Output is correct
48 Correct 333 ms 852 KB Output is correct
49 Correct 331 ms 592 KB Output is correct
50 Correct 340 ms 828 KB Output is correct
51 Correct 331 ms 584 KB Output is correct
52 Correct 333 ms 596 KB Output is correct
53 Correct 334 ms 836 KB Output is correct
54 Correct 331 ms 596 KB Output is correct
55 Correct 332 ms 568 KB Output is correct