oj.uz

답안 #736287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736287 2023-05-05T11:58:20 Z math_rabbit_1028 송신탑 (IOI22_towers) C++17
40 / 100
 1743 ms 39696 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
 
int n;
vector<int> arr;
vector<int> upidx, downidx;
 
struct localmax {
  int idx, d, l, r;
  bool operator<(const localmax &other) const {
    if (d == other.d) return idx < other.idx;
    return d < other.d;
  }
  void update() {
    d = arr[upidx[idx]] - max(arr[l], arr[r]);
  } 
} local_value[101010];
int adj[101010][2];
set<localmax> local;
 
vector< pair<int, int> > Dlist;
 
struct Node {
  Node *lt, *rt;
  int val;
  Node() {
    lt = rt = NULL;
    val = 0;
  }
};
Node *root[101010];
int first[101010];
 
void build(Node *node, int st, int ed) {
  if (st == ed) {
    node->val = first[st];
    return;
  }
  int mid = (st + ed) / 2;
  node->lt = new Node();
  node->rt = new Node();
  build(node->lt, st, mid);
  build(node->rt, mid + 1, ed);
  node->val = node->lt->val + node->rt->val;
}
 
void update(Node *prev, Node *now, int st, int ed, int idx, int value) {
  if (st == ed) {
    now->val = value;
    return;
  }
  int mid = (st + ed) / 2;
  if (idx <= mid) {
    now->lt = new Node();
    now->rt = prev->rt;
    update(prev->lt, now->lt, st, mid, idx, value);
  }
  else {
    now->lt = prev->lt;
    now->rt = new Node();
    update(prev->rt, now->rt, mid + 1, ed, idx, value);
  }
  now->val = now->lt->val + now->rt->val;
}
 
int get(Node *node, int st, int ed, int gs, int ge) {
  if (st > ge || ed < gs) return 0;
  if (gs <= st && ed <= ge) return node->val;
  int mid = (st + ed) / 2;
  return get(node->lt, st, mid, gs, ge) + get(node->rt, mid + 1, ed, gs, ge);
}


struct minseg {
  int tree[404040];
  vector<int> initarr;
  void init(int v, int st, int ed) {
    if (st == ed) {
      tree[v] = initarr[st];
      return;
    }
    int mid = (st + ed) / 2;
    init(2 * v, st, mid);
    init(2 * v + 1, mid + 1, ed);
    tree[v] = min(tree[2 * v], tree[2 * v + 1]);
  }
  int get(int v, int st, int ed, int gs, int ge) {
    if (st > ge || ed < gs) return 2e9;
    if (gs <= st && ed <= ge) return tree[v];
    int mid = (st + ed) / 2;
    return min(get(2 * v, st, mid, gs, ge), get(2 * v + 1, mid + 1, ed, gs, ge));
  }
} mintree;
 
void init(int N, vector<int> H) {
  n = N;
  for (int i = 0; i < n; i++) arr.push_back(H[i]);
  
  if (arr[0] < arr[1]) downidx.push_back(0);
  for (int i = 1; i < n - 1; i++) {
    if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) upidx.push_back(i);
    if (arr[i] < arr[i - 1] && arr[i] < arr[i + 1]) downidx.push_back(i);
  }
  if (arr[n - 1] < arr[n - 2]) downidx.push_back(n - 1);
 
  for (int i = 0; i < upidx.size(); i++) {
    local_value[i] = {i, 0, downidx[i], downidx[i + 1]};
    local_value[i].update();
    local.insert(local_value[i]);
    adj[i][0] = i - 1;
    adj[i][1] = i + 1;
  }
 
  while (!local.empty()) {
    localmax now = *local.begin();
    Dlist.push_back({now.d, upidx[now.idx]});
    int next = (arr[now.l] < arr[now.r] ? now.l : now.r);
    local.erase(local.begin());
    if (adj[now.idx][0] >= 0) {
      set<localmax>::iterator iter = local.find(local_value[adj[now.idx][0]]);
      if (iter != local.end()) {
        local.erase(iter);
        local_value[adj[now.idx][0]].r = next;
        local_value[adj[now.idx][0]].update();
        local.insert(local_value[adj[now.idx][0]]);
        adj[adj[now.idx][0]][1] = adj[now.idx][1];
      }
    }
    if (adj[now.idx][1] < upidx.size()) {
      set<localmax>::iterator iter = local.find(local_value[adj[now.idx][1]]);
      if (iter != local.end()) {
        local.erase(iter);
        local_value[adj[now.idx][1]].l = next;
        local_value[adj[now.idx][1]].update();
        local.insert(local_value[adj[now.idx][1]]);
        adj[adj[now.idx][1]][0] = adj[now.idx][0];
      }
    }
  }
 
  for (int i = 0; i < upidx.size(); i++) first[upidx[i]] = 1;
 
  root[0] = new Node();
  build(root[0], 0, n - 1);
  for (int i = 0; i < Dlist.size(); i++) {
    root[i + 1] = new Node();
    update(root[i], root[i + 1], 0, n - 1, Dlist[i].second, 0);
  }

  mintree.initarr = arr;
  mintree.init(1, 0, n - 1);
}

