oj.uz

답안 #807700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807700 2023-08-04T21:56:51 Z dong_liu Cake 3 (JOI19_cake3) C++17
100 / 100
 700 ms 9536 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 200000

namespace kactl {

typedef long long ll;
#define sz(x) int(x.size())

/**
 * Author: Lukas Polacek
 * Date: 2009-10-30
 * License: CC0
 * Source: folklore/TopCoder
 * Description: Computes partial sums a[0] + a[1] + ... + a[pos - 1], and
 * updates single elements a[i], taking the difference between the old and new
 * value. Time: Both operations are $O(\log N)$. Status: Stress-tested
 */

struct FT {
  vector<ll> s;
  vector<int> k;
  void init(int n) {
    s.assign(n, 0);
    k.assign(n, 0);
  }
  void update(int pos, ll dif, int c) {  // a[pos] += dif
    for (; pos < sz(s); pos |= pos + 1) {
      s[pos] += dif;
      k[pos] += c;
    }
  }
  ll query(int pos) {  // sum of values in [0, pos)
    ll res = 0;
    for (; pos > 0; pos &= pos - 1) res += s[pos - 1];
    return res;
  }
  int lower_bound(int c) {  // min pos st sum of [0, pos] >= sum
    // Returns n if no sum is >= sum, or -1 if empty sum is.
    if (c <= 0) return -1;
    int pos = 0;  // ll sum = 0;
    for (int pw = 1 << 25; pw; pw >>= 1) {
      if (pos + pw <= sz(k) && k[pos + pw - 1] < c) {
        pos += pw, c -= k[pos - 1];
      }
    }
    return pos;
  }
  ll q_(int c) { return query(lower_bound(c) + 1); }
} ft;

}  // namespace kactl

array<int, 2> aa[N];
int ii[N];

int l_ = 0, r_ = -1, m_;

long long query(int l, int r) {
  if (r - l + 1 < m_) return -0x3f3f3f3f3f3f3f3f;
  while (l_ < l) kactl::ft.update(ii[l_], -aa[l_][1], -1), l_++;
  while (l_ > l) l_--, kactl::ft.update(ii[l_], +aa[l_][1], +1);
  while (r_ > r) kactl::ft.update(ii[r_], -aa[r_][1], -1), r_--;
  while (r_ < r) r_++, kactl::ft.update(ii[r_], +aa[r_][1], +1);
  return kactl::ft.q_(m_) - (long long)2 * (aa[r][0] - aa[l][0]);
}

long long ans = -0x3f3f3f3f3f3f3f3f;

void dnc(int lo, int ro, int l, int r) {
  long long tmp;
  int m, mo;

  if (l > r) return;
  m = (l + r) / 2, mo = lo;
  tmp = query(mo, m);
  for (int i = lo; i <= ro; i++) {
    long long tmp_ = query(i, m);

    if (tmp_ > tmp) {
      tmp = tmp_;
      mo = i;
    }
  }
  ans = max(ans, tmp);
  if (mo == -1) {
    assert(0);
    dnc(lo, ro, m + 1, r);
  } else {
    dnc(lo, mo, l, m - 1);
    dnc(mo, ro, m + 1, r);
  }
}

int main() {
  static int ii_[N];
  int n;

  scanf("%d%d", &n, &m_);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &aa[i][1], &aa[i][0]);
    ii_[i] = i;
  }
  sort(aa, aa + n);
  sort(ii_, ii_ + n, [&](int i, int j) { return aa[i][1] > aa[j][1]; });
  for (int i = 0; i < n; i++) ii[ii_[i]] = i;
  kactl::ft.init(n + 5);
  dnc(0, n - 1, 0, n - 1);
  printf("%lld\n", ans);
  return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  100 |   scanf("%d%d", &n, &m_);
      |   ~~~~~^~~~~~~~~~~~~~~~~
