oj.uz

답안 #1057497

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057497 2024-08-13T20:39:17 Z mychecksedad 송신탑 (IOI22_towers) C++17
54 / 100
 785 ms 64764 KB 
#include "towers.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long int
#define en cout << '\n'
#define pii pair<int,int>
#define vi vector<int> 
#define ff first
#define ss second
const int N = 300005, K = 20;

struct Node{
  Node *L, *R;
  int sum, mostleft, mostright;
  Node(){
    L=R=nullptr;
    sum=0;
    mostleft=mostright=0;
  }
  Node(Node*l, Node*r): L(l), R(r){
    sum = 0;
    mostleft = 100000000;
    mostright = -1;
    if(l != nullptr) sum += l->sum, mostleft = min(mostleft, l->mostleft), mostright = max(mostright, l->mostright);
    if(r != nullptr) sum += r->sum, mostleft = min(mostleft, r->mostleft), mostright = max(mostright, r->mostright);
  }
  Node(int s, int pos): sum(s){
    if(s == 1)
      mostleft = mostright = pos;
    else 
      mostleft = 100000000, mostright = -1;
    L=R=nullptr;
  }
};
vector<bool> is_peak(300005);

Node *build(int l, int r){
  if(l == r){
    return new Node(is_peak[l], l);
  }
  int m = l+r>>1;
  return new Node(build(l, m), build(m+1, r));
}

Node *upd(Node *v, int l, int r, int p, int val){
  if(l == r){
    return new Node(val, l);
  }
  int m = l+r>>1;
  if(p <= m) return new Node(upd(v->L, l, m, p, val), v->R);
  return new Node(v->L, upd(v->R, m+1, r, p, val));
}

array<int, 3> get(Node *v, int l, int r, int ql, int qr){
  if(ql > r || l > qr) return {0, 100000000, -1};
  if(ql <= l && r <= qr){
    return {v->sum, v->mostleft, v->mostright};
  }
  int m = l+r>>1;

  auto x = get(v->L, l, m, ql, qr);
  auto y = get(v->R, m+1, r, ql, qr);
  return {x[0] + y[0], min(x[1], y[1]), max(x[2], y[2])};
}
int rmq[N][K];
int getmin(int l, int r){
  int k = int(log2(r-l+1));
  return min(rmq[l][k], rmq[r-(1<<k)+1][k]);
}

void op(vector<int> &a, vector<int> &A, vector<int> &B){
  if(a.size() <= 1){
    A = a;
    B.pb(0);
    return;
  }
  A.pb(a[0]);
  A.pb(a[1]);
  B.pb(0);
  B.pb(1);
  for(int i = 2; i < a.size(); ++i){
    if(a[i] > A.back() && A.back() > A[int(A.size()) - 2]){
      A.pop_back();
      B.pop_back();
      A.pb(a[i]);
      B.pb(i);
    }else if(a[i] < A.back() && A.back() < A[int(A.size()) - 2]){
      A.pop_back();
      B.pop_back();
      A.pb(a[i]);
      B.pb(i);
    }else{
      A.pb(a[i]);
      B.pb(i);
    }
  }
  
}
int n;
vector<int> A, B, a;
vector<pair<int, int>> ans;
vector<pair<int, Node*>> roots;
void init(int nn, vector<int> aa) { n=nn;a=aa;
  if(n == 1) return;
  op(a, A, B);

  for(int i = 0; i < n; ++i) rmq[i][0] = a[i];
  for(int j = 1; j < K; ++j){
    for(int i = 0; i + (1<<j) <= n; ++i){
      rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1<<(j-1))][j - 1]);
    }
  }

  if(A[0] > A[1]) A.erase(A.begin()), B.erase(B.begin());
  if(A.size()==1) return;
  if(A.back() > A[A.size() - 2]) A.pop_back(), B.pop_back();
  if(A.size()==1) return;

  set<array<int, 3>> S;
  priority_queue<array<int, 3>> Q;

  int m = A.size();
  for(int i = 0; i < m; ++i){
    S.insert({i, A[i], B[i]});
    if(i%2) is_peak[B[i]] = 1;
    if(i + 1 < m && A[i + 1] > A[i]) Q.push({-(A[i + 1] - A[i]), i, i + 1});
    if(i > 0 && A[i - 1] > A[i]) Q.push({-(A[i - 1] - A[i]), i, i - 1});
  }
  roots.pb({0, build(0, n - 1)});

  ans.pb({0, A.size() / 2 + 1});

  vector<bool> rem(A.size());
  while(!Q.empty()){
    auto V = Q.top();
    int v = V[1], u = V[2];
    int val = V[0];
    Q.pop();
    if(rem[u] || rem[v]) continue;
    S.erase({v, A[v], B[v]});
    S.erase({u, A[u], B[u]});
    rem[u] = rem[v] = 1;
    int mx = max(u, v);
    auto it = S.lower_bound(array<int,3>{mx, -1, -1});
    if(it != S.begin() && it != S.end()){
      auto it2 = prev(it);
      auto x = *it;
      auto y = *it2;
      Q.push({-abs(x[1] - y[1]), x[0], y[0]});
    }
    if(ans.back().ff == -val){
      roots.back().ss = upd(roots.back().ss, 0, n - 1, (A[v] > A[u] ? B[v] : B[u]), 0);
      ans.back().ss = S.size() / 2 + 1;
    }else{
      roots.pb({-val, upd(roots.back().ss, 0, n - 1, (A[v] > A[u] ? B[v] : B[u]), 0)});
      ans.pb({-val, S.size() / 2 + 1});
    }
  }

}

