oj.uz

Submission #681684

# Submission time Handle Problem Language Result Execution time Memory
681684 2023-01-13T16:58:10 Z peijar Cake 3 (JOI19_cake3) C++17
100 / 100
 2763 ms 16620 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

int nbElem, nbVoulus;
struct Container {
  multiset<int> small, big;
  int sum = 0;

  Container() {}

  void fix() {
    while ((int)big.size() > nbVoulus - 2) {
      int toDel = *big.begin();
      sum -= toDel;
      big.erase(big.begin());
      small.insert(toDel);
    }
    while ((int)big.size() < nbVoulus - 2 and !small.empty()) {
      int toDel = *small.rbegin();
      small.erase(small.find(toDel));
      sum += toDel;
      big.insert(toDel);
    }
  }

  void add(int x) {
    if (small.empty())
      big.insert(x), sum += x;
    else if (big.empty())
      small.insert(x);
    else if (x < *small.rbegin())
      small.insert(x);
    else
      big.insert(x), sum += x;
    fix();
  }

  void erase(int x) {
    if (big.count(x))
      big.erase(big.find(x)), sum -= x;
    else
      small.erase(small.find(x));
    fix();
  }
};

const int INF = 1e18;

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  cin >> nbElem >> nbVoulus;

  vector<pair<int, int>> arr(nbElem);
  for (auto &[V, C] : arr)
    cin >> V >> C;
  sort(arr.begin(), arr.end(), [&](auto l, auto r) {
    return pair(l.second, l.first) < pair(r.second, r.first);
  });

  int curL = 0, curR = 0;

  Container container;

  auto calc = [&](int l, int r) {
    if (r - l < nbVoulus - 2)
      return -INF;
    while (curR < r)
      container.add(arr[curR++].first);
    while (curL < l)
      container.erase(arr[curL++].first);
    while (curL > l)
      container.add(arr[--curL].first);
    while (curR > r)
      container.erase(arr[--curR].first);
    return container.sum;
  };

  int sol = -INF;

  auto Solve = [&](auto solve, int deb, int fin, int optL, int optR) {
    if (deb == fin)
      return;
    int mid = (deb + fin) / 2;
    int opt = -1;
    int dp = -INF;

    for (int i = min(optR, mid) - 1; i >= optL; --i) {
      int v = arr[mid].first + arr[i].first -
              2 * (arr[mid].second - arr[i].second) + calc(i + 1, mid);
      if (v > dp)
        opt = i, dp = v;
    }
    sol = max(sol, dp);
    solve(solve, deb, mid, optL, opt + 1);
    solve(solve, mid + 1, fin, opt, optR);
  };

  Solve(Solve, nbVoulus - 1, nbElem, 0, nbElem);
  cout << sol << endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 6 ms 340 KB Output is correct
39 Correct 7 ms 340 KB Output is correct
40 Correct 5 ms 340 KB Output is correct
41 Correct 5 ms 340 KB Output is correct
42 Correct 3 ms 340 KB Output is correct
43 Correct 4 ms 340 KB Output is correct
44 Correct 7 ms 340 KB Output is correct
45 Correct 7 ms 340 KB Output is correct
46 Correct 7 ms 340 KB Output is correct
47 Correct 8 ms 340 KB Output is correct
48 Correct 7 ms 408 KB Output is correct
49 Correct 6 ms 416 KB Output is correct
50 Correct 6 ms 340 KB Output is correct
51 Correct 6 ms 356 KB Output is correct
52 Correct 5 ms 340 KB Output is correct
53 Correct 6 ms 412 KB Output is correct
54 Correct 4 ms 340 KB Output is correct
55 Correct 3 ms 340 KB Output is correct
56 Correct 3 ms 340 KB Output is correct
57 Correct 3 ms 340 KB Output is correct
58 Correct 3 ms 340 KB Output is correct
59 Correct 4 ms 408 KB Output is correct
60 Correct 6 ms 408 KB Output is correct
61 Correct 4 ms 340 KB Output is correct
62 Correct 4 ms 340 KB Output is correct
63 Correct 5 ms 340 KB Output is correct
64 Correct 4 ms 340 KB Output is correct
65 Correct 7 ms 404 KB Output is correct
66 Correct 7 ms 408 KB Output is correct
67 Correct 7 ms 340 KB Output is correct
68 Correct 6 ms 340 KB Output is correct
69 Correct 7 ms 340 KB Output is correct
70 Correct 6 ms 348 KB Output is correct
71 Correct 6 ms 340 KB Output is correct
72 Correct 4 ms 340 KB Output is correct
73 Correct 3 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 2507 ms 12108 KB Output is correct
76 Correct 2763 ms 15168 KB Output is correct
77 Correct 2306 ms 15620 KB Output is correct
78 Correct 2340 ms 15908 KB Output is correct
79 Correct 127 ms 15948 KB Output is correct
80 Correct 362 ms 15356 KB Output is correct
81 Correct 2313 ms 12248 KB Output is correct
82 Correct 2577 ms 11704 KB Output is correct
83 Correct 2649 ms 12508 KB Output is correct
84 Correct 2679 ms 12332 KB Output is correct
85 Correct 2384 ms 12296 KB Output is correct
86 Correct 1208 ms 12744 KB Output is correct
87 Correct 1340 ms 12536 KB Output is correct
88 Correct 2064 ms 11852 KB Output is correct
89 Correct 2037 ms 12616 KB Output is correct
90 Correct 1350 ms 13788 KB Output is correct
91 Correct 820 ms 13360 KB Output is correct
92 Correct 847 ms 13184 KB Output is correct
93 Correct 1054 ms 13516 KB Output is correct
94 Correct 723 ms 14724 KB Output is correct
95 Correct 1312 ms 13792 KB Output is correct
96 Correct 880 ms 11824 KB Output is correct
97 Correct 936 ms 12776 KB Output is correct
98 Correct 941 ms 12420 KB Output is correct
99 Correct 937 ms 12840 KB Output is correct
100 Correct 700 ms 12472 KB Output is correct
101 Correct 721 ms 12492 KB Output is correct
102 Correct 2103 ms 11432 KB Output is correct
103 Correct 1966 ms 11596 KB Output is correct
104 Correct 2212 ms 11724 KB Output is correct
105 Correct 1833 ms 12680 KB Output is correct
106 Correct 1918 ms 13068 KB Output is correct
107 Correct 1591 ms 13004 KB Output is correct
108 Correct 2236 ms 15704 KB Output is correct
109 Correct 1670 ms 16480 KB Output is correct
110 Correct 1107 ms 12064 KB Output is correct
111 Correct 1550 ms 11084 KB Output is correct
112 Correct 468 ms 10912 KB Output is correct
113 Correct 122 ms 16620 KB Output is correct