oj.uz

Submission #312503

# Submission time Handle Problem Language Result Execution time Memory
312503 2020-10-13T15:06:58 Z nathanlee726 Cake 3 (JOI19_cake3) C++14
100 / 100
 3898 ms 11256 KB 
#include <bits/stdc++.h>

using namespace std;

const long long inf = 1ll << 60;

class solver {
 public:
  multiset<int> already, candidate;
  long long ans;
  int m;

  solver(int m): m(m) {
    ans = 0;
  }

  void insert(int x) {
    if ((int) already.size() == m) {
      if (x > *already.begin()) {
        ans += x - *already.begin();
        candidate.insert(*already.begin());
        already.erase(already.begin());
        already.insert(x);
      } else {
        candidate.insert(x);
      }
    } else {
      already.insert(x);
      ans += x;
    }
  }

  void erase(int x) {
    if (candidate.find(x) != candidate.end()) {
      candidate.erase(candidate.find(x));
    } else {
      already.erase(already.find(x));
      ans -= x;
      if (!candidate.empty()) {
        ans += *candidate.rbegin();
        already.insert(*candidate.rbegin());
        candidate.erase(--candidate.end());
      }
    }
  }

  long long query() {
    return ans;
  }
};

int main() {
#ifdef wxh010910
  freopen("input.txt", "r", stdin);
#endif
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  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());
  int l = 0, r = -1;
  long long ans = -inf;
  solver s(m);
  auto get = [&](int ll, int rr) {
    while (r < rr) {
      s.insert(a[++r].second);
    }
    while (l > ll) {
      s.insert(a[--l].second);
    }
    while (r > rr) {
      s.erase(a[r--].second);
    }
    while (l < ll) {
      s.erase(a[l++].second);
    }
    return s.query() - 2 * (a[rr].first - a[ll].first);
  };
  function<void(int, int, int, int)> solve = [&](int l, int r, int ll, int rr) {
    if (l > r) {
      return;
    }
    int mid = (l + r) >> 1;
    long long res = -inf;
    int pos = -1;
    for (int i = ll; i <= mid - m + 1 && i <= rr; ++i) {
      long long weight = get(i, mid);
      if (res < weight) {
        res = weight;
        pos = i;
      }
    }
    ans = max(ans, res);
    solve(l, mid - 1, ll, pos);
    solve(mid + 1, r, pos, rr);
  };
  solve(m - 1, n - 1, 0, n - m);
  cout << ans << "\n";
  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 8 ms 384 KB Output is correct
39 Correct 9 ms 384 KB Output is correct
40 Correct 6 ms 384 KB Output is correct
41 Correct 6 ms 384 KB Output is correct
42 Correct 4 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 7 ms 384 KB Output is correct
45 Correct 8 ms 384 KB Output is correct
46 Correct 8 ms 384 KB Output is correct
47 Correct 9 ms 512 KB Output is correct
48 Correct 8 ms 384 KB Output is correct
49 Correct 7 ms 384 KB Output is correct
50 Correct 7 ms 384 KB Output is correct
51 Correct 6 ms 384 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 6 ms 384 KB Output is correct
54 Correct 4 ms 384 KB Output is correct
55 Correct 3 ms 384 KB Output is correct
56 Correct 3 ms 384 KB Output is correct
57 Correct 3 ms 384 KB Output is correct
58 Correct 3 ms 512 KB Output is correct
59 Correct 2 ms 384 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 3 ms 512 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 8 ms 384 KB Output is correct
66 Correct 7 ms 384 KB Output is correct
67 Correct 8 ms 384 KB Output is correct
68 Correct 7 ms 384 KB Output is correct
69 Correct 6 ms 384 KB Output is correct
70 Correct 6 ms 384 KB Output is correct
71 Correct 6 ms 512 KB Output is correct
72 Correct 3 ms 384 KB Output is correct
73 Correct 4 ms 384 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 3560 ms 10780 KB Output is correct
76 Correct 3898 ms 10492 KB Output is correct
77 Correct 3090 ms 10816 KB Output is correct
78 Correct 3359 ms 10872 KB Output is correct
79 Correct 185 ms 10744 KB Output is correct
80 Correct 457 ms 10584 KB Output is correct
81 Correct 2848 ms 7928 KB Output is correct
82 Correct 3155 ms 7288 KB Output is correct
83 Correct 3273 ms 7928 KB Output is correct
84 Correct 3391 ms 7928 KB Output is correct
85 Correct 2952 ms 7964 KB Output is correct
86 Correct 1459 ms 8568 KB Output is correct
87 Correct 1538 ms 8316 KB Output is correct
88 Correct 2464 ms 7800 KB Output is correct
89 Correct 2402 ms 8440 KB Output is correct
90 Correct 1664 ms 9336 KB Output is correct
91 Correct 1043 ms 9208 KB Output is correct
92 Correct 1068 ms 9080 KB Output is correct
93 Correct 1308 ms 9208 KB Output is correct
94 Correct 902 ms 10360 KB Output is correct
95 Correct 1610 ms 9336 KB Output is correct
96 Correct 409 ms 7672 KB Output is correct
97 Correct 453 ms 8312 KB Output is correct
98 Correct 459 ms 8056 KB Output is correct
99 Correct 443 ms 8440 KB Output is correct
100 Correct 338 ms 8312 KB Output is correct
101 Correct 366 ms 8312 KB Output is correct
102 Correct 2148 ms 7288 KB Output is correct
103 Correct 1961 ms 7416 KB Output is correct
104 Correct 2149 ms 7288 KB Output is correct
105 Correct 1781 ms 8312 KB Output is correct
106 Correct 1861 ms 8600 KB Output is correct
107 Correct 1634 ms 8696 KB Output is correct
108 Correct 3079 ms 10744 KB Output is correct
109 Correct 2363 ms 11256 KB Output is correct
110 Correct 1006 ms 8460 KB Output is correct
111 Correct 1430 ms 7416 KB Output is correct
112 Correct 915 ms 10360 KB Output is correct
113 Correct 184 ms 11256 KB Output is correct