oj.uz

Submission #750157

# Submission time Handle Problem Language Result Execution time Memory
750157 2023-05-29T07:21:56 Z puppy Cake 3 (JOI19_cake3) C++17
100 / 100
 3749 ms 21304 KB 
#include <iostream>
#include <set>
#include <algorithm>
#include <utility>
using namespace std;
using ll = long long;
const ll inf = 1e18;
pair<ll, int> arr[200005];
int N, M;
int l, r;
set<pair<ll, int>> inc, exc;
ll cur = 0;
void in(int i)
{
    inc.insert(make_pair(arr[i].first, i));
    cur += arr[i].first;
    cur -= (*inc.begin()).first;
    exc.insert(*inc.begin());
    inc.erase(inc.begin());
}
void out(int i)
{
    auto it = inc.find(make_pair(arr[i].first, i));
    if (it != inc.end()) {
        cur -= arr[i].first;
        inc.erase(it);
        cur += (*--exc.end()).first;
        inc.insert(*--exc.end());
        exc.erase(--exc.end());
    }
    else {
        exc.erase(make_pair(arr[i].first, i));
    }
}
void put(int ln, int rn)
{
    while (l-- > ln) in(l);
    while (r++ < rn) in(r);
    while (l < ln) out(l++);
    while (r > rn) out(r--);
}
ll res[200005];
void dnc(int s, int e, int l, int r, bool ord)
{
    if (s > e) return;
    int m = s + e >> 1;
    int ml = max(m + M - 1, l), mr = r;
    if (ml > mr) {
        dnc(s, m - 1, l, r, ord);
    }
    else {
        int pv = -1;
        if (!ord) {
            for (int i = ml; i <= mr; i++) {
                put(m, i);
                ll tmp = cur - 2 * (arr[i].second - arr[m].second);
                if (res[m] < tmp) {
                    res[m] = tmp;
                    pv = i;
                }
            }
        }
        else {
            for (int i = mr; i >= ml; i--) {
                put(m, i);
                ll tmp = cur - 2 * (arr[i].second - arr[m].second);
                if (res[m] < tmp) {
                    res[m] = tmp;
                    pv = i;
                }
            }
        }
        if (!ord) {
            dnc(m+1, e, pv, r, !ord);
            dnc(s, m-1, l, pv, !ord);
        }
        else {
            dnc(s, m - 1, l, pv, !ord);
            dnc(m + 1, e, pv, r, !ord);
        }
    }
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> N >> M;
    for (int i = 1; i <= N; i++) {
        cin >> arr[i].first >> arr[i].second;
    }
    fill(res + 1, res + N + 1, -inf);
    sort(arr + 1, arr + N + 1, [&](auto &p1, auto &p2){return p1.second < p2.second;});
    l = 1, r = M;
    for (int i = 1; i <= M; i++) {
        inc.insert(make_pair(arr[i].first, i));
        cur += arr[i].first;
    }
    dnc(1, N-M+1, M, N, false);
    ll ans = *max_element(res + 1, res + N + 1);
    cout << ans << '\n';
}

Compilation message

cake3.cpp: In function 'void dnc(int, int, int, int, bool)':
cake3.cpp:46:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |     int m = s + e >> 1;
      |             ~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 9 ms 524 KB Output is correct
