답안 #800220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800220 2023-08-01T12:17:17 Z denniskim Group Photo (JOI21_ho_t3) C++17
100 / 100
650 ms 592 KB
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

ll n;
ll a[5010];
ll dp[5010];
ll w[5010];

struct fenwicktree
{
	ll bit[5010];
	
	void init(void)
	{
		for(ll i = 0 ; i <= n ; i++)
			bit[i] = 0;
	}
	
	void update(ll W, ll v)
	{
		if(W == 0)
			return;
		
		for(ll i = W ; i <= n ; i += (i & (-i)))
			bit[i] += v;
	}
	
	ll query(ll W)
	{
		ll ret = 0;
		
		for(ll i = W ; i > 0 ; i -= (i & (-i)))
			ret += bit[i];
		
		return ret;
	}
}BIT, BIT2;

int main(void)
{
	fastio
	
	cin >> n;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		cin >> a[i];
		
		w[a[i]] = i;
		dp[i] = INF;
	}
	
	dp[0] = 0;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		BIT.init();
		BIT2.init();
		
		for(ll j = 1 ; j < i ; j++)
			BIT.update(w[j], 1);
		
		ll sum = 0;
		
		for(ll j = i - 1 ; j >= 0 ; j--)
		{
			ll now = w[j + 1] + BIT.query(n) - BIT.query(w[j + 1] - 1);
			
			sum += now;
			dp[i] = min(dp[i], dp[j] + sum - (i + j + 1) * (i - j) / 2);
			
			BIT.update(w[j + 1], 1);
			BIT2.update(w[j + 1], 1);
			BIT.update(w[j], -1);
			sum -= BIT2.query(w[j]);
		}
	}
	
	cout << dp[n];
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 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 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 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 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 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 0 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 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 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 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 0 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 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 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 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 0 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 13 ms 380 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 9 ms 320 KB Output is correct
34 Correct 9 ms 376 KB Output is correct
35 Correct 11 ms 340 KB Output is correct
36 Correct 9 ms 380 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 9 ms 340 KB Output is correct
39 Correct 9 ms 328 KB Output is correct
40 Correct 9 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 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 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 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 0 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 13 ms 380 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 9 ms 320 KB Output is correct
34 Correct 9 ms 376 KB Output is correct
35 Correct 11 ms 340 KB Output is correct
36 Correct 9 ms 380 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 9 ms 340 KB Output is correct
39 Correct 9 ms 328 KB Output is correct
40 Correct 9 ms 376 KB Output is correct
41 Correct 645 ms 520 KB Output is correct
42 Correct 642 ms 520 KB Output is correct
43 Correct 646 ms 540 KB Output is correct
44 Correct 650 ms 464 KB Output is correct
45 Correct 641 ms 524 KB Output is correct
46 Correct 634 ms 520 KB Output is correct
47 Correct 637 ms 524 KB Output is correct
48 Correct 638 ms 592 KB Output is correct
49 Correct 635 ms 468 KB Output is correct
50 Correct 633 ms 524 KB Output is correct
51 Correct 641 ms 520 KB Output is correct
52 Correct 638 ms 532 KB Output is correct
53 Correct 635 ms 520 KB Output is correct
54 Correct 626 ms 520 KB Output is correct
55 Correct 640 ms 520 KB Output is correct