oj.uz

Submission #340603

# Submission time Handle Problem Language Result Execution time Memory
340603 2020-12-28T00:50:07 Z VROOM_VARUN Cake 3 (JOI19_cake3) C++17
100 / 100
 2867 ms 47596 KB 
/*
ID: varunra2
LANG: C++
TASK: cake3
*/

#include <bits/stdc++.h>
using namespace std;

#define int long long

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e12
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
int posl = 0, posr = 0;
int n, m;
VVI vals;
VI dp;

void init() {
  vals.resize(n);
  dp.assign(n, -INF);
}

struct segtree {
  int n;
  VI vals;
  VI pos;
  vector<bool> on;
  VII segtree;

  void init(VVI cake) {
    n = sz(cake);
    vals.resize(n);
    pos.resize(n);
    on.assign(n, false);
    for (int i = 0; i < n; i++) {
      swap(cake[i][0], cake[i][1]);
    }
    sort(all(cake), greater<VI>());
    for (int i = 0; i < n; i++) {
      pos[cake[i][2]] = i;
      vals[i] = cake[i][0];
    }
    segtree.assign(4 * n, MP(0, 0));
  }

  void merge(PII& a, PII& b, PII& c) { a = MP(b.x + c.x, b.y + c.y); }

  void upd(int ind, int cnt, int val, int node, int l, int r) {
    if (ind > r or ind < l) return;
    if (l == r) {
      segtree[node] = MP(val, cnt);
      return;
    }
    int mid = (l + r) / 2;
    upd(ind, cnt, val, 2 * node + 1, l, mid);
    upd(ind, cnt, val, 2 * node + 2, mid + 1, r);
    merge(segtree[node], segtree[2 * node + 1], segtree[2 * node + 2]);
  }

  int qry(int cnt, int node) {
    if (cnt <= 0) return 0;
    if (cnt >= segtree[node].y) return segtree[node].x;
    return qry(cnt, 2 * node + 1) +
           qry(cnt - segtree[2 * node + 1].y, 2 * node + 2);
  }
  void upd(int ind, int cnt, int val) { upd(ind, cnt, val, 0, 0, n - 1); }

  bool turn_on(int ind) {
    ind = pos[ind];
    if (on[ind]) return false;
    on[ind] = true;
    upd(ind, 1, vals[ind]);
    // debug("on", ind, vals[ind]);
    return true;
  }

  bool turn_off(int ind) {
    ind = pos[ind];
    if (on[ind] == false) return false;
    on[ind] = false;
    upd(ind, 0, 0);
    // debug("off", ind, vals[ind]);
    return true;
  }

  int qry() {
    int val = qry(m - 2, 0);
    // debug(posl, posr, val);
    return val;
  }
} st;

void shiftr(int r) {
  while (posr < r) {
    st.turn_on(++posr);
  }
  while (posr > r) {
    st.turn_off(posr--);
  }
}

void shiftl(int l) {
  while (posl < l) {
    st.turn_off(posl++);
  }
  while (posl > l) {
    st.turn_on(--posl);
  }
}

void activate(int l, int r) {
  if (posl > r) {
    shiftl(l);
    shiftr(r);
  } else {
    shiftr(r);
    shiftl(l);
  }
}

void dnc(int l, int r, int optl, int optr) {
  if (l > r) return;
  int mid = (l + r) / 2;
  PII ret = MP(-INF, 1);
  if (mid + m - 1 >= n) {
    dnc(l, mid - 1, optl, optr);
    return;
  }
  int start = max(mid + m - 1, optl);
  // debug(posl, posr, start);
  activate(mid + 1, start - 1);
  for (int i = start; i <= optr; i++) {
    int qr = st.qry();
    auto cur = MP(
        qr - 2 * (vals[i][0] - vals[mid][0]) + vals[i][1] + vals[mid][1], -i);
    // debug(cur, mid, qr, posl, posr);
    ret = max(ret, cur);
    st.turn_on(i);
    posr++;
  }
  dp[mid] = ret.x;
  int opt = -ret.y;
  // debug(ret, mid);
  dnc(l, mid - 1, optl, opt);
  dnc(mid + 1, r, opt, optr);
}

