oj.uz

Submission #682673

# Submission time Handle Problem Language Result Execution time Memory
682673 2023-01-16T18:05:14 Z phoenix Segments (IZhO18_segments) C++17
22 / 100
 799 ms 5796 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 200000;
const int B = 1800;

void UGABUGA(bool f) {
    if(!f) {
 
    }
}

struct SQRT {
    struct obj {
        int key;
        int val;
        obj(int key, int val) : key(key), val(val) {}
    };
    bool equal(obj a, obj b) {
        return (a.key == b.key && a.val == b.val);
    }
    vector<obj> arr[N / B + 5];
    vector<int> st[N / B + 5];
    int sz = 0, b_num = 0;
    void add(int key, int val) {
        int block = 0;
        while(block < b_num - 1 && (arr[block].empty() || arr[block].back().key < key)) 
            block++;
        int pos_arr = 0, pos_st = 0;
        for(int i = 0; i < (int)arr[block].size(); i++) {
            if(arr[block][i].key < key) pos_arr++;
            if(st[block][i] < val) pos_st++;
        }
        if(!sz) b_num = 1;
        sz++;
        st[block].insert(st[block].begin() + pos_st, val);
        arr[block].insert(arr[block].begin() + pos_arr, obj(key, val));
    }
    void del(int key, int val) {
        int block = 0;
        while(block < b_num - 1 && (arr[block].empty() || arr[block].back().key < key)) 
            block++;
        int pos_arr = 0, pos_st = 0;
        for(int i = 0; i < (int)arr[block].size(); i++) {
            if(arr[block][i].key < key) pos_arr++;
            if(st[block][i] < val) pos_st++;
        }
        // assert(pos_arr < (int)arr[block].size() && equal(arr[block][pos_arr], obj(key, val)));
        assert(pos_arr < (int)arr[block].size());
        arr[block].erase(arr[block].begin() + pos_arr);
        // assert(pos_st < (int)st[block].size() && st[block][pos_st] == val);
        assert(pos_st < (int)st[block].size());
        st[block].erase(st[block].begin() + pos_st);
        sz--;
        if(!sz) b_num = 0;
    }
    int get(int k, int x) {
        int ans = 0;
        int block_p = b_num - 1;
        while(block_p >= 0 && (arr[block_p].empty() || arr[block_p].front().key >= k)) {
            int lb = -1, rb = arr[block_p].size();
            while(rb - lb > 1) {
                int m = (lb + rb) / 2;
                if(st[block_p][m] < x) lb = m;
                else rb = m;
            }
            ans += lb + 1;
            block_p--;
        }
        if(block_p < 0) return ans;
        int arr_p = arr[block_p].size() - 1;
        while(arr_p >= 0 && arr[block_p][arr_p].key >= k) {
            ans += (arr[block_p][arr_p].val < x);
            arr_p--;
        }
        return ans;
    }
    void normalize() {
        vector<obj> v;
        for(int i = 0; i < b_num; i++) {
            for(obj x : arr[i]) 
                v.push_back(x);
        }
        for(int i = 0; i < sz; i++) {
            if(i % B == 0 && !arr[i / B].empty()) {
                arr[i / B].clear();
                st[i / B].clear();
            }
            arr[i / B].push_back(v[i]);
            st[i / B].push_back(v[i].val);
        }
        b_num = (sz - 1) / B + 1;
        for(int i = 0; i < b_num; i++) 
            sort(st[i].begin(), st[i].end());
    }
};

SQRT ll, rr;
int lastans;

