oj.uz

Submission #718682

# Submission time Handle Problem Language Result Execution time Memory
718682 2023-04-04T14:04:18 Z walterw Cake 3 (JOI19_cake3) C++17
100 / 100
 2970 ms 216836 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

#define int ll

pair<int, int> p[200005];

int v[200005], c[200005];

struct pqremove {
    priority_queue<ll, vector<ll>, greater<ll>> pq, rpq;

    ll sz;
    ll sum = 0;

    vector<pair<ll, ll>> ops;

    void init (int size) {
        sz = size;

        for (int i = 0; i < sz; i++) pq.push(-1e13);

        sum = sz * (ll) (-1e13);
    }

    void insert(int k) {
        while (!rpq.empty() && rpq.top() == pq.top()) {
            pq.pop();
            rpq.pop();
        }

        pq.push(k);
        sum += k;
        ops.emplace_back(0, k);
        sum -= pq.top();
        ops.push_back({1, pq.top()});
        pq.pop();
    }

    void undo(int t) {
        while (ops.size() > t) {
            auto [i, k] = ops.back();
            ops.pop_back();

            if (i == 0) {
                rpq.push(k);
                sum -= k;
            } else {
                pq.push(k);
                sum += k;
            }
        }

        while (!rpq.empty() && rpq.top() == pq.top()) {
            pq.pop();
            rpq.pop();
        }
    }
};

pqremove st;
ll dp[200005];
ll ans = -1e18;

