oj.uz

답안 #153380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153380 2019-09-13T20:02:21 Z fedoseevtimofey Cake 3 (JOI19_cake3) C++14
100 / 100
 1267 ms 107664 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;

const int N = 2e5 + 7;

const ll Inf = 5e18;

struct Node {
    ll sum;
    int cnt, L, R; 
    Node(int val) {
        sum = val;
        cnt = 1;
        L = R = -1;
    }
    Node(ll sum, int cnt) : sum(sum), cnt(cnt), L(-1), R(-1) {}
    Node(ll sum, int cnt, int L, int R) : sum(sum), cnt(cnt), L(L), R(R) {}
    Node() : sum(0), cnt(0), L(-1), R(-1) {}
};

vector <Node> t;

int build(int l, int r) {
    if (l == r) {
        t.push_back(Node());
        return (int)t.size() - 1;
    } else {
        int m = (l + r) >> 1;
        int L = build(l, m);
        int R = build(m + 1, r);
        t.push_back(Node(0, 0, L, R));
        return (int)t.size() - 1;
    }
}

ll val[N];

int modify(int id, int v, int l, int r) {
    if (l == r) {
        t.push_back(Node(t[v].sum + val[id], t[v].cnt + 1));
        return (int)t.size() - 1;
    } else {
        int m = (l + r) >> 1;
        if (id <= m) {
            int L = modify(id, t[v].L, l, m);
            int R = t[v].R;
            t.push_back(Node(t[L].sum + t[R].sum, t[L].cnt + t[R].cnt, L, R));
            return (int)t.size() - 1;
        } else {
            int L = t[v].L;
            int R = modify(id, t[v].R, m + 1, r);
            t.push_back(Node(t[L].sum + t[R].sum, t[L].cnt + t[R].cnt, L, R));
            return (int)t.size() - 1;
        }
    }
}
ll get(int k, int vl, int vr, int l, int r) {
    if (l == r) {
        return (ll)k * val[l];
    } else {
        int m = (l + r) >> 1;
        if (t[t[vr].R].cnt - t[t[vl].R].cnt >= k) {
            return get(k, t[vl].R, t[vr].R, m + 1, r);
        } else {
            return t[t[vr].R].sum - t[t[vl].R].sum + get(k - (t[t[vr].R].cnt - t[t[vl].R].cnt), t[vl].L, t[vr].L, l, m);
        }
    }
}

vector <int> roots;
int sz, n, m;

ll ans = -5e18;
vector <pair <int, int>> a;

ll get(int l, int r) {
    return get(m, roots[l], roots[r + 1], 0, sz - 1) - 2 * a[r].first + 2 * a[l].first;
}

