oj.uz

Submission #946383

# Submission time Handle Problem Language Result Execution time Memory
946383 2024-03-14T15:11:47 Z LOLOLO Cake 3 (JOI19_cake3) C++17
100 / 100
 1184 ms 26772 KB 
#include <bits/stdc++.h>
typedef long long ll;

#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)

using namespace std;
const int N = 2e5 + 100;
pair <ll, ll> seg[N * 4];
vector <ll> val;
vector <pair <ll, ll>> save;
map <int, int> mp;

void add(int id, int l, int r, int p, int val) {
    if (l > p || r < p)
        return;

    if (val < 0) {
        seg[id].s--;
    } else {
        seg[id].s++;
    }

    seg[id].f += val;
    if (l == r)
        return;

    int m = (l + r) / 2;
    add(id * 2, l, m, p, val);
    add(id * 2 + 1, m + 1, r, p, val); 
}

ll walk(int id, int l, int r, int re) {
    if (l == r) {
        return seg[id].f - val[l] * (seg[id].s - re);
    }

    int m = (l + r) / 2;
    if (seg[id * 2].s >= re)
        return walk(id * 2, l, m, re);

    ll t = walk(id * 2 + 1, m + 1, r, re - seg[id * 2].s);
    return seg[id * 2].f + t;
}

int n;
ll get(int m) {
    return walk(1, 0, n - 1, m);
}

ll ans = -1e16;
int l = 0, r = 0, sz;

void move(int L, int R) {
    while (r < R) {
        r++;
        add(1, 0, n - 1, save[r].s, val[save[r].s]);
    }

    while (l > L) {
        l--;
        add(1, 0, n - 1, save[l].s, val[save[l].s]);
    }

    while (l < L) {
        add(1, 0, n - 1, save[l].s, -val[save[l].s]);
        l++;
    }

    while (r > R) {
        add(1, 0, n - 1, save[r].s, -val[save[r].s]);
        r--;
    }
}

void dnc(int l, int r, int opl, int opr) {
    if (l > r || opl > opr)
        return;

    ll mx = -1e16;
    int m = (l + r) / 2, opt = opr;
    for (int j = max(m + sz - 1, opl); j <= opr; j++) {
        move(m, j);
        ll t = get(sz);
        if (mx < t - (save[j].f - save[m].f) * 2) {
            mx = t - (save[j].f - save[m].f) * 2;
            opt = j;
        }
    }

    dnc(l, m - 1, opl, opt);
    dnc(m + 1, r, opt, opr);
    ans = max(ans, mx);
}

ll solve() {
    cin >> n >> sz;
    
    for (int i = 0; i < n; i++) {
        int v, c;
        cin >> v >> c;
        save.pb({c, v});
        val.pb(v);
    }

    sort(all(save));
    uniquev(val);
    reverse(all(val));

    for (int i = 0; i < sz(val); i++)
        mp[val[i]] = i;

    for (auto &x : save) {
        x.s = mp[x.s];
    }

    l = r = 0;
    add(1, 0, n - 1, save[0].s, val[save[0].s]);    
    dnc(0, n - 1, 0, n - 1);
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;

    while (t--) {
        //solve();
        cout << solve() << '\n';
    }
    
    return 0;
}

