oj.uz

Submission #867965

# Submission time Handle Problem Language Result Execution time Memory
867965 2023-10-30T02:05:06 Z becaido Osumnjičeni (COCI21_osumnjiceni) C++17
110 / 110
 429 ms 33428 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

#define lpos pos*2
#define rpos pos*2+1

const int SIZE = 2e5 + 5;
const int H = __lg(SIZE);

int n, m, q;
vector<int> lis;
int hl[SIZE], hr[SIZE];
int to[SIZE][H + 1];

struct Node {
    int mx, lazy;
    Node operator + (const Node &rhs) const {
        Node re;
        re.mx = max(mx, rhs.mx);
        re.lazy = 0;
        return re;
    }
} node[SIZE << 3];

void push(int pos, int l, int r) {
    node[pos].mx += node[pos].lazy;
    if (l < r) {
        node[lpos].lazy += node[pos].lazy;
        node[rpos].lazy += node[pos].lazy;
    }
    node[pos].lazy = 0;
}
void pull(int pos, int l, int r) {
    int mid = (l + r) / 2;
    push(lpos, l, mid);
    push(rpos, mid + 1, r);
    node[pos] = node[lpos] + node[rpos];
}

void upd(int pos, int l, int r, int L, int R, int x) {
    if (l == L && r == R) {
        node[pos].lazy += x;
        push(pos, L, R);
        return;
    }
    push(pos, L, R);
    int mid = (L + R) / 2;
    if (r <= mid) upd(lpos, l, r, L, mid, x);
    else if (l > mid) upd(rpos, l, r, mid + 1, R, x);
    else {
        upd(lpos, l, mid, L, mid, x);
        upd(rpos, mid + 1, r, mid + 1, R, x);
    }
    pull(pos, L, R);
}

void solve() {
    cin >> n;
    FOR (i, 1, n) {
        cin >> hl[i] >> hr[i];
        lis.pb(hl[i]), lis.pb(hr[i]);
    }
    {
        sort(lis.begin(), lis.end());
        lis.erase(unique(lis.begin(), lis.end()), lis.end());
        m = lis.size();
        FOR (i, 1, n) {
            hl[i] = lower_bound(lis.begin(), lis.end(), hl[i]) - lis.begin() + 1;
            hr[i] = lower_bound(lis.begin(), lis.end(), hr[i]) - lis.begin() + 1;
        }
    }
    to[n + 1][0] = n + 1;
    for (int i = 1, p = 1; i <= n; i++) {
        while (p <= n && node[1].mx <= 1) {
            upd(1, hl[p], hr[p], 1, m, 1);
            p++;
        }
        to[i][0] = (node[1].mx > 1 ? p - 1 : p);
        upd(1, hl[i], hr[i], 1, m, -1);
    }
    FOR (j, 1, H) FOR (i, 1, n + 1) to[i][j] = to[to[i][j - 1]][j - 1];
    cin >> q;
    while (q--) {
        int l, r, ans = 0;
        cin >> l >> r;
        for (int i = H, pos = l; i >= 0; i--) if (to[pos][i] <= r) {
            ans += 1 << i;
            pos = to[pos][i];
        }
        ans++;
        cout << ans << '\n';
    }
}

