oj.uz

Submission #921406

# Submission time Handle Problem Language Result Execution time Memory
921406 2024-02-03T19:13:58 Z TAhmed33 Group Photo (JOI21_ho_t3) C++
44 / 100
 5000 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
int n, a[5001], dp[5001];
int cost (int l, int r) {
	vector <int> u;
	int cnt = 0, suff = 0;
	for (int i = n; i >= 1; i--) {
		if (a[i] >= l && a[i] <= r) {
			u.push_back(a[i]); cnt += suff;
		} else if (a[i] < l) suff++;
	}
	for (int j = 1; j < (int)u.size(); j++) {
		for (int l = j - 1; l >= 0; l--) {
			cnt += u[j] < u[l];
		}
	}
	return cnt;
}
int main () {
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) {
		dp[i] = 1e9;
		for (int j = i; j >= 1; j--) {
			dp[i] = min(dp[i], dp[j - 1] + cost(j, i));
		}
	}
	cout << dp[n] << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 440 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 56 ms 448 KB Output is correct
22 Correct 57 ms 440 KB Output is correct
23 Correct 58 ms 348 KB Output is correct
24 Correct 59 ms 348 KB Output is correct
25 Correct 59 ms 348 KB Output is correct
26 Correct 65 ms 604 KB Output is correct
27 Correct 60 ms 348 KB Output is correct
28 Correct 59 ms 348 KB Output is correct
29 Correct 58 ms 348 KB Output is correct
30 Correct 62 ms 428 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 56 ms 448 KB Output is correct
22 Correct 57 ms 440 KB Output is correct
23 Correct 58 ms 348 KB Output is correct
24 Correct 59 ms 348 KB Output is correct
25 Correct 59 ms 348 KB Output is correct
26 Correct 65 ms 604 KB Output is correct
27 Correct 60 ms 348 KB Output is correct
28 Correct 59 ms 348 KB Output is correct
29 Correct 58 ms 348 KB Output is correct
30 Correct 62 ms 428 KB Output is correct
31 Execution timed out 5006 ms 428 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 56 ms 448 KB Output is correct
22 Correct 57 ms 440 KB Output is correct
23 Correct 58 ms 348 KB Output is correct
24 Correct 59 ms 348 KB Output is correct
25 Correct 59 ms 348 KB Output is correct
26 Correct 65 ms 604 KB Output is correct
27 Correct 60 ms 348 KB Output is correct
28 Correct 59 ms 348 KB Output is correct
29 Correct 58 ms 348 KB Output is correct
30 Correct 62 ms 428 KB Output is correct
31 Execution timed out 5006 ms 428 KB Time limit exceeded
32 Halted 0 ms 0 KB -