oj.uz

Submission #171966

# Submission time Handle Problem Language Result Execution time Memory
171966 2019-12-30T17:15:48 Z gs18103 Cake 3 (JOI19_cake3) C++14
100 / 100
 1060 ms 109660 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 101010;
const int INF = 1e9;
const ll LINF = 1e18;

struct Node {
    int l, r, c; ll val;
    Node(int l, int r, int c, ll val) : l(l), r(r), c(c), val(val) {}
};

pll arr[2*MAX];
int root[2*MAX], n, x;
vector <Node> tree;
vector <ll> num;
ll ans = -LINF;

void expand_tree(int s, int e, int k, int pnd, int cnd) {
    tree[cnd].c = tree[pnd].c + 1;
    tree[cnd].val = tree[pnd].val + num[k];
    if(s == e) return;
    int m = s + e >> 1;
    if(k <= m) {
        tree[cnd].r = tree[pnd].r;
        tree[cnd].l = tree.size();
        tree.eb(0, 0, 0, 0LL);
        expand_tree(s, m, k, tree[pnd].l, tree[cnd].l);
    }
    else {
        tree[cnd].l = tree[pnd].l;
        tree[cnd].r = tree.size();
        tree.eb(0, 0, 0, 0LL);
        expand_tree(m+1, e, k, tree[pnd].r, tree[cnd].r);
    }
}

ll cal(int s, int e, int cnt, int pnd, int cnd) {
    if(s == e) return cnt * num[s];
    int m = s + e >> 1, rcnt = tree[tree[cnd].r].c - tree[tree[pnd].r].c;
    if(rcnt >= cnt) return cal(m+1, e, cnt, tree[pnd].r, tree[cnd].r);
    else {
        ll rval = tree[tree[cnd].r].val - tree[tree[pnd].r].val;
        return cal(s, m, cnt-rcnt, tree[pnd].l, tree[cnd].l) + rval;
    }
}

void dnc(int s, int e, int l, int r) {
    if(s > e) return;
    int idx = l, m = s + e >> 1;
    ll tans = -LINF;
    for(int i = l; i <= min(r, m - x + 1); i++) {
        ll temp = cal(1, n, x, root[i-1], root[m]);
        temp -= 2 * (arr[m].se - arr[i].se);
        if(temp > tans) {
            tans = temp;
            idx = i;
        }
    }
    ans = max(ans, tans);
    dnc(s, m-1, l, idx);
    dnc(m+1, e, idx, r);
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    
    cin >> n >> x;
    num.eb(0);
    for(int i = 1; i <= n; i++) {
        cin >> arr[i].fi >> arr[i].se;
        num.eb(arr[i].fi);
    }
    sort(arr+1, arr+n+1, [](pll a, pll b) {
        if(a.se == b.se) return a.fi < b.fi;
        return a.se < b.se;
    });
    sort(all(num));
    
    tree.eb(0, 0, 0, 0);
    for(int i = 1; i <= n; i++) {
        int k = lower_bound(all(num), arr[i].fi) - num.begin();
        root[i] = tree.size();
        tree.eb(0, 0, 0, 0LL);
        expand_tree(1, n, k, root[i-1], root[i]);
    }

    dnc(1, n, 1, n);
    cout << ans;
}

Compilation message

cake3.cpp: In function 'void expand_tree(int, int, int, int, int)':
cake3.cpp:32:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int m = s + e >> 1;
             ~~^~~
cake3.cpp: In function 'll cal(int, int, int, int, int)':
cake3.cpp:49:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int m = s + e >> 1, rcnt = tree[tree[cnd].r].c - tree[tree[pnd].r].c;
             ~~^~~
cake3.cpp: In function 'void dnc(int, int, int, int)':
cake3.cpp:59:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int idx = l, m = s + e >> 1;
                      ~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 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 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 424 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 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 376 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 376 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 376 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 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 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 424 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 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 376 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 376 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 376 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 1380 KB Output is correct