39 Correct 9 ms 476 KB Output is correct
40 Correct 8 ms 472 KB Output is correct
41 Correct 7 ms 468 KB Output is correct
42 Correct 4 ms 468 KB Output is correct
43 Correct 5 ms 468 KB Output is correct
44 Correct 9 ms 468 KB Output is correct
45 Correct 10 ms 468 KB Output is correct
46 Correct 11 ms 508 KB Output is correct
47 Correct 11 ms 516 KB Output is correct
48 Correct 13 ms 500 KB Output is correct
49 Correct 8 ms 516 KB Output is correct
50 Correct 8 ms 468 KB Output is correct
51 Correct 8 ms 504 KB Output is correct
52 Correct 7 ms 500 KB Output is correct
53 Correct 8 ms 480 KB Output is correct
54 Correct 5 ms 476 KB Output is correct
55 Correct 6 ms 480 KB Output is correct
56 Correct 6 ms 492 KB Output is correct
57 Correct 6 ms 468 KB Output is correct
58 Correct 4 ms 468 KB Output is correct
59 Correct 6 ms 468 KB Output is correct
60 Correct 8 ms 488 KB Output is correct
61 Correct 6 ms 512 KB Output is correct
62 Correct 5 ms 468 KB Output is correct
63 Correct 6 ms 528 KB Output is correct
64 Correct 6 ms 468 KB Output is correct
65 Correct 10 ms 468 KB Output is correct
66 Correct 9 ms 476 KB Output is correct
67 Correct 10 ms 492 KB Output is correct
68 Correct 10 ms 468 KB Output is correct
69 Correct 10 ms 520 KB Output is correct
70 Correct 7 ms 468 KB Output is correct
71 Correct 9 ms 468 KB Output is correct
72 Correct 7 ms 496 KB Output is correct
73 Correct 9 ms 476 KB Output is correct
74 Correct 2 ms 476 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 9 ms 524 KB Output is correct
39 Correct 9 ms 476 KB Output is correct
40 Correct 8 ms 472 KB Output is correct
41 Correct 7 ms 468 KB Output is correct
42 Correct 4 ms 468 KB Output is correct
43 Correct 5 ms 468 KB Output is correct
44 Correct 9 ms 468 KB Output is correct
45 Correct 10 ms 468 KB Output is correct
46 Correct 11 ms 508 KB Output is correct
47 Correct 11 ms 516 KB Output is correct
48 Correct 13 ms 500 KB Output is correct
49 Correct 8 ms 516 KB Output is correct
50 Correct 8 ms 468 KB Output is correct
51 Correct 8 ms 504 KB Output is correct
52 Correct 7 ms 500 KB Output is correct
53 Correct 8 ms 480 KB Output is correct
54 Correct 5 ms 476 KB Output is correct
55 Correct 6 ms 480 KB Output is correct
56 Correct 6 ms 492 KB Output is correct
57 Correct 6 ms 468 KB Output is correct
58 Correct 4 ms 468 KB Output is correct
59 Correct 6 ms 468 KB Output is correct
60 Correct 8 ms 488 KB Output is correct
61 Correct 6 ms 512 KB Output is correct
62 Correct 5 ms 468 KB Output is correct
63 Correct 6 ms 528 KB Output is correct
64 Correct 6 ms 468 KB Output is correct
65 Correct 10 ms 468 KB Output is correct
66 Correct 9 ms 476 KB Output is correct
67 Correct 10 ms 492 KB Output is correct
68 Correct 10 ms 468 KB Output is correct
69 Correct 10 ms 520 KB Output is correct
70 Correct 7 ms 468 KB Output is correct
71 Correct 9 ms 468 KB Output is correct
72 Correct 7 ms 496 KB Output is correct
73 Correct 9 ms 476 KB Output is correct
74 Correct 2 ms 476 KB Output is correct
75 Correct 3749 ms 17120 KB Output is correct
76 Correct 3196 ms 19588 KB Output is correct
77 Correct 2495 ms 20164 KB Output is correct
78 Correct 2729 ms 20296 KB Output is correct
79 Correct 146 ms 20268 KB Output is correct
80 Correct 367 ms 19992 KB Output is correct
81 Correct 2824 ms 17004 KB Output is correct
82 Correct 3159 ms 17108 KB Output is correct
83 Correct 3161 ms 17684 KB Output is correct
84 Correct 3372 ms 17688 KB Output is correct
85 Correct 2838 ms 17236 KB Output is correct
86 Correct 1533 ms 16832 KB Output is correct
87 Correct 1795 ms 16500 KB Output is correct
88 Correct 2422 ms 16272 KB Output is correct
89 Correct 2291 ms 17188 KB Output is correct
90 Correct 1806 ms 18296 KB Output is correct
91 Correct 1040 ms 17576 KB Output is correct
92 Correct 1133 ms 17320 KB Output is correct
93 Correct 1340 ms 17716 KB Output is correct
94 Correct 913 ms 19344 KB Output is correct
95 Correct 1841 ms 18388 KB Output is correct
96 Correct 1461 ms 15924 KB Output is correct
97 Correct 1445 ms 17196 KB Output is correct
98 Correct 1463 ms 16692 KB Output is correct
99 Correct 1272 ms 17192 KB Output is correct
100 Correct 1006 ms 16652 KB Output is correct
101 Correct 1114 ms 16608 KB Output is correct
102 Correct 2471 ms 16080 KB Output is correct
103 Correct 2505 ms 16004 KB Output is correct
104 Correct 2913 ms 17152 KB Output is correct
105 Correct 1893 ms 18144 KB Output is correct
106 Correct 1845 ms 18652 KB Output is correct
107 Correct 1502 ms 17608 KB Output is correct
108 Correct 2435 ms 20132 KB Output is correct
109 Correct 2054 ms 21276 KB Output is correct
110 Correct 1175 ms 16244 KB Output is correct
111 Correct 1750 ms 15184 KB Output is correct
112 Correct 2627 ms 17980 KB Output is correct
113 Correct 150 ms 21304 KB Output is correct