oj.uz

Submission #222836

# Submission time Handle Problem Language Result Execution time Memory
222836 2020-04-14T07:11:39 Z rama_pang Meetings (IOI18_meetings) C++14
100 / 100
 3553 ms 381524 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

using lint = long long;
const lint INF = 1e18;

class LiChao { // Li Chao Segment Tree
 private:
  struct Line { // y = ax + b
    lint a, b;
    lint get(lint x) { return a * x + b; }
    Line() {}
    Line(lint a, lint b) : a(a), b(b) {}
  };

  int sz;
  vector<Line> tree;
  vector<lint> lazy;

  void Apply(int n, lint x) {
    tree[n].b += x;
    lazy[n] += x;
  }

  void Push(int n, int lc, int rc) {
    Apply(lc, lazy[n]);
    Apply(rc, lazy[n]);
    lazy[n] = 0;
  }

  void SetLine(int n, int tl, int tr, int l, int r, Line line) {
    if (tr < l || r < tl || tl > tr || l > r) return;
    int mid = (tl + tr) / 2;
    int lc = n + 1;
    int rc = n + 2 * (mid - tl + 1);
    if (tl != tr) Push(n, lc, rc);
    if (l <= tl && tr <= r) {
      if (tree[n].get(tl) > line.get(tl)) swap(tree[n], line);
      if (tree[n].get(tr) <= line.get(tr)) return;
      if (tree[n].get(mid) <= line.get(mid)) {
        return SetLine(rc, mid + 1, tr, l, r, line);
      } else {
        swap(tree[n], line);
        return SetLine(lc, tl, mid, l, r, line);
      }
    }
    SetLine(lc, tl, mid, l, r, line);
    SetLine(rc, mid + 1, tr, l, r, line);
  }

  void RangeSumUpdate(int n, int tl, int tr, int l, int r, lint x) {
    if (tr < l || r < tl || tl > tr || l > r) return;
    if (l <= tl && tr <= r) return Apply(n, x);
    int mid = (tl + tr) / 2;
    int lc = n + 1;
    int rc = n + 2 * (mid - tl + 1);
    Push(n, lc, rc);
    RangeSumUpdate(lc, tl, mid, l, r, x);
    RangeSumUpdate(rc, mid + 1, tr, l, r, x);
  }

  lint Query(int n, int tl, int tr, int x) {
    lint res = tree[n].get(x);
    if (tl == tr) return res;
    int mid = (tl + tr) / 2;
    int lc = n + 1;
    int rc = n + 2 * (mid - tl + 1);
    Push(n, lc, rc);
    if (x <= mid) res = min(res, Query(lc, tl, mid, x));
    if (x > mid) res = min(res, Query(rc, mid + 1, tr, x));
    return res;
  }

 public:
  LiChao() {}
  LiChao(int n) : sz(n) {
    tree.assign(2 * sz, Line(0, INF));
    lazy.assign(2 * sz, 0);
  }

  void SetLine(int l, int r, lint a, lint b) {
    return SetLine(1, 0, sz - 1, l, r, Line(a, b));
  }

  void RangeSumUpdate(int l, int r, lint x) {
    return RangeSumUpdate(1, 0, sz - 1, l, r, x);
  }

  lint Query(int x) {
    return Query(1, 0, sz - 1, x);
  }
};

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

 public:
  SegmentTree() {}
  SegmentTree(int n, vector<int> A) : sz(n) {
    tree.resize(2 * sz);
    for (int i = 0; i < sz; i++) {
      tree[i + sz] = {A[i], i};
    }
    for (int i = sz - 1; i >= 0; i--) {
      tree[i] = max(tree[i * 2], tree[i * 2 + 1]);
    }
  }

  int Query(int l, int r) {
    pair<int, int> res = {0, -1};
    for (l += sz, r += sz + 1; l < r; l /= 2, r /= 2) {
      if (l & 1) res = max(res, tree[l++]);
      if (r & 1) res = max(res, tree[--r]);
    }
    return res.second;
  }
};

struct query_t {
  int id;
  int l, r;
  query_t() {}
  query_t(int id, int ql, int qr) : id(id), l(ql), r(qr) {}
};

LiChao Left, Right;
SegmentTree RMQ;  

void Solve(int L, int R, const vector<int> &H, 
           const vector<vector<query_t>> &Query, vector<lint> &Answer) {
  if (L > R) return;
  int M = RMQ.Query(L, R);
  Solve(L, M - 1, H, Query, Answer);
  Solve(M + 1, R, H, Query, Answer);

  for (auto q : Query[M]) {
    Answer[q.id] = min(Left.Query(q.l) + 1ll * (q.r - M + 1) * H[M], 
                       Right.Query(q.r) + 1ll * (M - q.l + 1) * H[M]);
  }

  Left.RangeSumUpdate(L, M, 1ll * (R - M + 1) * H[M]);
  Left.SetLine(L, M, -H[M], 1ll * M * H[M]  + H[M] + (M < R ? Left.Query(M + 1) : 0));

  Right.RangeSumUpdate(M, R, 1ll * (M - L + 1) * H[M]);
  Right.SetLine(M, R, H[M], -1ll * M * H[M] + H[M] + (M > L ? Right.Query(M - 1) : 0));

  return;
}