39 Correct 6 ms 1408 KB Output is correct
40 Correct 5 ms 1408 KB Output is correct
41 Correct 5 ms 1332 KB Output is correct
42 Correct 5 ms 1404 KB Output is correct
43 Correct 5 ms 1408 KB Output is correct
44 Correct 5 ms 1412 KB Output is correct
45 Correct 6 ms 1408 KB Output is correct
46 Correct 6 ms 1408 KB Output is correct
47 Correct 6 ms 1356 KB Output is correct
48 Correct 5 ms 1408 KB Output is correct
49 Correct 5 ms 1408 KB Output is correct
50 Correct 5 ms 1408 KB Output is correct
51 Correct 5 ms 1408 KB Output is correct
52 Correct 5 ms 1408 KB Output is correct
53 Correct 5 ms 1280 KB Output is correct
54 Correct 5 ms 1408 KB Output is correct
55 Correct 5 ms 1408 KB Output is correct
56 Correct 5 ms 1392 KB Output is correct
57 Correct 5 ms 1408 KB Output is correct
58 Correct 6 ms 1408 KB Output is correct
59 Correct 5 ms 1404 KB Output is correct
60 Correct 5 ms 1408 KB Output is correct
61 Correct 5 ms 1408 KB Output is correct
62 Correct 4 ms 1408 KB Output is correct
63 Correct 5 ms 1408 KB Output is correct
64 Correct 4 ms 1412 KB Output is correct
65 Correct 5 ms 1408 KB Output is correct
66 Correct 5 ms 1408 KB Output is correct
67 Correct 5 ms 1408 KB Output is correct
68 Correct 5 ms 1408 KB Output is correct
69 Correct 5 ms 1280 KB Output is correct
70 Correct 5 ms 1408 KB Output is correct
71 Correct 4 ms 1408 KB Output is correct
72 Correct 4 ms 1276 KB Output is correct
73 Correct 5 ms 1408 KB Output is correct
74 Correct 5 ms 1408 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 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 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 424 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 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 376 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 376 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 376 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 1380 KB Output is correct
39 Correct 6 ms 1408 KB Output is correct
40 Correct 5 ms 1408 KB Output is correct
41 Correct 5 ms 1332 KB Output is correct
42 Correct 5 ms 1404 KB Output is correct
43 Correct 5 ms 1408 KB Output is correct
44 Correct 5 ms 1412 KB Output is correct
45 Correct 6 ms 1408 KB Output is correct
46 Correct 6 ms 1408 KB Output is correct
47 Correct 6 ms 1356 KB Output is correct
48 Correct 5 ms 1408 KB Output is correct
49 Correct 5 ms 1408 KB Output is correct
50 Correct 5 ms 1408 KB Output is correct
51 Correct 5 ms 1408 KB Output is correct
52 Correct 5 ms 1408 KB Output is correct
53 Correct 5 ms 1280 KB Output is correct
54 Correct 5 ms 1408 KB Output is correct
55 Correct 5 ms 1408 KB Output is correct
56 Correct 5 ms 1392 KB Output is correct
57 Correct 5 ms 1408 KB Output is correct
58 Correct 6 ms 1408 KB Output is correct
59 Correct 5 ms 1404 KB Output is correct
60 Correct 5 ms 1408 KB Output is correct
61 Correct 5 ms 1408 KB Output is correct
62 Correct 4 ms 1408 KB Output is correct
63 Correct 5 ms 1408 KB Output is correct
64 Correct 4 ms 1412 KB Output is correct
65 Correct 5 ms 1408 KB Output is correct
66 Correct 5 ms 1408 KB Output is correct
67 Correct 5 ms 1408 KB Output is correct
68 Correct 5 ms 1408 KB Output is correct
69 Correct 5 ms 1280 KB Output is correct
70 Correct 5 ms 1408 KB Output is correct
71 Correct 4 ms 1408 KB Output is correct
72 Correct 4 ms 1276 KB Output is correct
73 Correct 5 ms 1408 KB Output is correct
74 Correct 5 ms 1408 KB Output is correct
75 Correct 971 ms 108868 KB Output is correct
76 Correct 1060 ms 108740 KB Output is correct
77 Correct 891 ms 108924 KB Output is correct
78 Correct 936 ms 109048 KB Output is correct
79 Correct 399 ms 109072 KB Output is correct
80 Correct 425 ms 108796 KB Output is correct
81 Correct 707 ms 108152 KB Output is correct
82 Correct 898 ms 108280 KB Output is correct
83 Correct 805 ms 108592 KB Output is correct
84 Correct 814 ms 108636 KB Output is correct
85 Correct 731 ms 108412 KB Output is correct
86 Correct 479 ms 108072 KB Output is correct
87 Correct 488 ms 107896 KB Output is correct
88 Correct 638 ms 108000 KB Output is correct
89 Correct 654 ms 108156 KB Output is correct
90 Correct 588 ms 108540 KB Output is correct
91 Correct 499 ms 108080 KB Output is correct
92 Correct 471 ms 107900 KB Output is correct
93 Correct 448 ms 108152 KB Output is correct
94 Correct 423 ms 108496 KB Output is correct
95 Correct 496 ms 108560 KB Output is correct
96 Correct 423 ms 107968 KB Output is correct
97 Correct 447 ms 108548 KB Output is correct
98 Correct 460 ms 108484 KB Output is correct
99 Correct 443 ms 108284 KB Output is correct
100 Correct 390 ms 108060 KB Output is correct
101 Correct 394 ms 107896 KB Output is correct
102 Correct 603 ms 108032 KB Output is correct
103 Correct 624 ms 107824 KB Output is correct
104 Correct 664 ms 108336 KB Output is correct
105 Correct 510 ms 108224 KB Output is correct
106 Correct 578 ms 108412 KB Output is correct
107 Correct 624 ms 108160 KB Output is correct
108 Correct 877 ms 108848 KB Output is correct
109 Correct 775 ms 109660 KB Output is correct
110 Correct 396 ms 107512 KB Output is correct
111 Correct 410 ms 107628 KB Output is correct
112 Correct 668 ms 107368 KB Output is correct
113 Correct 405 ms 109472 KB Output is correct