cake3.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |     scanf("%d%d", &aa[i][1], &aa[i][0]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 1 ms 212 KB Output is correct
27 Correct 1 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 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 1 ms 212 KB Output is correct
27 Correct 1 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 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 3 ms 340 KB Output is correct
39 Correct 3 ms 340 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 324 KB Output is correct
44 Correct 2 ms 396 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 3 ms 340 KB Output is correct
47 Correct 3 ms 360 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 2 ms 320 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 2 ms 340 KB Output is correct
55 Correct 2 ms 324 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 2 ms 340 KB Output is correct
60 Correct 2 ms 360 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 2 ms 340 KB Output is correct
63 Correct 3 ms 320 KB Output is correct
64 Correct 2 ms 340 KB Output is correct
65 Correct 3 ms 340 KB Output is correct
66 Correct 2 ms 356 KB Output is correct
67 Correct 2 ms 340 KB Output is correct
68 Correct 2 ms 340 KB Output is correct
69 Correct 2 ms 340 KB Output is correct
70 Correct 2 ms 340 KB Output is correct
71 Correct 2 ms 320 KB Output is correct
72 Correct 2 ms 340 KB Output is correct
73 Correct 2 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 1 ms 212 KB Output is correct
27 Correct 1 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 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 3 ms 340 KB Output is correct
39 Correct 3 ms 340 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 324 KB Output is correct
44 Correct 2 ms 396 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 3 ms 340 KB Output is correct
47 Correct 3 ms 360 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 2 ms 320 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 2 ms 340 KB Output is correct
55 Correct 2 ms 324 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 2 ms 340 KB Output is correct
60 Correct 2 ms 360 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 2 ms 340 KB Output is correct
63 Correct 3 ms 320 KB Output is correct
64 Correct 2 ms 340 KB Output is correct
65 Correct 3 ms 340 KB Output is correct
66 Correct 2 ms 356 KB Output is correct
67 Correct 2 ms 340 KB Output is correct
68 Correct 2 ms 340 KB Output is correct
69 Correct 2 ms 340 KB Output is correct
70 Correct 2 ms 340 KB Output is correct
71 Correct 2 ms 320 KB Output is correct
72 Correct 2 ms 340 KB Output is correct
73 Correct 2 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 590 ms 9008 KB Output is correct
76 Correct 669 ms 8776 KB Output is correct
77 Correct 485 ms 9028 KB Output is correct
78 Correct 519 ms 9172 KB Output is correct
79 Correct 94 ms 9164 KB Output is correct
80 Correct 133 ms 8948 KB Output is correct
81 Correct 558 ms 8312 KB Output is correct
82 Correct 700 ms 8396 KB Output is correct
83 Correct 674 ms 8700 KB Output is correct
84 Correct 689 ms 8780 KB Output is correct
85 Correct 545 ms 8396 KB Output is correct
86 Correct 296 ms 8032 KB Output is correct
87 Correct 326 ms 7960 KB Output is correct
88 Correct 487 ms 7996 KB Output is correct
89 Correct 476 ms 8304 KB Output is correct
90 Correct 328 ms 8712 KB Output is correct
91 Correct 196 ms 8012 KB Output is correct
92 Correct 214 ms 7960 KB Output is correct
93 Correct 255 ms 8344 KB Output is correct
94 Correct 184 ms 8608 KB Output is correct
95 Correct 307 ms 8792 KB Output is correct
96 Correct 321 ms 8084 KB Output is correct
97 Correct 360 ms 8688 KB Output is correct
98 Correct 433 ms 8572 KB Output is correct
99 Correct 337 ms 8592 KB Output is correct
100 Correct 255 ms 8120 KB Output is correct
101 Correct 263 ms 8120 KB Output is correct
102 Correct 465 ms 8124 KB Output is correct
103 Correct 439 ms 8008 KB Output is correct
104 Correct 479 ms 8440 KB Output is correct
105 Correct 377 ms 8452 KB Output is correct
106 Correct 401 ms 8616 KB Output is correct
107 Correct 336 ms 8328 KB Output is correct
108 Correct 468 ms 8852 KB Output is correct
109 Correct 393 ms 9536 KB Output is correct
110 Correct 257 ms 7624 KB Output is correct
111 Correct 368 ms 7696 KB Output is correct
112 Correct 306 ms 7456 KB Output is correct
113 Correct 99 ms 9508 KB Output is correct