oj.uz

Submission #171511

# Submission time Handle Problem Language Result Execution time Memory
171511 2019-12-28T21:39:33 Z theboatman Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 11808 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int block_size = int(800);
const int inf = int(1e9) + 10;

struct Query {
    int type, a, b, k, id;
};

struct Seg {
    int l, r, id;
};

bool cmp_len(Seg a, Seg b) {
    return (a.r - a.l) < (b.r - b.l);
}

bool cmp_first(Seg a, Seg b) {
    return a.r > b.r;
}

bool cmp_second(Seg a, Seg b) {
    return a.l < b.l;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    int q, t;
    cin >> q >> t;

    int last_ans = 0, id = 1;
    vector <Seg> seg;
    for(int iq = 0; iq < q; iq++) {
        vector <Query> que;

        for(int i = 0; i < block_size && iq < q; i++, iq++) {
            int type;
            cin >> type;

            if (type == 1) {
                int a, b;
                cin >> a >> b;

                que.push_back({type, a, b, -1, id});
                id++;
            }

            if (type == 2) {
                int id;
                cin >> id;

                que.push_back({type, -1, -1, -1, id});
            }

            if (type == 3) {
                int a, b, k;
                cin >> a >> b >> k;

                que.push_back({type, a, b, k, -1});
            }
        }
        iq--;

        vector <int> del(q + 1);
        for(auto i : que) {
            if (i.type == 2) {
                del[i.id] = 1;
            }
        }

        vector <Seg> cur_seg, active;
        for(auto i : seg) {
            if (!del[i.id]) {
                cur_seg.push_back(i);
            }
            else {
                active.push_back(i);
            }
        }

        sort(cur_seg.begin(), cur_seg.end(), cmp_len);

        vector <int> mn_l, mx_l, mn_sz, mx_sz;
        vector <vector <Seg> > first, second;
        int n = sqrt(seg.size()) + 1;

        for(int i = 0; i < cur_seg.size(); i++) {
            vector <Seg> cur;
            for(int it = 0; it < n && i < cur_seg.size(); it++, i++) {
                cur.push_back(cur_seg[i]);
            }
            i--;

            int mn = inf, mx = -inf;
            int mn1 = inf, mx1 = -inf;
            for(auto it : cur) {
                mn = min(mn, it.l);
                mx = max(mx, it.l);

                mn1 = min(mn1, it.r - it.l + 1);
                mx1 = max(mx1, it.r - it.l + 1);
            }

            sort(cur.begin(), cur.end(), cmp_first);
            first.push_back(cur);

            sort(cur.begin(), cur.end(), cmp_second);
            second.push_back(cur);

            mn_l.push_back(mn);
            mx_l.push_back(mx);

            mx_sz.push_back(mx1);
            mn_sz.push_back(mn1);
        }

        del.assign(q + 1, 0);
        for(auto it : que) {
            if (it.type == 1) {
                int l = it.a ^ (last_ans * t), r = it.b ^ (last_ans * t);

                if (l > r) {
                    swap(l, r);
                }

                active.push_back({l, r, it.id});
            }

            if (it.type == 2) {
                del[it.id] = 1;
            }

            if (it.type == 3) {
                int l = it.a ^ (last_ans * t), r = it.b ^ (last_ans * t), k = it.k;

                if (l > r) {
                    swap(l, r);
                }

                int ans = 0;
                for(auto i : active) {
                    if (!del[i.id]) {
                        if (min(r, i.r) - max(l, i.l) + 1 >= k) {
                            ans++;
                        }
                    }
                }

                for(int x = 0; x < first.size(); x++) {
                    if (mx_sz[x] < k) {
                        continue;
                    }

                    if (mn_sz[x] < k && mx_sz[x] >= k) {
                        for(auto i : first[x]) {
                            if (i.r - i.l + 1 >= k && min(r, i.r) - max(l, i.l) + 1 >= k) {
                                ans++;
                            }
                        }
                        continue;
                    }

                    if (mx_l[x] <= l) {
                        int tl = 0, tr = first[x].size();
                        while(tl < tr) {
                            int c = tl + tr >> 1;

                            if (first[x][c].r - l + 1 >= k) {
                                tl = c + 1;
                            }
                            else {
                                tr = c;
                            }
                        }

                        ans += tl;
                        continue;
                    }

                    if (mn_l[x] > l) {
                        int tl = 0, tr = second[x].size();
                        while(tl < tr) {
                            int c = tl + tr >> 1;

                            if (r - second[x][c].l + 1 >= k) {
                                tl = c + 1;
                            }
                            else {
                                tr = c;
                            }
                        }

                        ans += tl;
                        continue;
                    }

                    for(auto i : first[x]) {
                        if (min(r, i.r) - max(l, i.l) + 1 >= k) {
                            ans++;
                        }
                    }

                }

                cout << ans << "\n";
                last_ans = ans;
            }
        }

        for(auto i : active) {
            if (!del[i.id]) {
                cur_seg.push_back(i);
            }
        }

        seg = cur_seg;
    }

    return 0;
}
/*
*/

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:93:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < cur_seg.size(); i++) {
                        ~~^~~~~~~~~~~~~~~~
segments.cpp:95:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int it = 0; it < n && i < cur_seg.size(); it++, i++) {
                                       ~~^~~~~~~~~~~~~~~~
segments.cpp:155:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int x = 0; x < first.size(); x++) {
                                ~~^~~~~~~~~~~~~~
segments.cpp:172:40: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                             int c = tl + tr >> 1;
                                     ~~~^~~~
segments.cpp:189:40: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                             int c = tl + tr >> 1;
                                     ~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 416 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 12 ms 892 KB Output is correct
6 Correct 12 ms 760 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 9 ms 660 KB Output is correct
9 Correct 9 ms 504 KB Output is correct
10 Correct 8 ms 772 KB Output is correct
11 Correct 14 ms 632 KB Output is correct
12 Correct 14 ms 700 KB Output is correct
13 Correct 8 ms 660 KB Output is correct
14 Correct 9 ms 632 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 8 ms 656 KB Output is correct
18 Correct 9 ms 760 KB Output is correct
19 Correct 8 ms 632 KB Output is correct
20 Correct 8 ms 632 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3368 ms 4920 KB Output is correct
2 Correct 3400 ms 4996 KB Output is correct
3 Correct 3414 ms 5160 KB Output is correct
4 Correct 3414 ms 5240 KB Output is correct
5 Correct 2169 ms 8396 KB Output is correct
6 Correct 1970 ms 8568 KB Output is correct
7 Correct 3397 ms 5136 KB Output is correct
8 Correct 3393 ms 5124 KB Output is correct
9 Correct 3403 ms 4788 KB Output is correct
10 Correct 2039 ms 2952 KB Output is correct
11 Correct 2571 ms 3248 KB Output is correct
12 Correct 3293 ms 7692 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1096 KB Output is correct
2 Correct 65 ms 1248 KB Output is correct
3 Correct 91 ms 992 KB Output is correct
4 Correct 66 ms 1236 KB Output is correct
5 Correct 4437 ms 7192 KB Output is correct
6 Correct 4827 ms 5576 KB Output is correct
7 Correct 4676 ms 5624 KB Output is correct
8 Correct 2480 ms 8096 KB Output is correct
9 Correct 2169 ms 7916 KB Output is correct
10 Correct 2660 ms 5780 KB Output is correct
11 Correct 338 ms 1676 KB Output is correct
12 Correct 2671 ms 6052 KB Output is correct
13 Correct 2318 ms 5184 KB Output is correct
14 Correct 1610 ms 3624 KB Output is correct
15 Correct 1438 ms 3948 KB Output is correct
16 Correct 1010 ms 3192 KB Output is correct
17 Correct 4855 ms 6328 KB Output is correct
18 Correct 4848 ms 6072 KB Output is correct
19 Correct 4859 ms 5916 KB Output is correct
20 Correct 4871 ms 6308 KB Output is correct
21 Correct 473 ms 2776 KB Output is correct
22 Correct 2241 ms 5884 KB Output is correct
23 Correct 2538 ms 6404 KB Output is correct
24 Correct 2342 ms 5536 KB Output is correct
25 Correct 78 ms 2660 KB Output is correct
26 Correct 68 ms 2752 KB Output is correct
27 Correct 76 ms 2712 KB Output is correct
28 Correct 71 ms 2756 KB Output is correct
29 Correct 2579 ms 7068 KB Output is correct
30 Correct 2659 ms 6780 KB Output is correct
31 Correct 2185 ms 9820 KB Output is correct
32 Correct 2667 ms 7180 KB Output is correct
33 Correct 2346 ms 7208 KB Output is correct
34 Correct 1390 ms 4884 KB Output is correct
35 Correct 2179 ms 6320 KB Output is correct
36 Correct 2346 ms 7604 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 1120 KB Output is correct
2 Correct 96 ms 1256 KB Output is correct
3 Correct 77 ms 1248 KB Output is correct
4 Correct 72 ms 1252 KB Output is correct
5 Correct 3094 ms 7656 KB Output is correct
6 Correct 1529 ms 2492 KB Output is correct
7 Correct 2796 ms 8036 KB Output is correct
8 Correct 2123 ms 3424 KB Output is correct
9 Correct 1700 ms 4296 KB Output is correct
10 Correct 2285 ms 7152 KB Output is correct
11 Correct 775 ms 2348 KB Output is correct
12 Correct 1873 ms 8356 KB Output is correct
13 Correct 2185 ms 6028 KB Output is correct
14 Correct 1555 ms 3208 KB Output is correct
15 Correct 2023 ms 8076 KB Output is correct
16 Correct 2200 ms 5964 KB Output is correct
17 Correct 3399 ms 5636 KB Output is correct
18 Correct 3413 ms 5012 KB Output is correct
19 Correct 3406 ms 5944 KB Output is correct
20 Correct 3383 ms 5664 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 416 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 12 ms 892 KB Output is correct
6 Correct 12 ms 760 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 9 ms 660 KB Output is correct
9 Correct 9 ms 504 KB Output is correct
10 Correct 8 ms 772 KB Output is correct
11 Correct 14 ms 632 KB Output is correct
12 Correct 14 ms 700 KB Output is correct
13 Correct 8 ms 660 KB Output is correct
14 Correct 9 ms 632 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 8 ms 656 KB Output is correct
18 Correct 9 ms 760 KB Output is correct
19 Correct 8 ms 632 KB Output is correct
20 Correct 8 ms 632 KB Output is correct
21 Correct 3368 ms 4920 KB Output is correct
22 Correct 3400 ms 4996 KB Output is correct
23 Correct 3414 ms 5160 KB Output is correct
24 Correct 3414 ms 5240 KB Output is correct
25 Correct 2169 ms 8396 KB Output is correct
26 Correct 1970 ms 8568 KB Output is correct
27 Correct 3397 ms 5136 KB Output is correct
28 Correct 3393 ms 5124 KB Output is correct
29 Correct 3403 ms 4788 KB Output is correct
30 Correct 2039 ms 2952 KB Output is correct
31 Correct 2571 ms 3248 KB Output is correct
32 Correct 3293 ms 7692 KB Output is correct
33 Correct 68 ms 1120 KB Output is correct
34 Correct 96 ms 1256 KB Output is correct
35 Correct 77 ms 1248 KB Output is correct
36 Correct 72 ms 1252 KB Output is correct
37 Correct 3094 ms 7656 KB Output is correct
38 Correct 1529 ms 2492 KB Output is correct
39 Correct 2796 ms 8036 KB Output is correct
40 Correct 2123 ms 3424 KB Output is correct
41 Correct 1700 ms 4296 KB Output is correct
42 Correct 2285 ms 7152 KB Output is correct
43 Correct 775 ms 2348 KB Output is correct
44 Correct 1873 ms 8356 KB Output is correct
45 Correct 2185 ms 6028 KB Output is correct
46 Correct 1555 ms 3208 KB Output is correct
47 Correct 2023 ms 8076 KB Output is correct
48 Correct 2200 ms 5964 KB Output is correct
49 Correct 3399 ms 5636 KB Output is correct
50 Correct 3413 ms 5012 KB Output is correct
51 Correct 3406 ms 5944 KB Output is correct
52 Correct 3383 ms 5664 KB Output is correct
53 Correct 73 ms 2900 KB Output is correct
54 Correct 73 ms 1632 KB Output is correct
55 Correct 68 ms 2912 KB Output is correct
56 Correct 68 ms 2148 KB Output is correct
57 Correct 2824 ms 3536 KB Output is correct
58 Correct 1077 ms 2900 KB Output is correct
59 Correct 3422 ms 6300 KB Output is correct
60 Correct 924 ms 2564 KB Output is correct
61 Correct 2213 ms 7084 KB Output is correct
62 Correct 2109 ms 8584 KB Output is correct
63 Correct 1919 ms 7980 KB Output is correct
64 Correct 2117 ms 7708 KB Output is correct
65 Correct 1041 ms 2628 KB Output is correct
66 Correct 843 ms 3128 KB Output is correct
67 Correct 2150 ms 6336 KB Output is correct
68 Correct 2016 ms 6360 KB Output is correct
69 Correct 3403 ms 6680 KB Output is correct
70 Correct 3402 ms 6416 KB Output is correct
71 Correct 3393 ms 5804 KB Output is correct
72 Correct 3394 ms 6296 KB Output is correct
73 Correct 1284 ms 3464 KB Output is correct
74 Correct 2023 ms 6384 KB Output is correct
75 Correct 1819 ms 10220 KB Output is correct
76 Correct 1921 ms 10140 KB Output is correct
77 Correct 71 ms 2916 KB Output is correct
78 Correct 68 ms 2948 KB Output is correct
79 Correct 74 ms 2916 KB Output is correct
80 Correct 69 ms 3040 KB Output is correct
81 Correct 1956 ms 6740 KB Output is correct
82 Correct 1268 ms 4316 KB Output is correct
83 Correct 720 ms 3608 KB Output is correct
84 Correct 2025 ms 6352 KB Output is correct
85 Correct 2182 ms 6868 KB Output is correct
86 Correct 2234 ms 8572 KB Output is correct
87 Correct 1691 ms 5504 KB Output is correct
88 Correct 746 ms 4100 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 416 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 12 ms 892 KB Output is correct
6 Correct 12 ms 760 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 9 ms 660 KB Output is correct
9 Correct 9 ms 504 KB Output is correct
10 Correct 8 ms 772 KB Output is correct
11 Correct 14 ms 632 KB Output is correct
12 Correct 14 ms 700 KB Output is correct
13 Correct 8 ms 660 KB Output is correct
14 Correct 9 ms 632 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 8 ms 656 KB Output is correct
18 Correct 9 ms 760 KB Output is correct
19 Correct 8 ms 632 KB Output is correct
20 Correct 8 ms 632 KB Output is correct
21 Correct 3368 ms 4920 KB Output is correct
22 Correct 3400 ms 4996 KB Output is correct
23 Correct 3414 ms 5160 KB Output is correct
24 Correct 3414 ms 5240 KB Output is correct
25 Correct 2169 ms 8396 KB Output is correct
26 Correct 1970 ms 8568 KB Output is correct
27 Correct 3397 ms 5136 KB Output is correct
28 Correct 3393 ms 5124 KB Output is correct
29 Correct 3403 ms 4788 KB Output is correct
30 Correct 2039 ms 2952 KB Output is correct
31 Correct 2571 ms 3248 KB Output is correct
32 Correct 3293 ms 7692 KB Output is correct
33 Correct 74 ms 1096 KB Output is correct
34 Correct 65 ms 1248 KB Output is correct
35 Correct 91 ms 992 KB Output is correct
36 Correct 66 ms 1236 KB Output is correct
37 Correct 4437 ms 7192 KB Output is correct
38 Correct 4827 ms 5576 KB Output is correct
39 Correct 4676 ms 5624 KB Output is correct
40 Correct 2480 ms 8096 KB Output is correct
41 Correct 2169 ms 7916 KB Output is correct
42 Correct 2660 ms 5780 KB Output is correct
43 Correct 338 ms 1676 KB Output is correct
44 Correct 2671 ms 6052 KB Output is correct
45 Correct 2318 ms 5184 KB Output is correct
46 Correct 1610 ms 3624 KB Output is correct
47 Correct 1438 ms 3948 KB Output is correct
48 Correct 1010 ms 3192 KB Output is correct
49 Correct 4855 ms 6328 KB Output is correct
50 Correct 4848 ms 6072 KB Output is correct
51 Correct 4859 ms 5916 KB Output is correct
52 Correct 4871 ms 6308 KB Output is correct
53 Correct 473 ms 2776 KB Output is correct
54 Correct 2241 ms 5884 KB Output is correct
55 Correct 2538 ms 6404 KB Output is correct
56 Correct 2342 ms 5536 KB Output is correct
57 Correct 78 ms 2660 KB Output is correct
58 Correct 68 ms 2752 KB Output is correct
59 Correct 76 ms 2712 KB Output is correct
60 Correct 71 ms 2756 KB Output is correct
61 Correct 2579 ms 7068 KB Output is correct
62 Correct 2659 ms 6780 KB Output is correct
63 Correct 2185 ms 9820 KB Output is correct
64 Correct 2667 ms 7180 KB Output is correct
65 Correct 2346 ms 7208 KB Output is correct
66 Correct 1390 ms 4884 KB Output is correct
67 Correct 2179 ms 6320 KB Output is correct
68 Correct 2346 ms 7604 KB Output is correct
69 Correct 68 ms 1120 KB Output is correct
70 Correct 96 ms 1256 KB Output is correct
71 Correct 77 ms 1248 KB Output is correct
72 Correct 72 ms 1252 KB Output is correct
73 Correct 3094 ms 7656 KB Output is correct
74 Correct 1529 ms 2492 KB Output is correct
75 Correct 2796 ms 8036 KB Output is correct
76 Correct 2123 ms 3424 KB Output is correct
77 Correct 1700 ms 4296 KB Output is correct
78 Correct 2285 ms 7152 KB Output is correct
79 Correct 775 ms 2348 KB Output is correct
80 Correct 1873 ms 8356 KB Output is correct
81 Correct 2185 ms 6028 KB Output is correct
82 Correct 1555 ms 3208 KB Output is correct
83 Correct 2023 ms 8076 KB Output is correct
84 Correct 2200 ms 5964 KB Output is correct
85 Correct 3399 ms 5636 KB Output is correct
86 Correct 3413 ms 5012 KB Output is correct
87 Correct 3406 ms 5944 KB Output is correct
88 Correct 3383 ms 5664 KB Output is correct
89 Correct 73 ms 2900 KB Output is correct
90 Correct 73 ms 1632 KB Output is correct
91 Correct 68 ms 2912 KB Output is correct
92 Correct 68 ms 2148 KB Output is correct
93 Correct 2824 ms 3536 KB Output is correct
94 Correct 1077 ms 2900 KB Output is correct
95 Correct 3422 ms 6300 KB Output is correct
96 Correct 924 ms 2564 KB Output is correct
97 Correct 2213 ms 7084 KB Output is correct
98 Correct 2109 ms 8584 KB Output is correct
99 Correct 1919 ms 7980 KB Output is correct
100 Correct 2117 ms 7708 KB Output is correct
101 Correct 1041 ms 2628 KB Output is correct
102 Correct 843 ms 3128 KB Output is correct
103 Correct 2150 ms 6336 KB Output is correct
104 Correct 2016 ms 6360 KB Output is correct
105 Correct 3403 ms 6680 KB Output is correct
106 Correct 3402 ms 6416 KB Output is correct
107 Correct 3393 ms 5804 KB Output is correct
108 Correct 3394 ms 6296 KB Output is correct
109 Correct 1284 ms 3464 KB Output is correct
110 Correct 2023 ms 6384 KB Output is correct
111 Correct 1819 ms 10220 KB Output is correct
112 Correct 1921 ms 10140 KB Output is correct
113 Correct 71 ms 2916 KB Output is correct
114 Correct 68 ms 2948 KB Output is correct
115 Correct 74 ms 2916 KB Output is correct
116 Correct 69 ms 3040 KB Output is correct
117 Correct 1956 ms 6740 KB Output is correct
118 Correct 1268 ms 4316 KB Output is correct
119 Correct 720 ms 3608 KB Output is correct
120 Correct 2025 ms 6352 KB Output is correct
121 Correct 2182 ms 6868 KB Output is correct
122 Correct 2234 ms 8572 KB Output is correct
123 Correct 1691 ms 5504 KB Output is correct
124 Correct 746 ms 4100 KB Output is correct
125 Correct 169 ms 4576 KB Output is correct
126 Correct 178 ms 5080 KB Output is correct
127 Correct 195 ms 5084 KB Output is correct
128 Correct 178 ms 4956 KB Output is correct
129 Correct 168 ms 4824 KB Output is correct
130 Correct 180 ms 4956 KB Output is correct
131 Correct 4601 ms 7532 KB Output is correct
132 Execution timed out 5030 ms 11808 KB Time limit exceeded
133 Halted 0 ms 0 KB -