제출 #380623

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
380623	2021-03-22 14:54:11	ntabc05101	Bubble Sort 2 (JOI18_bubblesort2)	C++14	100 / 100	3651 ms	128992 KiB

bubblesort2

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
#if not LOCAL
#define NDEBUG 1
#endif // LOCAL
#include<bits/stdc++.h>
const int inf=1e9+9;
struct SegmentTree {
        std::vector<int64_t> nodes, lazy;
        std::vector<int> L, H;
        void buildRange(int node, int low, int high) {
                L[node]=low, H[node]=high;
                nodes[node]=lazy[node]=0;
                if (low==high) {
                        return ;
                }
                int mid=(low+high)>>1;
                buildRange(node<<1, low, mid);
                buildRange(node<<1|1, mid+1, high);
        }
        SegmentTree(int n) {
                nodes.resize(n<<2); lazy.resize(n<<2);
                L.resize(n<<2), H.resize(n<<2);
                buildRange(1, 1, n);
        }
        void propagate(int node) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 21 / 21
• Subtask 3: 22 / 22
• Subtask 4: 40 / 40