/*
4 3
2 3
2 6 2
2 4 2
6 5 1
1 2 3
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 348 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 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 464 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 348 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 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 464 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 604 KB Output is correct
39 Correct 4 ms 532 KB Output is correct
40 Correct 3 ms 600 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 4 ms 604 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 5 ms 480 KB Output is correct
47 Correct 5 ms 692 KB Output is correct
48 Correct 4 ms 600 KB Output is correct
49 Correct 4 ms 716 KB Output is correct
50 Correct 4 ms 604 KB Output is correct
51 Correct 4 ms 604 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 4 ms 600 KB Output is correct
54 Correct 3 ms 604 KB Output is correct
55 Correct 2 ms 604 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 2 ms 528 KB Output is correct
58 Correct 2 ms 604 KB Output is correct
59 Correct 2 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 2 ms 480 KB Output is correct
63 Correct 2 ms 348 KB Output is correct
64 Correct 2 ms 348 KB Output is correct
65 Correct 4 ms 600 KB Output is correct
66 Correct 4 ms 604 KB Output is correct
67 Correct 4 ms 480 KB Output is correct
68 Correct 4 ms 600 KB Output is correct
69 Correct 3 ms 600 KB Output is correct
70 Correct 3 ms 604 KB Output is correct
71 Correct 3 ms 344 KB Output is correct
72 Correct 2 ms 344 KB Output is correct
73 Correct 4 ms 604 KB Output is correct
74 Correct 2 ms 604 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 348 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 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 464 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 604 KB Output is correct
39 Correct 4 ms 532 KB Output is correct
40 Correct 3 ms 600 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 4 ms 604 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 5 ms 480 KB Output is correct
47 Correct 5 ms 692 KB Output is correct
48 Correct 4 ms 600 KB Output is correct
49 Correct 4 ms 716 KB Output is correct
50 Correct 4 ms 604 KB Output is correct
51 Correct 4 ms 604 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 4 ms 600 KB Output is correct
54 Correct 3 ms 604 KB Output is correct
55 Correct 2 ms 604 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 2 ms 528 KB Output is correct
58 Correct 2 ms 604 KB Output is correct
59 Correct 2 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 2 ms 480 KB Output is correct
63 Correct 2 ms 348 KB Output is correct
64 Correct 2 ms 348 KB Output is correct
65 Correct 4 ms 600 KB Output is correct
66 Correct 4 ms 604 KB Output is correct
67 Correct 4 ms 480 KB Output is correct
68 Correct 4 ms 600 KB Output is correct
69 Correct 3 ms 600 KB Output is correct
70 Correct 3 ms 604 KB Output is correct
71 Correct 3 ms 344 KB Output is correct
72 Correct 2 ms 344 KB Output is correct
73 Correct 4 ms 604 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 1040 ms 25400 KB Output is correct
76 Correct 1184 ms 24892 KB Output is correct
77 Correct 832 ms 25368 KB Output is correct
78 Correct 928 ms 25916 KB Output is correct
79 Correct 180 ms 25576 KB Output is correct
80 Correct 229 ms 25252 KB Output is correct
81 Correct 751 ms 10832 KB Output is correct
82 Correct 995 ms 11832 KB Output is correct
83 Correct 868 ms 11580 KB Output is correct
84 Correct 912 ms 11828 KB Output is correct
85 Correct 841 ms 11224 KB Output is correct
86 Correct 422 ms 10360 KB Output is correct
87 Correct 468 ms 10552 KB Output is correct
88 Correct 697 ms 11576 KB Output is correct
89 Correct 681 ms 11320 KB Output is correct
90 Correct 457 ms 11364 KB Output is correct
91 Correct 302 ms 10044 KB Output is correct
92 Correct 309 ms 10472 KB Output is correct
93 Correct 396 ms 10548 KB Output is correct
94 Correct 267 ms 10656 KB Output is correct
95 Correct 434 ms 10744 KB Output is correct
96 Correct 407 ms 10760 KB Output is correct
97 Correct 422 ms 11016 KB Output is correct
98 Correct 442 ms 10064 KB Output is correct
99 Correct 386 ms 10560 KB Output is correct
100 Correct 311 ms 9444 KB Output is correct
101 Correct 335 ms 9808 KB Output is correct
102 Correct 600 ms 9616 KB Output is correct
103 Correct 578 ms 9536 KB Output is correct
104 Correct 678 ms 10044 KB Output is correct
105 Correct 489 ms 10816 KB Output is correct
106 Correct 494 ms 11068 KB Output is correct
107 Correct 404 ms 10816 KB Output is correct
108 Correct 820 ms 25400 KB Output is correct
109 Correct 637 ms 26772 KB Output is correct
110 Correct 312 ms 9160 KB Output is correct
111 Correct 464 ms 9032 KB Output is correct
112 Correct 637 ms 23468 KB Output is correct
113 Correct 185 ms 26712 KB Output is correct