oj.uz

Submission #234804

# Submission time Handle Problem Language Result Execution time Memory
234804 2020-05-25T16:57:16 Z AlexLuchianov Two Antennas (JOI19_antennas) C++14
100 / 100
 917 ms 43352 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

int const nmax = 200000;
int const inf = 1000000005;

struct El{
  int h;
  int a;
  int b;
} v[1 + nmax];
int _queries[1 + nmax][2];
int sol[1 + nmax];

vector<int> events[1 + nmax];
vector<pair<int,int>> queries[1 + nmax];

class SegmentTree{
private:
  struct Node{
    int result;
    int smax;
    Node operator + (Node const &a) const {
      return {max(result, a.result), max(smax, a.smax)};
    }
  };
public:
  vector<Node> aint;
  vector<int> lazy;

  SegmentTree(int n){
    aint.resize(1 + 4 * n);
    lazy.resize(1 + 4 * n);
  }

  void build(int node, int from, int to){
    if(from < to){
      int mid = (from + to) / 2;
      build(node * 2, from, mid);
      build(node * 2 + 1, mid + 1, to);
    }
    aint[node] = {-inf, -inf};
  }

  void cleannode(int node, int from, int to){
    if(from < to){
      int mid = (from + to) / 2;
      lazy[node * 2] = max(lazy[node * 2], lazy[node]);
      lazy[node * 2 + 1] = max(lazy[node * 2 + 1], lazy[node]);
    }
    aint[node].result = max(aint[node].result, aint[node].smax + lazy[node]);
    lazy[node] = 0;
  }

  void computenode(int node, int from, int to){
    if(from < to){
      int mid = (from + to) / 2;
      aint[node] = aint[node * 2] + aint[node * 2 + 1];
    }
  }

  void update(int node, int from, int to, int x, int y, int val){
    if(x == from && to == y){
      lazy[node] = max(lazy[node], val);
      cleannode(node, from, to);
    } else {
      int mid = (from + to) / 2;
      cleannode(node * 2, from, mid);
      cleannode(node * 2 + 1, mid + 1, to);
      if(x <= mid)
        update(node * 2, from, mid, x, MIN(y, mid), val);
      if(mid + 1 <= y)
        update(node * 2 + 1, mid + 1, to, MAX(mid + 1, x), y, val);
      computenode(node, from, to);
    }
  }

  void setvalue(int node, int from, int to, int x, int val){
    if(from < to){
      int mid = (from + to) / 2;
      cleannode(node * 2, from, mid);
      cleannode(node * 2 + 1, mid + 1, to);
      if(x <= mid)
        setvalue(node * 2, from, mid, x, val);
      else
        setvalue(node * 2 + 1, mid + 1, to, x, val);
      computenode(node, from, to);
    } else {
      cleannode(node, from, to);
      aint[node].smax = val;
    }
  }

  int query(int node, int from, int to, int x, int y){
    cleannode(node, from, to);
    if(from == x && to == y)
      return aint[node].result;
    else {
      int mid = (from + to) / 2;
      if(x <= mid && y <= mid)
        return query(node * 2, from, mid, x, y);
      else if(mid + 1 <= x && mid + 1 <= y)
        return query(node * 2 + 1, mid + 1, to, x, y);
      else
        return max(query(node * 2, from, mid, x, mid), query(node * 2 + 1, mid + 1, to, mid + 1, y));
    }
  }
};

