제출 #802155

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
802155	2023-08-02 10:29:43	elkernos	Passport (JOI23_passport)	C++17	100 / 100	944 ms	88368 KiB

passport

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;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    vector<vector<int>> tree(4 * n);
    function<void(int, int, int, int, int, int)> wrzuc = [&](int v, int l, int r, int ql, int qr, int i) {
        if (ql <= l && r <= qr) {
            tree[v].push_back(i);
            return;
        }
        int m = (l + r) / 2;
        if (ql <= m) wrzuc(2 * v, l, m, ql, qr, i);
        if (m < qr) wrzuc(2 * v + 1, m + 1, r, ql, qr, i);
    };
    function<int(int, int, int, int)> szuk = [&](int v, int l, int r, int x) {
        if (l == r) return v;
        int m = (l + r) / 2;
        if (x <= m) return szuk(2 * v, l, m, x);
        else return szuk(2 * v + 1, m + 1, r, x);
    };
    for (int i = 0; i < n; i++) {
        int l, r; cin >> l >> r;
        l--, r--;
        wrzuc(1, 0, n - 1, l, r, i);
    }
    const int oo = 1e9 + 7;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 8 / 8
• Subtask 5: 46 / 46