oj.uz

Submission #952155

# Submission time Handle Problem Language Result Execution time Memory
952155 2024-03-23T07:01:12 Z GrandTiger1729 Cake 3 (JOI19_cake3) C++17
100 / 100
 2377 ms 15184 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, K;
    cin >> n >> K;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i].second >> a[i].first;
    }
    sort(a.begin(), a.end());
    long long cur = 0;
    multiset<int> st, st2;
    auto add = [&](int x)
    {
        st.insert(x);
        cur += x;
        while (st.size() > K)
        {
            auto it = st.begin();
            cur -= *it;
            st2.insert(*it);
            st.erase(it);
        }
    };
    auto del = [&](int x)
    {
        auto it = st.find(x);
        if (it == st.end())
        {
            it = st2.find(x);
            st2.erase(it);
        }
        else
        {
            cur -= *it;
            st.erase(it);
            while (st2.size() && st.size() < K)
            {
                it = --st2.end();
                cur += *it;
                st.insert(*it);
                st2.erase(it);
            }
        }
    };
    int ll = 0, rr = -1;
    auto query = [&]() -> long long
    {
        return st.size() == K ? cur : -INF;
    };
    long long ans = -INF;
    function<void(int, int, int, int)> solve = [&](int l, int r, int ql, int qr)
    {
        if (l > r)
        {
            return;
        }
        int mid = (l + r) / 2;
        pair<long long, int> maxn(-INF, INF);
        while (rr < mid)
        {
            add(a[++rr].second);
        }
        while (ll > qr)
        {
            add(a[--ll].second);
        }
        while (rr > mid && rr >= ll)
        {
            del(a[rr--].second);
        }
        if (rr > mid && rr < ll)
        {
            rr = mid;
            ll = mid + 1;
        }
        while (ll <= qr && ll <= rr)
        {
            del(a[ll++].second);
        }
        while (ll > ql)
        {
            add(a[--ll].second);
            maxn = max(maxn, make_pair(query() - 2ll * (a[mid].first - a[ll].first), ll));
        }
        auto [mx, j] = maxn;
        ans = max(ans, mx);
        solve(l, mid - 1, ql, j);
        solve(mid + 1, r, j, qr);
    };
    solve(K - 1, n - 1, 0, n - 1);
    cout << ans << '\n';
    return 0;
}

Compilation message

cake3.cpp: In lambda function:
cake3.cpp:22:26: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |         while (st.size() > K)
      |                ~~~~~~~~~~^~~
cake3.cpp: In lambda function:
cake3.cpp:42:44: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |             while (st2.size() && st.size() < K)
      |                                  ~~~~~~~~~~^~~
cake3.cpp: In lambda function:
cake3.cpp:54:26: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |         return st.size() == K ? cur : -INF;
      |                ~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 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 7 ms 348 KB Output is correct
