oj.uz

Submission #220111

# Submission time Handle Problem Language Result Execution time Memory
220111 2020-04-07T04:32:07 Z rama_pang Cake 3 (JOI19_cake3) C++14
100 / 100
 1761 ms 17004 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

class SegmentTree {
 private:
  int sz;
  vector<int> A;
  vector<pair<long long, int>> tree;

  void Update(int n, int tl, int tr, int pos, int activate) {
    if (tl == tr) return void(tree[n] = {activate ? A[pos] : 0, activate});
    int mid = (tl + tr) / 2;
    int lc = n + 1;
    int rc = n + 2 * (mid - tl + 1);
    if (pos <= mid) {
      Update(lc, tl, mid, pos, activate);
    } else {
      Update(rc, mid + 1, tr, pos, activate);
    }
    tree[n] = {tree[lc].first + tree[rc].first, tree[lc].second + tree[rc].second};
  }

  long long Query(int n, int tl, int tr, int key) { // sum of key minimum elements
    if (key <= 0) return 0;
    if (tree[n].second <= key) return tree[n].first;
    int mid = (tl + tr) / 2;
    int lc = n + 1;
    int rc = n + 2 * (mid - tl + 1);
    return Query(lc, tl, mid, key) + Query(rc, mid + 1, tr, key - tree[lc].second);
  }

 public:
  SegmentTree() {}
  SegmentTree(int n, vector<int> A) : sz(n), A(A) {
    tree.resize(2 * sz);
  }

  void Insert(int pos) {
    return Update(1, 0, sz - 1, pos, 1);
  }

  void Erase(int pos) {
    return Update(1, 0, sz - 1, pos, 0);
  }

  long long Query(int key) { // return key largest elements
    return tree[1].first - Query(1, 0, sz - 1, tree[1].second - key);
  }
};

struct Cake {
  int V, C;
  Cake() {}
  Cake(int V, int C) : V(V), C(C) {}
};

int N, M;
vector<Cake> cake;

SegmentTree seg;
vector<int> coord;

void Init() { // coordinate compression on cake based on V, cakes initially sorted by C
  vector<pair<int, int>> all;
  for (int i = 0; i < N; i++) {
    all.emplace_back(cake[i].V, i);
  }
  sort(begin(all), end(all));
  
  coord.resize(N);
  for (int i = 0; i < N; i++) {
    coord[all[i].second] = i;
  }

  vector<int> A;
  for (int i = 0; i < N; i++) {
    A.emplace_back(all[i].first);
  }

  seg = SegmentTree(N, A);
}

long long Query(int l, int r) {
  if (r - l + 1 < M) return -INF;
  static int tl = 0, tr = -1;
  while (tr < r) seg.Insert(coord[++tr]);
  while (tl > l) seg.Insert(coord[--tl]);
  while (tr > r) seg.Erase(coord[tr--]);
  while (tl < l) seg.Erase(coord[tl++]);
  return seg.Query(M) - 2 * (cake[r].C - cake[l].C);
}

long long Solve(int L1 = 0, int L2 = N - M, int R1 = 0, int R2 = N - 1) {
  if (L1 > L2) return -INF;
  int L = (L1 + L2) / 2;
  int opt = -1;
  long long cur = -INF;
  for (int R = max(R1, L + M - 1); R <= R2; R++) {
    long long now = Query(L, R);
    if (now > cur) cur = now, opt = R;
  }
  return max({cur, Solve(L1, L - 1, R1, opt), Solve(L + 1, L2, opt, R2)});
}

void Read() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  cin >> N >> M;
  
  cake.resize(N);
  for (int i = 0; i < N; i++) {
    cin >> cake[i].V >> cake[i].C;
  }

  sort(begin(cake), end(cake), [&](const Cake &a, const Cake &b) { 
    return make_pair(a.C, a.V) < make_pair(b.C, b.V); 
  });
}

