Submission #681735

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
681735	2023-01-14 01:04:24	NK_	Fortune Telling 2 (JOI14_fortune_telling2)	C++17	100 / 100	262 ms	63764 KiB

fortune_telling2

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>
using namespace std;
#define nl '\n'
using ll = long long;
struct BIT {
  vector<int> data; int N;
  void init(int n) { N = n; data = vector<int>(N, 0); }
  void add(int p, int x) { for(++p;p<=N;p+=p&-p) data[p-1] += x; }
  int sum(int l, int r) { return sum(r+1) - sum(l); }
  int sum(int r) { int s = 0; for(;r;r-=r&-r) s += data[r-1]; return s; }
};
struct ST {
  int level(int x) { return 31 - __builtin_clz(x); }
  int comb(int a, int b) { return max(a, b); }
  vector<int> v; vector<vector<int>> jmp;
  void init(const vector<int> &_v) {
    v = _v; jmp = {v};
    for(int j = 1; (1<<j) <= int(size(v)); j++) {
      jmp.push_back(vector<int>(int(size(v)) - (1<<j) + 1));
      for(int i = 0; i < int(size(jmp[j])); i++) {
        jmp[j][i] = comb(jmp[j-1][i], jmp[j-1][i + (1<<(j-1))]);
      } 
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 31 / 31
• Subtask 3: 65 / 65