void solve(int n, int q){
  for(int i = 1;i <= n; i++) {
    events[i].clear();
    queries[i].clear();
  }

  for(int i = 1; i <= n; i++) {
    if(i + v[i].a <= n)
      events[i + v[i].a].push_back(i);
    if(i + v[i].b + 1 <= n)
      events[i + v[i].b + 1].push_back(-i);
  }

  for(int i = 1; i <= q; i++)
    queries[_queries[i][1]].push_back({_queries[i][0], i});
  SegmentTree aint(1 + n);
  aint.build(1, 1, n);

  for(int i = 1; i <= n; i++)
    aint.setvalue(1, 1, n, i, -inf);

  for(int i = 1; i <= n; i++){
    for(int h = 0; h < events[i].size(); h++){
      int id = events[i][h];
      if(0 < id)
        aint.setvalue(1, 1, n, id, -v[id].h);
      else
        aint.setvalue(1, 1, n, -id, -inf);
    }

    int x = max(1, i - v[i].b);
    int y = i - v[i].a;
    if(x <= y)
      aint.update(1, 1, n, x, y, v[i].h);


    for(int h = 0; h < queries[i].size(); h++){
      int pos = queries[i][h].second;
      sol[pos] = max(sol[pos], aint.query(1, 1, n, queries[i][h].first, i));
    }
  }
}

int oth(int n, int pos){
  return n - pos + 1;
}

int main()
{

  ios::sync_with_stdio(0);
  cin.tie(0);


  int n;
  cin >> n;
  for(int i = 1;i <= n; i++)
    cin >> v[i].h >> v[i].a >> v[i].b;
  int q;
  cin >> q;
  for(int i = 1;i <= q; i++)
    cin >> _queries[i][0] >> _queries[i][1];
  for(int i = 1;i <= q; i++)
    sol[i] = -1;

  solve(n, q);

  for(int i = 1;i <= n; i++)
    if(i < oth(n, i))
      swap(v[i], v[oth(n, i)]);
  for(int i = 1;i <= q; i++) {
    _queries[i][0] = oth(n, _queries[i][0]);
    _queries[i][1] = oth(n, _queries[i][1]);
    swap(_queries[i][0], _queries[i][1]);
  }

  solve(n, q);
  for(int i = 1;i <= q; i++)
    cout << sol[i] << '\n';

  return 0;
}

Compilation message

antennas.cpp: In member function 'void SegmentTree::cleannode(int, int, int)':
antennas.cpp:54:11: warning: unused variable 'mid' [-Wunused-variable]
       int mid = (from + to) / 2;
           ^~~
antennas.cpp: In member function 'void SegmentTree::computenode(int, int, int)':
antennas.cpp:64:11: warning: unused variable 'mid' [-Wunused-variable]
       int mid = (from + to) / 2;
           ^~~