int main() {
  Read();
  Init();
  cout << Solve() << "\n";
  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 4 ms 256 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 11 ms 512 KB Output is correct
39 Correct 10 ms 512 KB Output is correct
40 Correct 8 ms 512 KB Output is correct
41 Correct 8 ms 512 KB Output is correct
42 Correct 7 ms 512 KB Output is correct
43 Correct 7 ms 512 KB Output is correct
44 Correct 9 ms 512 KB Output is correct
45 Correct 10 ms 512 KB Output is correct
46 Correct 10 ms 512 KB Output is correct
47 Correct 10 ms 512 KB Output is correct
48 Correct 10 ms 512 KB Output is correct
49 Correct 9 ms 512 KB Output is correct
50 Correct 9 ms 512 KB Output is correct
51 Correct 9 ms 512 KB Output is correct
52 Correct 9 ms 640 KB Output is correct
53 Correct 9 ms 512 KB Output is correct
54 Correct 7 ms 512 KB Output is correct
55 Correct 7 ms 512 KB Output is correct
56 Correct 7 ms 512 KB Output is correct
57 Correct 7 ms 512 KB Output is correct
58 Correct 7 ms 512 KB Output is correct
59 Correct 8 ms 512 KB Output is correct
60 Correct 9 ms 512 KB Output is correct
61 Correct 8 ms 512 KB Output is correct
62 Correct 7 ms 512 KB Output is correct
63 Correct 8 ms 512 KB Output is correct
64 Correct 7 ms 512 KB Output is correct
65 Correct 9 ms 512 KB Output is correct
66 Correct 9 ms 512 KB Output is correct
67 Correct 11 ms 768 KB Output is correct
68 Correct 9 ms 512 KB Output is correct
69 Correct 8 ms 384 KB Output is correct
70 Correct 9 ms 512 KB Output is correct
71 Correct 9 ms 512 KB Output is correct
72 Correct 7 ms 512 KB Output is correct
73 Correct 9 ms 512 KB Output is correct
74 Correct 6 ms 512 KB Output is correct
75 Correct 1492 ms 12396 KB Output is correct
76 Correct 1722 ms 15468 KB Output is correct
77 Correct 1218 ms 15980 KB Output is correct
78 Correct 1339 ms 16108 KB Output is correct
79 Correct 152 ms 16236 KB Output is correct
80 Correct 262 ms 15852 KB Output is correct
81 Correct 1387 ms 15340 KB Output is correct
82 Correct 1761 ms 15468 KB Output is correct
83 Correct 1644 ms 15980 KB Output is correct
84 Correct 1701 ms 15852 KB Output is correct
85 Correct 1425 ms 15468 KB Output is correct
86 Correct 763 ms 14956 KB Output is correct
87 Correct 853 ms 14804 KB Output is correct
88 Correct 1220 ms 14700 KB Output is correct
89 Correct 1162 ms 15340 KB Output is correct
90 Correct 846 ms 15976 KB Output is correct
91 Correct 527 ms 14956 KB Output is correct
92 Correct 549 ms 14828 KB Output is correct
93 Correct 660 ms 15340 KB Output is correct
94 Correct 455 ms 15980 KB Output is correct
95 Correct 805 ms 15980 KB Output is correct
96 Correct 692 ms 14956 KB Output is correct
97 Correct 726 ms 15980 KB Output is correct
98 Correct 765 ms 15852 KB Output is correct
99 Correct 688 ms 15856 KB Output is correct
100 Correct 544 ms 14956 KB Output is correct
101 Correct 568 ms 15084 KB Output is correct
102 Correct 1251 ms 15080 KB Output is correct
103 Correct 1163 ms 14828 KB Output is correct
104 Correct 1362 ms 15596 KB Output is correct
105 Correct 1002 ms 15592 KB Output is correct
106 Correct 991 ms 15852 KB Output is correct
107 Correct 853 ms 15340 KB Output is correct
108 Correct 1202 ms 15852 KB Output is correct
109 Correct 946 ms 16748 KB Output is correct
110 Correct 617 ms 14572 KB Output is correct
111 Correct 903 ms 14704 KB Output is correct
112 Correct 906 ms 14060 KB Output is correct
113 Correct 158 ms 17004 KB Output is correct