Submission #986311

# Submission time Handle Problem Language Result Execution time Memory
986311 2024-05-20T09:53:00 Z yanndev Group Photo (JOI21_ho_t3) C++17
100 / 100
336 ms 852 KB
#include <bits/stdc++.h>
#define int long long
using namespace std;

int n;
int dp[5044];

void add(vector<int>& bit, int idx, int val) {
    for (int i = idx + 1; i <= (int)bit.size(); i += (i & -i))
        bit[i] += val;
}

int sum(vector<int>& bit, int idx) {
    int ans = 0;
    for (int i = idx + 1; i > 0; i -= (i & -i))
        ans += bit[i];
    return ans;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> n;

    vector<int> ls (n + 1);
    for (int i = 1; i <= n; i++)
        cin >> ls[i];

    for (int i = 0; i <= n; i++)
        dp[i] = 1e16;
    dp[0] = 0;

    for (int l = 0; l + 1 <= n; l++) {
        vector<int> bit (n + 2, 0);
        vector<int> pos (n + 1, 0);

        /*
            we used everything from 1 to l
        */

        int cur = l + 1;
        for (int i = 1; i <= n; i++)
            if (ls[i] > l)
                pos[ls[i]] = cur++;

        int s = 0;
        int inv = 0;
        for (int r = l + 1; r <= n; r++) {
            // from l + 2 to r + 1
            s += pos[r];
            inv += sum(bit, pos[r]);
            add(bit, pos[r], 1);
            //cout << "from " << l << " to " << r << " s " << s << ' ' << inv << '\n';
            dp[r] = min(dp[r], dp[l] + inv + s - ((r * (r + 1) / 2) - (l * (l + 1) / 2)));
        }
    }

    cout << dp[n] << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 0 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 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 0 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 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 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 0 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 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 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 0 ms 348 KB Output is correct
20 Correct 0 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 344 KB Output is correct
25 Correct 1 ms 344 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 0 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 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 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 0 ms 348 KB Output is correct
20 Correct 0 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 344 KB Output is correct
25 Correct 1 ms 344 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 7 ms 348 KB Output is correct
32 Correct 7 ms 488 KB Output is correct
33 Correct 7 ms 452 KB Output is correct
34 Correct 7 ms 348 KB Output is correct
35 Correct 7 ms 488 KB Output is correct
36 Correct 7 ms 348 KB Output is correct
37 Correct 7 ms 488 KB Output is correct
38 Correct 9 ms 348 KB Output is correct
39 Correct 8 ms 348 KB Output is correct
40 Correct 8 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 0 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 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 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 0 ms 348 KB Output is correct
20 Correct 0 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 344 KB Output is correct
25 Correct 1 ms 344 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 7 ms 348 KB Output is correct
32 Correct 7 ms 488 KB Output is correct
33 Correct 7 ms 452 KB Output is correct
34 Correct 7 ms 348 KB Output is correct
35 Correct 7 ms 488 KB Output is correct
36 Correct 7 ms 348 KB Output is correct
37 Correct 7 ms 488 KB Output is correct
38 Correct 9 ms 348 KB Output is correct
39 Correct 8 ms 348 KB Output is correct
40 Correct 8 ms 348 KB Output is correct
41 Correct 325 ms 612 KB Output is correct
42 Correct 328 ms 852 KB Output is correct
43 Correct 324 ms 608 KB Output is correct
44 Correct 327 ms 612 KB Output is correct
45 Correct 325 ms 612 KB Output is correct
46 Correct 330 ms 848 KB Output is correct
47 Correct 325 ms 612 KB Output is correct
48 Correct 327 ms 852 KB Output is correct
49 Correct 325 ms 612 KB Output is correct
50 Correct 323 ms 604 KB Output is correct
51 Correct 322 ms 612 KB Output is correct
52 Correct 328 ms 600 KB Output is correct
53 Correct 322 ms 608 KB Output is correct
54 Correct 336 ms 600 KB Output is correct
55 Correct 324 ms 604 KB Output is correct