oj.uz

Submission #231352

# Submission time Handle Problem Language Result Execution time Memory
231352 2020-05-13T12:16:11 Z AlexLuchianov Pinball (JOI14_pinball) C++14
100 / 100
 630 ms 94712 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 100000;
ll const inf = 1LL * 1000000000 * nmax * 10;

class SegmentTree{
private:
  struct Node{
    ll number;
    Node* left;
    Node* right;
    Node(ll val){
      number = val;
      left = right = nullptr;
    }
  };
  Node* root = nullptr;

  void computenode(Node* &root){
    if(root->left == nullptr && root->right == nullptr)
      root->number = inf;
    else if(root->left == nullptr)
      root->number = root->right->number;
    else if(root->right == nullptr)
      root->number = root->left->number;
    else
      root->number = std::min(root->left->number, root->right->number);
  }

  void _update(Node* &root, int from, int to, int x, ll val){
    if(root == nullptr)
      root = new Node(val);

    if(from < to){
      int mid = (from + to) / 2;
      if(x <= mid)
        _update(root->left, from, mid, x, val);
      else if(mid + 1 <= x)
        _update(root->right, mid + 1, to, x, val);
      computenode(root);
    } else
      root->number = std::min(root->number, val);
  }

  ll _query(Node* &root, int from, int to, int x, int y){
    if(root == nullptr)
      return inf;
    if(from == x && to == y)
      return root->number;
    else {
      int mid = (from + to) / 2;
      if(x <= mid && y <= mid)
        return _query(root->left, from, mid, x, y);
      else if(mid + 1 <= x && mid + 1 <= y)
        return _query(root->right, mid + 1, to, x, y);
      else
        return std::min(_query(root->left, from, mid, x, mid), _query(root->right, mid + 1, to, mid + 1, y));
    }
  }
public:
  void update(int from, int to, int x, ll val){
    _update(root, from, to, x, val);
  }
  ll query(int from, int to, int x, int y){
    return _query(root, from, to, x, y);
  }
};

int main()
{
  int n, lim;
  std::cin >> n >> lim;
  SegmentTree aint1, aint2;

  aint1.update(1, lim, 1, 0);
  aint2.update(1, lim, lim, 0);


  ll result = inf;
  for(int i = 1;i <= n; i++){
    int from, mid, to, cost;
    std::cin >> from >> to >> mid >> cost;
    ll result1 = aint1.query(1, lim, from, to);
    ll result2 = aint2.query(1, lim, from, to);

    aint1.update(1, lim, mid, result1 + cost);
    aint2.update(1, lim, mid, result2 + cost);

    result = std::min(result, result1 + result2 + cost);
  }
  if(result == inf)
    std::cout << -1;
  else
    std::cout << result;
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 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 512 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 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 512 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 10 ms 1152 KB Output is correct
18 Correct 8 ms 384 KB Output is correct
19 Correct 10 ms 1536 KB Output is correct
20 Correct 9 ms 1024 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 9 ms 1536 KB Output is correct
23 Correct 10 ms 1664 KB Output is correct
24 Correct 10 ms 1664 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 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 512 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 10 ms 1152 KB Output is correct
18 Correct 8 ms 384 KB Output is correct
19 Correct 10 ms 1536 KB Output is correct
20 Correct 9 ms 1024 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 9 ms 1536 KB Output is correct
23 Correct 10 ms 1664 KB Output is correct
24 Correct 10 ms 1664 KB Output is correct
25 Correct 41 ms 4216 KB Output is correct
26 Correct 135 ms 16632 KB Output is correct
27 Correct 384 ms 36600 KB Output is correct
28 Correct 424 ms 4984 KB Output is correct
29 Correct 292 ms 36600 KB Output is correct
30 Correct 520 ms 14548 KB Output is correct
31 Correct 614 ms 69240 KB Output is correct
32 Correct 627 ms 56952 KB Output is correct
33 Correct 80 ms 13560 KB Output is correct
34 Correct 288 ms 45944 KB Output is correct
35 Correct 457 ms 94712 KB Output is correct
36 Correct 630 ms 91976 KB Output is correct
37 Correct 563 ms 91896 KB Output is correct
38 Correct 570 ms 92024 KB Output is correct