vector<lint> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
  int N = H.size(), Q = L.size();

  Left = LiChao(N);
  Right = LiChao(N);
  RMQ = SegmentTree(N, H);

  vector<vector<query_t>> Query(N);
  vector<lint> Answer(Q, INF);

  for (int i = 0; i < Q; i++) {
    Query[RMQ.Query(L[i], R[i])].emplace_back(i, L[i], R[i]);
  }
  for (int i = 0; i < N; i++) {
    Left.SetLine(i, i, 0, 0);
    Right.SetLine(i, i, 0, 0);
  }

  Solve(0, N - 1, H, Query, Answer);
  return Answer;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 768 KB Output is correct
3 Correct 9 ms 768 KB Output is correct
4 Correct 9 ms 768 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 9 ms 1024 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 768 KB Output is correct
3 Correct 9 ms 768 KB Output is correct
4 Correct 9 ms 768 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 9 ms 1024 KB Output is correct
10 Correct 19 ms 1280 KB Output is correct
11 Correct 17 ms 1388 KB Output is correct
12 Correct 17 ms 1280 KB Output is correct
13 Correct 17 ms 1280 KB Output is correct
14 Correct 17 ms 2048 KB Output is correct
15 Correct 18 ms 1408 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 62 ms 4728 KB Output is correct
3 Correct 333 ms 33680 KB Output is correct
4 Correct 313 ms 18928 KB Output is correct
5 Correct 278 ms 36848 KB Output is correct
6 Correct 320 ms 38488 KB Output is correct
7 Correct 339 ms 43120 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 62 ms 4728 KB Output is correct
3 Correct 333 ms 33680 KB Output is correct
4 Correct 313 ms 18928 KB Output is correct
5 Correct 278 ms 36848 KB Output is correct
6 Correct 320 ms 38488 KB Output is correct
7 Correct 339 ms 43120 KB Output is correct
8 Correct 308 ms 22128 KB Output is correct
9 Correct 292 ms 22128 KB Output is correct
10 Correct 294 ms 22128 KB Output is correct
11 Correct 295 ms 20592 KB Output is correct
12 Correct 261 ms 20720 KB Output is correct
13 Correct 272 ms 20976 KB Output is correct
14 Correct 313 ms 35700 KB Output is correct
15 Correct 280 ms 20592 KB Output is correct
16 Correct 337 ms 36208 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 768 KB Output is correct
3 Correct 9 ms 768 KB Output is correct
4 Correct 9 ms 768 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 9 ms 1024 KB Output is correct
10 Correct 19 ms 1280 KB Output is correct
11 Correct 17 ms 1388 KB Output is correct
12 Correct 17 ms 1280 KB Output is correct
13 Correct 17 ms 1280 KB Output is correct
14 Correct 17 ms 2048 KB Output is correct
15 Correct 18 ms 1408 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 62 ms 4728 KB Output is correct
18 Correct 333 ms 33680 KB Output is correct
19 Correct 313 ms 18928 KB Output is correct
20 Correct 278 ms 36848 KB Output is correct
21 Correct 320 ms 38488 KB Output is correct
22 Correct 339 ms 43120 KB Output is correct
23 Correct 308 ms 22128 KB Output is correct
24 Correct 292 ms 22128 KB Output is correct
25 Correct 294 ms 22128 KB Output is correct
26 Correct 295 ms 20592 KB Output is correct
27 Correct 261 ms 20720 KB Output is correct
28 Correct 272 ms 20976 KB Output is correct
29 Correct 313 ms 35700 KB Output is correct
30 Correct 280 ms 20592 KB Output is correct
31 Correct 337 ms 36208 KB Output is correct
32 Correct 2728 ms 153348 KB Output is correct
33 Correct 2160 ms 157692 KB Output is correct
34 Correct 2298 ms 157072 KB Output is correct
35 Correct 2734 ms 155176 KB Output is correct
36 Correct 2112 ms 156308 KB Output is correct
37 Correct 2318 ms 157824 KB Output is correct
38 Correct 2933 ms 269244 KB Output is correct
39 Correct 3001 ms 269188 KB Output is correct
40 Correct 2699 ms 168564 KB Output is correct
41 Correct 3268 ms 381204 KB Output is correct
42 Correct 3508 ms 381268 KB Output is correct
43 Correct 3553 ms 381524 KB Output is correct
44 Correct 3198 ms 268968 KB Output is correct