void rec(int l, int r, int opt_l, int opt_r) {
    if (l > r) return;
    int mid = (l + r) >> 1;
    int opt_m = opt_r;
    ll res = -5e18;
    for (int i = max(mid + m - 1, opt_l); i <= opt_r; ++i) {
        ll cur = get(mid, i);
        ans = max(ans, cur);
        if (cur > res) {
            res = cur;
            opt_m = i;
        }
    }
    rec(l, mid - 1, opt_l, opt_m);
    rec(mid + 1, r, opt_m, opt_r);
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif    
    cin >> n >> m;
    a.resize(n);
    for (int i = 0; i < n; ++i) cin >> a[i].second >> a[i].first;
    sort(a.begin(), a.end());
    vector <int> cm;
    for (int i = 0; i < n; ++i) cm.push_back(a[i].second);
    sort(cm.begin(), cm.end());
    cm.resize(unique(cm.begin(), cm.end()) - cm.begin());
    sz = cm.size();
    roots.push_back(build(0, sz - 1));
    for (int i = 0; i < (int)cm.size(); ++i) val[i] = cm[i];
    for (int i = 0; i < n; ++i) {
        int id = lower_bound(cm.begin(), cm.end(), a[i].second) - cm.begin();
        roots.push_back(modify(id, roots.back(), 0, sz - 1));
    }
    rec(0, n - 1, 0, n - 1);
    cout << ans << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 404 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 420 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 424 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 6 ms 1404 KB Output is correct
39 Correct 6 ms 1404 KB Output is correct
40 Correct 6 ms 1300 KB Output is correct
41 Correct 6 ms 1276 KB Output is correct
42 Correct 6 ms 1280 KB Output is correct
43 Correct 5 ms 1272 KB Output is correct
44 Correct 6 ms 1400 KB Output is correct
45 Correct 6 ms 1300 KB Output is correct
46 Correct 6 ms 1320 KB Output is correct
47 Correct 6 ms 1276 KB Output is correct
48 Correct 6 ms 1344 KB Output is correct
49 Correct 5 ms 1276 KB Output is correct
50 Correct 6 ms 1276 KB Output is correct
51 Correct 5 ms 1272 KB Output is correct
52 Correct 5 ms 1276 KB Output is correct
53 Correct 5 ms 1276 KB Output is correct
54 Correct 5 ms 1344 KB Output is correct
55 Correct 5 ms 1276 KB Output is correct
56 Correct 5 ms 1404 KB Output is correct
57 Correct 5 ms 1280 KB Output is correct
58 Correct 5 ms 1276 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 568 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 504 KB Output is correct
63 Correct 3 ms 632 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 6 ms 1276 KB Output is correct
66 Correct 5 ms 1276 KB Output is correct
67 Correct 6 ms 1276 KB Output is correct
68 Correct 5 ms 1276 KB Output is correct
69 Correct 5 ms 1404 KB Output is correct
70 Correct 5 ms 1400 KB Output is correct
71 Correct 3 ms 960 KB Output is correct
72 Correct 3 ms 960 KB Output is correct
73 Correct 6 ms 1404 KB Output is correct
74 Correct 5 ms 1400 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 404 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 420 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 424 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 6 ms 1404 KB Output is correct
39 Correct 6 ms 1404 KB Output is correct
40 Correct 6 ms 1300 KB Output is correct
41 Correct 6 ms 1276 KB Output is correct
42 Correct 6 ms 1280 KB Output is correct
43 Correct 5 ms 1272 KB Output is correct
44 Correct 6 ms 1400 KB Output is correct
45 Correct 6 ms 1300 KB Output is correct
46 Correct 6 ms 1320 KB Output is correct
47 Correct 6 ms 1276 KB Output is correct
48 Correct 6 ms 1344 KB Output is correct
49 Correct 5 ms 1276 KB Output is correct
50 Correct 6 ms 1276 KB Output is correct
51 Correct 5 ms 1272 KB Output is correct
52 Correct 5 ms 1276 KB Output is correct
53 Correct 5 ms 1276 KB Output is correct
54 Correct 5 ms 1344 KB Output is correct
55 Correct 5 ms 1276 KB Output is correct
56 Correct 5 ms 1404 KB Output is correct
57 Correct 5 ms 1280 KB Output is correct
58 Correct 5 ms 1276 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 568 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 504 KB Output is correct
63 Correct 3 ms 632 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 6 ms 1276 KB Output is correct
66 Correct 5 ms 1276 KB Output is correct
67 Correct 6 ms 1276 KB Output is correct
68 Correct 5 ms 1276 KB Output is correct
69 Correct 5 ms 1404 KB Output is correct
70 Correct 5 ms 1400 KB Output is correct
71 Correct 3 ms 960 KB Output is correct
72 Correct 3 ms 960 KB Output is correct
73 Correct 6 ms 1404 KB Output is correct
74 Correct 5 ms 1400 KB Output is correct
75 Correct 1201 ms 107084 KB Output is correct
76 Correct 1267 ms 106756 KB Output is correct
77 Correct 1002 ms 107344 KB Output is correct
78 Correct 1055 ms 107332 KB Output is correct
79 Correct 476 ms 107336 KB Output is correct
80 Correct 500 ms 106956 KB Output is correct
81 Correct 638 ms 105232 KB Output is correct
82 Correct 780 ms 105412 KB Output is correct
83 Correct 756 ms 105528 KB Output is correct
84 Correct 807 ms 105532 KB Output is correct
85 Correct 758 ms 105208 KB Output is correct
86 Correct 500 ms 105476 KB Output is correct
87 Correct 495 ms 105384 KB Output is correct
88 Correct 657 ms 104964 KB Output is correct
89 Correct 634 ms 105692 KB Output is correct
90 Correct 494 ms 105808 KB Output is correct
91 Correct 386 ms 105496 KB Output is correct
92 Correct 413 ms 105408 KB Output is correct
93 Correct 402 ms 105676 KB Output is correct
94 Correct 367 ms 106088 KB Output is correct
95 Correct 479 ms 105804 KB Output is correct
96 Correct 86 ms 12600 KB Output is correct
97 Correct 93 ms 12804 KB Output is correct
98 Correct 88 ms 12776 KB Output is correct
99 Correct 88 ms 12776 KB Output is correct
100 Correct 85 ms 12392 KB Output is correct
101 Correct 83 ms 12648 KB Output is correct
102 Correct 454 ms 105496 KB Output is correct
103 Correct 440 ms 105340 KB Output is correct
104 Correct 578 ms 105796 KB Output is correct
105 Correct 397 ms 105728 KB Output is correct
106 Correct 396 ms 105852 KB Output is correct
107 Correct 369 ms 105664 KB Output is correct
108 Correct 960 ms 106868 KB Output is correct
109 Correct 962 ms 107304 KB Output is correct
110 Correct 130 ms 30284 KB Output is correct
111 Correct 145 ms 30412 KB Output is correct
112 Correct 973 ms 105444 KB Output is correct
113 Correct 556 ms 107664 KB Output is correct