oj.uz

Submission #923628

# Submission time Handle Problem Language Result Execution time Memory
923628 2024-02-07T13:49:51 Z danikoynov Cake 3 (JOI19_cake3) C++14
100 / 100
 1158 ms 19236 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 2e5 + 10;

struct element
{
    ll v, s, idx;

    element(ll _v = 0, ll _s = 0, ll _idx = 0)
    {
        v = _v;
        s = _s;
        idx = _idx;
    }
} e[maxn];
int n, m;

void input()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++)
    {
        cin >> e[i].v >> e[i].s;
        e[i].s *= 2;
        e[i].idx = i;
    }
}

bool cmp_second(element e1, element e2)
{
    return e1.s < e2.s;
}
ll inf = 1e18;


ll result;

ll dp[maxn];

int lb = 1, rb = 0;
int tree[4 * maxn];

void update(int root, int left, int right, int pos, int val)
{
    if (left == right)
    {
        tree[root] = val;
        return;
    }

    int mid = (left + right) / 2;
    if (pos <= mid)
        update(root * 2, left, mid, pos, val);
    else
        update(root * 2 + 1, mid + 1, right, pos, val);

    tree[root] = tree[root * 2] + tree[root * 2 + 1];
}

int walk(int root, int left, int right, int take)
{
    if (left == right)
        return left;

    int mid = (left + right) / 2;
    if (tree[root * 2 + 1] >= take)
        return walk(root * 2 + 1, mid + 1, right, take);
    else
        return walk(root * 2, left, mid, take - tree[root * 2 + 1]);
}

int rev[maxn];
ll num[maxn];

ll fen[maxn];
void point_add(int pos, ll v)
{
    for (int i = pos; i <= n; i += (i & -i))
        fen[i] += v;
}

ll fen_sum(int pos)
{
    ll s = 0;
    for (int i = pos; i > 0; i -= (i & -i))
        s += fen[i];
    return s;
}

ll range_sum(int l, int r)
{
    return fen_sum(r) - fen_sum(l - 1);
}
ll cost(int left, int right)
{
    ///cout << "cost" << endl;
    while(rb < right)
    {
        rb ++;
        update(1, 1, n, rev[rb], 1);
        point_add(rev[rb], num[rev[rb]]);
    }

    while(lb > left)
    {
        lb --;
        update(1, 1, n, rev[lb], 1);
        point_add(rev[lb], num[rev[lb]]);
    }

    while(rb > right)
    {
        update(1, 1, n, rev[rb], 0);
        point_add(rev[rb], -num[rev[rb]]);
        rb --;
    }
    ///cout << "fine" << endl;
    while(lb < left)
    {
        update(1, 1, n, rev[lb], 0);
        point_add(rev[lb], -num[rev[lb]]);
        lb ++;
    }

    int pivot = walk(1, 1, n, m);
    return range_sum(pivot, n);

    //cout << "cost " << left << " " << right << endl;
    /**vector < ll > values;
    for (int i = left; i <= right; i ++)
        values.push_back(e[i].v);

    sort(values.begin(), values.end());

    ll res = 0;
    for (int i = (int)(values.size()) - 1; i >= (int)(values.size()) - m; i --)
        res += values[i];

        //exit(0);
    return res;*/
}

void divide(int l, int r, int optl, int optr)
{
    if (l > r)
        return;

    ///cout << l << " " << r << " " << optl << " " << optr << endl;
    int mid = max(optl + m - 1, (l + r) / 2), opt = -1;
    if (mid > r)
        return;

    for (int i = optl; i <= min(optr, mid); i ++)
    {
        ///cout << "check " << mid << " " << i << endl;
        if (mid - i + 1 >= m)
        {
            ll sum = - e[mid].s + e[i].s + cost(i, mid);
            ///cout << "alive " << " " << sum << endl;
            if (sum > dp[mid])
            {
                dp[mid ] = sum;
                opt = i;
            }
        }
    }


    //cout << "pos " << mid << " " << opt << endl;

    divide(l, mid - 1, optl, opt);
    divide(mid + 1, r, opt, optr);

}

void print()
{
    ll best = -inf;
    for (int i = 1; i <= n; i ++)
        best = max(best, dp[i]);
    cout << best << endl;
}
void precompute()
{
    sort(e + 1, e + n + 1, cmp_second);
    vector < pair < ll, ll > > val;
    for (int i = 1; i <= n; i ++)
    {
        e[i].idx = i;
        val.push_back({e[i].v, i});
    }

    sort(val.begin(), val.end());
    for (int i = 0; i < n; i ++)
    {
        rev[val[i].second] = i + 1;
        num[i + 1] = val[i].first;
    }

    for (int i = 1; i <= n; i ++)
        dp[i] = -inf;
}
void solve()
{
    input();
    precompute();
    divide(1, n, 1, n);
    print();
}

