oj.uz

Submission #366397

# Submission time Handle Problem Language Result Execution time Memory
366397 2021-02-14T06:37:15 Z Kazalika Cake 3 (JOI19_cake3) C++14
100 / 100
 2625 ms 35932 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
const int N = 2e5 + 5;
 
ll cval[N];
 
struct segment_tree {
  int size;
  vector<ll> sum, cnt;
  segment_tree() {}
  segment_tree(int sz) {
    size = sz;
    sum.resize(4 * size);
    cnt.resize(4 * size);
  }
  void upd(int t, int l, int r, int id, ll add) {
    if (l + 1 == r) {
      cnt[t] += add;
      sum[t] += add * cval[id];
      return;
    }
    int md = r + l >> 1;
    if (md > id)
      upd(t * 2 + 1, l, md, id, add);
    else
      upd(t * 2 + 2, md, r, id, add);
    sum[t] = sum[t * 2 + 1] + sum[t * 2 + 2];
    cnt[t] = cnt[t * 2 + 1] + cnt[t * 2 + 2];
  }
  void upd(int id, ll add) {
    upd(0, 0, size, id, add);
  }
  ll get(int t, int l, int r, ll k) {
    if (!k)
      return 0;
    if (l + 1 == r)
      return cval[l] * min(k, cnt[t]);
    int md = r + l >> 1;
    if (cnt[t * 2 + 1] >= k)
      return get(t * 2 + 1, l, md, k);
    return sum[t * 2 + 1] + get(t * 2 + 2, md, r, k - cnt[t * 2 + 1]);
  }
  ll get(ll k) {
    return get(0, 0, size, k);
  }
};
 
segment_tree sgt(N);
 
int n, m;
pair<ll, ll> vc[N];
vector<ll> vf;
 
const ll inf = 1e15;
 
ll ans[N];
 
int L, R = -1;
 
void add(int id) {
  sgt.upd(vc[id].first, 1);
}
void del(int id) {
  sgt.upd(vc[id].first, -1);
}
 
void move(int l, int r) {
  while (R < r) {
    R++;
    add(R);
  }
  while (L > l) {
    L--;
    add(L);
  }
  while (R > r) {
    del(R);
    R--;
  }
  while (L < l) {
    del(L);
    L++;
  }
}
 
void dc(int l, int r, int optl, int optr) {
  if (l > r)
    return;
  int md = l + r >> 1, opt = -1;
  ll mx = -inf;
  for (int p = max(optl, md + m - 1); p <= optr; ++p) {
    move(md, p);
    ll vl = sgt.get(m) - 2 * (vc[p].second - vc[md].second);
    if (vl > mx) {
      opt = p;
      mx = vl;
    }
  }
  assert(opt != -1);
  ans[md] = mx;
  dc(l, md - 1, optl, opt);
  dc(md + 1, r, opt, optr);
}
 
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m;
  vf.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> vc[i].first >> vc[i].second;
    vf[i] = vc[i].first;
  }
  sort(vc, vc + n, [&](pair<ll, ll> a, pair<ll, ll> b) { return a.second < b.second; });
  sort(vf.begin(), vf.end());
  vf.erase(unique(vf.begin(), vf.end()), vf.end());
  sort(vf.rbegin(), vf.rend());
  map<ll, ll> proper;
  for (int i = 0; i < vf.size(); ++i) {
    proper[vf[i]] = i;
    cval[i] = vf[i];
  }
  for (int i = 0; i < n; ++i)
    vc[i].first = proper[vc[i].first];
  dc(0, n - m, 0, n - 1);
  ll res = -inf;
  for (int i = 0; i <= n - m; ++i)
    res = max(res, ans[i]);
  cout << res;
}

Compilation message

cake3.cpp: In member function 'void segment_tree::upd(int, int, int, int, ll)':
cake3.cpp:25:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |     int md = r + l >> 1;
      |              ~~^~~
cake3.cpp: In member function 'll segment_tree::get(int, int, int, ll)':
cake3.cpp:41:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |     int md = r + l >> 1;
      |              ~~^~~
