제출 #400854

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
400854	2021-05-08 18:36:50	timmyfeng	Bubble Sort 2 (JOI18_bubblesort2)	C++17	100 / 100	2429 ms	51432 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
#include <bits/stdc++.h>
using namespace std;
const int N = 1000000;
array<int, 2> values[N];
int maxi[4 * N], lazy[4 * N], m;
void update(int a, int b, int x, int u = 1, int l = 0, int r = m - 1) {
    if (a > b || b < l || r < a) {
        return;
    } else if (a <= l && r <= b) {
        lazy[u] += x;
        maxi[u] += x;
    } else {
        int m = (l + r) / 2;
        update(a, b, x, 2 * u, l, m);
        update(a, b, x, 2 * u + 1, m + 1, r);
        maxi[u] = max(maxi[2 * u], maxi[2 * u + 1]) + lazy[u];
    }
}
void assign(int a, int x, int u = 1, int l = 0, int r = m - 1) {
    if (l == r) {
        maxi[u] = x + lazy[u];
    } else {
        int m = (l + r) / 2;
        if (a <= m) {
            assign(a, x, 2 * u, l, m);
        } else {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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