제출 #602234

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
602234	2022-07-22 18:11:55	Soumya1	별자리 3 (JOI20_constellation3)	C++17	100 / 100	460 ms	79984 KiB

constellation3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#ifdef __LOCAL__
  #include <debug_local.h>
#endif
using namespace std;
const int mxN = 2e5 + 5;
const int lg = 20;
pair<int, int> h[mxN][lg];
int cur, up[mxN], lc[mxN], rc[mxN], low[mxN], out[mxN], par[mxN][lg];
vector<pair<int, int>> points[mxN];
long long dp[mxN][2];
long long bit[mxN];
int down[mxN], ll[mxN], rr[mxN];
pair<int, int> query(int l, int r) {
  int x = 31 - __builtin_clz(r - l + 1);
  return max(h[l][x], h[r - (1 << x) + 1][x]);
}
int build(int l, int r, int H, int p) {
  if (l > r) return -1;
  int x = ++cur;
  ll[x] = l, rr[x] = r, down[x] = H;
  auto [mx, idx] = query(l, r);
  par[x][0] = p;
  for (int j = 1; j < lg; j++) par[x][j] = par[par[x][j - 1]][j - 1];
  lc[x] = build(l, idx - 1, mx, x);
  rc[x] = build(idx + 1, r, mx, x);
  low[idx] = x;
  up[x] = mx + 1;
  out[x] = cur;
  return x;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 65 / 65