oj.uz

Submission #175939

# Submission time Handle Problem Language Result Execution time Memory
175939 2020-01-07T12:31:18 Z VEGAnn Segments (IZhO18_segments) C++14
100 / 100
 4173 ms 12404 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define PB push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N = 200100;
const int BLOCK = 3000;
const int NB = N / BLOCK + 10;
const int PW = 20;
vector<int> bad, old, nw, lf, rt, glf, grt;
int last_ans = 0, n, l[N], r[N], tt = 0;
bool mrk[N], T;
 
bool cmp(int _x, int _y){
    return (r[_x] - l[_x]) < (r[_y] - l[_y]);
}
 
bool cmp_lf(int _x, int _y){
    return l[_x] < l[_y];
}
 
bool cmp_rt(int _x, int _y){
    return r[_x] < r[_y];
}
 
bool ok(int id, int l1, int r1, int k){
    int lef = max(l1, l[id]);
    int rgt = min(r1, r[id]);
    return bool((rgt - lef + 1) >= k);
}
 
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
 
    cin >> n >> T;
 
    old.clear();
 
    for (int it = 0; it < n; it += BLOCK){
        int bd = min(n, it + BLOCK);
        int mem_tt = tt;
        bad.clear();
 
        for (int i = it; i < bd; i++){
            int tp; cin >> tp;
            if (tp == 1){
                cin >> l[tt] >> r[tt];
                if (T){
                    l[tt] = (l[tt] ^ last_ans);
                    r[tt] = (r[tt] ^ last_ans);
                }
                if (l[tt] > r[tt])
                    swap(l[tt], r[tt]);
                tt++;
            } else if (tp == 2){
                int id; cin >> id; id--;
                bad.PB(id);
                mrk[id] = 1;
            } else {
                int l1, r1, k;
                cin >> l1 >> r1 >> k;
                if (T){
                    l1 = (l1 ^ last_ans);
                    r1 = (r1 ^ last_ans);
                }
                if (l1 > r1)
                    swap(l1, r1);
 
                if (r1 - l1 + 1 < k){
                    last_ans = 0;
                    cout << "0\n";
                    continue;
                }
 
                int dl = 0;
                if (sz(lf)){
                    dl += lower_bound(all(grt), l1 + k - 1) - grt.begin();
                    dl += sz(glf);
                    dl -= upper_bound(all(glf), r1 - k + 1) - glf.begin();
 
                    for (int i = 0; i < sz(lf); i += BLOCK){
                        int bd = min(sz(lf), i + BLOCK);
                        if (r[nw[bd - 1]] - l[nw[bd - 1]] + 1 >= k){
                            for (int j = i; j < bd; j++){
                                int nm = nw[j];
                                if (r[nm] - l[nm] + 1 >= k) break;
                                if (r[nm] < l1 + k - 1)
                                    dl--;
                                if (l[nm] > r1 - k + 1)
                                    dl--;
                                dl++;
                            }
                        } else {
                            dl -= lower_bound(rt.begin() + i, rt.begin() + bd, l1 + k - 1) - rt.begin() - i;
                            dl -= bd;
                            dl += upper_bound(lf.begin() + i, lf.begin() + bd, r1 - k + 1) - lf.begin();
 
                            dl += bd - i;
                        }
                    }
                }
                int ans = sz(lf) - dl;
 
                for (int i = mem_tt; i < tt; i++)
                    if (ok(i, l1, r1, k))
                        ans++;
 
                for (int i : bad)
                    if (ok(i, l1, r1, k))
                        ans--;
 
                cout << ans << '\n';
                last_ans = ans;
            }
        }
 
        old = nw;
        nw.clear();
 
        for (int id : old)
            if (!mrk[id])
                nw.PB(id);
 
        for (int i = mem_tt; i < tt; i++)
            if (!mrk[i])
                nw.PB(i);
 
        sort(all(nw), cmp);
 
        lf.resize(sz(nw));
        rt.resize(sz(nw));
        glf.resize(sz(nw));
        grt.resize(sz(nw));
        for (int i = 0; i < sz(nw); i++){
            lf[i] = glf[i] = l[nw[i]];
            rt[i] = grt[i] = r[nw[i]];
        }
 
        for (int i = 0; i < sz(nw); i += BLOCK){
            int bd = min(sz(nw), i + BLOCK);
            sort(lf.begin() + i, lf.begin() + bd);
            sort(rt.begin() + i, rt.begin() + bd);
        }
 
        sort(all(glf));
        sort(all(grt));
    }
 
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 7 ms 504 KB Output is correct
5 Correct 10 ms 632 KB Output is correct
6 Correct 11 ms 632 KB Output is correct
7 Correct 8 ms 532 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 8 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 12 ms 672 KB Output is correct
12 Correct 12 ms 632 KB Output is correct
13 Correct 8 ms 632 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 7 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 8 ms 504 KB Output is correct
18 Correct 8 ms 632 KB Output is correct
19 Correct 8 ms 504 KB Output is correct
20 Correct 8 ms 504 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 5436 KB Output is correct
2 Correct 1020 ms 5208 KB Output is correct
3 Correct 1022 ms 5396 KB Output is correct
4 Correct 1059 ms 5284 KB Output is correct
5 Correct 927 ms 6296 KB Output is correct
6 Correct 896 ms 6344 KB Output is correct
7 Correct 1020 ms 5200 KB Output is correct
8 Correct 1037 ms 5208 KB Output is correct
9 Correct 1026 ms 5376 KB Output is correct
10 Correct 727 ms 4636 KB Output is correct
11 Correct 817 ms 4956 KB Output is correct
12 Correct 1014 ms 5416 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 2552 KB Output is correct
2 Correct 109 ms 2552 KB Output is correct
3 Correct 114 ms 2680 KB Output is correct
4 Correct 111 ms 2680 KB Output is correct
5 Correct 712 ms 5180 KB Output is correct
6 Correct 660 ms 5232 KB Output is correct
7 Correct 674 ms 5004 KB Output is correct
8 Correct 866 ms 6292 KB Output is correct
9 Correct 930 ms 6132 KB Output is correct
10 Correct 821 ms 4756 KB Output is correct
11 Correct 155 ms 2812 KB Output is correct
12 Correct 854 ms 5072 KB Output is correct
13 Correct 761 ms 4872 KB Output is correct
14 Correct 503 ms 3960 KB Output is correct
15 Correct 429 ms 3960 KB Output is correct
16 Correct 329 ms 3448 KB Output is correct
17 Correct 571 ms 4912 KB Output is correct
18 Correct 577 ms 5080 KB Output is correct
19 Correct 567 ms 4908 KB Output is correct
20 Correct 578 ms 4888 KB Output is correct
21 Correct 180 ms 2940 KB Output is correct
22 Correct 594 ms 4408 KB Output is correct
23 Correct 696 ms 4848 KB Output is correct
24 Correct 616 ms 4312 KB Output is correct
25 Correct 112 ms 2620 KB Output is correct
26 Correct 109 ms 2708 KB Output is correct
27 Correct 112 ms 2652 KB Output is correct
28 Correct 110 ms 2552 KB Output is correct
29 Correct 707 ms 4588 KB Output is correct
30 Correct 714 ms 4632 KB Output is correct
31 Correct 888 ms 6216 KB Output is correct
32 Correct 823 ms 5124 KB Output is correct
33 Correct 801 ms 4892 KB Output is correct
34 Correct 416 ms 3656 KB Output is correct
35 Correct 705 ms 4540 KB Output is correct
36 Correct 806 ms 4676 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 2840 KB Output is correct
2 Correct 112 ms 2804 KB Output is correct
3 Correct 114 ms 2872 KB Output is correct
4 Correct 116 ms 2744 KB Output is correct
5 Correct 1028 ms 5464 KB Output is correct
6 Correct 554 ms 4452 KB Output is correct
7 Correct 976 ms 5808 KB Output is correct
8 Correct 682 ms 4596 KB Output is correct
9 Correct 735 ms 4272 KB Output is correct
10 Correct 999 ms 5776 KB Output is correct
11 Correct 424 ms 3512 KB Output is correct
12 Correct 936 ms 6540 KB Output is correct
13 Correct 931 ms 4892 KB Output is correct
14 Correct 650 ms 4372 KB Output is correct
15 Correct 947 ms 6120 KB Output is correct
16 Correct 911 ms 5024 KB Output is correct
17 Correct 1026 ms 5540 KB Output is correct
18 Correct 996 ms 5412 KB Output is correct
19 Correct 1040 ms 5312 KB Output is correct
20 Correct 1006 ms 5424 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 7 ms 504 KB Output is correct
5 Correct 10 ms 632 KB Output is correct
6 Correct 11 ms 632 KB Output is correct
7 Correct 8 ms 532 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 8 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 12 ms 672 KB Output is correct
12 Correct 12 ms 632 KB Output is correct
13 Correct 8 ms 632 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 7 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 8 ms 504 KB Output is correct
18 Correct 8 ms 632 KB Output is correct
19 Correct 8 ms 504 KB Output is correct
20 Correct 8 ms 504 KB Output is correct
21 Correct 1000 ms 5436 KB Output is correct
22 Correct 1020 ms 5208 KB Output is correct
23 Correct 1022 ms 5396 KB Output is correct
24 Correct 1059 ms 5284 KB Output is correct
25 Correct 927 ms 6296 KB Output is correct
26 Correct 896 ms 6344 KB Output is correct
27 Correct 1020 ms 5200 KB Output is correct
28 Correct 1037 ms 5208 KB Output is correct
29 Correct 1026 ms 5376 KB Output is correct
30 Correct 727 ms 4636 KB Output is correct
31 Correct 817 ms 4956 KB Output is correct
32 Correct 1014 ms 5416 KB Output is correct
33 Correct 113 ms 2840 KB Output is correct
34 Correct 112 ms 2804 KB Output is correct
35 Correct 114 ms 2872 KB Output is correct
36 Correct 116 ms 2744 KB Output is correct
37 Correct 1028 ms 5464 KB Output is correct
38 Correct 554 ms 4452 KB Output is correct
39 Correct 976 ms 5808 KB Output is correct
40 Correct 682 ms 4596 KB Output is correct
41 Correct 735 ms 4272 KB Output is correct
42 Correct 999 ms 5776 KB Output is correct
43 Correct 424 ms 3512 KB Output is correct
44 Correct 936 ms 6540 KB Output is correct
45 Correct 931 ms 4892 KB Output is correct
46 Correct 650 ms 4372 KB Output is correct
47 Correct 947 ms 6120 KB Output is correct
48 Correct 911 ms 5024 KB Output is correct
49 Correct 1026 ms 5540 KB Output is correct
50 Correct 996 ms 5412 KB Output is correct
51 Correct 1040 ms 5312 KB Output is correct
52 Correct 1006 ms 5424 KB Output is correct
53 Correct 116 ms 2904 KB Output is correct
54 Correct 117 ms 2808 KB Output is correct
55 Correct 113 ms 2788 KB Output is correct
56 Correct 113 ms 2808 KB Output is correct
57 Correct 888 ms 5240 KB Output is correct
58 Correct 486 ms 4216 KB Output is correct
59 Correct 1054 ms 5508 KB Output is correct
60 Correct 447 ms 4216 KB Output is correct
61 Correct 963 ms 5324 KB Output is correct
62 Correct 933 ms 6124 KB Output is correct
63 Correct 941 ms 6260 KB Output is correct
64 Correct 1008 ms 6080 KB Output is correct
65 Correct 474 ms 3836 KB Output is correct
66 Correct 406 ms 3472 KB Output is correct
67 Correct 899 ms 5204 KB Output is correct
68 Correct 859 ms 4684 KB Output is correct
69 Correct 1060 ms 5428 KB Output is correct
70 Correct 1035 ms 5424 KB Output is correct
71 Correct 1025 ms 5292 KB Output is correct
72 Correct 1020 ms 5280 KB Output is correct
73 Correct 592 ms 3960 KB Output is correct
74 Correct 850 ms 4920 KB Output is correct
75 Correct 931 ms 6628 KB Output is correct
76 Correct 940 ms 6300 KB Output is correct
77 Correct 119 ms 2756 KB Output is correct
78 Correct 115 ms 2808 KB Output is correct
79 Correct 117 ms 2808 KB Output is correct
80 Correct 114 ms 2808 KB Output is correct
81 Correct 823 ms 4668 KB Output is correct
82 Correct 576 ms 3960 KB Output is correct
83 Correct 415 ms 3448 KB Output is correct
84 Correct 864 ms 4652 KB Output is correct
85 Correct 902 ms 5364 KB Output is correct
86 Correct 912 ms 5576 KB Output is correct
87 Correct 694 ms 4424 KB Output is correct
88 Correct 385 ms 3576 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 7 ms 504 KB Output is correct
5 Correct 10 ms 632 KB Output is correct
6 Correct 11 ms 632 KB Output is correct
7 Correct 8 ms 532 KB Output is correct
8 Correct 9 ms 632 KB Output is correct
9 Correct 8 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 12 ms 672 KB Output is correct
12 Correct 12 ms 632 KB Output is correct
13 Correct 8 ms 632 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 7 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 8 ms 504 KB Output is correct
18 Correct 8 ms 632 KB Output is correct
19 Correct 8 ms 504 KB Output is correct
20 Correct 8 ms 504 KB Output is correct
21 Correct 1000 ms 5436 KB Output is correct
22 Correct 1020 ms 5208 KB Output is correct
23 Correct 1022 ms 5396 KB Output is correct
24 Correct 1059 ms 5284 KB Output is correct
25 Correct 927 ms 6296 KB Output is correct
26 Correct 896 ms 6344 KB Output is correct
27 Correct 1020 ms 5200 KB Output is correct
28 Correct 1037 ms 5208 KB Output is correct
29 Correct 1026 ms 5376 KB Output is correct
30 Correct 727 ms 4636 KB Output is correct
31 Correct 817 ms 4956 KB Output is correct
32 Correct 1014 ms 5416 KB Output is correct
33 Correct 111 ms 2552 KB Output is correct
34 Correct 109 ms 2552 KB Output is correct
35 Correct 114 ms 2680 KB Output is correct
36 Correct 111 ms 2680 KB Output is correct
37 Correct 712 ms 5180 KB Output is correct
38 Correct 660 ms 5232 KB Output is correct
39 Correct 674 ms 5004 KB Output is correct
40 Correct 866 ms 6292 KB Output is correct
41 Correct 930 ms 6132 KB Output is correct
42 Correct 821 ms 4756 KB Output is correct
43 Correct 155 ms 2812 KB Output is correct
44 Correct 854 ms 5072 KB Output is correct
45 Correct 761 ms 4872 KB Output is correct
46 Correct 503 ms 3960 KB Output is correct
47 Correct 429 ms 3960 KB Output is correct
48 Correct 329 ms 3448 KB Output is correct
49 Correct 571 ms 4912 KB Output is correct
50 Correct 577 ms 5080 KB Output is correct
51 Correct 567 ms 4908 KB Output is correct
52 Correct 578 ms 4888 KB Output is correct
53 Correct 180 ms 2940 KB Output is correct
54 Correct 594 ms 4408 KB Output is correct
55 Correct 696 ms 4848 KB Output is correct
56 Correct 616 ms 4312 KB Output is correct
57 Correct 112 ms 2620 KB Output is correct
58 Correct 109 ms 2708 KB Output is correct
59 Correct 112 ms 2652 KB Output is correct
60 Correct 110 ms 2552 KB Output is correct
61 Correct 707 ms 4588 KB Output is correct
62 Correct 714 ms 4632 KB Output is correct
63 Correct 888 ms 6216 KB Output is correct
64 Correct 823 ms 5124 KB Output is correct
65 Correct 801 ms 4892 KB Output is correct
66 Correct 416 ms 3656 KB Output is correct
67 Correct 705 ms 4540 KB Output is correct
68 Correct 806 ms 4676 KB Output is correct
69 Correct 113 ms 2840 KB Output is correct
70 Correct 112 ms 2804 KB Output is correct
71 Correct 114 ms 2872 KB Output is correct
72 Correct 116 ms 2744 KB Output is correct
73 Correct 1028 ms 5464 KB Output is correct
74 Correct 554 ms 4452 KB Output is correct
75 Correct 976 ms 5808 KB Output is correct
76 Correct 682 ms 4596 KB Output is correct
77 Correct 735 ms 4272 KB Output is correct
78 Correct 999 ms 5776 KB Output is correct
79 Correct 424 ms 3512 KB Output is correct
80 Correct 936 ms 6540 KB Output is correct
81 Correct 931 ms 4892 KB Output is correct
82 Correct 650 ms 4372 KB Output is correct
83 Correct 947 ms 6120 KB Output is correct
84 Correct 911 ms 5024 KB Output is correct
85 Correct 1026 ms 5540 KB Output is correct
86 Correct 996 ms 5412 KB Output is correct
87 Correct 1040 ms 5312 KB Output is correct
88 Correct 1006 ms 5424 KB Output is correct
89 Correct 116 ms 2904 KB Output is correct
90 Correct 117 ms 2808 KB Output is correct
91 Correct 113 ms 2788 KB Output is correct
92 Correct 113 ms 2808 KB Output is correct
93 Correct 888 ms 5240 KB Output is correct
94 Correct 486 ms 4216 KB Output is correct
95 Correct 1054 ms 5508 KB Output is correct
96 Correct 447 ms 4216 KB Output is correct
97 Correct 963 ms 5324 KB Output is correct
98 Correct 933 ms 6124 KB Output is correct
99 Correct 941 ms 6260 KB Output is correct
100 Correct 1008 ms 6080 KB Output is correct
101 Correct 474 ms 3836 KB Output is correct
102 Correct 406 ms 3472 KB Output is correct
103 Correct 899 ms 5204 KB Output is correct
104 Correct 859 ms 4684 KB Output is correct
105 Correct 1060 ms 5428 KB Output is correct
106 Correct 1035 ms 5424 KB Output is correct
107 Correct 1025 ms 5292 KB Output is correct
108 Correct 1020 ms 5280 KB Output is correct
109 Correct 592 ms 3960 KB Output is correct
110 Correct 850 ms 4920 KB Output is correct
111 Correct 931 ms 6628 KB Output is correct
112 Correct 940 ms 6300 KB Output is correct
113 Correct 119 ms 2756 KB Output is correct
114 Correct 115 ms 2808 KB Output is correct
115 Correct 117 ms 2808 KB Output is correct
116 Correct 114 ms 2808 KB Output is correct
117 Correct 823 ms 4668 KB Output is correct
118 Correct 576 ms 3960 KB Output is correct
119 Correct 415 ms 3448 KB Output is correct
120 Correct 864 ms 4652 KB Output is correct
121 Correct 902 ms 5364 KB Output is correct
122 Correct 912 ms 5576 KB Output is correct
123 Correct 694 ms 4424 KB Output is correct
124 Correct 385 ms 3576 KB Output is correct
125 Correct 232 ms 5240 KB Output is correct
126 Correct 232 ms 5368 KB Output is correct
127 Correct 253 ms 5536 KB Output is correct
128 Correct 235 ms 5240 KB Output is correct
129 Correct 231 ms 5368 KB Output is correct
130 Correct 242 ms 5552 KB Output is correct
131 Correct 1487 ms 8304 KB Output is correct
132 Correct 3350 ms 9780 KB Output is correct
133 Correct 3785 ms 10376 KB Output is correct
134 Correct 2009 ms 8696 KB Output is correct
135 Correct 3859 ms 10864 KB Output is correct
136 Correct 660 ms 7672 KB Output is correct
137 Correct 4173 ms 11996 KB Output is correct
138 Correct 3439 ms 9564 KB Output is correct
139 Correct 4030 ms 10728 KB Output is correct
140 Correct 3888 ms 11768 KB Output is correct
141 Correct 3827 ms 10220 KB Output is correct
142 Correct 906 ms 5908 KB Output is correct
143 Correct 1751 ms 7216 KB Output is correct
144 Correct 533 ms 5640 KB Output is correct
145 Correct 3946 ms 10916 KB Output is correct
146 Correct 2614 ms 7696 KB Output is correct
147 Correct 1913 ms 6936 KB Output is correct
148 Correct 1651 ms 7004 KB Output is correct
149 Correct 3449 ms 9968 KB Output is correct
150 Correct 3543 ms 9872 KB Output is correct
151 Correct 3493 ms 9956 KB Output is correct
152 Correct 3488 ms 10044 KB Output is correct
153 Correct 3513 ms 9908 KB Output is correct
154 Correct 3449 ms 9984 KB Output is correct
155 Correct 1290 ms 6284 KB Output is correct
156 Correct 2035 ms 7220 KB Output is correct
157 Correct 3973 ms 11300 KB Output is correct
158 Correct 3912 ms 11960 KB Output is correct
159 Correct 3681 ms 9348 KB Output is correct
160 Correct 2849 ms 7628 KB Output is correct
161 Correct 246 ms 5244 KB Output is correct
162 Correct 237 ms 5300 KB Output is correct
163 Correct 240 ms 5368 KB Output is correct
164 Correct 299 ms 5512 KB Output is correct
165 Correct 246 ms 5368 KB Output is correct
166 Correct 236 ms 5364 KB Output is correct
167 Correct 3929 ms 12160 KB Output is correct
168 Correct 4027 ms 12280 KB Output is correct
169 Correct 3898 ms 12404 KB Output is correct
170 Correct 4086 ms 10860 KB Output is correct
171 Correct 3712 ms 10092 KB Output is correct
172 Correct 2493 ms 7696 KB Output is correct
173 Correct 3869 ms 11872 KB Output is correct
174 Correct 2476 ms 7824 KB Output is correct
175 Correct 3713 ms 10104 KB Output is correct
176 Correct 1657 ms 6924 KB Output is correct
177 Correct 3436 ms 9632 KB Output is correct
178 Correct 3311 ms 9032 KB Output is correct