oj.uz

Submission #915441

# Submission time Handle Problem Language Result Execution time Memory
915441 2024-01-23T22:56:47 Z SalihSahin Osumnjičeni (COCI21_osumnjiceni) C++14
60 / 110
 1000 ms 69092 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){
        if(lazy[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(){
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);
    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);
    int go[n];
    bool flag = 1, inc;
    int r = 0;
    for(int l = 0; l < n; l++){
        inc = 0;
        while(r < n && flag && seg.query(1, 1, N, a[r].first, a[r].second) == 0){
            seg.update(1, 1, N, a[r].first, a[r].second, 1);
            inc = 1;
            r++;
        }

        if(!inc) flag = 0;
        go[l] = r;

        if(r < n && !(a[l].second < a[r].first || a[r].second < a[l].first)) flag = 1;
        seg.update(1, 1, N, a[l].first, a[l].second, -1);
    }

    int K = 18;
    int lift[K][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, ans;
    cin>>q;
    while(q--){
        int lq, rq;
        cin>>lq>>rq;
        lq--, rq--;

        ans = 1;

        for(int i = K-1; i >= 0; i--){
            if(lift[i][lq] <= rq){
                lq = lift[i][lq];
                ans += (1 << i);
            }
        }

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 65872 KB Output is correct
2 Correct 694 ms 65176 KB Output is correct
3 Correct 697 ms 65032 KB Output is correct
4 Correct 737 ms 65892 KB Output is correct
5 Correct 807 ms 68884 KB Output is correct
6 Correct 51 ms 17164 KB Output is correct
7 Correct 52 ms 17488 KB Output is correct
8 Correct 57 ms 17780 KB Output is correct
9 Correct 63 ms 18000 KB Output is correct
10 Correct 68 ms 17480 KB Output is correct
11 Correct 521 ms 67156 KB Output is correct
12 Correct 483 ms 63244 KB Output is correct
13 Correct 497 ms 63152 KB Output is correct
14 Correct 472 ms 67092 KB Output is correct
15 Correct 471 ms 65364 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 51 ms 18348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2128 KB Output is correct
2 Correct 16 ms 2136 KB Output is correct
3 Correct 19 ms 2144 KB Output is correct
4 Correct 16 ms 2136 KB Output is correct
5 Correct 16 ms 1884 KB Output is correct
6 Correct 10 ms 856 KB Output is correct
7 Correct 8 ms 860 KB Output is correct
8 Correct 8 ms 860 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 8 ms 984 KB Output is correct
11 Correct 13 ms 2140 KB Output is correct
12 Correct 17 ms 2292 KB Output is correct
13 Correct 12 ms 2004 KB Output is correct
14 Correct 14 ms 2392 KB Output is correct
15 Correct 13 ms 2136 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 8 ms 984 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2128 KB Output is correct
2 Correct 16 ms 2136 KB Output is correct
3 Correct 19 ms 2144 KB Output is correct
4 Correct 16 ms 2136 KB Output is correct
5 Correct 16 ms 1884 KB Output is correct
6 Correct 10 ms 856 KB Output is correct
7 Correct 8 ms 860 KB Output is correct
8 Correct 8 ms 860 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 8 ms 984 KB Output is correct
11 Correct 13 ms 2140 KB Output is correct
12 Correct 17 ms 2292 KB Output is correct
13 Correct 12 ms 2004 KB Output is correct
14 Correct 14 ms 2392 KB Output is correct
15 Correct 13 ms 2136 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 8 ms 984 KB Output is correct
18 Correct 275 ms 3964 KB Output is correct
19 Correct 247 ms 3764 KB Output is correct
20 Correct 273 ms 4124 KB Output is correct
21 Correct 260 ms 3952 KB Output is correct
22 Correct 279 ms 3844 KB Output is correct
23 Correct 250 ms 2644 KB Output is correct
24 Correct 255 ms 2824 KB Output is correct
25 Correct 263 ms 2936 KB Output is correct
26 Correct 252 ms 2732 KB Output is correct
27 Correct 246 ms 3020 KB Output is correct
28 Correct 247 ms 3852 KB Output is correct
29 Correct 250 ms 3512 KB Output is correct
30 Correct 277 ms 3680 KB Output is correct
31 Correct 247 ms 3608 KB Output is correct
32 Correct 238 ms 3508 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 249 ms 2648 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 865 ms 69092 KB Output is correct
2 Correct 861 ms 67368 KB Output is correct
3 Correct 800 ms 63076 KB Output is correct
4 Correct 775 ms 62324 KB Output is correct
5 Correct 780 ms 64336 KB Output is correct
6 Correct 54 ms 17236 KB Output is correct
7 Correct 53 ms 17208 KB Output is correct
8 Correct 63 ms 17488 KB Output is correct
9 Correct 60 ms 17232 KB Output is correct
10 Correct 79 ms 18380 KB Output is correct
11 Correct 495 ms 62544 KB Output is correct
12 Correct 677 ms 68996 KB Output is correct
13 Correct 556 ms 62732 KB Output is correct
14 Correct 520 ms 64336 KB Output is correct
15 Correct 573 ms 68160 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 49 ms 17588 KB Output is correct

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 65872 KB Output is correct
2 Correct 694 ms 65176 KB Output is correct
3 Correct 697 ms 65032 KB Output is correct
4 Correct 737 ms 65892 KB Output is correct
5 Correct 807 ms 68884 KB Output is correct
6 Correct 51 ms 17164 KB Output is correct
7 Correct 52 ms 17488 KB Output is correct
8 Correct 57 ms 17780 KB Output is correct
9 Correct 63 ms 18000 KB Output is correct
10 Correct 68 ms 17480 KB Output is correct
11 Correct 521 ms 67156 KB Output is correct
12 Correct 483 ms 63244 KB Output is correct
13 Correct 497 ms 63152 KB Output is correct
14 Correct 472 ms 67092 KB Output is correct
15 Correct 471 ms 65364 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 51 ms 18348 KB Output is correct
18 Correct 17 ms 2128 KB Output is correct
19 Correct 16 ms 2136 KB Output is correct
20 Correct 19 ms 2144 KB Output is correct
21 Correct 16 ms 2136 KB Output is correct
22 Correct 16 ms 1884 KB Output is correct
23 Correct 10 ms 856 KB Output is correct
24 Correct 8 ms 860 KB Output is correct
25 Correct 8 ms 860 KB Output is correct
26 Correct 8 ms 760 KB Output is correct
27 Correct 8 ms 984 KB Output is correct
28 Correct 13 ms 2140 KB Output is correct
29 Correct 17 ms 2292 KB Output is correct
30 Correct 12 ms 2004 KB Output is correct
31 Correct 14 ms 2392 KB Output is correct
32 Correct 13 ms 2136 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 8 ms 984 KB Output is correct
35 Correct 275 ms 3964 KB Output is correct
36 Correct 247 ms 3764 KB Output is correct
37 Correct 273 ms 4124 KB Output is correct
38 Correct 260 ms 3952 KB Output is correct
39 Correct 279 ms 3844 KB Output is correct
40 Correct 250 ms 2644 KB Output is correct
41 Correct 255 ms 2824 KB Output is correct
42 Correct 263 ms 2936 KB Output is correct
43 Correct 252 ms 2732 KB Output is correct
44 Correct 246 ms 3020 KB Output is correct
45 Correct 247 ms 3852 KB Output is correct
46 Correct 250 ms 3512 KB Output is correct
47 Correct 277 ms 3680 KB Output is correct
48 Correct 247 ms 3608 KB Output is correct
49 Correct 238 ms 3508 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 249 ms 2648 KB Output is correct
52 Correct 865 ms 69092 KB Output is correct
53 Correct 861 ms 67368 KB Output is correct
54 Correct 800 ms 63076 KB Output is correct
55 Correct 775 ms 62324 KB Output is correct
56 Correct 780 ms 64336 KB Output is correct
57 Correct 54 ms 17236 KB Output is correct
58 Correct 53 ms 17208 KB Output is correct
59 Correct 63 ms 17488 KB Output is correct
60 Correct 60 ms 17232 KB Output is correct
61 Correct 79 ms 18380 KB Output is correct
62 Correct 495 ms 62544 KB Output is correct
63 Correct 677 ms 68996 KB Output is correct
64 Correct 556 ms 62732 KB Output is correct
65 Correct 520 ms 64336 KB Output is correct
66 Correct 573 ms 68160 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 49 ms 17588 KB Output is correct
69 Execution timed out 1016 ms 66384 KB Time limit exceeded
70 Halted 0 ms 0 KB -