oj.uz

답안 #956166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956166 2024-04-01T08:25:03 Z Pring Cake 3 (JOI19_cake3) C++17
100 / 100
 714 ms 203672 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 200005, MXC = 1000000005, LG = 40, INF = 3.9e18;
int n, m;
pii p[MXN], ans[MXN];

namespace PSMG {
#define mid ((l + r) >> 1)
#define ls(x) nd[x].L
#define rs(x) nd[x].R
    struct NODE {
        int val, cnt, L, R;
        NODE() {}
    } nd[MXN * LG];
    int nc, rt[MXN];

    int new_node(int ref) {
        nd[nc] = nd[ref];
        return nc++;
    }

    void pull(int id) {
        nd[id].val = nd[ls(id)].val + nd[rs(id)].val;
        nd[id].cnt = nd[ls(id)].cnt + nd[rs(id)].cnt;
    }

    int modify(int pre, int l, int r, int p) {
        int id = new_node(pre);
        if (l + 1 == r) {
            nd[id].val += p;
            nd[id].cnt++;
            return id;
        }
        if (p < mid) ls(id) = modify(ls(id), l, mid, p);
        else rs(id) = modify(rs(id), mid, r, p);
        pull(id);
        return id;
    }

    void BUILD() {
        nc = 2;
        rt[0] = 1;
        FOR(i, 0, n) {
            rt[i + 1] = modify(rt[i], 0, MXC, p[i].fs);
        }
    }

    int query(int lid, int rid, int l, int r, int bnd) {
        if (l + 1 == r) return l * bnd;
        int rval = nd[rs(rid)].val - nd[rs(lid)].val;
        int rcnt = nd[rs(rid)].cnt - nd[rs(lid)].cnt;
        if (rcnt == bnd) return rval;
        if (rcnt > bnd) return query(rs(lid), rs(rid), mid, r, bnd);
        return rval + query(ls(lid), ls(rid), l, mid, bnd - rcnt);
    }

    int QUERY(int l, int r, int bnd) {
        return query(rt[l], rt[r], 0, MXC, bnd);
    }
#undef mid
#undef ls
#undef rs
}

int calc(int l, int r) {
    if (r - l < m) return -INF;
    int y = PSMG::QUERY(l + 1, r - 1, m - 2);
    int x = p[l].fs + p[l].sc * 2 + p[r - 1].fs - p[r - 1].sc * 2 + y;
    return x;
}

void SOLVE(int l, int r, int kl, int kr) {
    if (l == r) return;
    int mid = (l + r) >> 1;
    ans[mid] = mp(-INF, -1LL);
    FOR(i, kl, kr + 1) ans[mid] = max(ans[mid], mp(calc(i, mid), i));
    int K = ans[mid].sc;
    SOLVE(l, mid, kl, K);
    SOLVE(mid + 1, r, K, kr);
}

