oj.uz

답안 #966976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966976 2024-04-20T18:39:45 Z Soumya1 Cake 3 (JOI19_cake3) C++17
100 / 100
 692 ms 19020 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxN = 2e5 + 5;
const ll inf = 1e18;
int v[mxN], c[mxN], comp[mxN];
ll ans = -inf;
int n, m, lptr, rptr;
int bx[mxN];
ll by[mxN];
void upd(int i, int x, int y) {
  for (; i <= n; i += i & (-i)) bx[i] += x, by[i] += y;
}
pair<int, ll> query(int i) {
  int sx = 0;
  ll sy = 0;
  for (; i > 0; i -= i & (-i)) sx += bx[i], sy += by[i];
  return {sx, sy};
}
ll query() {
  int cur = 0, sumx = 0;
  for (int i = 18; i >= 0; i--) {
    if (cur + (1 << i) <= n && sumx + bx[cur + (1 << i)] < m) {
      sumx += bx[cur + (1 << i)];
      cur += (1 << i);
    }
  }
  auto [fx, fy] = query(cur + 1);
  if (fx != m) return -inf;
  return fy;
}
void add(int i) {
  if (!i) return;
  upd(comp[i], 1, v[i]);
}
void rem(int i) {
  if (!i) return;
  upd(comp[i], -1, -v[i]);
}
ll get(int l, int r) {
  while (lptr > l) add(--lptr);
  while (rptr < r) add(++rptr);
  while (rptr > r) rem(rptr--);
  while (lptr < l) rem(lptr++);
  return query();
}
void solve(int l, int r, int optl, int optr) {
  if (l > r) return;
  int m = (l + r) >> 1;
  int opt;
  ll best = -inf;
  for (int i = max(m, optl); i <= optr; i++) {
    if (best < get(m, i) + 2 * (c[m] - c[i])) {
      best = get(m, i) + 2 * (c[m] - c[i]);
      opt = i;
    }
  }
  ans = max(ans, best);
  if (best == -inf) {
    solve(l, m - 1, optl, optr);
  } else {
    solve(l, m - 1, optl, opt);
    solve(m + 1, r, opt, optr);
  }
}
void testCase() {
  cin >> n >> m;
  vector<int> all;
  for (int i = 1; i <= n; i++) {
    cin >> v[i] >> c[i];
    all.push_back(v[i]);
  }
  {
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 1);
    sort(ord.begin(), ord.end(), [&](int i, int j) { return c[i] < c[j]; });
    vector<int> nv(n + 1), nc(n + 1);
    for (int i = 0; i < n; i++) nv[i + 1] = v[ord[i]], nc[i + 1] = c[ord[i]];
    for (int i = 1; i <= n; i++) c[i] = nc[i], v[i] = nv[i];
  }
  sort(all.rbegin(), all.rend());
  map<int, int> mp;
  for (int i = n - 1; i >= 0; i--) mp[all[i]] = i + 1;
  vector<bool> done(all.size());
  for (int i = 1; i <= n; i++) {
    comp[i] = mp[v[i]]++;
  }
  solve(1, n, 1, n);
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4452 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 1 ms 4576 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4564 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 1 ms 4696 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4512 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4452 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 1 ms 4576 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4564 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 1 ms 4696 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4512 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 4 ms 4700 KB Output is correct
39 Correct 4 ms 4696 KB Output is correct
40 Correct 3 ms 4700 KB Output is correct
41 Correct 3 ms 4700 KB Output is correct
42 Correct 3 ms 4700 KB Output is correct
43 Correct 3 ms 4700 KB Output is correct
44 Correct 3 ms 4572 KB Output is correct
45 Correct 3 ms 4700 KB Output is correct
46 Correct 4 ms 4700 KB Output is correct
47 Correct 3 ms 4700 KB Output is correct
48 Correct 3 ms 4700 KB Output is correct
49 Correct 3 ms 4700 KB Output is correct
50 Correct 3 ms 4696 KB Output is correct
51 Correct 3 ms 4696 KB Output is correct
52 Correct 3 ms 4700 KB Output is correct
53 Correct 3 ms 4700 KB Output is correct
54 Correct 3 ms 4700 KB Output is correct
55 Correct 3 ms 4696 KB Output is correct
56 Correct 3 ms 4696 KB Output is correct
57 Correct 3 ms 4696 KB Output is correct
58 Correct 3 ms 4700 KB Output is correct
59 Correct 2 ms 4440 KB Output is correct
60 Correct 3 ms 4444 KB Output is correct
61 Correct 3 ms 4444 KB Output is correct
62 Correct 3 ms 4444 KB Output is correct
63 Correct 3 ms 4444 KB Output is correct
64 Correct 3 ms 4444 KB Output is correct
65 Correct 4 ms 4696 KB Output is correct
66 Correct 3 ms 4700 KB Output is correct
67 Correct 3 ms 4700 KB Output is correct
68 Correct 3 ms 4716 KB Output is correct
69 Correct 3 ms 4696 KB Output is correct
70 Correct 3 ms 4700 KB Output is correct
71 Correct 3 ms 4444 KB Output is correct
72 Correct 3 ms 4632 KB Output is correct
73 Correct 3 ms 4700 KB Output is correct
74 Correct 3 ms 4700 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4452 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 1 ms 4576 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4564 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 1 ms 4696 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4512 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 4 ms 4700 KB Output is correct
39 Correct 4 ms 4696 KB Output is correct
40 Correct 3 ms 4700 KB Output is correct
41 Correct 3 ms 4700 KB Output is correct
42 Correct 3 ms 4700 KB Output is correct
43 Correct 3 ms 4700 KB Output is correct
44 Correct 3 ms 4572 KB Output is correct
45 Correct 3 ms 4700 KB Output is correct
46 Correct 4 ms 4700 KB Output is correct
47 Correct 3 ms 4700 KB Output is correct
48 Correct 3 ms 4700 KB Output is correct
49 Correct 3 ms 4700 KB Output is correct
50 Correct 3 ms 4696 KB Output is correct
51 Correct 3 ms 4696 KB Output is correct
52 Correct 3 ms 4700 KB Output is correct
53 Correct 3 ms 4700 KB Output is correct
54 Correct 3 ms 4700 KB Output is correct
55 Correct 3 ms 4696 KB Output is correct
56 Correct 3 ms 4696 KB Output is correct
57 Correct 3 ms 4696 KB Output is correct
58 Correct 3 ms 4700 KB Output is correct
59 Correct 2 ms 4440 KB Output is correct
60 Correct 3 ms 4444 KB Output is correct
61 Correct 3 ms 4444 KB Output is correct
62 Correct 3 ms 4444 KB Output is correct
63 Correct 3 ms 4444 KB Output is correct
64 Correct 3 ms 4444 KB Output is correct
65 Correct 4 ms 4696 KB Output is correct
66 Correct 3 ms 4700 KB Output is correct
67 Correct 3 ms 4700 KB Output is correct
68 Correct 3 ms 4716 KB Output is correct
69 Correct 3 ms 4696 KB Output is correct
70 Correct 3 ms 4700 KB Output is correct
71 Correct 3 ms 4444 KB Output is correct
72 Correct 3 ms 4632 KB Output is correct
73 Correct 3 ms 4700 KB Output is correct
74 Correct 3 ms 4700 KB Output is correct
75 Correct 692 ms 17988 KB Output is correct
76 Correct 680 ms 17796 KB Output is correct
77 Correct 662 ms 18176 KB Output is correct
78 Correct 659 ms 18188 KB Output is correct
79 Correct 440 ms 18452 KB Output is correct
80 Correct 471 ms 17920 KB Output is correct
81 Correct 515 ms 9924 KB Output is correct
82 Correct 611 ms 10808 KB Output is correct
83 Correct 605 ms 10396 KB Output is correct
84 Correct 600 ms 10340 KB Output is correct
85 Correct 548 ms 9996 KB Output is correct
86 Correct 460 ms 9376 KB Output is correct
87 Correct 432 ms 9376 KB Output is correct
88 Correct 523 ms 9732 KB Output is correct
89 Correct 525 ms 9736 KB Output is correct
90 Correct 444 ms 9640 KB Output is correct
91 Correct 435 ms 9040 KB Output is correct
92 Correct 411 ms 9080 KB Output is correct
93 Correct 433 ms 9236 KB Output is correct
94 Correct 458 ms 9396 KB Output is correct
95 Correct 456 ms 9524 KB Output is correct
96 Correct 343 ms 8496 KB Output is correct
97 Correct 387 ms 8872 KB Output is correct
98 Correct 434 ms 9160 KB Output is correct
99 Correct 341 ms 8904 KB Output is correct
100 Correct 345 ms 8544 KB Output is correct
101 Correct 359 ms 8640 KB Output is correct
102 Correct 504 ms 8660 KB Output is correct
103 Correct 510 ms 8544 KB Output is correct
104 Correct 545 ms 8696 KB Output is correct
105 Correct 471 ms 8692 KB Output is correct
106 Correct 496 ms 8948 KB Output is correct
107 Correct 468 ms 8784 KB Output is correct
108 Correct 660 ms 17972 KB Output is correct
109 Correct 629 ms 18996 KB Output is correct
110 Correct 425 ms 8140 KB Output is correct
111 Correct 428 ms 8148 KB Output is correct
112 Correct 627 ms 16260 KB Output is correct
113 Correct 448 ms 19020 KB Output is correct