oj.uz

Submission #915435

# Submission time Handle Problem Language Result Execution time Memory
915435 2024-01-23T22:47:39 Z SalihSahin Osumnjičeni (COCI21_osumnjiceni) C++14
60 / 110
 1000 ms 71248 KB 
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
 
const int mod = 998244353;

struct SEGT{
    vector<int> tree, lazy;

    void init(int n){
        tree.assign(4*n, 0);
        lazy.assign(4*n, 0);
    }

    void push(int ind){
        tree[ind*2] += lazy[ind];
        tree[ind*2+1] += lazy[ind];
        lazy[ind*2] += lazy[ind];
        lazy[ind*2+1] += lazy[ind];
        lazy[ind] = 0;
    }

    void update(int ind, int l, int r, int ql, int qr, int val){
        if(l > r || l > qr || r < ql) return;
        if(l >= ql && r <= qr){
            tree[ind] += val;
            lazy[ind] += val;
        }
        else{
            push(ind);
            int m = (l + r)/2;

            update(ind*2, l, m, ql, qr, val);
            update(ind*2+1, m+1, r, ql, qr, val);
            tree[ind] = max(tree[ind*2], tree[ind*2+1]);
        }
    }

    int query(int ind, int l, int r, int ql, int qr){
        if(l > r || l > qr || r < ql) return 0;
        if(l >= ql && r <= qr) return tree[ind];
        else{
            push(ind);
            int m = (l + r)/2;

            return max(query(ind*2, l, m, ql, qr),  query(ind*2+1, m+1, r, ql, qr));
        }
    }
};

