제출 #543404

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
543404	2022-03-30 13:27:57	amunduzbaev	무지개나라 (APIO17_rainbow)	C++17	100 / 100	2065 ms	235880 KiB

rainbow

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 "rainbow.h"
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
#define int long long 
#define i32 int32_t
#define ar array
const int N = 2e5 + 5;
struct MSST{
  vector<int> tree[N << 2];
  void add(int i, int y, int lx = 0, int rx = N, int x = 1){
    tree[x].push_back(y);
    if(lx == rx) return;
    int m = (lx + rx) >> 1;
    if(i <= m) add(i, y, lx, m, x<<1);
    else add(i, y, m+1, rx, x<<1|1);
  }
  
  void build(int lx = 0, int rx = N, int x = 1){
    sort(tree[x].begin(), tree[x].end());
    if(lx == rx) return;
    int m = (lx + rx) >> 1;
    build(lx, m, x<<1), build(m+1, rx, x<<1|1);
  }
  
  int get(int l, int r, int l_, int r_, int lx = 0, int rx = N, int x = 1){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 12 / 12
• Subtask 3: 24 / 24
• Subtask 4: 27 / 27
• Subtask 5: 26 / 26