void dnc(int l, int r, int lb, int rb) {
    if (l > r) return;

    int mid = (l + r) / 2;

    int t = st.ops.size();

    for (int i = mid - 1; i >= l && i > rb; i--) {
        st.insert(v[i]);
    }

    for (int i = min(mid - 1, rb); i >= lb; i--) {
        dp[i] = v[i] + v[mid] + st.sum - 2 * (c[mid] - c[i]);
        st.insert(v[i]);
    }

    st.undo(t);

    int maxsofar = lb;
    for (int i = min(mid - 1, rb); i >= lb; i--) {
        if (dp[i] >= dp[maxsofar]) {
            maxsofar = i;
        }
    }

    ans = max(ans, dp[maxsofar]);

    if (l <= mid - 1) {
        for (int i = min(l - 1, rb); i > maxsofar; i--) {
            st.insert(v[i]);
        }

        dnc(l, mid - 1, lb, maxsofar);

        st.undo(t);
    }

    if (r >= mid + 1) {
        for (int i = max(rb + 1, l); i <= mid; i++) {
            st.insert(v[i]);
        }

        dnc(mid + 1, r, maxsofar, rb);

        st.undo(t);
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n, m; cin >> n >> m;

    st.init(m - 2);

    for (int i = 1; i <= n; i++) {
        cin >> p[i].second >> p[i].first;
    }

    sort( p+ 1, p + 1 + n);

    for (int i = 1; i <= n; i++) {
        c[i] = p[i].first;
        v[i] = p[i].second;
    }

    dnc(1, n, 1, n);

    cout << ans;
}

Compilation message

cake3.cpp: In member function 'void pqremove::undo(ll)':
cake3.cpp:69:27: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   69 |         while (ops.size() > t) {
      |                ~~~~~~~~~~~^~~

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 340 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 256 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 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 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 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 340 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 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 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 340 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 256 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 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 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 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 340 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 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 12 ms 852 KB Output is correct
39 Correct 14 ms 1220 KB Output is correct
40 Correct 11 ms 1428 KB Output is correct
41 Correct 11 ms 1064 KB Output is correct
42 Correct 9 ms 1620 KB Output is correct
43 Correct 10 ms 1244 KB Output is correct
44 Correct 10 ms 1056 KB Output is correct
45 Correct 10 ms 1120 KB Output is correct
46 Correct 11 ms 1056 KB Output is correct
47 Correct 10 ms 1108 KB Output is correct
48 Correct 9 ms 1248 KB Output is correct
49 Correct 9 ms 1372 KB Output is correct
50 Correct 10 ms 1436 KB Output is correct
51 Correct 8 ms 1436 KB Output is correct
52 Correct 8 ms 1432 KB Output is correct
53 Correct 9 ms 1356 KB Output is correct
54 Correct 8 ms 1620 KB Output is correct
55 Correct 7 ms 1616 KB Output is correct
56 Correct 8 ms 1620 KB Output is correct
57 Correct 8 ms 1620 KB Output is correct
58 Correct 8 ms 1568 KB Output is correct
59 Correct 5 ms 724 KB Output is correct
60 Correct 5 ms 596 KB Output is correct
61 Correct 4 ms 724 KB Output is correct
62 Correct 5 ms 800 KB Output is correct
63 Correct 8 ms 724 KB Output is correct
64 Correct 5 ms 852 KB Output is correct
65 Correct 10 ms 1056 KB Output is correct
66 Correct 9 ms 1100 KB Output is correct
67 Correct 9 ms 1108 KB Output is correct
68 Correct 10 ms 1112 KB Output is correct
69 Correct 11 ms 1368 KB Output is correct
70 Correct 11 ms 1328 KB Output is correct
71 Correct 8 ms 1028 KB Output is correct
72 Correct 8 ms 1628 KB Output is correct
73 Correct 10 ms 724 KB Output is correct
74 Correct 9 ms 1620 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 340 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 256 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 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 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 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 340 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 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 12 ms 852 KB Output is correct
39 Correct 14 ms 1220 KB Output is correct
40 Correct 11 ms 1428 KB Output is correct
41 Correct 11 ms 1064 KB Output is correct
42 Correct 9 ms 1620 KB Output is correct
43 Correct 10 ms 1244 KB Output is correct
44 Correct 10 ms 1056 KB Output is correct
45 Correct 10 ms 1120 KB Output is correct
46 Correct 11 ms 1056 KB Output is correct
47 Correct 10 ms 1108 KB Output is correct
48 Correct 9 ms 1248 KB Output is correct
49 Correct 9 ms 1372 KB Output is correct
50 Correct 10 ms 1436 KB Output is correct
51 Correct 8 ms 1436 KB Output is correct
52 Correct 8 ms 1432 KB Output is correct
53 Correct 9 ms 1356 KB Output is correct
54 Correct 8 ms 1620 KB Output is correct
55 Correct 7 ms 1616 KB Output is correct
56 Correct 8 ms 1620 KB Output is correct
57 Correct 8 ms 1620 KB Output is correct
58 Correct 8 ms 1568 KB Output is correct
59 Correct 5 ms 724 KB Output is correct
60 Correct 5 ms 596 KB Output is correct
61 Correct 4 ms 724 KB Output is correct
62 Correct 5 ms 800 KB Output is correct
63 Correct 8 ms 724 KB Output is correct
64 Correct 5 ms 852 KB Output is correct
65 Correct 10 ms 1056 KB Output is correct
66 Correct 9 ms 1100 KB Output is correct
67 Correct 9 ms 1108 KB Output is correct
68 Correct 10 ms 1112 KB Output is correct
69 Correct 11 ms 1368 KB Output is correct
70 Correct 11 ms 1328 KB Output is correct
71 Correct 8 ms 1028 KB Output is correct
72 Correct 8 ms 1628 KB Output is correct
73 Correct 10 ms 724 KB Output is correct
74 Correct 9 ms 1620 KB Output is correct
75 Correct 2944 ms 68660 KB Output is correct
76 Correct 2970 ms 56004 KB Output is correct
77 Correct 2757 ms 79692 KB Output is correct
78 Correct 2924 ms 76216 KB Output is correct
79 Correct 1165 ms 215976 KB Output is correct
80 Correct 1324 ms 141580 KB Output is correct
81 Correct 1798 ms 114028 KB Output is correct
82 Correct 2174 ms 85060 KB Output is correct
83 Correct 2001 ms 121200 KB Output is correct
84 Correct 2128 ms 121224 KB Output is correct
85 Correct 1840 ms 114088 KB Output is correct
86 Correct 1353 ms 126388 KB Output is correct
87 Correct 1472 ms 120140 KB Output is correct
88 Correct 1679 ms 113296 KB Output is correct
89 Correct 1662 ms 120268 KB Output is correct
90 Correct 1534 ms 139472 KB Output is correct
91 Correct 1381 ms 134616 KB Output is correct
92 Correct 1425 ms 132512 KB Output is correct
93 Correct 1497 ms 135908 KB Output is correct
94 Correct 1525 ms 214700 KB Output is correct
95 Correct 2068 ms 141012 KB Output is correct
96 Correct 1240 ms 27444 KB Output is correct
97 Correct 1329 ms 29656 KB Output is correct
98 Correct 1214 ms 36152 KB Output is correct
99 Correct 1407 ms 39552 KB Output is correct
100 Correct 1388 ms 43292 KB Output is correct
101 Correct 1361 ms 41192 KB Output is correct
102 Correct 1767 ms 82136 KB Output is correct
103 Correct 1605 ms 119784 KB Output is correct
104 Correct 1632 ms 84612 KB Output is correct
105 Correct 1277 ms 121556 KB Output is correct
106 Correct 1477 ms 116944 KB Output is correct
107 Correct 1457 ms 114364 KB Output is correct
108 Correct 2671 ms 116352 KB Output is correct
109 Correct 2540 ms 117580 KB Output is correct
110 Correct 1233 ms 114612 KB Output is correct
111 Correct 1355 ms 119160 KB Output is correct
112 Correct 1814 ms 69768 KB Output is correct
113 Correct 1236 ms 216836 KB Output is correct