int main(){
    int n;
    cin>>n;
    vector<pair<int, int> > a(n);
    set<int> ste;

    for(int i = 0; i < n; i++){
        int l, r;
        cin>>l>>r;
        ste.insert(l);
        ste.insert(r);
        a[i] = mp(l, r);
    }
    map<int, int> conv;
    int val = 1;
    for(auto itr: ste){
        conv[itr] = val;
        val++;
    }
    for(int i = 0; i < n; i++){
        a[i] = mp(conv[a[i].first], conv[a[i].second]);
    }
    int N = val + 5;
    
    SEGT seg;
    seg.init(N);
    vector<int> go(n);
    int r = 0;
    for(int l = 0; l < n; l++){
        while(r < n && seg.query(1, 1, N, a[r].first, a[r].second) == 0){
            seg.update(1, 1, N, a[r].first, a[r].second, 1);
            r++;
        }
        go[l] = r;

        seg.update(1, 1, N, a[l].first, a[l].second, -1);
    }
    int K = 18;

    vector<vector<int> > lift(K, vector<int>(n+1));
    for(int i = 0; i < n; i++){
        lift[0][i] = go[i];
    }
    lift[0][n] = n;

    for(int i = 1; i < K; i++){
        for(int j = 0; j <= n; j++){
            lift[i][j] = lift[i-1][lift[i-1][j]];
        }
    }

    int q;
    cin>>q;
    while(q--){
        int l, r;
        cin>>l>>r;
        int ans = 1;
        l--, r--;
        
        for(int i = K-1; i >= 0; i--){
            if(lift[i][l] <= r){
                l = lift[i][l];
                ans += (1 << i);
            }
        }

        cout<<ans<<endl;
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 873 ms 64820 KB Output is correct
2 Correct 775 ms 67288 KB Output is correct
3 Correct 851 ms 67668 KB Output is correct
4 Correct 816 ms 68300 KB Output is correct
5 Correct 930 ms 71248 KB Output is correct
6 Correct 115 ms 19372 KB Output is correct
7 Correct 168 ms 19768 KB Output is correct
8 Correct 128 ms 20056 KB Output is correct
9 Correct 130 ms 20560 KB Output is correct
10 Correct 141 ms 19772 KB Output is correct
11 Correct 567 ms 69276 KB Output is correct
12 Correct 556 ms 65236 KB Output is correct
13 Correct 520 ms 65108 KB Output is correct
14 Correct 608 ms 69284 KB Output is correct
15 Correct 552 ms 67412 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 127 ms 20868 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1884 KB Output is correct
2 Correct 19 ms 2140 KB Output is correct
3 Correct 19 ms 2132 KB Output is correct
4 Correct 22 ms 2140 KB Output is correct
5 Correct 21 ms 2140 KB Output is correct
6 Correct 13 ms 860 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 11 ms 860 KB Output is correct
9 Correct 12 ms 884 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 15 ms 2136 KB Output is correct
12 Correct 15 ms 1884 KB Output is correct
13 Correct 15 ms 2144 KB Output is correct
14 Correct 16 ms 2140 KB Output is correct
15 Correct 17 ms 2140 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 11 ms 828 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1884 KB Output is correct
2 Correct 19 ms 2140 KB Output is correct
3 Correct 19 ms 2132 KB Output is correct
4 Correct 22 ms 2140 KB Output is correct
5 Correct 21 ms 2140 KB Output is correct
6 Correct 13 ms 860 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 11 ms 860 KB Output is correct
9 Correct 12 ms 884 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 15 ms 2136 KB Output is correct
12 Correct 15 ms 1884 KB Output is correct
13 Correct 15 ms 2144 KB Output is correct
14 Correct 16 ms 2140 KB Output is correct
15 Correct 17 ms 2140 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 11 ms 828 KB Output is correct
18 Correct 342 ms 4860 KB Output is correct
19 Correct 305 ms 4488 KB Output is correct
20 Correct 342 ms 5116 KB Output is correct
21 Correct 309 ms 4456 KB Output is correct
22 Correct 358 ms 4716 KB Output is correct
23 Correct 296 ms 3412 KB Output is correct
24 Correct 325 ms 3924 KB Output is correct
25 Correct 331 ms 3524 KB Output is correct
26 Correct 324 ms 3668 KB Output is correct
27 Correct 306 ms 3156 KB Output is correct
28 Correct 289 ms 4176 KB Output is correct
29 Correct 309 ms 4204 KB Output is correct
30 Correct 309 ms 4264 KB Output is correct
31 Correct 302 ms 4052 KB Output is correct
32 Correct 322 ms 4176 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 304 ms 3096 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 953 ms 67488 KB Output is correct
2 Correct 996 ms 70116 KB Output is correct
3 Correct 884 ms 65352 KB Output is correct
4 Correct 831 ms 64524 KB Output is correct
5 Correct 929 ms 66624 KB Output is correct
6 Correct 125 ms 19884 KB Output is correct
7 Correct 121 ms 19488 KB Output is correct
8 Correct 123 ms 19512 KB Output is correct
9 Correct 134 ms 19492 KB Output is correct
10 Correct 160 ms 21016 KB Output is correct
11 Correct 683 ms 64300 KB Output is correct
12 Correct 833 ms 68132 KB Output is correct
13 Correct 606 ms 64528 KB Output is correct
14 Correct 750 ms 66460 KB Output is correct
15 Correct 783 ms 70432 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 126 ms 19780 KB Output is correct

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 873 ms 64820 KB Output is correct
2 Correct 775 ms 67288 KB Output is correct
3 Correct 851 ms 67668 KB Output is correct
4 Correct 816 ms 68300 KB Output is correct
5 Correct 930 ms 71248 KB Output is correct
6 Correct 115 ms 19372 KB Output is correct
7 Correct 168 ms 19768 KB Output is correct
8 Correct 128 ms 20056 KB Output is correct
9 Correct 130 ms 20560 KB Output is correct
10 Correct 141 ms 19772 KB Output is correct
11 Correct 567 ms 69276 KB Output is correct
12 Correct 556 ms 65236 KB Output is correct
13 Correct 520 ms 65108 KB Output is correct
14 Correct 608 ms 69284 KB Output is correct
15 Correct 552 ms 67412 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 127 ms 20868 KB Output is correct
18 Correct 20 ms 1884 KB Output is correct
19 Correct 19 ms 2140 KB Output is correct
20 Correct 19 ms 2132 KB Output is correct
21 Correct 22 ms 2140 KB Output is correct
22 Correct 21 ms 2140 KB Output is correct
23 Correct 13 ms 860 KB Output is correct
24 Correct 11 ms 860 KB Output is correct
25 Correct 11 ms 860 KB Output is correct
26 Correct 12 ms 884 KB Output is correct
27 Correct 11 ms 860 KB Output is correct
28 Correct 15 ms 2136 KB Output is correct
29 Correct 15 ms 1884 KB Output is correct
30 Correct 15 ms 2144 KB Output is correct
31 Correct 16 ms 2140 KB Output is correct
32 Correct 17 ms 2140 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 11 ms 828 KB Output is correct
35 Correct 342 ms 4860 KB Output is correct
36 Correct 305 ms 4488 KB Output is correct
37 Correct 342 ms 5116 KB Output is correct
38 Correct 309 ms 4456 KB Output is correct
39 Correct 358 ms 4716 KB Output is correct
40 Correct 296 ms 3412 KB Output is correct
41 Correct 325 ms 3924 KB Output is correct
42 Correct 331 ms 3524 KB Output is correct
43 Correct 324 ms 3668 KB Output is correct
44 Correct 306 ms 3156 KB Output is correct
45 Correct 289 ms 4176 KB Output is correct
46 Correct 309 ms 4204 KB Output is correct
47 Correct 309 ms 4264 KB Output is correct
48 Correct 302 ms 4052 KB Output is correct
49 Correct 322 ms 4176 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 304 ms 3096 KB Output is correct
52 Correct 953 ms 67488 KB Output is correct
53 Correct 996 ms 70116 KB Output is correct
54 Correct 884 ms 65352 KB Output is correct
55 Correct 831 ms 64524 KB Output is correct
56 Correct 929 ms 66624 KB Output is correct
57 Correct 125 ms 19884 KB Output is correct
58 Correct 121 ms 19488 KB Output is correct
59 Correct 123 ms 19512 KB Output is correct
60 Correct 134 ms 19492 KB Output is correct
61 Correct 160 ms 21016 KB Output is correct
62 Correct 683 ms 64300 KB Output is correct
63 Correct 833 ms 68132 KB Output is correct
64 Correct 606 ms 64528 KB Output is correct
65 Correct 750 ms 66460 KB Output is correct
66 Correct 783 ms 70432 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 126 ms 19780 KB Output is correct
69 Execution timed out 1073 ms 67156 KB Time limit exceeded
70 Halted 0 ms 0 KB -