int32_t main() {
  // #ifndef ONLINE_JUDGE
  // freopen("cake3.in", "r", stdin);
  // freopen("cake3.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> m;

  init();

  for (int i = 0; i < n; i++) {
    int v, c;
    cin >> v >> c;
    vals[i] = {c, v};
  }

  sort(all(vals));

  // debug(vals);

  for (int i = 0; i < n; i++) {
    vals[i].PB(i);
  }

  st.init(vals);
  st.turn_on(0);

  dnc(0, n - 1, 0, n - 1);

  // debug(dp);

  cout << *max_element(all(dp)) << '\n';

  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 376 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 8 ms 768 KB Output is correct
39 Correct 8 ms 748 KB Output is correct
40 Correct 5 ms 748 KB Output is correct
41 Correct 5 ms 748 KB Output is correct
42 Correct 4 ms 748 KB Output is correct
43 Correct 6 ms 748 KB Output is correct
44 Correct 7 ms 748 KB Output is correct
45 Correct 8 ms 748 KB Output is correct
46 Correct 8 ms 748 KB Output is correct
47 Correct 8 ms 768 KB Output is correct
48 Correct 7 ms 748 KB Output is correct
49 Correct 7 ms 748 KB Output is correct
50 Correct 7 ms 748 KB Output is correct
51 Correct 6 ms 748 KB Output is correct
52 Correct 6 ms 748 KB Output is correct
53 Correct 6 ms 748 KB Output is correct
54 Correct 5 ms 876 KB Output is correct
55 Correct 4 ms 748 KB Output is correct
56 Correct 4 ms 748 KB Output is correct
57 Correct 4 ms 748 KB Output is correct
58 Correct 4 ms 748 KB Output is correct
59 Correct 5 ms 748 KB Output is correct
60 Correct 6 ms 748 KB Output is correct
61 Correct 5 ms 748 KB Output is correct
62 Correct 4 ms 748 KB Output is correct
63 Correct 5 ms 748 KB Output is correct
64 Correct 5 ms 748 KB Output is correct
65 Correct 7 ms 748 KB Output is correct
66 Correct 7 ms 748 KB Output is correct
67 Correct 8 ms 748 KB Output is correct
68 Correct 7 ms 748 KB Output is correct
69 Correct 6 ms 748 KB Output is correct
70 Correct 7 ms 748 KB Output is correct
71 Correct 7 ms 748 KB Output is correct
72 Correct 4 ms 748 KB Output is correct
73 Correct 6 ms 748 KB Output is correct
74 Correct 2 ms 748 KB Output is correct
75 Correct 2558 ms 44396 KB Output is correct
76 Correct 2867 ms 43244 KB Output is correct
77 Correct 2173 ms 44396 KB Output is correct
78 Correct 2343 ms 45036 KB Output is correct
79 Correct 352 ms 45420 KB Output is correct
80 Correct 536 ms 44012 KB Output is correct
81 Correct 2264 ms 44140 KB Output is correct
82 Correct 2854 ms 44652 KB Output is correct
83 Correct 2600 ms 46060 KB Output is correct
84 Correct 2793 ms 45932 KB Output is correct
85 Correct 2394 ms 44396 KB Output is correct
86 Correct 1320 ms 42892 KB Output is correct
87 Correct 1458 ms 42388 KB Output is correct
88 Correct 2071 ms 42220 KB Output is correct
89 Correct 1940 ms 44396 KB Output is correct
90 Correct 1422 ms 46444 KB Output is correct
91 Correct 941 ms 42988 KB Output is correct
92 Correct 971 ms 42604 KB Output is correct
93 Correct 1145 ms 44524 KB Output is correct
94 Correct 803 ms 46316 KB Output is correct
95 Correct 1358 ms 46444 KB Output is correct
96 Correct 1122 ms 43116 KB Output is correct
97 Correct 1205 ms 46444 KB Output is correct
98 Correct 1248 ms 45804 KB Output is correct
99 Correct 1102 ms 45932 KB Output is correct
100 Correct 884 ms 43372 KB Output is correct
101 Correct 954 ms 43372 KB Output is correct
102 Correct 2035 ms 43520 KB Output is correct
103 Correct 1991 ms 42860 KB Output is correct
104 Correct 2352 ms 45124 KB Output is correct
105 Correct 1724 ms 44908 KB Output is correct
106 Correct 1765 ms 46060 KB Output is correct
107 Correct 1413 ms 44524 KB Output is correct
108 Correct 2111 ms 44652 KB Output is correct
109 Correct 1585 ms 47340 KB Output is correct
110 Correct 967 ms 42092 KB Output is correct
111 Correct 1414 ms 42604 KB Output is correct
112 Correct 1478 ms 41580 KB Output is correct
113 Correct 347 ms 47596 KB Output is correct