cake3.cpp: In function 'void dc(int, int, int, int)':
cake3.cpp:92:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |   int md = l + r >> 1, opt = -1;
      |            ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:122:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |   for (int i = 0; i < vf.size(); ++i) {
      |                   ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12908 KB Output is correct
2 Correct 8 ms 12908 KB Output is correct
3 Correct 8 ms 12908 KB Output is correct
4 Correct 7 ms 12908 KB Output is correct
5 Correct 7 ms 12908 KB Output is correct
6 Correct 7 ms 12908 KB Output is correct
7 Correct 7 ms 12908 KB Output is correct
8 Correct 7 ms 12908 KB Output is correct
9 Correct 8 ms 12908 KB Output is correct
10 Correct 8 ms 12908 KB Output is correct
11 Correct 8 ms 12908 KB Output is correct
12 Correct 7 ms 12908 KB Output is correct
13 Correct 7 ms 12908 KB Output is correct
14 Correct 7 ms 12928 KB Output is correct
15 Correct 7 ms 12908 KB Output is correct
16 Correct 7 ms 12928 KB Output is correct
17 Correct 7 ms 12908 KB Output is correct
18 Correct 7 ms 12908 KB Output is correct
19 Correct 7 ms 12908 KB Output is correct
20 Correct 7 ms 12908 KB Output is correct
21 Correct 7 ms 12908 KB Output is correct
22 Correct 8 ms 12908 KB Output is correct
23 Correct 7 ms 12908 KB Output is correct
24 Correct 7 ms 12908 KB Output is correct
25 Correct 7 ms 12908 KB Output is correct
26 Correct 8 ms 12928 KB Output is correct
27 Correct 7 ms 12908 KB Output is correct
28 Correct 7 ms 12928 KB Output is correct
29 Correct 7 ms 12908 KB Output is correct
30 Correct 7 ms 12908 KB Output is correct
31 Correct 7 ms 12908 KB Output is correct
32 Correct 8 ms 12908 KB Output is correct
33 Correct 7 ms 12908 KB Output is correct
34 Correct 8 ms 12908 KB Output is correct
35 Correct 7 ms 12908 KB Output is correct
36 Correct 8 ms 12908 KB Output is correct
37 Correct 7 ms 12908 KB Output is correct
38 Correct 18 ms 13164 KB Output is correct
39 Correct 18 ms 13164 KB Output is correct
40 Correct 14 ms 13164 KB Output is correct
41 Correct 14 ms 13056 KB Output is correct
42 Correct 11 ms 13164 KB Output is correct
43 Correct 13 ms 13036 KB Output is correct
44 Correct 16 ms 13036 KB Output is correct
45 Correct 17 ms 13164 KB Output is correct
46 Correct 17 ms 13164 KB Output is correct
47 Correct 19 ms 13164 KB Output is correct
48 Correct 17 ms 13164 KB Output is correct
49 Correct 15 ms 13164 KB Output is correct
50 Correct 16 ms 13164 KB Output is correct
51 Correct 14 ms 13164 KB Output is correct
52 Correct 15 ms 13184 KB Output is correct
53 Correct 15 ms 13164 KB Output is correct
54 Correct 13 ms 13164 KB Output is correct
55 Correct 11 ms 13036 KB Output is correct
56 Correct 11 ms 13036 KB Output is correct
57 Correct 12 ms 13056 KB Output is correct
58 Correct 11 ms 13036 KB Output is correct
59 Correct 12 ms 12908 KB Output is correct
60 Correct 14 ms 12908 KB Output is correct
61 Correct 13 ms 12908 KB Output is correct
62 Correct 12 ms 12908 KB Output is correct
63 Correct 12 ms 12908 KB Output is correct
64 Correct 12 ms 12908 KB Output is correct
65 Correct 16 ms 13036 KB Output is correct
66 Correct 16 ms 13036 KB Output is correct
67 Correct 17 ms 13036 KB Output is correct
68 Correct 15 ms 13036 KB Output is correct
69 Correct 14 ms 13036 KB Output is correct
70 Correct 15 ms 13036 KB Output is correct
71 Correct 15 ms 12908 KB Output is correct
72 Correct 12 ms 12928 KB Output is correct
73 Correct 17 ms 13036 KB Output is correct
74 Correct 9 ms 13164 KB Output is correct
75 Correct 2245 ms 34952 KB Output is correct
76 Correct 2625 ms 34768 KB Output is correct
77 Correct 1933 ms 35004 KB Output is correct
78 Correct 2051 ms 35212 KB Output is correct
79 Correct 356 ms 34412 KB Output is correct
80 Correct 502 ms 33900 KB Output is correct
81 Correct 1493 ms 23276 KB Output is correct
82 Correct 1992 ms 24860 KB Output is correct
83 Correct 1748 ms 23912 KB Output is correct
84 Correct 1830 ms 24360 KB Output is correct
85 Correct 1533 ms 23404 KB Output is correct
86 Correct 864 ms 22124 KB Output is correct
87 Correct 941 ms 22124 KB Output is correct
88 Correct 1338 ms 22824 KB Output is correct
89 Correct 1263 ms 22600 KB Output is correct
90 Correct 921 ms 22456 KB Output is correct
91 Correct 585 ms 21356 KB Output is correct
92 Correct 623 ms 21492 KB Output is correct
93 Correct 736 ms 21796 KB Output is correct
94 Correct 489 ms 21612 KB Output is correct
95 Correct 880 ms 22364 KB Output is correct
96 Correct 932 ms 20956 KB Output is correct
97 Correct 947 ms 21560 KB Output is correct
98 Correct 1026 ms 21356 KB Output is correct
99 Correct 890 ms 21316 KB Output is correct
100 Correct 680 ms 21028 KB Output is correct
101 Correct 699 ms 20828 KB Output is correct
102 Correct 1392 ms 21308 KB Output is correct
103 Correct 1309 ms 21356 KB Output is correct
104 Correct 1536 ms 21820 KB Output is correct
105 Correct 1099 ms 21256 KB Output is correct
106 Correct 1105 ms 21456 KB Output is correct
107 Correct 960 ms 20976 KB Output is correct
108 Correct 1972 ms 34904 KB Output is correct
109 Correct 1547 ms 35932 KB Output is correct
110 Correct 756 ms 20152 KB Output is correct
111 Correct 1166 ms 20588 KB Output is correct
112 Correct 2189 ms 32844 KB Output is correct
113 Correct 402 ms 35692 KB Output is correct