답안 #973733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973733	2024-05-02T10:15:09 Z	UltraFalcon	Group Photo (JOI21_ho_t3)	C++17	100 / 100	507 ms	600 KB

Main

#ifndef DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,abm,mmx,fma,popcnt")
#endif

#include <bits/stdc++.h>
// #define int long long
using ll = long long;

using namespace std;

const int INF = 1e9;

struct Fenwick {
    int n;
    vector<int> b;

    Fenwick(int sz) {
        n = sz+1;
        b.assign(n, 0);
    }

    int query(int k) {
        int res = b[0];
        for (int i=k; i>0; i-=i&-i) {
            res += b[i];
        }
        return res;
    } 

    void update(int k, int x) {
        for (int i=k+1; i<n; i+=i&-i) {
            b[i] += x;
        }
    }
};

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;

    vector<int> h(n);
    for (auto &x : h) {
        cin >> x;
        x--;
    }

    vector<int> dp(n, INF);
    for (int i=0; i<n; i++) {
        // precompute stuff
        vector<int> cost(n, 0);
        int cnt1 = 0;
        for (int j=0; j<n; j++) {
            if (h[j] <= i) {
                cost[h[j]] += cnt1;
                // TODO: substract #heights to the left with height h: h[j] < h <= i
            } else {
                cnt1++;
            }
        }
        // int cnt2 = 0;
        Fenwick fen(n);
        for (int j=n-1; j>=0; j--) {
            if (h[j] <= i) {
                // cost[h[j]] += cnt2;
                cost[h[j]] += fen.query(i+1) - fen.query(h[j]);
                // cnt2++;
            }
            fen.update(h[j], +1);
        }
        int tot_cost = 0;
        for (int j=i; j>=0; j--) {
            tot_cost += cost[j];

            if (j > 0) {
                dp[i] = min(dp[i], dp[j-1] + tot_cost);
            } else {
                dp[i] = min(dp[i], tot_cost);
            }
        }
    }

    cout << dp[n-1] << "\n";

}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	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	1 ms	348 KB	Output is correct
10	Correct	0 ms	452 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	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	1 ms	348 KB	Output is correct
10	Correct	0 ms	452 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	0 ms	600 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	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	1 ms	348 KB	Output is correct
10	Correct	0 ms	452 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	0 ms	600 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	456 KB	Output is correct
23	Correct	1 ms	460 KB	Output is correct
24	Correct	1 ms	348 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	344 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	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	1 ms	348 KB	Output is correct
10	Correct	0 ms	452 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	0 ms	600 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	456 KB	Output is correct
23	Correct	1 ms	460 KB	Output is correct
24	Correct	1 ms	348 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	344 KB	Output is correct
31	Correct	9 ms	344 KB	Output is correct
32	Correct	9 ms	348 KB	Output is correct
33	Correct	9 ms	344 KB	Output is correct
34	Correct	8 ms	348 KB	Output is correct
35	Correct	8 ms	476 KB	Output is correct
36	Correct	8 ms	348 KB	Output is correct
37	Correct	8 ms	344 KB	Output is correct
38	Correct	9 ms	476 KB	Output is correct
39	Correct	9 ms	348 KB	Output is correct
40	Correct	8 ms	476 KB	Output is correct

Subtask #5
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	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	1 ms	348 KB	Output is correct
10	Correct	0 ms	452 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	0 ms	600 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	456 KB	Output is correct
23	Correct	1 ms	460 KB	Output is correct
24	Correct	1 ms	348 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	344 KB	Output is correct
31	Correct	9 ms	344 KB	Output is correct
32	Correct	9 ms	348 KB	Output is correct
33	Correct	9 ms	344 KB	Output is correct
34	Correct	8 ms	348 KB	Output is correct
35	Correct	8 ms	476 KB	Output is correct
36	Correct	8 ms	348 KB	Output is correct
37	Correct	8 ms	344 KB	Output is correct
38	Correct	9 ms	476 KB	Output is correct
39	Correct	9 ms	348 KB	Output is correct
40	Correct	8 ms	476 KB	Output is correct
41	Correct	501 ms	348 KB	Output is correct
42	Correct	492 ms	536 KB	Output is correct
43	Correct	507 ms	596 KB	Output is correct
44	Correct	494 ms	344 KB	Output is correct
45	Correct	491 ms	536 KB	Output is correct
46	Correct	496 ms	536 KB	Output is correct
47	Correct	492 ms	348 KB	Output is correct
48	Correct	502 ms	536 KB	Output is correct
49	Correct	503 ms	344 KB	Output is correct
50	Correct	491 ms	544 KB	Output is correct
51	Correct	491 ms	532 KB	Output is correct
52	Correct	507 ms	540 KB	Output is correct
53	Correct	499 ms	540 KB	Output is correct
54	Correct	491 ms	540 KB	Output is correct
55	Correct	490 ms	600 KB	Output is correct

답안 #973733

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