oj.uz

Submission #915411

# Submission time Handle Problem Language Result Execution time Memory
915411 2024-01-23T20:08:26 Z SalihSahin Osumnjičeni (COCI21_osumnjiceni) C++14
30 / 110
 1000 ms 52856 KB 
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
 
const int mod = 998244353;
const int N = 4e5 + 2;

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 == r){
            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]);
    }
    SEGT seg;
    seg.init(N);
    vector<int> go(n);
    int r = 0;
    bool inc = 0, flag = 1;
    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++;
        }
        go[l] = r;
        if(!inc && r < n && (a[l].second < a[r].first || a[l].first > a[r].second)){
            flag = 0;
        }
        if(inc || !(a[l].second < a[r].first || a[l].first > a[r].second)) flag = 1;
        
        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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 50840 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 14196 KB Output is correct
2 Correct 396 ms 14220 KB Output is correct
3 Correct 404 ms 14132 KB Output is correct
4 Correct 428 ms 14172 KB Output is correct
5 Correct 383 ms 14120 KB Output is correct
6 Correct 19 ms 13400 KB Output is correct
7 Correct 20 ms 13148 KB Output is correct
8 Correct 19 ms 13404 KB Output is correct
9 Correct 19 ms 13380 KB Output is correct
10 Correct 22 ms 13148 KB Output is correct
11 Correct 21 ms 14172 KB Output is correct
12 Correct 21 ms 14172 KB Output is correct
13 Correct 20 ms 14172 KB Output is correct
14 Correct 20 ms 14168 KB Output is correct
15 Correct 20 ms 14172 KB Output is correct
16 Correct 4 ms 12888 KB Output is correct
17 Correct 19 ms 13404 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 14196 KB Output is correct
2 Correct 396 ms 14220 KB Output is correct
3 Correct 404 ms 14132 KB Output is correct
4 Correct 428 ms 14172 KB Output is correct
5 Correct 383 ms 14120 KB Output is correct
6 Correct 19 ms 13400 KB Output is correct
7 Correct 20 ms 13148 KB Output is correct
8 Correct 19 ms 13404 KB Output is correct
9 Correct 19 ms 13380 KB Output is correct
10 Correct 22 ms 13148 KB Output is correct
11 Correct 21 ms 14172 KB Output is correct
12 Correct 21 ms 14172 KB Output is correct
13 Correct 20 ms 14172 KB Output is correct
14 Correct 20 ms 14168 KB Output is correct
15 Correct 20 ms 14172 KB Output is correct
16 Correct 4 ms 12888 KB Output is correct
17 Correct 19 ms 13404 KB Output is correct
18 Correct 739 ms 14932 KB Output is correct
19 Correct 691 ms 14992 KB Output is correct
20 Correct 761 ms 14968 KB Output is correct
21 Correct 688 ms 14980 KB Output is correct
22 Correct 691 ms 14868 KB Output is correct
23 Correct 334 ms 14008 KB Output is correct
24 Correct 329 ms 14264 KB Output is correct
25 Correct 350 ms 14000 KB Output is correct
26 Correct 329 ms 14164 KB Output is correct
27 Correct 334 ms 14256 KB Output is correct
28 Correct 315 ms 14676 KB Output is correct
29 Correct 325 ms 14500 KB Output is correct
30 Correct 326 ms 14576 KB Output is correct
31 Correct 309 ms 14476 KB Output is correct
32 Correct 306 ms 14672 KB Output is correct
33 Correct 4 ms 12892 KB Output is correct
34 Correct 311 ms 14200 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1056 ms 52856 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 50840 KB Time limit exceeded
2 Halted 0 ms 0 KB -