oj.uz

Submission #1092300

# Submission time Handle Problem Language Result Execution time Memory
1092300 2024-09-23T18:03:49 Z PagodePaiva Group Photo (JOI21_ho_t3) C++17
100 / 100
 1696 ms 756 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 5010;
int n;
int v[N];
int dp[N];

struct Segtree{
    int tree[4*N];
    int join(int a, int b){
        return a+b;
    }
    void build(int node, int l, int r){
        if(l == r){
            tree[node] = 0;
            return;
        }
        int mid = (l+r)/2;
        build(2*node, l, mid);
        build(2*node+1, mid+1, r);
        tree[node] = join(tree[2*node], tree[2*node+1]);
        return;
    }
    void update(int node, int l, int r, int pos, int val){
        if(l == r){
            tree[node] = val;
            return;
        }
        int mid = (l+r)/2;
        if(l <= pos and pos <= mid) update(2*node, l, mid, pos, val);
        else update(2*node+1, mid+1,r, pos, val);
        tree[node] = join(tree[2*node], tree[2*node+1]);
        return;
    }
    int query(int node, int l, int r, int tl, int tr){
        if(l > r) return 0;
        if(l <= tl and tr <= r) return tree[node];
        if(l > tr or tl > r) return 0;
        int mid = (tl+tr)/2;
        return join(query(2*node, l, r, tl, mid), query(2*node+1, l, r, mid+1, tr));
    }
} seg;

int p[N];

void solve(int t){
    vector <int> atual;
    for(int i = 1;i <= n;i++){
        if(v[i] <= t) atual.push_back(v[i]);
    }
    for(int i = 1;i <= t;i++){
        p[atual[i-1]] = i;
    }
    seg.build(1, 1, t);
    int sum = 0;
    dp[t] = 1e8;
    for(int i = t;i > 0;i--){
        sum += t - p[i];
        sum -= seg.query(1, 1, p[i]-1, 1, t);
        seg.update(1, 1, t, p[i], 1);
        dp[t] = min(dp[t], dp[i-1] + sum);
    }
    return;
}

int main(){
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> v[i];
    }
    dp[0] = 0;
    for(int i = 1;i <= n;i++){
        solve(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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 388 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 348 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 388 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 348 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 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 0 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 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 388 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 348 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 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 0 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 1 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 2 ms 344 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 440 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 344 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 0 ms 348 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 388 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 348 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 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 0 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 1 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 2 ms 344 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 440 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 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 21 ms 348 KB Output is correct
32 Correct 21 ms 348 KB Output is correct
33 Correct 22 ms 348 KB Output is correct
34 Correct 21 ms 348 KB Output is correct
35 Correct 21 ms 348 KB Output is correct
36 Correct 22 ms 468 KB Output is correct
37 Correct 21 ms 344 KB Output is correct
38 Correct 21 ms 348 KB Output is correct
39 Correct 21 ms 464 KB Output is correct
40 Correct 21 ms 344 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 0 ms 348 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 388 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 348 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 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 0 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 1 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 2 ms 344 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 440 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 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 21 ms 348 KB Output is correct
32 Correct 21 ms 348 KB Output is correct
33 Correct 22 ms 348 KB Output is correct
34 Correct 21 ms 348 KB Output is correct
35 Correct 21 ms 348 KB Output is correct
36 Correct 22 ms 468 KB Output is correct
37 Correct 21 ms 344 KB Output is correct
38 Correct 21 ms 348 KB Output is correct
39 Correct 21 ms 464 KB Output is correct
40 Correct 21 ms 344 KB Output is correct
41 Correct 1664 ms 504 KB Output is correct
42 Correct 1638 ms 504 KB Output is correct
43 Correct 1645 ms 492 KB Output is correct
44 Correct 1647 ms 552 KB Output is correct
45 Correct 1665 ms 548 KB Output is correct
46 Correct 1642 ms 596 KB Output is correct
47 Correct 1648 ms 600 KB Output is correct
48 Correct 1627 ms 756 KB Output is correct
49 Correct 1647 ms 596 KB Output is correct
50 Correct 1663 ms 596 KB Output is correct
51 Correct 1638 ms 500 KB Output is correct
52 Correct 1653 ms 592 KB Output is correct
53 Correct 1696 ms 596 KB Output is correct
54 Correct 1661 ms 596 KB Output is correct
55 Correct 1630 ms 596 KB Output is correct