oj.uz

답안 #940256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940256 2024-03-07T07:10:13 Z Angus_Yeung Group Photo (JOI21_ho_t3) C++14
44 / 100
 5000 ms 4252 KB 
#include <bits/stdc++.h>
#define len first
#define node second
#define pii pair<ll, ll>
typedef long long ll;
const ll MOD = 1000000007LL;
const ll INF = 1e15;
using namespace std;

ll n, a[5010], dp[5010], pos[5010], tmp;
vector<ll> p[5010];

ll f(ll id, ll l, ll r) {
	if (l > r) return 0;
	return upper_bound(p[id].begin(), p[id].end(), r)-lower_bound(p[id].begin(), p[id].end(), l);
}

int main() {
	cin.tie(0); cout.tie(0);
	ios::sync_with_stdio(0);
	
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		pos[a[i]] = i;
		for (int j = 1; j < i; j++) p[i].push_back(a[j]);
		sort(p[i].begin(), p[i].end());
	}
	
	dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		dp[i] = INF;
		for (int j = 1; j <= i; j++) {
			tmp = 0;
			for (int k = j; k <= i; k++) {
				tmp += f(pos[i+j-k], i+1, n);
				tmp += f(pos[i+j-k], j, i+j-k-1);
			}
			dp[i] = min(dp[i], dp[j-1]+tmp);
//			cout << dp[j-1]+tmp << ' ';
//			cout << "\n";
		}
//		cout << "\n";
	}
	
	cout << dp[n] << "\n";
	
	return 0;
}
/*



*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 76 ms 604 KB Output is correct
22 Correct 82 ms 1064 KB Output is correct
23 Correct 77 ms 604 KB Output is correct
24 Correct 76 ms 600 KB Output is correct
25 Correct 77 ms 604 KB Output is correct
26 Correct 78 ms 852 KB Output is correct
27 Correct 76 ms 804 KB Output is correct
28 Correct 82 ms 600 KB Output is correct
29 Correct 76 ms 604 KB Output is correct
30 Correct 87 ms 600 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 76 ms 604 KB Output is correct
22 Correct 82 ms 1064 KB Output is correct
23 Correct 77 ms 604 KB Output is correct
24 Correct 76 ms 600 KB Output is correct
25 Correct 77 ms 604 KB Output is correct
26 Correct 78 ms 852 KB Output is correct
27 Correct 76 ms 804 KB Output is correct
28 Correct 82 ms 600 KB Output is correct
29 Correct 76 ms 604 KB Output is correct
30 Correct 87 ms 600 KB Output is correct
31 Execution timed out 5032 ms 4252 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 76 ms 604 KB Output is correct
22 Correct 82 ms 1064 KB Output is correct
23 Correct 77 ms 604 KB Output is correct
24 Correct 76 ms 600 KB Output is correct
25 Correct 77 ms 604 KB Output is correct
26 Correct 78 ms 852 KB Output is correct
27 Correct 76 ms 804 KB Output is correct
28 Correct 82 ms 600 KB Output is correct
29 Correct 76 ms 604 KB Output is correct
30 Correct 87 ms 600 KB Output is correct
31 Execution timed out 5032 ms 4252 KB Time limit exceeded
32 Halted 0 ms 0 KB -