oj.uz

Submission #973012

# Submission time Handle Problem Language Result Execution time Memory
973012 2024-05-01T12:16:14 Z Double_Slash Cake 3 (JOI19_cake3) C++17
100 / 100
 1170 ms 193936 KB 
#include <bits/stdc++.h>
#define debug(x) [&](){ auto _x = x; cerr << __LINE__ << ": " << #x << " = " << _x << endl; }()
 
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
 
const int INF = 1e9;
const ll LLINF = 1e18;
int n, m, v[200001], c[200001];
ll ans;
struct Node {
    int freq = 0;
    ll sum = 0;
    Node *lc = nullptr, *rc = nullptr;
 
    Node *pull(Node *ln, Node *rn) {
        return new Node{ln->freq + rn->freq, ln->sum + rn->sum, ln, rn};
    }
 
    Node *update(int i, int v, int l, int r) {
        if (l == r) return new Node{freq + 1, sum + v};
        int m = (l + r) >> 1;
        if (i <= m) return pull(lc->update(i, v, l, m), rc);
        else return pull(lc, rc->update(i, v, m + 1, r));
    }
} *st[200001];
 
ll walk(Node *ln, Node *rn, int k, int l, int r) {
    if (l == r) return (ll) k * rn->sum / rn->freq;
    int rfreq = rn->rc ? rn->rc->freq - (ln and ln->rc ? ln->rc->freq : 0) : 0;
    int m = (l + r) >> 1;
    if (k <= rfreq) return walk(ln ? ln->rc : nullptr, rn->rc, k, m + 1, r);
    else return walk(ln ? ln->lc : nullptr, rn->lc, k - rfreq, l, m) + (rn->rc ? rn->rc->sum - (ln and ln->rc ? ln->rc->sum : 0) : 0);
}
 
ll calc(int l, int r) {
    if (r - l + 1 < m) return -LLINF;
    return walk(st[l - 1], st[r], m, 1, n) - (c[r] - c[l]) * 2;
}
 
void dnc(int l, int r, int optl, int optr) {
    if (l > r) return;
    int mid = (l + r) >> 1;
    pair<ll, int> mx{-LLINF, 0};
    for (int k = max(optl, mid + m - 1); k <= optr; ++k) {
        mx = max(mx, {calc(mid, k), k});
    }
    ans = max(ans, mx.first);
    dnc(l, mid - 1, optl, mx.second);
    dnc(mid + 1, r, mx.second, optr);
}
 
