제출 #405695

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
405695	2021-05-16 19:14:23	ritul_kr_singh	운세 보기 2 (JOI14_fortune_telling2)	C++17	100 / 100	190 ms	18180 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 int long long
#define sp << ' ' <<
#define nl << '\n'
const int INF = 1e18;
struct FenwickTree{
  vector<bool> a; int n, s;
  FenwickTree(int N){ a.resize((n=N)+1); }
  void add(int i){
    for(++i; i<=n; i+=i&-i) a[i] = a[i] ^ 1;
  }
  int get(int i){
    for(s=0; i>=1; i-=i&-i) s ^= a[i];
    return s;
  }
  int get(int i, int j){ return get(j+1) ^ get(i); }
};
struct SegmentTree{
  vector<int> a; int sz = 1;
  SegmentTree(vector<int> &v){
    while(sz < (int)v.size()) sz += sz;
    a.assign(2*sz, -1);
    build(v, 0, 0, sz);
  }
  void build(vector<int> &v, int x, int lx, int rx){
    if(rx-lx==1){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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