int main()
{
    speed();
    solve();
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 2 ms 11352 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11356 KB Output is correct
9 Correct 2 ms 11428 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct
11 Correct 2 ms 11356 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 11352 KB Output is correct
14 Correct 2 ms 11356 KB Output is correct
15 Correct 2 ms 11504 KB Output is correct
16 Correct 2 ms 11356 KB Output is correct
17 Correct 2 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 2 ms 11356 KB Output is correct
20 Correct 2 ms 11356 KB Output is correct
21 Correct 2 ms 11356 KB Output is correct
22 Correct 2 ms 11352 KB Output is correct
23 Correct 2 ms 11356 KB Output is correct
24 Correct 2 ms 11356 KB Output is correct
25 Correct 3 ms 11356 KB Output is correct
26 Correct 2 ms 11356 KB Output is correct
27 Correct 2 ms 11356 KB Output is correct
28 Correct 2 ms 11356 KB Output is correct
29 Correct 3 ms 11528 KB Output is correct
30 Correct 2 ms 11356 KB Output is correct
31 Correct 3 ms 11540 KB Output is correct
32 Correct 2 ms 11356 KB Output is correct
33 Correct 2 ms 11356 KB Output is correct
34 Correct 2 ms 11356 KB Output is correct
35 Correct 2 ms 11356 KB Output is correct
36 Correct 2 ms 11356 KB Output is correct
37 Correct 2 ms 11356 KB Output is correct
38 Correct 6 ms 11612 KB Output is correct
39 Correct 6 ms 11444 KB Output is correct
40 Correct 5 ms 11612 KB Output is correct
41 Correct 5 ms 11612 KB Output is correct
42 Correct 4 ms 11612 KB Output is correct
43 Correct 5 ms 11612 KB Output is correct
44 Correct 6 ms 11612 KB Output is correct
45 Correct 6 ms 11612 KB Output is correct
46 Correct 6 ms 11608 KB Output is correct
47 Correct 6 ms 11612 KB Output is correct
48 Correct 6 ms 11612 KB Output is correct
49 Correct 5 ms 11612 KB Output is correct
50 Correct 5 ms 11612 KB Output is correct
51 Correct 5 ms 11612 KB Output is correct
52 Correct 5 ms 11612 KB Output is correct
53 Correct 5 ms 11624 KB Output is correct
54 Correct 4 ms 11612 KB Output is correct
55 Correct 4 ms 11612 KB Output is correct
56 Correct 3 ms 11608 KB Output is correct
57 Correct 3 ms 11612 KB Output is correct
58 Correct 3 ms 11612 KB Output is correct
59 Correct 4 ms 11612 KB Output is correct
60 Correct 5 ms 11612 KB Output is correct
61 Correct 6 ms 11612 KB Output is correct
62 Correct 4 ms 11616 KB Output is correct
63 Correct 4 ms 11864 KB Output is correct
64 Correct 4 ms 11612 KB Output is correct
65 Correct 5 ms 11612 KB Output is correct
66 Correct 5 ms 11612 KB Output is correct
67 Correct 6 ms 11600 KB Output is correct
68 Correct 5 ms 11612 KB Output is correct
69 Correct 5 ms 11628 KB Output is correct
70 Correct 4 ms 11612 KB Output is correct
71 Correct 5 ms 11612 KB Output is correct
72 Correct 4 ms 11612 KB Output is correct
73 Correct 6 ms 11532 KB Output is correct
74 Correct 3 ms 11612 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 2 ms 11352 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11356 KB Output is correct
9 Correct 2 ms 11428 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct
11 Correct 2 ms 11356 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 11352 KB Output is correct
14 Correct 2 ms 11356 KB Output is correct
15 Correct 2 ms 11504 KB Output is correct
16 Correct 2 ms 11356 KB Output is correct
17 Correct 2 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 2 ms 11356 KB Output is correct
20 Correct 2 ms 11356 KB Output is correct
21 Correct 2 ms 11356 KB Output is correct
22 Correct 2 ms 11352 KB Output is correct
23 Correct 2 ms 11356 KB Output is correct
24 Correct 2 ms 11356 KB Output is correct
25 Correct 3 ms 11356 KB Output is correct
26 Correct 2 ms 11356 KB Output is correct
27 Correct 2 ms 11356 KB Output is correct
28 Correct 2 ms 11356 KB Output is correct
29 Correct 3 ms 11528 KB Output is correct
30 Correct 2 ms 11356 KB Output is correct
31 Correct 3 ms 11540 KB Output is correct
32 Correct 2 ms 11356 KB Output is correct
33 Correct 2 ms 11356 KB Output is correct
34 Correct 2 ms 11356 KB Output is correct
35 Correct 2 ms 11356 KB Output is correct
36 Correct 2 ms 11356 KB Output is correct
37 Correct 2 ms 11356 KB Output is correct
38 Correct 6 ms 11612 KB Output is correct
39 Correct 6 ms 11444 KB Output is correct
40 Correct 5 ms 11612 KB Output is correct
41 Correct 5 ms 11612 KB Output is correct
42 Correct 4 ms 11612 KB Output is correct
43 Correct 5 ms 11612 KB Output is correct
44 Correct 6 ms 11612 KB Output is correct
45 Correct 6 ms 11612 KB Output is correct
46 Correct 6 ms 11608 KB Output is correct
47 Correct 6 ms 11612 KB Output is correct
48 Correct 6 ms 11612 KB Output is correct
49 Correct 5 ms 11612 KB Output is correct
50 Correct 5 ms 11612 KB Output is correct
51 Correct 5 ms 11612 KB Output is correct
52 Correct 5 ms 11612 KB Output is correct
53 Correct 5 ms 11624 KB Output is correct
54 Correct 4 ms 11612 KB Output is correct
55 Correct 4 ms 11612 KB Output is correct
56 Correct 3 ms 11608 KB Output is correct
57 Correct 3 ms 11612 KB Output is correct
58 Correct 3 ms 11612 KB Output is correct
59 Correct 4 ms 11612 KB Output is correct
60 Correct 5 ms 11612 KB Output is correct
61 Correct 6 ms 11612 KB Output is correct
62 Correct 4 ms 11616 KB Output is correct
63 Correct 4 ms 11864 KB Output is correct
64 Correct 4 ms 11612 KB Output is correct
65 Correct 5 ms 11612 KB Output is correct
66 Correct 5 ms 11612 KB Output is correct
67 Correct 6 ms 11600 KB Output is correct
68 Correct 5 ms 11612 KB Output is correct
69 Correct 5 ms 11628 KB Output is correct
70 Correct 4 ms 11612 KB Output is correct
71 Correct 5 ms 11612 KB Output is correct
72 Correct 4 ms 11612 KB Output is correct
73 Correct 6 ms 11532 KB Output is correct
74 Correct 3 ms 11612 KB Output is correct
75 Correct 965 ms 14536 KB Output is correct
76 Correct 1089 ms 19236 KB Output is correct
77 Correct 808 ms 18824 KB Output is correct
78 Correct 890 ms 18364 KB Output is correct
79 Correct 98 ms 18120 KB Output is correct
80 Correct 169 ms 18028 KB Output is correct
81 Correct 903 ms 18376 KB Output is correct
82 Correct 1158 ms 17860 KB Output is correct
83 Correct 1049 ms 18412 KB Output is correct
84 Correct 1068 ms 17600 KB Output is correct
85 Correct 984 ms 17348 KB Output is correct
86 Correct 479 ms 17900 KB Output is correct
87 Correct 495 ms 17600 KB Output is correct
88 Correct 771 ms 17428 KB Output is correct
89 Correct 761 ms 18376 KB Output is correct
90 Correct 507 ms 17600 KB Output is correct
91 Correct 299 ms 17088 KB Output is correct
92 Correct 338 ms 17680 KB Output is correct
93 Correct 381 ms 17720 KB Output is correct
94 Correct 256 ms 17604 KB Output is correct
95 Correct 466 ms 17604 KB Output is correct
96 Correct 543 ms 18120 KB Output is correct
97 Correct 594 ms 17628 KB Output is correct
98 Correct 661 ms 17608 KB Output is correct
99 Correct 549 ms 18108 KB Output is correct
100 Correct 437 ms 17092 KB Output is correct
101 Correct 482 ms 17100 KB Output is correct
102 Correct 886 ms 17992 KB Output is correct
103 Correct 868 ms 17132 KB Output is correct
104 Correct 979 ms 17352 KB Output is correct
105 Correct 699 ms 18116 KB Output is correct
106 Correct 706 ms 17604 KB Output is correct
107 Correct 629 ms 17240 KB Output is correct
108 Correct 787 ms 18680 KB Output is correct
109 Correct 618 ms 19144 KB Output is correct
110 Correct 376 ms 17200 KB Output is correct
111 Correct 539 ms 16868 KB Output is correct
112 Correct 945 ms 16584 KB Output is correct
113 Correct 101 ms 18632 KB Output is correct