int main() {
    cin >> n >> m;
    vector<pair<int, int>> raw(n);
    map<int, int> cc;
    for (auto &[b, a]: raw) {
        cin >> a >> b;
        cc[a] = 0;
    }
    int j = 1;
    for (auto &[k, v]: cc) v = j++;
    sort(all(raw));
    st[0] = new Node{};
    st[0]->lc = st[0]->rc = st[0];
    for (int i = 1; i <= n; ++i) {
        tie(c[i], v[i]) = raw[i - 1];
        st[i] = st[i - 1]->update(cc[v[i]], v[i], 1, n);
    }
    ans = -LLINF;
    dnc(1, n - m + 1, m, n);
    cout << ans << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 4 ms 3420 KB Output is correct
39 Correct 4 ms 3676 KB Output is correct
40 Correct 4 ms 3672 KB Output is correct
41 Correct 3 ms 3420 KB Output is correct
42 Correct 3 ms 3676 KB Output is correct
43 Correct 3 ms 3616 KB Output is correct
44 Correct 3 ms 3640 KB Output is correct
45 Correct 5 ms 3676 KB Output is correct
46 Correct 4 ms 3676 KB Output is correct
47 Correct 4 ms 3672 KB Output is correct
48 Correct 4 ms 3420 KB Output is correct
49 Correct 4 ms 3676 KB Output is correct
50 Correct 4 ms 3724 KB Output is correct
51 Correct 3 ms 3676 KB Output is correct
52 Correct 3 ms 3676 KB Output is correct
53 Correct 4 ms 3676 KB Output is correct
54 Correct 3 ms 3676 KB Output is correct
55 Correct 3 ms 3676 KB Output is correct
56 Correct 3 ms 3556 KB Output is correct
57 Correct 3 ms 3676 KB Output is correct
58 Correct 3 ms 3420 KB Output is correct
59 Correct 3 ms 3420 KB Output is correct
60 Correct 3 ms 3420 KB Output is correct
61 Correct 3 ms 3420 KB Output is correct
62 Correct 3 ms 3576 KB Output is correct
63 Correct 4 ms 3420 KB Output is correct
64 Correct 3 ms 3420 KB Output is correct
65 Correct 4 ms 3676 KB Output is correct
66 Correct 3 ms 3420 KB Output is correct
67 Correct 4 ms 3676 KB Output is correct
68 Correct 4 ms 3676 KB Output is correct
69 Correct 3 ms 3676 KB Output is correct
70 Correct 3 ms 3676 KB Output is correct
71 Correct 3 ms 3420 KB Output is correct
72 Correct 3 ms 3420 KB Output is correct
73 Correct 3 ms 3676 KB Output is correct
74 Correct 3 ms 3676 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 4 ms 3420 KB Output is correct
39 Correct 4 ms 3676 KB Output is correct
40 Correct 4 ms 3672 KB Output is correct
41 Correct 3 ms 3420 KB Output is correct
42 Correct 3 ms 3676 KB Output is correct
43 Correct 3 ms 3616 KB Output is correct
44 Correct 3 ms 3640 KB Output is correct
45 Correct 5 ms 3676 KB Output is correct
46 Correct 4 ms 3676 KB Output is correct
47 Correct 4 ms 3672 KB Output is correct
48 Correct 4 ms 3420 KB Output is correct
49 Correct 4 ms 3676 KB Output is correct
50 Correct 4 ms 3724 KB Output is correct
51 Correct 3 ms 3676 KB Output is correct
52 Correct 3 ms 3676 KB Output is correct
53 Correct 4 ms 3676 KB Output is correct
54 Correct 3 ms 3676 KB Output is correct
55 Correct 3 ms 3676 KB Output is correct
56 Correct 3 ms 3556 KB Output is correct
57 Correct 3 ms 3676 KB Output is correct
58 Correct 3 ms 3420 KB Output is correct
59 Correct 3 ms 3420 KB Output is correct
60 Correct 3 ms 3420 KB Output is correct
61 Correct 3 ms 3420 KB Output is correct
62 Correct 3 ms 3576 KB Output is correct
63 Correct 4 ms 3420 KB Output is correct
64 Correct 3 ms 3420 KB Output is correct
65 Correct 4 ms 3676 KB Output is correct
66 Correct 3 ms 3420 KB Output is correct
67 Correct 4 ms 3676 KB Output is correct
68 Correct 4 ms 3676 KB Output is correct
69 Correct 3 ms 3676 KB Output is correct
70 Correct 3 ms 3676 KB Output is correct
71 Correct 3 ms 3420 KB Output is correct
72 Correct 3 ms 3420 KB Output is correct
73 Correct 3 ms 3676 KB Output is correct
74 Correct 3 ms 3676 KB Output is correct
75 Correct 1108 ms 179748 KB Output is correct
76 Correct 1170 ms 174768 KB Output is correct
77 Correct 1016 ms 180368 KB Output is correct
78 Correct 1093 ms 183376 KB Output is correct
79 Correct 540 ms 184080 KB Output is correct
80 Correct 518 ms 178260 KB Output is correct
81 Correct 572 ms 173784 KB Output is correct
82 Correct 756 ms 177252 KB Output is correct
83 Correct 689 ms 182608 KB Output is correct
84 Correct 713 ms 182216 KB Output is correct
85 Correct 611 ms 175392 KB Output is correct
86 Correct 421 ms 168588 KB Output is correct
87 Correct 441 ms 166848 KB Output is correct
88 Correct 539 ms 165552 KB Output is correct
89 Correct 544 ms 175112 KB Output is correct
90 Correct 483 ms 183376 KB Output is correct
91 Correct 363 ms 168788 KB Output is correct
92 Correct 386 ms 167776 KB Output is correct
93 Correct 421 ms 174932 KB Output is correct
94 Correct 384 ms 182872 KB Output is correct
95 Correct 466 ms 183380 KB Output is correct
96 Correct 512 ms 172372 KB Output is correct
97 Correct 570 ms 186344 KB Output is correct
98 Correct 577 ms 183376 KB Output is correct
99 Correct 531 ms 183636 KB Output is correct
100 Correct 437 ms 173392 KB Output is correct
101 Correct 462 ms 173400 KB Output is correct
102 Correct 771 ms 170124 KB Output is correct
103 Correct 826 ms 167808 KB Output is correct
104 Correct 1000 ms 177380 KB Output is correct
105 Correct 768 ms 176468 KB Output is correct
106 Correct 757 ms 181540 KB Output is correct
107 Correct 635 ms 174692 KB Output is correct
108 Correct 1016 ms 182100 KB Output is correct
109 Correct 953 ms 193400 KB Output is correct
110 Correct 388 ms 171616 KB Output is correct
111 Correct 490 ms 173136 KB Output is correct
112 Correct 887 ms 172880 KB Output is correct
113 Correct 564 ms 193936 KB Output is correct