int max_towers(int L, int R, int D) {
  if(n == 1 || L == R || A.size() == 1) return 1;
  int pos = upper_bound(all(ans), pii{D, -1}) - ans.begin() - 1;
  if(pos == ans.size()) return 1;
  auto F = get(roots[pos].ss, 0, n - 1, L, R);
  int l = F[1], r = F[2], cur = F[0];
  if(cur == 0) return 1;
  if(L < l){
    cur += getmin(L, l-1) <= a[F[1]] - D;
  }
  if(r < R){
    cur += getmin(r + 1, R) <= a[F[2]] - D;
  }
  return cur - 1;
    // if(D==1) return ans[0].ss;
  // return max(pos == ans.size() ? 1 : ans[pos].ss, 1);
}

Compilation message

towers.cpp: In function 'Node* build(int, int)':
towers.cpp:43:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |   int m = l+r>>1;
      |           ~^~
towers.cpp: In function 'Node* upd(Node*, int, int, int, int)':
towers.cpp:51:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |   int m = l+r>>1;
      |           ~^~
towers.cpp: In function 'std::array<int, 3> get(Node*, int, int, int, int)':
towers.cpp:61:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   61 |   int m = l+r>>1;
      |           ~^~
towers.cpp: In function 'void op(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
towers.cpp:83:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   for(int i = 2; i < a.size(); ++i){
      |                  ~~^~~~~~~~~~
towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:167:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |   if(pos == ans.size()) return 1;
      |      ~~~~^~~~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 289 ms 13012 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 0 ms 600 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 2 ms 1368 KB Output is correct
17 Correct 1 ms 1368 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 596 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 2 ms 1368 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 0 ms 600 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1180 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 1 ms 1368 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 0 ms 600 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 2 ms 1368 KB Output is correct
17 Correct 1 ms 1368 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 596 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 2 ms 1368 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 0 ms 600 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1180 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 1 ms 1368 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 52 ms 32596 KB Output is correct
37 Correct 84 ms 49836 KB Output is correct
38 Correct 95 ms 49648 KB Output is correct
39 Correct 116 ms 64680 KB Output is correct
40 Correct 121 ms 64492 KB Output is correct
41 Correct 115 ms 64492 KB Output is correct
42 Correct 122 ms 64636 KB Output is correct
43 Correct 10 ms 9816 KB Output is correct
44 Correct 17 ms 9844 KB Output is correct
45 Correct 15 ms 19200 KB Output is correct
46 Correct 15 ms 19288 KB Output is correct
47 Correct 82 ms 49644 KB Output is correct
48 Correct 122 ms 64704 KB Output is correct
49 Correct 118 ms 64680 KB Output is correct
50 Correct 14 ms 9816 KB Output is correct
51 Correct 15 ms 19288 KB Output is correct
52 Correct 81 ms 49644 KB Output is correct
53 Correct 146 ms 64764 KB Output is correct
54 Correct 119 ms 64744 KB Output is correct
55 Correct 10 ms 9816 KB Output is correct
56 Correct 22 ms 19352 KB Output is correct
57 Correct 77 ms 47900 KB Output is correct
58 Correct 95 ms 49748 KB Output is correct
59 Correct 84 ms 49900 KB Output is correct
60 Correct 123 ms 64612 KB Output is correct
61 Correct 129 ms 64492 KB Output is correct
62 Correct 134 ms 64604 KB Output is correct
63 Correct 161 ms 64748 KB Output is correct
64 Correct 17 ms 9816 KB Output is correct
65 Correct 19 ms 9832 KB Output is correct
66 Correct 18 ms 19288 KB Output is correct
67 Correct 15 ms 19308 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 49380 KB Output is correct
2 Correct 716 ms 49640 KB Output is correct
3 Correct 677 ms 49644 KB Output is correct
4 Correct 736 ms 64604 KB Output is correct
5 Correct 754 ms 64748 KB Output is correct
6 Correct 749 ms 64596 KB Output is correct
7 Correct 764 ms 64492 KB Output is correct
8 Correct 472 ms 9816 KB Output is correct
9 Correct 526 ms 9816 KB Output is correct
10 Correct 613 ms 19288 KB Output is correct
11 Correct 582 ms 19288 KB Output is correct
12 Correct 612 ms 19252 KB Output is correct
13 Correct 472 ms 9816 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 78 ms 49644 KB Output is correct
18 Correct 126 ms 64492 KB Output is correct
19 Correct 131 ms 64492 KB Output is correct
20 Correct 10 ms 9816 KB Output is correct
21 Correct 15 ms 19304 KB Output is correct
22 Correct 97 ms 49568 KB Output is correct
23 Correct 129 ms 64492 KB Output is correct
24 Correct 120 ms 64692 KB Output is correct
25 Correct 10 ms 9816 KB Output is correct
26 Correct 15 ms 19312 KB Output is correct
27 Correct 2 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 0 ms 600 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 1 ms 1368 KB Output is correct
34 Correct 2 ms 1368 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 0 ms 600 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 11604 KB Output is correct
2 Correct 605 ms 49640 KB Output is correct
3 Correct 644 ms 49644 KB Output is correct
4 Correct 674 ms 64748 KB Output is correct
5 Correct 685 ms 64492 KB Output is correct
6 Correct 629 ms 64560 KB Output is correct
7 Correct 677 ms 64748 KB Output is correct
8 Correct 518 ms 9816 KB Output is correct
9 Correct 451 ms 9816 KB Output is correct
10 Correct 576 ms 19280 KB Output is correct
11 Correct 506 ms 19312 KB Output is correct
12 Correct 92 ms 49540 KB Output is correct
13 Correct 127 ms 64752 KB Output is correct
14 Correct 129 ms 64636 KB Output is correct
15 Correct 18 ms 9816 KB Output is correct
16 Correct 20 ms 19304 KB Output is correct
17 Correct 95 ms 47924 KB Output is correct
18 Correct 107 ms 49640 KB Output is correct
19 Correct 82 ms 49900 KB Output is correct
20 Correct 142 ms 64700 KB Output is correct
21 Correct 135 ms 64488 KB Output is correct
22 Correct 126 ms 64604 KB Output is correct
23 Correct 119 ms 64500 KB Output is correct
24 Correct 12 ms 9840 KB Output is correct
25 Correct 18 ms 9816 KB Output is correct
26 Correct 27 ms 19280 KB Output is correct
27 Correct 21 ms 19288 KB Output is correct
28 Correct 1 ms 1112 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 1272 KB Output is correct
35 Correct 1 ms 1272 KB Output is correct
36 Correct 3 ms 1368 KB Output is correct
37 Correct 2 ms 1368 KB Output is correct
38 Correct 2 ms 1368 KB Output is correct
39 Correct 2 ms 1368 KB Output is correct
40 Correct 0 ms 600 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 1 ms 600 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 2 ms 1368 KB Output is correct
17 Correct 1 ms 1368 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 596 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 2 ms 1368 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 0 ms 600 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1180 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 1 ms 1368 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 52 ms 32596 KB Output is correct
37 Correct 84 ms 49836 KB Output is correct
38 Correct 95 ms 49648 KB Output is correct
39 Correct 116 ms 64680 KB Output is correct
40 Correct 121 ms 64492 KB Output is correct
41 Correct 115 ms 64492 KB Output is correct
42 Correct 122 ms 64636 KB Output is correct
43 Correct 10 ms 9816 KB Output is correct
44 Correct 17 ms 9844 KB Output is correct
45 Correct 15 ms 19200 KB Output is correct
46 Correct 15 ms 19288 KB Output is correct
47 Correct 82 ms 49644 KB Output is correct
48 Correct 122 ms 64704 KB Output is correct
49 Correct 118 ms 64680 KB Output is correct
50 Correct 14 ms 9816 KB Output is correct
51 Correct 15 ms 19288 KB Output is correct
52 Correct 81 ms 49644 KB Output is correct
53 Correct 146 ms 64764 KB Output is correct
54 Correct 119 ms 64744 KB Output is correct
55 Correct 10 ms 9816 KB Output is correct
56 Correct 22 ms 19352 KB Output is correct
57 Correct 77 ms 47900 KB Output is correct
58 Correct 95 ms 49748 KB Output is correct
59 Correct 84 ms 49900 KB Output is correct
60 Correct 123 ms 64612 KB Output is correct
61 Correct 129 ms 64492 KB Output is correct
62 Correct 134 ms 64604 KB Output is correct
63 Correct 161 ms 64748 KB Output is correct
64 Correct 17 ms 9816 KB Output is correct
65 Correct 19 ms 9832 KB Output is correct
66 Correct 18 ms 19288 KB Output is correct
67 Correct 15 ms 19308 KB Output is correct
68 Correct 521 ms 49380 KB Output is correct
69 Correct 716 ms 49640 KB Output is correct
70 Correct 677 ms 49644 KB Output is correct
71 Correct 736 ms 64604 KB Output is correct
72 Correct 754 ms 64748 KB Output is correct
73 Correct 749 ms 64596 KB Output is correct
74 Correct 764 ms 64492 KB Output is correct
75 Correct 472 ms 9816 KB Output is correct
76 Correct 526 ms 9816 KB Output is correct
77 Correct 613 ms 19288 KB Output is correct
78 Correct 582 ms 19288 KB Output is correct
79 Correct 612 ms 19252 KB Output is correct
80 Correct 472 ms 9816 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 0 ms 600 KB Output is correct
83 Correct 0 ms 600 KB Output is correct
84 Correct 78 ms 49644 KB Output is correct
85 Correct 126 ms 64492 KB Output is correct
86 Correct 131 ms 64492 KB Output is correct
87 Correct 10 ms 9816 KB Output is correct
88 Correct 15 ms 19304 KB Output is correct
89 Correct 97 ms 49568 KB Output is correct
90 Correct 129 ms 64492 KB Output is correct
91 Correct 120 ms 64692 KB Output is correct
92 Correct 10 ms 9816 KB Output is correct
93 Correct 15 ms 19312 KB Output is correct
94 Correct 2 ms 1112 KB Output is correct
95 Correct 1 ms 1368 KB Output is correct
96 Correct 1 ms 1368 KB Output is correct
97 Correct 0 ms 600 KB Output is correct
98 Correct 0 ms 600 KB Output is correct
99 Correct 1 ms 1112 KB Output is correct
100 Correct 1 ms 1368 KB Output is correct
101 Correct 2 ms 1368 KB Output is correct
102 Correct 0 ms 600 KB Output is correct
103 Correct 0 ms 600 KB Output is correct
104 Correct 620 ms 44596 KB Output is correct
105 Incorrect 785 ms 49544 KB 22302nd lines differ - on the 1st token, expected: '1', found: '0'
106 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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