39 Correct 7 ms 348 KB Output is correct
40 Correct 6 ms 556 KB Output is correct
41 Correct 7 ms 348 KB Output is correct
42 Correct 5 ms 544 KB Output is correct
43 Correct 5 ms 544 KB Output is correct
44 Correct 6 ms 348 KB Output is correct
45 Correct 7 ms 532 KB Output is correct
46 Correct 7 ms 348 KB Output is correct
47 Correct 7 ms 528 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 6 ms 348 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 6 ms 536 KB Output is correct
52 Correct 6 ms 348 KB Output is correct
53 Correct 6 ms 348 KB Output is correct
54 Correct 5 ms 348 KB Output is correct
55 Correct 6 ms 604 KB Output is correct
56 Correct 4 ms 348 KB Output is correct
57 Correct 4 ms 348 KB Output is correct
58 Correct 5 ms 348 KB Output is correct
59 Correct 4 ms 348 KB Output is correct
60 Correct 6 ms 344 KB Output is correct
61 Correct 4 ms 344 KB Output is correct
62 Correct 4 ms 348 KB Output is correct
63 Correct 5 ms 348 KB Output is correct
64 Correct 4 ms 348 KB Output is correct
65 Correct 7 ms 348 KB Output is correct
66 Correct 6 ms 348 KB Output is correct
67 Correct 7 ms 348 KB Output is correct
68 Correct 7 ms 348 KB Output is correct
69 Correct 7 ms 344 KB Output is correct
70 Correct 6 ms 348 KB Output is correct
71 Correct 6 ms 348 KB Output is correct
72 Correct 5 ms 348 KB Output is correct
73 Correct 4 ms 528 KB Output is correct
74 Correct 1 ms 348 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 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 7 ms 348 KB Output is correct
39 Correct 7 ms 348 KB Output is correct
40 Correct 6 ms 556 KB Output is correct
41 Correct 7 ms 348 KB Output is correct
42 Correct 5 ms 544 KB Output is correct
43 Correct 5 ms 544 KB Output is correct
44 Correct 6 ms 348 KB Output is correct
45 Correct 7 ms 532 KB Output is correct
46 Correct 7 ms 348 KB Output is correct
47 Correct 7 ms 528 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 6 ms 348 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 6 ms 536 KB Output is correct
52 Correct 6 ms 348 KB Output is correct
53 Correct 6 ms 348 KB Output is correct
54 Correct 5 ms 348 KB Output is correct
55 Correct 6 ms 604 KB Output is correct
56 Correct 4 ms 348 KB Output is correct
57 Correct 4 ms 348 KB Output is correct
58 Correct 5 ms 348 KB Output is correct
59 Correct 4 ms 348 KB Output is correct
60 Correct 6 ms 344 KB Output is correct
61 Correct 4 ms 344 KB Output is correct
62 Correct 4 ms 348 KB Output is correct
63 Correct 5 ms 348 KB Output is correct
64 Correct 4 ms 348 KB Output is correct
65 Correct 7 ms 348 KB Output is correct
66 Correct 6 ms 348 KB Output is correct
67 Correct 7 ms 348 KB Output is correct
68 Correct 7 ms 348 KB Output is correct
69 Correct 7 ms 344 KB Output is correct
70 Correct 6 ms 348 KB Output is correct
71 Correct 6 ms 348 KB Output is correct
72 Correct 5 ms 348 KB Output is correct
73 Correct 4 ms 528 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 2315 ms 10444 KB Output is correct
76 Correct 2257 ms 13640 KB Output is correct
77 Correct 2245 ms 14476 KB Output is correct
78 Correct 2263 ms 14932 KB Output is correct
79 Correct 743 ms 14416 KB Output is correct
80 Correct 1292 ms 13904 KB Output is correct
81 Correct 2217 ms 10836 KB Output is correct
82 Correct 2271 ms 10340 KB Output is correct
83 Correct 2366 ms 11092 KB Output is correct
84 Correct 2377 ms 10812 KB Output is correct
85 Correct 2166 ms 10812 KB Output is correct
86 Correct 1772 ms 11280 KB Output is correct
87 Correct 1748 ms 11092 KB Output is correct
88 Correct 1963 ms 10320 KB Output is correct
89 Correct 2070 ms 11348 KB Output is correct
90 Correct 1868 ms 12244 KB Output is correct
91 Correct 1564 ms 11860 KB Output is correct
92 Correct 1578 ms 11856 KB Output is correct
93 Correct 1675 ms 12048 KB Output is correct
94 Correct 1774 ms 13100 KB Output is correct
95 Correct 1820 ms 12224 KB Output is correct
96 Correct 849 ms 10324 KB Output is correct
97 Correct 902 ms 11092 KB Output is correct
98 Correct 939 ms 10856 KB Output is correct
99 Correct 891 ms 11188 KB Output is correct
100 Correct 751 ms 11112 KB Output is correct
101 Correct 791 ms 10832 KB Output is correct
102 Correct 1734 ms 10068 KB Output is correct
103 Correct 1675 ms 10068 KB Output is correct
104 Correct 1766 ms 10068 KB Output is correct
105 Correct 1723 ms 11088 KB Output is correct
106 Correct 1725 ms 11540 KB Output is correct
107 Correct 1570 ms 11344 KB Output is correct
108 Correct 2198 ms 14588 KB Output is correct
109 Correct 2216 ms 15052 KB Output is correct
110 Correct 1382 ms 10616 KB Output is correct
111 Correct 1609 ms 9552 KB Output is correct
112 Correct 695 ms 9556 KB Output is correct
113 Correct 174 ms 15184 KB Output is correct