답안 #1056778

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056778	2024-08-13T11:06:42 Z	SalihSahin	Group Photo (JOI21_ho_t3)	C++14	100 / 100	1869 ms	327692 KB

Main

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define double long double
using namespace std;

const int mod = 1e9 + 7;
const int N = 2e5 + 5;

struct SEGT{
    vector<int> tree;

    void init(int n){
        tree.assign(4*n, 0);
    }

    void update(int ind, int l, int r, int pos, int val){
        if(l == r) tree[ind] = val;
        else{
            int m = (l + r)/2;
            if(pos <= m) update(ind*2, l, m, pos, val);
            else update(ind*2+1, m+1, r, pos, val);

            tree[ind] = tree[ind*2] + tree[ind*2+1];
        }
    }

    int query(int ind, int l, int r, int ql, int qr){
        if(l > r || l > qr || r < ql) return 0;
        if(l >= ql && r <= qr) return tree[ind];
        else{
            int m = (l + r)/2;

            return query(ind*2, l, m, ql, qr) + query(ind*2+1, m+1, r, ql, qr);
        }
    }

    int sum(int l, int r){
        return query(1LL, 1LL, tree.size()/4, l, r);
    }
};

int32_t main(){
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    // dp[we put first i elements without changing order of other ones] = minimum cost to get this array
    int n;
    cin>>n;
    vector<int> a(n), dp(n+1, mod);
    for(int i = 0; i < n; i++){
        cin>>a[i];
    }
    vector<int> arr[n+1];
    for(int i = 0; i < n; i++){
        for(int j = 1; j <= a[i]; j++){
            arr[j].pb(a[i]);
        }
    }
    vector<vector<int> > cost(n+1, vector<int>(n+1, mod));
    dp[0] = 0;

    /*
    for(int i = 1; i <= n; i++){
        for(int pre = i-1; pre >= 0; pre--){
            int cst = 0, ind = 0;
            vector<int> sim = arr[pre + 1];
            for(int j = i; j >= pre + 1; j--){
                int possim = 0;
                for(int pos = 0; pos < sim.size(); pos++){
                    if(sim[pos] == j){
                        possim = pos;
                        break;
                    }
                }
                cst += possim - ind;
                for(int pos = possim; pos >= ind + 1; pos--) sim[pos] = sim[pos - 1];
                sim[ind] = j;
                ind++;
            }
            cost[pre][i] = cst;
        }
    }
    */
    vector<int> presm(n+1), ind(n+1);

    for(int arri = 1; arri <= n; arri++){
        for(int j = 0; j <= n; j++) presm[j] = 0;

        int m = arr[arri].size();
        SEGT seg;
        seg.init(n+1);
        for(int i = m-1; i >= 0; i--){
            int val = arr[arri][i];
            presm[val] = seg.sum(1, val - 1);
            ind[val] = i;
            seg.update(1, 1, n+1, val, 1);
        }

        int cnt = 0;
        for(int j = arri; j <= n; j++){
            cnt += (ind[j] - presm[j]);
            cost[arri - 1][j] = cnt;
        }
    }

    for(int i = 1; i <= n; i++){
        for(int pre = i-1; pre >= 0; pre--){
            dp[i] = min(dp[i], dp[pre] + cost[pre][i]);
        }
    }

    cout<<dp[n]<<endl;
    return 0;
}

Subtask #1
5.0 / 5.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	344 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	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	456 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	1 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

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	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	456 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	1 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	860 KB	Output is correct
22	Correct	2 ms	860 KB	Output is correct
23	Correct	1 ms	860 KB	Output is correct
24	Correct	1 ms	860 KB	Output is correct
25	Correct	1 ms	860 KB	Output is correct
26	Correct	1 ms	860 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	860 KB	Output is correct
30	Correct	1 ms	860 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	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	456 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	1 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	860 KB	Output is correct
22	Correct	2 ms	860 KB	Output is correct
23	Correct	1 ms	860 KB	Output is correct
24	Correct	1 ms	860 KB	Output is correct
25	Correct	1 ms	860 KB	Output is correct
26	Correct	1 ms	860 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	860 KB	Output is correct
30	Correct	1 ms	860 KB	Output is correct
31	Correct	22 ms	9416 KB	Output is correct
32	Correct	19 ms	9308 KB	Output is correct
33	Correct	18 ms	9420 KB	Output is correct
34	Correct	19 ms	9308 KB	Output is correct
35	Correct	19 ms	9308 KB	Output is correct
36	Correct	18 ms	9308 KB	Output is correct
37	Correct	18 ms	9308 KB	Output is correct
38	Correct	18 ms	9260 KB	Output is correct
39	Correct	18 ms	9452 KB	Output is correct
40	Correct	18 ms	9308 KB	Output is correct

Subtask #5
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	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	456 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	1 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	860 KB	Output is correct
22	Correct	2 ms	860 KB	Output is correct
23	Correct	1 ms	860 KB	Output is correct
24	Correct	1 ms	860 KB	Output is correct
25	Correct	1 ms	860 KB	Output is correct
26	Correct	1 ms	860 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	860 KB	Output is correct
30	Correct	1 ms	860 KB	Output is correct
31	Correct	22 ms	9416 KB	Output is correct
32	Correct	19 ms	9308 KB	Output is correct
33	Correct	18 ms	9420 KB	Output is correct
34	Correct	19 ms	9308 KB	Output is correct
35	Correct	19 ms	9308 KB	Output is correct
36	Correct	18 ms	9308 KB	Output is correct
37	Correct	18 ms	9308 KB	Output is correct
38	Correct	18 ms	9260 KB	Output is correct
39	Correct	18 ms	9452 KB	Output is correct
40	Correct	18 ms	9308 KB	Output is correct
41	Correct	1811 ms	326512 KB	Output is correct
42	Correct	1832 ms	326440 KB	Output is correct
43	Correct	1805 ms	326836 KB	Output is correct
44	Correct	1781 ms	327076 KB	Output is correct
45	Correct	1818 ms	327508 KB	Output is correct
46	Correct	1830 ms	326340 KB	Output is correct
47	Correct	1869 ms	326836 KB	Output is correct
48	Correct	1815 ms	326996 KB	Output is correct
49	Correct	1844 ms	326740 KB	Output is correct
50	Correct	1797 ms	327092 KB	Output is correct
51	Correct	1834 ms	327056 KB	Output is correct
52	Correct	1807 ms	326648 KB	Output is correct
53	Correct	1802 ms	327148 KB	Output is correct
54	Correct	1805 ms	327692 KB	Output is correct
55	Correct	1800 ms	326820 KB	Output is correct

답안 #1056778

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 20.0 / 20.0

Subtask #5 36.0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
20.0 / 20.0

Subtask #5
36.0 / 36.0