oj.uz

Submission #921980

# Submission time Handle Problem Language Result Execution time Memory
921980 2024-02-04T15:43:40 Z boris_mihov Cake 3 (JOI19_cake3) C++17
100 / 100
 1271 ms 18672 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>

typedef long long llong;
const int MAXN = 200000 + 10;
const llong INF = 1e18;

int n, k;
int v[MAXN];
int c[MAXN];
int sortedV[MAXN];
struct SegmentTree
{
    struct Node
    {
        llong sum;
        int cnt;

        Node()
        {
            sum = cnt = 0;
        }

        friend Node operator + (const Node &left, const Node &right)
        {
            Node res;
            res.sum = left.sum + right.sum;
            res.cnt = left.cnt + right.cnt;
            return res;
        }
    };

    Node tree[4*MAXN];
    void update(int l, int r, int node, int queryPos)
    {
        if (l == r)
        {
            if (tree[node].cnt == 1)
            {
                tree[node].sum = 0;
                tree[node].cnt = 0;
            } else
            {
                tree[node].sum = sortedV[l];
                tree[node].cnt = 1;
            }

            return;
        }

        int mid = (l + r) / 2;
        if (queryPos <= mid) update(l, mid, 2*node, queryPos);
        else update(mid + 1, r, 2*node + 1, queryPos);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    int findPos(int l, int r, int node, int k)
    {
        if (l == r)
        {
            return l;
        }

        int mid = (l + r) / 2;
        if (tree[2*node].cnt >= k)
        {
            return findPos(l, mid, 2*node, k);
        } else
        {
            return findPos(mid + 1, r, 2*node + 1, k - tree[2*node].cnt);
        }
    }

    llong query(int l, int r, int node, int queryL, int queryR)
    {
        if (queryL <= l && r <= queryR)
        {
            return tree[node].sum;
        }

        llong res = 0;
        int mid = (l + r) / 2;
        if (queryL <= mid) res += query(l, mid, 2*node, queryL, queryR);
        if (mid + 1 <= queryR) res += query(mid + 1, r, 2*node + 1, queryL, queryR);
        return res;
    }

    void update(int pos)
    {
        update(1, n, 1, pos);
    }

    llong query()
    {
        int to = findPos(1, n, 1, k);
        return query(1, n, 1, 1, to);
    }
};

int inOrder[MAXN];
int revOrder[MAXN];
std::pair <int,int> toSort[MAXN];
SegmentTree tree;

int ptrL = 1;
int ptrR = 0;
llong cost(int l, int r)
{
    r--;
    l++;
    while (ptrL < l)
    {
        tree.update(revOrder[ptrL]);
        ptrL++;
    }

    while (ptrL > l)
    {
        ptrL--;
        tree.update(revOrder[ptrL]);
    }

    while (ptrR > r)
    {
        tree.update(revOrder[ptrR]);
        ptrR--;
    }

    while (ptrR < r)
    {
        ptrR++;
        tree.update(revOrder[ptrR]);
    }

    return tree.query() + v[l - 1] + v[r + 1] - 2 * (c[r + 1] - c[l - 1]);
}

llong ans = -INF;
void divide(int l, int r, int optL, int optR)
{
    int opt = -1;
    llong curr = -INF;
    int mid = (l + r) / 2;

    for (int i = std::max(mid + k + 1, optL) ; i <= optR ; ++i)
    {
        llong res = cost(mid, i);
        if (res > curr)
        {
            curr = res;
            opt = i;
        }
    }

    ans = std::max(ans, curr);
    if (l < mid) divide(l, mid - 1, optL, opt);
    if (mid < r) divide(mid + 1, r, opt, optR);
}

void solve()
{
    std::sort(toSort + 1, toSort + 1 + n);
    for (int i = 1 ; i <= n ; ++i)
    {
        c[i] = toSort[i].first;
        v[i] = toSort[i].second;
    }

    std::iota(inOrder + 1, inOrder + 1 + n, 1);
    std::sort(inOrder + 1, inOrder + 1 + n, [&](int x, int y)
    {
        return v[x] > v[y];
    }); 

    for (int i = 1 ; i <= n ; ++i)
    {
        sortedV[i] = v[inOrder[i]];
        revOrder[inOrder[i]] = i;
    }

    k -= 2;
    divide(1, n - k - 1, 1, n);
    std::cout << ans << '\n';
}

void input()
{
    std::cin >> n >> k;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> toSort[i].second >> toSort[i].first;
    }
}   

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 17044 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 3 ms 17004 KB Output is correct
9 Correct 3 ms 16984 KB Output is correct
10 Correct 3 ms 16984 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 2 ms 16988 KB Output is correct
15 Correct 3 ms 16988 KB Output is correct
16 Correct 2 ms 16988 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16984 KB Output is correct
19 Correct 3 ms 17240 KB Output is correct
20 Correct 3 ms 16988 KB Output is correct
21 Correct 3 ms 16988 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 3 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 3 ms 16988 KB Output is correct
27 Correct 3 ms 16984 KB Output is correct
28 Correct 3 ms 16988 KB Output is correct
29 Correct 3 ms 16988 KB Output is correct
30 Correct 3 ms 16984 KB Output is correct
31 Correct 3 ms 16988 KB Output is correct
32 Correct 2 ms 16988 KB Output is correct
33 Correct 3 ms 16988 KB Output is correct
34 Correct 3 ms 16988 KB Output is correct
35 Correct 3 ms 16988 KB Output is correct
36 Correct 3 ms 16984 KB Output is correct
37 Correct 2 ms 16988 KB Output is correct
38 Correct 7 ms 17052 KB Output is correct
39 Correct 7 ms 16988 KB Output is correct
40 Correct 5 ms 17032 KB Output is correct
41 Correct 6 ms 16988 KB Output is correct
42 Correct 4 ms 16988 KB Output is correct
43 Correct 5 ms 16996 KB Output is correct
44 Correct 6 ms 16988 KB Output is correct
45 Correct 8 ms 16988 KB Output is correct
46 Correct 7 ms 16988 KB Output is correct
47 Correct 8 ms 16988 KB Output is correct
48 Correct 7 ms 16988 KB Output is correct
49 Correct 6 ms 16988 KB Output is correct
50 Correct 6 ms 16988 KB Output is correct
51 Correct 6 ms 16988 KB Output is correct
52 Correct 6 ms 17052 KB Output is correct
53 Correct 6 ms 16988 KB Output is correct
54 Correct 5 ms 16988 KB Output is correct
55 Correct 5 ms 16988 KB Output is correct
56 Correct 4 ms 17060 KB Output is correct
57 Correct 5 ms 16988 KB Output is correct
58 Correct 5 ms 16988 KB Output is correct
59 Correct 5 ms 16988 KB Output is correct
60 Correct 6 ms 16988 KB Output is correct
61 Correct 5 ms 16988 KB Output is correct
62 Correct 5 ms 16988 KB Output is correct
63 Correct 5 ms 16984 KB Output is correct
64 Correct 5 ms 16988 KB Output is correct
65 Correct 7 ms 16988 KB Output is correct
66 Correct 7 ms 16988 KB Output is correct
67 Correct 7 ms 16976 KB Output is correct
68 Correct 6 ms 16988 KB Output is correct
69 Correct 6 ms 17056 KB Output is correct
70 Correct 6 ms 16988 KB Output is correct
71 Correct 6 ms 16988 KB Output is correct
72 Correct 5 ms 16988 KB Output is correct
73 Correct 6 ms 16988 KB Output is correct
74 Correct 5 ms 16988 KB Output is correct
75 Correct 993 ms 18340 KB Output is correct
76 Correct 1162 ms 18260 KB Output is correct
77 Correct 874 ms 18348 KB Output is correct
78 Correct 916 ms 18564 KB Output is correct
79 Correct 90 ms 18372 KB Output is correct
80 Correct 166 ms 18328 KB Output is correct
81 Correct 1010 ms 18356 KB Output is correct
82 Correct 1271 ms 18376 KB Output is correct
83 Correct 1166 ms 18432 KB Output is correct
84 Correct 1198 ms 18424 KB Output is correct
85 Correct 1026 ms 18512 KB Output is correct
86 Correct 533 ms 18256 KB Output is correct
87 Correct 605 ms 18260 KB Output is correct
88 Correct 891 ms 18296 KB Output is correct
89 Correct 850 ms 18376 KB Output is correct
90 Correct 597 ms 18440 KB Output is correct
91 Correct 361 ms 18260 KB Output is correct
92 Correct 373 ms 18512 KB Output is correct
93 Correct 457 ms 18548 KB Output is correct
94 Correct 311 ms 18256 KB Output is correct
95 Correct 555 ms 18264 KB Output is correct
96 Correct 552 ms 18332 KB Output is correct
97 Correct 586 ms 18256 KB Output is correct
98 Correct 608 ms 18424 KB Output is correct
99 Correct 547 ms 18560 KB Output is correct
100 Correct 431 ms 18332 KB Output is correct
101 Correct 458 ms 18512 KB Output is correct
102 Correct 1073 ms 18516 KB Output is correct
103 Correct 985 ms 18564 KB Output is correct
104 Correct 1135 ms 18396 KB Output is correct
105 Correct 859 ms 18392 KB Output is correct
106 Correct 844 ms 18428 KB Output is correct
107 Correct 729 ms 18516 KB Output is correct
108 Correct 853 ms 18356 KB Output is correct
109 Correct 636 ms 18440 KB Output is correct
110 Correct 507 ms 18516 KB Output is correct
111 Correct 769 ms 18256 KB Output is correct
112 Correct 721 ms 18256 KB Output is correct
113 Correct 100 ms 18672 KB Output is correct