vector<pair<int, int>> v;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    v.push_back({-1, -1});

    int n, t;
    cin >> n >> t;
    for(int iter = 1; iter <= n; iter++) {
        int type;
        cin >> type;
        if(type == 1) {
            int l, r;
            cin >> l >> r;
            l = (l ^ (t * lastans));
            r = (r ^ (t * lastans));
            if(l > r) swap(l, r);
            v.push_back({l, r});
            int len = r - l + 1;
            ll.add(len, l);
            rr.add(len, r);
        }
        if(type == 2) {
            int id;
            cin >> id;
            ll.del(v[id].second - v[id].first + 1, v[id].first);
            rr.del(v[id].second - v[id].first + 1, v[id].second);
        }
        if(type == 3) {
            int l, r, k;
            cin >> l >> r >> k;
            l = (l ^ (t * lastans));
            r = (r ^ (t * lastans));
            if(l > r) swap(l, r);
            lastans = 0;
            if(r - l + 1 < k) {
                cout << 0 << '\n';
                continue;
            }
            lastans = ll.get(k, r - k + 2) - rr.get(k, l + k - 1);
            cout << lastans << '\n';
        }
        if(iter % B == 0) {
            ll.normalize();
            rr.normalize();
        }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 20 ms 636 KB Output is correct
6 Correct 19 ms 504 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 19 ms 472 KB Output is correct
9 Correct 19 ms 508 KB Output is correct
10 Correct 25 ms 504 KB Output is correct
11 Correct 14 ms 504 KB Output is correct
12 Correct 14 ms 528 KB Output is correct
13 Correct 30 ms 588 KB Output is correct
14 Correct 18 ms 456 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 16 ms 460 KB Output is correct
18 Correct 21 ms 556 KB Output is correct
19 Correct 13 ms 340 KB Output is correct
20 Correct 14 ms 440 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 689 ms 3576 KB Output is correct
2 Correct 667 ms 3540 KB Output is correct
3 Correct 681 ms 3644 KB Output is correct
4 Correct 736 ms 3744 KB Output is correct
5 Correct 781 ms 5652 KB Output is correct
6 Correct 761 ms 5796 KB Output is correct
7 Correct 698 ms 3540 KB Output is correct
8 Correct 668 ms 3632 KB Output is correct
9 Correct 676 ms 3692 KB Output is correct
10 Correct 425 ms 2148 KB Output is correct
11 Correct 487 ms 2472 KB Output is correct
12 Correct 776 ms 4860 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1076 KB Output is correct
2 Correct 40 ms 1016 KB Output is correct
3 Correct 86 ms 1016 KB Output is correct
4 Correct 44 ms 984 KB Output is correct
5 Correct 785 ms 4840 KB Output is correct
6 Correct 711 ms 4188 KB Output is correct
7 Correct 741 ms 4600 KB Output is correct
8 Correct 749 ms 5720 KB Output is correct
9 Correct 754 ms 5516 KB Output is correct
10 Incorrect 705 ms 4044 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 988 KB Output is correct
2 Correct 45 ms 1052 KB Output is correct
3 Correct 44 ms 1008 KB Output is correct
4 Correct 53 ms 1048 KB Output is correct
5 Correct 786 ms 5172 KB Output is correct
6 Correct 345 ms 1768 KB Output is correct
7 Correct 799 ms 5508 KB Output is correct
8 Correct 420 ms 2244 KB Output is correct
9 Incorrect 585 ms 2964 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 20 ms 636 KB Output is correct
6 Correct 19 ms 504 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 19 ms 472 KB Output is correct
9 Correct 19 ms 508 KB Output is correct
10 Correct 25 ms 504 KB Output is correct
11 Correct 14 ms 504 KB Output is correct
12 Correct 14 ms 528 KB Output is correct
13 Correct 30 ms 588 KB Output is correct
14 Correct 18 ms 456 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 16 ms 460 KB Output is correct
18 Correct 21 ms 556 KB Output is correct
19 Correct 13 ms 340 KB Output is correct
20 Correct 14 ms 440 KB Output is correct
21 Correct 689 ms 3576 KB Output is correct
22 Correct 667 ms 3540 KB Output is correct
23 Correct 681 ms 3644 KB Output is correct
24 Correct 736 ms 3744 KB Output is correct
25 Correct 781 ms 5652 KB Output is correct
26 Correct 761 ms 5796 KB Output is correct
27 Correct 698 ms 3540 KB Output is correct
28 Correct 668 ms 3632 KB Output is correct
29 Correct 676 ms 3692 KB Output is correct
30 Correct 425 ms 2148 KB Output is correct
31 Correct 487 ms 2472 KB Output is correct
32 Correct 776 ms 4860 KB Output is correct
33 Correct 42 ms 988 KB Output is correct
34 Correct 45 ms 1052 KB Output is correct
35 Correct 44 ms 1008 KB Output is correct
36 Correct 53 ms 1048 KB Output is correct
37 Correct 786 ms 5172 KB Output is correct
38 Correct 345 ms 1768 KB Output is correct
39 Correct 799 ms 5508 KB Output is correct
40 Correct 420 ms 2244 KB Output is correct
41 Incorrect 585 ms 2964 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 20 ms 636 KB Output is correct
6 Correct 19 ms 504 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 19 ms 472 KB Output is correct
9 Correct 19 ms 508 KB Output is correct
10 Correct 25 ms 504 KB Output is correct
11 Correct 14 ms 504 KB Output is correct
12 Correct 14 ms 528 KB Output is correct
13 Correct 30 ms 588 KB Output is correct
14 Correct 18 ms 456 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 16 ms 460 KB Output is correct
18 Correct 21 ms 556 KB Output is correct
19 Correct 13 ms 340 KB Output is correct
20 Correct 14 ms 440 KB Output is correct
21 Correct 689 ms 3576 KB Output is correct
22 Correct 667 ms 3540 KB Output is correct
23 Correct 681 ms 3644 KB Output is correct
24 Correct 736 ms 3744 KB Output is correct
25 Correct 781 ms 5652 KB Output is correct
26 Correct 761 ms 5796 KB Output is correct
27 Correct 698 ms 3540 KB Output is correct
28 Correct 668 ms 3632 KB Output is correct
29 Correct 676 ms 3692 KB Output is correct
30 Correct 425 ms 2148 KB Output is correct
31 Correct 487 ms 2472 KB Output is correct
32 Correct 776 ms 4860 KB Output is correct
33 Correct 57 ms 1076 KB Output is correct
34 Correct 40 ms 1016 KB Output is correct
35 Correct 86 ms 1016 KB Output is correct
36 Correct 44 ms 984 KB Output is correct
37 Correct 785 ms 4840 KB Output is correct
38 Correct 711 ms 4188 KB Output is correct
39 Correct 741 ms 4600 KB Output is correct
40 Correct 749 ms 5720 KB Output is correct
41 Correct 754 ms 5516 KB Output is correct
42 Incorrect 705 ms 4044 KB Output isn't correct
43 Halted 0 ms 0 KB -