void miku() {
    cin >> n >> m;
    FOR(i, 0, n) cin >> p[i].fs >> p[i].sc;
    sort(p, p + n, [](pii a, pii b) -> bool {
        return a.sc < b.sc;
    });
    PSMG::BUILD();
    SOLVE(m, n + 1, 0, n - m);
    int ANS = -INF;
    // FOR(i, m, n + 1) cout << ans[i].fs << ' ' << ans[i].sc << '\n';
    FOR(i, m, n + 1) ANS = max(ANS, ans[i].fs);
    cout << ANS << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6608 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6612 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6608 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6612 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 3 ms 8540 KB Output is correct
39 Correct 3 ms 8540 KB Output is correct
40 Correct 3 ms 8540 KB Output is correct
41 Correct 3 ms 8624 KB Output is correct
42 Correct 3 ms 8540 KB Output is correct
43 Correct 3 ms 8540 KB Output is correct
44 Correct 3 ms 8540 KB Output is correct
45 Correct 3 ms 8536 KB Output is correct
46 Correct 3 ms 8540 KB Output is correct
47 Correct 4 ms 8540 KB Output is correct
48 Correct 3 ms 8540 KB Output is correct
49 Correct 3 ms 8540 KB Output is correct
50 Correct 3 ms 8540 KB Output is correct
51 Correct 3 ms 8540 KB Output is correct
52 Correct 3 ms 8540 KB Output is correct
53 Correct 3 ms 8540 KB Output is correct
54 Correct 3 ms 8540 KB Output is correct
55 Correct 2 ms 8540 KB Output is correct
56 Correct 3 ms 8540 KB Output is correct
57 Correct 2 ms 8540 KB Output is correct
58 Correct 2 ms 8540 KB Output is correct
59 Correct 3 ms 8540 KB Output is correct
60 Correct 3 ms 8700 KB Output is correct
61 Correct 3 ms 8540 KB Output is correct
62 Correct 3 ms 8700 KB Output is correct
63 Correct 3 ms 8536 KB Output is correct
64 Correct 3 ms 8536 KB Output is correct
65 Correct 3 ms 8536 KB Output is correct
66 Correct 3 ms 8540 KB Output is correct
67 Correct 4 ms 8540 KB Output is correct
68 Correct 3 ms 8540 KB Output is correct
69 Correct 3 ms 8540 KB Output is correct
70 Correct 3 ms 8672 KB Output is correct
71 Correct 3 ms 8540 KB Output is correct
72 Correct 3 ms 8540 KB Output is correct
73 Correct 3 ms 8540 KB Output is correct
74 Correct 2 ms 8540 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6608 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6612 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 3 ms 8540 KB Output is correct
39 Correct 3 ms 8540 KB Output is correct
40 Correct 3 ms 8540 KB Output is correct
41 Correct 3 ms 8624 KB Output is correct
42 Correct 3 ms 8540 KB Output is correct
43 Correct 3 ms 8540 KB Output is correct
44 Correct 3 ms 8540 KB Output is correct
45 Correct 3 ms 8536 KB Output is correct
46 Correct 3 ms 8540 KB Output is correct
47 Correct 4 ms 8540 KB Output is correct
48 Correct 3 ms 8540 KB Output is correct
49 Correct 3 ms 8540 KB Output is correct
50 Correct 3 ms 8540 KB Output is correct
51 Correct 3 ms 8540 KB Output is correct
52 Correct 3 ms 8540 KB Output is correct
53 Correct 3 ms 8540 KB Output is correct
54 Correct 3 ms 8540 KB Output is correct
55 Correct 2 ms 8540 KB Output is correct
56 Correct 3 ms 8540 KB Output is correct
57 Correct 2 ms 8540 KB Output is correct
58 Correct 2 ms 8540 KB Output is correct
59 Correct 3 ms 8540 KB Output is correct
60 Correct 3 ms 8700 KB Output is correct
61 Correct 3 ms 8540 KB Output is correct
62 Correct 3 ms 8700 KB Output is correct
63 Correct 3 ms 8536 KB Output is correct
64 Correct 3 ms 8536 KB Output is correct
65 Correct 3 ms 8536 KB Output is correct
66 Correct 3 ms 8540 KB Output is correct
67 Correct 4 ms 8540 KB Output is correct
68 Correct 3 ms 8540 KB Output is correct
69 Correct 3 ms 8540 KB Output is correct
70 Correct 3 ms 8672 KB Output is correct
71 Correct 3 ms 8540 KB Output is correct
72 Correct 3 ms 8540 KB Output is correct
73 Correct 3 ms 8540 KB Output is correct
74 Correct 2 ms 8540 KB Output is correct
75 Correct 686 ms 187220 KB Output is correct
76 Correct 714 ms 186308 KB Output is correct
77 Correct 611 ms 191940 KB Output is correct
78 Correct 648 ms 194128 KB Output is correct
79 Correct 199 ms 193360 KB Output is correct
80 Correct 216 ms 188184 KB Output is correct
81 Correct 474 ms 192176 KB Output is correct
82 Correct 626 ms 195040 KB Output is correct
83 Correct 537 ms 201348 KB Output is correct
84 Correct 562 ms 200720 KB Output is correct
85 Correct 469 ms 193620 KB Output is correct
86 Correct 269 ms 186924 KB Output is correct
87 Correct 278 ms 184660 KB Output is correct
88 Correct 404 ms 183660 KB Output is correct
89 Correct 381 ms 193616 KB Output is correct
90 Correct 288 ms 201820 KB Output is correct
91 Correct 208 ms 186708 KB Output is correct
92 Correct 212 ms 185168 KB Output is correct
93 Correct 261 ms 193104 KB Output is correct
94 Correct 199 ms 200784 KB Output is correct
95 Correct 278 ms 201812 KB Output is correct
96 Correct 232 ms 189008 KB Output is correct
97 Correct 252 ms 203672 KB Output is correct
98 Correct 258 ms 201032 KB Output is correct
99 Correct 237 ms 201012 KB Output is correct
100 Correct 211 ms 189496 KB Output is correct
101 Correct 232 ms 189508 KB Output is correct
102 Correct 519 ms 190012 KB Output is correct
103 Correct 443 ms 187504 KB Output is correct
104 Correct 590 ms 197604 KB Output is correct
105 Correct 377 ms 196040 KB Output is correct
106 Correct 391 ms 201136 KB Output is correct
107 Correct 329 ms 193876 KB Output is correct
108 Correct 614 ms 193028 KB Output is correct
109 Correct 575 ms 203348 KB Output is correct
110 Correct 217 ms 189524 KB Output is correct
111 Correct 270 ms 192340 KB Output is correct
112 Correct 607 ms 183904 KB Output is correct
113 Correct 212 ms 203088 KB Output is correct