int max_towers(int L, int R, int D) {
  int d = lower_bound(Dlist.begin(), Dlist.end(), make_pair(D, 0)) - Dlist.begin();
  int ans = get(root[d], 0, n - 1, L, R) + 1;
  if (ans > 1) {
    int st = L, ed = R;
    while (st < ed) {
      int mid = (st + ed) / 2;
      if (get(root[d], 0, n - 1, L, mid) > 0) ed = mid;
      else st = mid + 1;
    }
    //cout << st << " " << mintree.get(1, 0, n - 1, L, st - 1) << "\n";
    if (mintree.get(1, 0, n - 1, L, st) + D > arr[st]) ans--;

    st = L, ed = R;
    while (st < ed) {
      int mid = (st + ed + 1) / 2;
      if (get(root[d], 0, n - 1, mid, R) > 0) st = mid;
      else ed = mid - 1;
    }
    //cout << st << " " << mintree.get(1, 0, n - 1, st + 1, R) << "\n";
    if (mintree.get(1, 0, n - 1, st, R) + D > arr[st]) ans--;
  }
  return ans;
}

Compilation message

towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:107:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |   for (int i = 0; i < upidx.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~
towers.cpp:130:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |     if (adj[now.idx][1] < upidx.size()) {
      |         ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
towers.cpp:142:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |   for (int i = 0; i < upidx.size(); i++) first[upidx[i]] = 1;
      |                   ~~^~~~~~~~~~~~~~
towers.cpp:146:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |   for (int i = 0; i < Dlist.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 580 ms 5452 KB 18th lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 2 ms 720 KB Output is correct
4 Correct 2 ms 848 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 848 KB Output is correct
7 Correct 2 ms 848 KB Output is correct
8 Correct 1 ms 552 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 2 ms 848 KB Output is correct
18 Correct 1 ms 496 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 720 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 2 ms 848 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 2 ms 848 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 2 ms 848 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 2 ms 720 KB Output is correct
4 Correct 2 ms 848 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 848 KB Output is correct
7 Correct 2 ms 848 KB Output is correct
8 Correct 1 ms 552 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 2 ms 848 KB Output is correct
18 Correct 1 ms 496 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 720 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 2 ms 848 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 2 ms 848 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 2 ms 848 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 56 ms 18704 KB Output is correct
37 Correct 97 ms 29640 KB Output is correct
38 Correct 91 ms 29484 KB Output is correct
39 Correct 151 ms 39612 KB Output is correct
40 Correct 145 ms 39608 KB Output is correct
41 Correct 151 ms 39528 KB Output is correct
42 Correct 115 ms 39588 KB Output is correct
43 Correct 19 ms 9136 KB Output is correct
44 Correct 27 ms 9140 KB Output is correct
45 Correct 26 ms 9152 KB Output is correct
46 Correct 20 ms 9120 KB Output is correct
47 Correct 83 ms 29500 KB Output is correct
48 Correct 186 ms 39548 KB Output is correct
49 Correct 122 ms 39576 KB Output is correct
50 Correct 20 ms 9136 KB Output is correct
51 Correct 29 ms 9140 KB Output is correct
52 Correct 107 ms 29520 KB Output is correct
53 Correct 146 ms 39572 KB Output is correct
54 Correct 179 ms 39592 KB Output is correct
55 Correct 21 ms 9128 KB Output is correct
56 Correct 28 ms 9120 KB Output is correct
57 Correct 98 ms 28592 KB Output is correct
58 Correct 114 ms 29592 KB Output is correct
59 Correct 98 ms 29592 KB Output is correct
60 Correct 165 ms 39512 KB Output is correct
61 Correct 137 ms 39600 KB Output is correct
62 Correct 146 ms 39592 KB Output is correct
63 Correct 131 ms 39608 KB Output is correct
64 Correct 27 ms 9116 KB Output is correct
65 Correct 29 ms 9148 KB Output is correct
66 Correct 21 ms 9156 KB Output is correct
67 Correct 20 ms 9140 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1329 ms 29324 KB Output is correct
2 Correct 1743 ms 29508 KB Output is correct
3 Incorrect 1741 ms 29788 KB 18409th lines differ - on the 1st token, expected: '1', found: '0'
4 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 289 ms 6864 KB Output is correct
2 Correct 1213 ms 29524 KB Output is correct
3 Correct 1223 ms 29492 KB Output is correct
4 Correct 1490 ms 39620 KB Output is correct
5 Correct 1352 ms 39500 KB Output is correct
6 Correct 1273 ms 39612 KB Output is correct
7 Correct 1407 ms 39564 KB Output is correct
8 Correct 891 ms 9164 KB Output is correct
9 Correct 675 ms 9136 KB Output is correct
10 Correct 1244 ms 9248 KB Output is correct
11 Correct 1079 ms 9136 KB Output is correct
12 Correct 90 ms 29648 KB Output is correct
13 Correct 132 ms 39552 KB Output is correct
14 Correct 120 ms 39556 KB Output is correct
15 Correct 21 ms 9152 KB Output is correct
16 Correct 20 ms 9256 KB Output is correct
17 Correct 86 ms 28592 KB Output is correct
18 Correct 86 ms 29616 KB Output is correct
19 Correct 86 ms 29636 KB Output is correct
20 Correct 123 ms 39576 KB Output is correct
21 Correct 144 ms 39696 KB Output is correct
22 Correct 146 ms 39572 KB Output is correct
23 Correct 132 ms 39592 KB Output is correct
24 Correct 21 ms 9152 KB Output is correct
25 Correct 29 ms 9148 KB Output is correct
26 Correct 31 ms 9148 KB Output is correct
27 Correct 20 ms 9152 KB Output is correct
28 Correct 2 ms 720 KB Output is correct
29 Correct 2 ms 848 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 2 ms 720 KB Output is correct
35 Correct 1 ms 720 KB Output is correct
36 Correct 2 ms 848 KB Output is correct
37 Correct 2 ms 848 KB Output is correct
38 Correct 2 ms 848 KB Output is correct
39 Correct 2 ms 848 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 1 ms 464 KB Output is correct
43 Correct 1 ms 464 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 2 ms 720 KB Output is correct
4 Correct 2 ms 848 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 848 KB Output is correct
7 Correct 2 ms 848 KB Output is correct
8 Correct 1 ms 552 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 2 ms 848 KB Output is correct
18 Correct 1 ms 496 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 720 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 2 ms 848 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 2 ms 848 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 2 ms 848 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 56 ms 18704 KB Output is correct
37 Correct 97 ms 29640 KB Output is correct
38 Correct 91 ms 29484 KB Output is correct
39 Correct 151 ms 39612 KB Output is correct
40 Correct 145 ms 39608 KB Output is correct
41 Correct 151 ms 39528 KB Output is correct
42 Correct 115 ms 39588 KB Output is correct
43 Correct 19 ms 9136 KB Output is correct
44 Correct 27 ms 9140 KB Output is correct
45 Correct 26 ms 9152 KB Output is correct
46 Correct 20 ms 9120 KB Output is correct
47 Correct 83 ms 29500 KB Output is correct
48 Correct 186 ms 39548 KB Output is correct
49 Correct 122 ms 39576 KB Output is correct
50 Correct 20 ms 9136 KB Output is correct
51 Correct 29 ms 9140 KB Output is correct
52 Correct 107 ms 29520 KB Output is correct
53 Correct 146 ms 39572 KB Output is correct
54 Correct 179 ms 39592 KB Output is correct
55 Correct 21 ms 9128 KB Output is correct
56 Correct 28 ms 9120 KB Output is correct
57 Correct 98 ms 28592 KB Output is correct
58 Correct 114 ms 29592 KB Output is correct
59 Correct 98 ms 29592 KB Output is correct
60 Correct 165 ms 39512 KB Output is correct
61 Correct 137 ms 39600 KB Output is correct
62 Correct 146 ms 39592 KB Output is correct
63 Correct 131 ms 39608 KB Output is correct
64 Correct 27 ms 9116 KB Output is correct
65 Correct 29 ms 9148 KB Output is correct
66 Correct 21 ms 9156 KB Output is correct
67 Correct 20 ms 9140 KB Output is correct
68 Correct 1329 ms 29324 KB Output is correct
69 Correct 1743 ms 29508 KB Output is correct
70 Incorrect 1741 ms 29788 KB 18409th lines differ - on the 1st token, expected: '1', found: '0'
71 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 580 ms 5452 KB 18th lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -