제출 #633225

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
633225	2022-08-22 01:19:01	Gromp15	Abracadabra (CEOI22_abracadabra)	C++17	100 / 100	530 ms	40216 KiB

Main

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>
#define ll long long
#define ar array
using namespace std;
struct fenwick {
    int n, lg; vector<int> bit;
    fenwick(int a) : n(a), lg(__lg(n)), bit(a+1) {}
    int pref(int pos) {
        pos++;
        int ret = 0;
        if (pos > n) pos = n;
        while (pos) {
            ret += bit[pos], pos -= pos&-pos;
        }
        return ret;
    }
    int point(int pos) {
        return pref(pos) - pref(pos-1);
    }
    void update(int pos, int x) {
        pos++;
        while (pos <= n) {
            bit[pos] += x, pos += pos&-pos;
        }
    }
    int last_smaller(int x) {
        int pos = 0;
        for (int i = lg; i >= 0; i--) {
            if (pos + (1 << i) <= n && x > bit[pos+(1<<i)]) {
                x -= bit[pos+(1<<i)];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25