antennas.cpp: In function 'void solve(int, int)':
antennas.cpp:139:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int h = 0; h < events[i].size(); h++){
                    ~~^~~~~~~~~~~~~~~~~~
antennas.cpp:153:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int h = 0; h < queries[i].size(); h++){
                    ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 10 ms 9856 KB Output is correct
4 Correct 11 ms 9728 KB Output is correct
5 Correct 11 ms 9728 KB Output is correct
6 Correct 11 ms 9728 KB Output is correct
7 Correct 11 ms 9728 KB Output is correct
8 Correct 11 ms 9856 KB Output is correct
9 Correct 10 ms 9728 KB Output is correct
10 Correct 11 ms 9856 KB Output is correct
11 Correct 10 ms 9728 KB Output is correct
12 Correct 11 ms 9728 KB Output is correct
13 Correct 10 ms 9856 KB Output is correct
14 Correct 10 ms 9728 KB Output is correct
15 Correct 10 ms 9728 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 10 ms 9728 KB Output is correct
18 Correct 11 ms 9856 KB Output is correct
19 Correct 10 ms 9728 KB Output is correct
20 Correct 11 ms 9856 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Correct 10 ms 9728 KB Output is correct
23 Correct 10 ms 9728 KB Output is correct
24 Correct 10 ms 9856 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 10 ms 9856 KB Output is correct
4 Correct 11 ms 9728 KB Output is correct
5 Correct 11 ms 9728 KB Output is correct
6 Correct 11 ms 9728 KB Output is correct
7 Correct 11 ms 9728 KB Output is correct
8 Correct 11 ms 9856 KB Output is correct
9 Correct 10 ms 9728 KB Output is correct
10 Correct 11 ms 9856 KB Output is correct
11 Correct 10 ms 9728 KB Output is correct
12 Correct 11 ms 9728 KB Output is correct
13 Correct 10 ms 9856 KB Output is correct
14 Correct 10 ms 9728 KB Output is correct
15 Correct 10 ms 9728 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 10 ms 9728 KB Output is correct
18 Correct 11 ms 9856 KB Output is correct
19 Correct 10 ms 9728 KB Output is correct
20 Correct 11 ms 9856 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Correct 10 ms 9728 KB Output is correct
23 Correct 10 ms 9728 KB Output is correct
24 Correct 10 ms 9856 KB Output is correct
25 Correct 100 ms 16376 KB Output is correct
26 Correct 25 ms 10628 KB Output is correct
27 Correct 151 ms 19064 KB Output is correct
28 Correct 154 ms 18936 KB Output is correct
29 Correct 108 ms 16632 KB Output is correct
30 Correct 108 ms 16248 KB Output is correct
31 Correct 113 ms 18168 KB Output is correct
32 Correct 155 ms 18936 KB Output is correct
33 Correct 140 ms 18680 KB Output is correct
34 Correct 83 ms 14456 KB Output is correct
35 Correct 151 ms 19320 KB Output is correct
36 Correct 153 ms 18936 KB Output is correct
37 Correct 90 ms 14584 KB Output is correct
38 Correct 158 ms 17912 KB Output is correct
39 Correct 32 ms 11128 KB Output is correct
40 Correct 150 ms 17912 KB Output is correct
41 Correct 118 ms 16120 KB Output is correct
42 Correct 151 ms 17912 KB Output is correct
43 Correct 59 ms 12664 KB Output is correct
44 Correct 148 ms 17912 KB Output is correct
45 Correct 37 ms 11392 KB Output is correct
46 Correct 155 ms 17916 KB Output is correct
47 Correct 49 ms 12024 KB Output is correct
48 Correct 152 ms 17932 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 523 ms 24084 KB Output is correct
2 Correct 582 ms 25816 KB Output is correct
3 Correct 386 ms 21060 KB Output is correct
4 Correct 584 ms 25780 KB Output is correct
5 Correct 253 ms 17036 KB Output is correct
6 Correct 576 ms 25808 KB Output is correct
7 Correct 506 ms 23444 KB Output is correct
8 Correct 573 ms 25688 KB Output is correct
9 Correct 79 ms 12356 KB Output is correct
10 Correct 590 ms 25672 KB Output is correct
11 Correct 345 ms 19824 KB Output is correct
12 Correct 571 ms 25556 KB Output is correct
13 Correct 506 ms 24776 KB Output is correct
14 Correct 478 ms 24372 KB Output is correct
15 Correct 481 ms 23764 KB Output is correct
16 Correct 437 ms 23784 KB Output is correct
17 Correct 498 ms 25296 KB Output is correct
18 Correct 468 ms 24244 KB Output is correct
19 Correct 483 ms 24288 KB Output is correct
20 Correct 468 ms 24212 KB Output is correct
21 Correct 443 ms 24544 KB Output is correct
22 Correct 467 ms 24272 KB Output is correct
23 Correct 467 ms 24544 KB Output is correct
24 Correct 424 ms 23248 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 10 ms 9856 KB Output is correct
4 Correct 11 ms 9728 KB Output is correct
5 Correct 11 ms 9728 KB Output is correct
6 Correct 11 ms 9728 KB Output is correct
7 Correct 11 ms 9728 KB Output is correct
8 Correct 11 ms 9856 KB Output is correct
9 Correct 10 ms 9728 KB Output is correct
10 Correct 11 ms 9856 KB Output is correct
11 Correct 10 ms 9728 KB Output is correct
12 Correct 11 ms 9728 KB Output is correct
13 Correct 10 ms 9856 KB Output is correct
14 Correct 10 ms 9728 KB Output is correct
15 Correct 10 ms 9728 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 10 ms 9728 KB Output is correct
18 Correct 11 ms 9856 KB Output is correct
19 Correct 10 ms 9728 KB Output is correct
20 Correct 11 ms 9856 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Correct 10 ms 9728 KB Output is correct
23 Correct 10 ms 9728 KB Output is correct
24 Correct 10 ms 9856 KB Output is correct
25 Correct 100 ms 16376 KB Output is correct
26 Correct 25 ms 10628 KB Output is correct
27 Correct 151 ms 19064 KB Output is correct
28 Correct 154 ms 18936 KB Output is correct
29 Correct 108 ms 16632 KB Output is correct
30 Correct 108 ms 16248 KB Output is correct
31 Correct 113 ms 18168 KB Output is correct
32 Correct 155 ms 18936 KB Output is correct
33 Correct 140 ms 18680 KB Output is correct
34 Correct 83 ms 14456 KB Output is correct
35 Correct 151 ms 19320 KB Output is correct
36 Correct 153 ms 18936 KB Output is correct
37 Correct 90 ms 14584 KB Output is correct
38 Correct 158 ms 17912 KB Output is correct
39 Correct 32 ms 11128 KB Output is correct
40 Correct 150 ms 17912 KB Output is correct
41 Correct 118 ms 16120 KB Output is correct
42 Correct 151 ms 17912 KB Output is correct
43 Correct 59 ms 12664 KB Output is correct
44 Correct 148 ms 17912 KB Output is correct
45 Correct 37 ms 11392 KB Output is correct
46 Correct 155 ms 17916 KB Output is correct
47 Correct 49 ms 12024 KB Output is correct
48 Correct 152 ms 17932 KB Output is correct
49 Correct 523 ms 24084 KB Output is correct
50 Correct 582 ms 25816 KB Output is correct
51 Correct 386 ms 21060 KB Output is correct
52 Correct 584 ms 25780 KB Output is correct
53 Correct 253 ms 17036 KB Output is correct
54 Correct 576 ms 25808 KB Output is correct
55 Correct 506 ms 23444 KB Output is correct
56 Correct 573 ms 25688 KB Output is correct
57 Correct 79 ms 12356 KB Output is correct
58 Correct 590 ms 25672 KB Output is correct
59 Correct 345 ms 19824 KB Output is correct
60 Correct 571 ms 25556 KB Output is correct
61 Correct 506 ms 24776 KB Output is correct
62 Correct 478 ms 24372 KB Output is correct
63 Correct 481 ms 23764 KB Output is correct
64 Correct 437 ms 23784 KB Output is correct
65 Correct 498 ms 25296 KB Output is correct
66 Correct 468 ms 24244 KB Output is correct
67 Correct 483 ms 24288 KB Output is correct
68 Correct 468 ms 24212 KB Output is correct
69 Correct 443 ms 24544 KB Output is correct
70 Correct 467 ms 24272 KB Output is correct
71 Correct 467 ms 24544 KB Output is correct
72 Correct 424 ms 23248 KB Output is correct
73 Correct 754 ms 37996 KB Output is correct
74 Correct 625 ms 31412 KB Output is correct
75 Correct 688 ms 36092 KB Output is correct
76 Correct 915 ms 43096 KB Output is correct
77 Correct 462 ms 27768 KB Output is correct
78 Correct 831 ms 39508 KB Output is correct
79 Correct 842 ms 39956 KB Output is correct
80 Correct 904 ms 43228 KB Output is correct
81 Correct 300 ms 22936 KB Output is correct
82 Correct 746 ms 37172 KB Output is correct
83 Correct 629 ms 34284 KB Output is correct
84 Correct 917 ms 43352 KB Output is correct
85 Correct 683 ms 36628 KB Output is correct
86 Correct 799 ms 40516 KB Output is correct
87 Correct 517 ms 30400 KB Output is correct
88 Correct 765 ms 39932 KB Output is correct
89 Correct 740 ms 38816 KB Output is correct
90 Correct 793 ms 40248 KB Output is correct
91 Correct 615 ms 33336 KB Output is correct
92 Correct 794 ms 40320 KB Output is correct
93 Correct 509 ms 31700 KB Output is correct
94 Correct 797 ms 40372 KB Output is correct
95 Correct 559 ms 32700 KB Output is correct
96 Correct 767 ms 39484 KB Output is correct