int main() {
    Waimai;
    solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 29848 KB Output is correct
2 Correct 327 ms 29604 KB Output is correct
3 Correct 285 ms 29492 KB Output is correct
4 Correct 303 ms 29640 KB Output is correct
5 Correct 297 ms 29860 KB Output is correct
6 Correct 43 ms 21044 KB Output is correct
7 Correct 48 ms 21208 KB Output is correct
8 Correct 51 ms 21152 KB Output is correct
9 Correct 59 ms 21192 KB Output is correct
10 Correct 62 ms 20932 KB Output is correct
11 Correct 227 ms 29388 KB Output is correct
12 Correct 212 ms 28780 KB Output is correct
13 Correct 203 ms 28764 KB Output is correct
14 Correct 230 ms 29492 KB Output is correct
15 Correct 194 ms 28988 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 43 ms 21324 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7080 KB Output is correct
2 Correct 8 ms 7004 KB Output is correct
3 Correct 7 ms 7000 KB Output is correct
4 Correct 8 ms 7004 KB Output is correct
5 Correct 7 ms 7004 KB Output is correct
6 Correct 3 ms 4852 KB Output is correct
7 Correct 3 ms 4828 KB Output is correct
8 Correct 3 ms 4696 KB Output is correct
9 Correct 3 ms 4744 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 5 ms 6860 KB Output is correct
12 Correct 5 ms 7004 KB Output is correct
13 Correct 5 ms 7000 KB Output is correct
14 Correct 7 ms 6876 KB Output is correct
15 Correct 6 ms 7000 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 3 ms 4700 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7080 KB Output is correct
2 Correct 8 ms 7004 KB Output is correct
3 Correct 7 ms 7000 KB Output is correct
4 Correct 8 ms 7004 KB Output is correct
5 Correct 7 ms 7004 KB Output is correct
6 Correct 3 ms 4852 KB Output is correct
7 Correct 3 ms 4828 KB Output is correct
8 Correct 3 ms 4696 KB Output is correct
9 Correct 3 ms 4744 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 5 ms 6860 KB Output is correct
12 Correct 5 ms 7004 KB Output is correct
13 Correct 5 ms 7000 KB Output is correct
14 Correct 7 ms 6876 KB Output is correct
15 Correct 6 ms 7000 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 3 ms 4700 KB Output is correct
18 Correct 59 ms 9556 KB Output is correct
19 Correct 54 ms 9312 KB Output is correct
20 Correct 73 ms 9728 KB Output is correct
21 Correct 54 ms 9284 KB Output is correct
22 Correct 56 ms 9580 KB Output is correct
23 Correct 50 ms 7244 KB Output is correct
24 Correct 56 ms 7248 KB Output is correct
25 Correct 60 ms 7472 KB Output is correct
26 Correct 51 ms 7248 KB Output is correct
27 Correct 49 ms 6996 KB Output is correct
28 Correct 40 ms 8912 KB Output is correct
29 Correct 41 ms 9184 KB Output is correct
30 Correct 53 ms 9056 KB Output is correct
31 Correct 42 ms 8948 KB Output is correct
32 Correct 44 ms 9044 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 49 ms 7092 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 357 ms 30076 KB Output is correct
2 Correct 307 ms 30104 KB Output is correct
3 Correct 286 ms 29348 KB Output is correct
4 Correct 270 ms 29408 KB Output is correct
5 Correct 316 ms 29604 KB Output is correct
6 Correct 39 ms 20972 KB Output is correct
7 Correct 45 ms 20936 KB Output is correct
8 Correct 49 ms 20792 KB Output is correct
9 Correct 54 ms 20836 KB Output is correct
10 Correct 70 ms 21528 KB Output is correct
11 Correct 197 ms 28916 KB Output is correct
12 Correct 223 ms 29384 KB Output is correct
13 Correct 200 ms 28916 KB Output is correct
14 Correct 211 ms 28872 KB Output is correct
15 Correct 205 ms 29476 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 40 ms 21020 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 29848 KB Output is correct
2 Correct 327 ms 29604 KB Output is correct
3 Correct 285 ms 29492 KB Output is correct
4 Correct 303 ms 29640 KB Output is correct
5 Correct 297 ms 29860 KB Output is correct
6 Correct 43 ms 21044 KB Output is correct
7 Correct 48 ms 21208 KB Output is correct
8 Correct 51 ms 21152 KB Output is correct
9 Correct 59 ms 21192 KB Output is correct
10 Correct 62 ms 20932 KB Output is correct
11 Correct 227 ms 29388 KB Output is correct
12 Correct 212 ms 28780 KB Output is correct
13 Correct 203 ms 28764 KB Output is correct
14 Correct 230 ms 29492 KB Output is correct
15 Correct 194 ms 28988 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 43 ms 21324 KB Output is correct
18 Correct 8 ms 7080 KB Output is correct
19 Correct 8 ms 7004 KB Output is correct
20 Correct 7 ms 7000 KB Output is correct
21 Correct 8 ms 7004 KB Output is correct
22 Correct 7 ms 7004 KB Output is correct
23 Correct 3 ms 4852 KB Output is correct
24 Correct 3 ms 4828 KB Output is correct
25 Correct 3 ms 4696 KB Output is correct
26 Correct 3 ms 4744 KB Output is correct
27 Correct 3 ms 4700 KB Output is correct
28 Correct 5 ms 6860 KB Output is correct
29 Correct 5 ms 7004 KB Output is correct
30 Correct 5 ms 7000 KB Output is correct
31 Correct 7 ms 6876 KB Output is correct
32 Correct 6 ms 7000 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 3 ms 4700 KB Output is correct
35 Correct 59 ms 9556 KB Output is correct
36 Correct 54 ms 9312 KB Output is correct
37 Correct 73 ms 9728 KB Output is correct
38 Correct 54 ms 9284 KB Output is correct
39 Correct 56 ms 9580 KB Output is correct
40 Correct 50 ms 7244 KB Output is correct
41 Correct 56 ms 7248 KB Output is correct
42 Correct 60 ms 7472 KB Output is correct
43 Correct 51 ms 7248 KB Output is correct
44 Correct 49 ms 6996 KB Output is correct
45 Correct 40 ms 8912 KB Output is correct
46 Correct 41 ms 9184 KB Output is correct
47 Correct 53 ms 9056 KB Output is correct
48 Correct 42 ms 8948 KB Output is correct
49 Correct 44 ms 9044 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 49 ms 7092 KB Output is correct
52 Correct 357 ms 30076 KB Output is correct
53 Correct 307 ms 30104 KB Output is correct
54 Correct 286 ms 29348 KB Output is correct
55 Correct 270 ms 29408 KB Output is correct
56 Correct 316 ms 29604 KB Output is correct
57 Correct 39 ms 20972 KB Output is correct
58 Correct 45 ms 20936 KB Output is correct
59 Correct 49 ms 20792 KB Output is correct
60 Correct 54 ms 20836 KB Output is correct
61 Correct 70 ms 21528 KB Output is correct
62 Correct 197 ms 28916 KB Output is correct
63 Correct 223 ms 29384 KB Output is correct
64 Correct 200 ms 28916 KB Output is correct
65 Correct 211 ms 28872 KB Output is correct
66 Correct 205 ms 29476 KB Output is correct
67 Correct 1 ms 4444 KB Output is correct
68 Correct 40 ms 21020 KB Output is correct
69 Correct 362 ms 32964 KB Output is correct
70 Correct 429 ms 33428 KB Output is correct
71 Correct 392 ms 32676 KB Output is correct
72 Correct 390 ms 33156 KB Output is correct
73 Correct 374 ms 32964 KB Output is correct
74 Correct 172 ms 25184 KB Output is correct
75 Correct 130 ms 24512 KB Output is correct
76 Correct 178 ms 25012 KB Output is correct
77 Correct 132 ms 24368 KB Output is correct
78 Correct 162 ms 24624 KB Output is correct
79 Correct 263 ms 32208 KB Output is correct
80 Correct 256 ms 31648 KB Output is correct
81 Correct 241 ms 31684 KB Output is correct
82 Correct 259 ms 32192 KB Output is correct
83 Correct 281 ms 31428 KB Output is correct
84 Correct 1 ms 4444 KB Output is correct
85 Correct 102 ms 24408 KB Output is correct