oj.uz

Submission #915409

# Submission time Handle Problem Language Result Execution time Memory
915409 2024-01-23T20:03:35 Z SalihSahin Osumnjičeni (COCI21_osumnjiceni) C++17
30 / 110
 1000 ms 76112 KB 
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
using namespace std;
 
const int mod = 998244353;
const int N = 4e5 + 5;
const int inf = 1e17*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));
        }
    }
};

int32_t 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;
    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
0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 27320 KB Output is correct
2 Correct 398 ms 27240 KB Output is correct
3 Correct 426 ms 27252 KB Output is correct
4 Correct 425 ms 27472 KB Output is correct
5 Correct 401 ms 27396 KB Output is correct
6 Correct 20 ms 26460 KB Output is correct
7 Correct 23 ms 26452 KB Output is correct
8 Correct 20 ms 26460 KB Output is correct
9 Correct 21 ms 26456 KB Output is correct
10 Correct 20 ms 26240 KB Output is correct
11 Correct 23 ms 27480 KB Output is correct
12 Correct 23 ms 27228 KB Output is correct
13 Correct 26 ms 27228 KB Output is correct
14 Correct 26 ms 27480 KB Output is correct
15 Correct 24 ms 27304 KB Output is correct
16 Correct 6 ms 25432 KB Output is correct
17 Correct 20 ms 26460 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 27320 KB Output is correct
2 Correct 398 ms 27240 KB Output is correct
3 Correct 426 ms 27252 KB Output is correct
4 Correct 425 ms 27472 KB Output is correct
5 Correct 401 ms 27396 KB Output is correct
6 Correct 20 ms 26460 KB Output is correct
7 Correct 23 ms 26452 KB Output is correct
8 Correct 20 ms 26460 KB Output is correct
9 Correct 21 ms 26456 KB Output is correct
10 Correct 20 ms 26240 KB Output is correct
11 Correct 23 ms 27480 KB Output is correct
12 Correct 23 ms 27228 KB Output is correct
13 Correct 26 ms 27228 KB Output is correct
14 Correct 26 ms 27480 KB Output is correct
15 Correct 24 ms 27304 KB Output is correct
16 Correct 6 ms 25432 KB Output is correct
17 Correct 20 ms 26460 KB Output is correct
18 Correct 766 ms 30220 KB Output is correct
19 Correct 683 ms 29780 KB Output is correct
20 Correct 761 ms 30248 KB Output is correct
21 Correct 712 ms 29676 KB Output is correct
22 Correct 686 ms 29780 KB Output is correct
23 Correct 317 ms 28876 KB Output is correct
24 Correct 323 ms 28832 KB Output is correct
25 Correct 347 ms 29264 KB Output is correct
26 Correct 323 ms 28980 KB Output is correct
27 Correct 315 ms 28800 KB Output is correct
28 Correct 310 ms 29496 KB Output is correct
29 Correct 320 ms 29748 KB Output is correct
30 Correct 320 ms 29576 KB Output is correct
31 Correct 315 ms 29432 KB Output is correct
32 Correct 304 ms 29520 KB Output is correct
33 Correct 7 ms 25432 KB Output is correct
34 Correct 311 ms 28736 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1014 ms 76112 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 1060 ms 73820 KB Time limit exceeded
2 Halted 0 ms 0 KB -