oj.uz

Submission #684932

# Submission time Handle Problem Language Result Execution time Memory
684932 2023-01-22T21:05:45 Z KiriLL1ca Segments (IZhO18_segments) C++17
100 / 100
 1636 ms 14372 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)((x).size())
#define pb push_back
#define fr first
#define sc second
#define pw(x) (1ll << x)

using namespace std;
using namespace __gnu_pbds;

#define int long long

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;

template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }

template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const int N = 2e5 + 100;
const int buben = 1700;
const int nb = N / buben + 2;

struct segment {
    int l, r;
    segment (int l = 0, int r = 0) : l(l), r(r) {}
    inline int len () { return r - l + 1; }

    inline bool operator < (segment &x) {
        if (len() != x.len()) return len() < x.len();
        return make_pair(l, r) < make_pair(x.l, x.r);
    }
};

inline int inter (const segment &a, const segment &b) {
    return max(0ll, min(a.r, b.r) - max(a.l, b.l) + 1);
}

struct sex {
    vector <segment> buf;
    vector <segment> ful;
    vector <int> lb[nb], rb[nb];

    inline void add (int l, int r) {
        segment seg (l, r); buf.pb(seg);

        if (sz(buf) == buben) {
            sort(all(buf));

            vector <segment> mt; mt.reserve(sz(ful) + sz(buf));
            int uk1 = 0, uk2 = 0;
            while (uk1 < sz(ful) || uk2 < sz(buf)) {
                if (uk1 == sz(ful)) mt.pb(buf[uk2++]);
                else if (uk2 == sz(buf)) mt.pb(ful[uk1++]);
                else if (ful[uk1] < buf[uk2]) mt.pb(ful[uk1++]);
                else mt.pb(buf[uk2++]);
            }
            ful.swap(mt); buf.clear();

            for (int i = 0; i < nb; ++i) lb[i].clear(), rb[i].clear();
            for (int i = 0; i < sz(ful); ++i) {
                lb[i / buben].pb(ful[i].l);
                rb[i / buben].pb(ful[i].r);
            }
            for (int i = 0; i < nb; ++i) {
                sort(all(lb[i]));
                sort(all(rb[i]));
            }
        }
    }

    inline int get (int l, int r, int k) {
        int res = 0;
        segment seg (l, r);

        for (segment x : buf) res += inter(x, seg) >= k;

        for (int L = 0, i = 0; L < sz(ful); L += buben, ++i) {
            int R = min(sz(ful), L + buben) - 1;
            if (ful[L].len() >= k) {
                res += R - L + 1;
                res -= sz(lb[i]) - (lower_bound(all(lb[i]), r - k + 2) - lb[i].begin());
                res -= upper_bound(all(rb[i]), l + k - 2) - rb[i].begin();
            }
            else if (ful[R].len() >= k) {
                for (int j = L; j <= R; ++j) res += inter(ful[j], seg) >= k;
            }
        }

        return res;
    }
};

inline void solve () {
    int q, T; cin >> q >> T;
    vector <pii> seg (q); int uk = 0;
    int lst = 0;
    sex in, out;
    while (q--) {
        int t; cin >> t;
        if (t == 1) {
            int l, r; cin >> l >> r;
            l = (l ^ (T * lst)), r = (r ^ (T * lst)); if (l > r) swap(l, r);
            seg[uk++] = {l, r};
            in.add(l, r);
        }
        if (t == 2) {
            int id; cin >> id; --id;
            auto [l, r] = seg[id];
            out.add(l, r);
        }
        if (t == 3) {
            int l, r, k; cin >> l >> r >> k;
            l = (l ^ (T * lst)), r = (r ^ (T * lst)); if (l > r) swap(l, r);
            lst = in.get(l, r, k) - out.get(l, r, k);
            cout << lst << endl;
        }
    }
}

signed main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif // LOCAL

    int t = 1; // cin >> t;
    while (t--) solve();
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 12 ms 468 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 7 ms 596 KB Output is correct
6 Correct 8 ms 596 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 7 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 22 ms 524 KB Output is correct
12 Correct 18 ms 516 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 9 ms 624 KB Output is correct
16 Correct 8 ms 468 KB Output is correct
17 Correct 12 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 9 ms 528 KB Output is correct
20 Correct 12 ms 568 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 4316 KB Output is correct
2 Correct 529 ms 4364 KB Output is correct
3 Correct 559 ms 4332 KB Output is correct
4 Correct 509 ms 4592 KB Output is correct
5 Correct 382 ms 6560 KB Output is correct
6 Correct 362 ms 6808 KB Output is correct
7 Correct 513 ms 4480 KB Output is correct
8 Correct 543 ms 4404 KB Output is correct
9 Correct 553 ms 4360 KB Output is correct
10 Correct 580 ms 2984 KB Output is correct
11 Correct 696 ms 3220 KB Output is correct
12 Correct 489 ms 5444 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 4776 KB Output is correct
2 Correct 342 ms 4852 KB Output is correct
3 Correct 322 ms 4736 KB Output is correct
4 Correct 334 ms 4808 KB Output is correct
5 Correct 391 ms 5508 KB Output is correct
6 Correct 475 ms 4864 KB Output is correct
7 Correct 466 ms 5200 KB Output is correct
8 Correct 380 ms 6604 KB Output is correct
9 Correct 360 ms 6632 KB Output is correct
10 Correct 341 ms 6340 KB Output is correct
11 Correct 307 ms 5424 KB Output is correct
12 Correct 340 ms 6268 KB Output is correct
13 Correct 337 ms 6372 KB Output is correct
14 Correct 301 ms 5956 KB Output is correct
15 Correct 312 ms 6028 KB Output is correct
16 Correct 312 ms 5520 KB Output is correct
17 Correct 411 ms 4440 KB Output is correct
18 Correct 472 ms 4392 KB Output is correct
19 Correct 422 ms 4296 KB Output is correct
20 Correct 428 ms 4340 KB Output is correct
21 Correct 321 ms 5340 KB Output is correct
22 Correct 341 ms 6240 KB Output is correct
23 Correct 339 ms 6100 KB Output is correct
24 Correct 347 ms 6264 KB Output is correct
25 Correct 334 ms 4744 KB Output is correct
26 Correct 317 ms 4708 KB Output is correct
27 Correct 346 ms 4780 KB Output is correct
28 Correct 325 ms 4780 KB Output is correct
29 Correct 356 ms 6108 KB Output is correct
30 Correct 314 ms 6124 KB Output is correct
31 Correct 345 ms 6752 KB Output is correct
32 Correct 346 ms 6288 KB Output is correct
33 Correct 298 ms 6248 KB Output is correct
34 Correct 288 ms 5940 KB Output is correct
35 Correct 311 ms 6228 KB Output is correct
36 Correct 306 ms 6448 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 4740 KB Output is correct
2 Correct 506 ms 4840 KB Output is correct
3 Correct 506 ms 4768 KB Output is correct
4 Correct 469 ms 4776 KB Output is correct
5 Correct 424 ms 5808 KB Output is correct
6 Correct 500 ms 2932 KB Output is correct
7 Correct 441 ms 6136 KB Output is correct
8 Correct 509 ms 3072 KB Output is correct
9 Correct 437 ms 6156 KB Output is correct
10 Correct 373 ms 6380 KB Output is correct
11 Correct 459 ms 5516 KB Output is correct
12 Correct 328 ms 6700 KB Output is correct
13 Correct 383 ms 6160 KB Output is correct
14 Correct 521 ms 6048 KB Output is correct
15 Correct 338 ms 6568 KB Output is correct
16 Correct 364 ms 6232 KB Output is correct
17 Correct 514 ms 4364 KB Output is correct
18 Correct 513 ms 4332 KB Output is correct
19 Correct 506 ms 4412 KB Output is correct
20 Correct 505 ms 4340 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 12 ms 468 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 7 ms 596 KB Output is correct
6 Correct 8 ms 596 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 7 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 22 ms 524 KB Output is correct
12 Correct 18 ms 516 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 9 ms 624 KB Output is correct
16 Correct 8 ms 468 KB Output is correct
17 Correct 12 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 9 ms 528 KB Output is correct
20 Correct 12 ms 568 KB Output is correct
21 Correct 556 ms 4316 KB Output is correct
22 Correct 529 ms 4364 KB Output is correct
23 Correct 559 ms 4332 KB Output is correct
24 Correct 509 ms 4592 KB Output is correct
25 Correct 382 ms 6560 KB Output is correct
26 Correct 362 ms 6808 KB Output is correct
27 Correct 513 ms 4480 KB Output is correct
28 Correct 543 ms 4404 KB Output is correct
29 Correct 553 ms 4360 KB Output is correct
30 Correct 580 ms 2984 KB Output is correct
31 Correct 696 ms 3220 KB Output is correct
32 Correct 489 ms 5444 KB Output is correct
33 Correct 481 ms 4740 KB Output is correct
34 Correct 506 ms 4840 KB Output is correct
35 Correct 506 ms 4768 KB Output is correct
36 Correct 469 ms 4776 KB Output is correct
37 Correct 424 ms 5808 KB Output is correct
38 Correct 500 ms 2932 KB Output is correct
39 Correct 441 ms 6136 KB Output is correct
40 Correct 509 ms 3072 KB Output is correct
41 Correct 437 ms 6156 KB Output is correct
42 Correct 373 ms 6380 KB Output is correct
43 Correct 459 ms 5516 KB Output is correct
44 Correct 328 ms 6700 KB Output is correct
45 Correct 383 ms 6160 KB Output is correct
46 Correct 521 ms 6048 KB Output is correct
47 Correct 338 ms 6568 KB Output is correct
48 Correct 364 ms 6232 KB Output is correct
49 Correct 514 ms 4364 KB Output is correct
50 Correct 513 ms 4332 KB Output is correct
51 Correct 506 ms 4412 KB Output is correct
52 Correct 505 ms 4340 KB Output is correct
53 Correct 480 ms 4892 KB Output is correct
54 Correct 480 ms 4800 KB Output is correct
55 Correct 480 ms 4756 KB Output is correct
56 Correct 473 ms 4768 KB Output is correct
57 Correct 631 ms 3384 KB Output is correct
58 Correct 672 ms 2924 KB Output is correct
59 Correct 429 ms 4944 KB Output is correct
60 Correct 592 ms 2684 KB Output is correct
61 Correct 389 ms 6332 KB Output is correct
62 Correct 354 ms 6536 KB Output is correct
63 Correct 332 ms 6644 KB Output is correct
64 Correct 343 ms 6516 KB Output is correct
65 Correct 448 ms 5604 KB Output is correct
66 Correct 481 ms 6080 KB Output is correct
67 Correct 374 ms 6460 KB Output is correct
68 Correct 395 ms 6344 KB Output is correct
69 Correct 512 ms 4352 KB Output is correct
70 Correct 499 ms 4356 KB Output is correct
71 Correct 522 ms 4420 KB Output is correct
72 Correct 505 ms 4384 KB Output is correct
73 Correct 457 ms 5948 KB Output is correct
74 Correct 435 ms 6156 KB Output is correct
75 Correct 326 ms 6756 KB Output is correct
76 Correct 359 ms 6752 KB Output is correct
77 Correct 484 ms 4756 KB Output is correct
78 Correct 506 ms 4880 KB Output is correct
79 Correct 471 ms 4816 KB Output is correct
80 Correct 478 ms 4840 KB Output is correct
81 Correct 398 ms 6180 KB Output is correct
82 Correct 450 ms 5964 KB Output is correct
83 Correct 493 ms 6120 KB Output is correct
84 Correct 423 ms 6308 KB Output is correct
85 Correct 435 ms 6272 KB Output is correct
86 Correct 374 ms 6448 KB Output is correct
87 Correct 443 ms 6204 KB Output is correct
88 Correct 459 ms 5420 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 12 ms 468 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 7 ms 596 KB Output is correct
6 Correct 8 ms 596 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 7 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 22 ms 524 KB Output is correct
12 Correct 18 ms 516 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 9 ms 624 KB Output is correct
16 Correct 8 ms 468 KB Output is correct
17 Correct 12 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 9 ms 528 KB Output is correct
20 Correct 12 ms 568 KB Output is correct
21 Correct 556 ms 4316 KB Output is correct
22 Correct 529 ms 4364 KB Output is correct
23 Correct 559 ms 4332 KB Output is correct
24 Correct 509 ms 4592 KB Output is correct
25 Correct 382 ms 6560 KB Output is correct
26 Correct 362 ms 6808 KB Output is correct
27 Correct 513 ms 4480 KB Output is correct
28 Correct 543 ms 4404 KB Output is correct
29 Correct 553 ms 4360 KB Output is correct
30 Correct 580 ms 2984 KB Output is correct
31 Correct 696 ms 3220 KB Output is correct
32 Correct 489 ms 5444 KB Output is correct
33 Correct 369 ms 4776 KB Output is correct
34 Correct 342 ms 4852 KB Output is correct
35 Correct 322 ms 4736 KB Output is correct
36 Correct 334 ms 4808 KB Output is correct
37 Correct 391 ms 5508 KB Output is correct
38 Correct 475 ms 4864 KB Output is correct
39 Correct 466 ms 5200 KB Output is correct
40 Correct 380 ms 6604 KB Output is correct
41 Correct 360 ms 6632 KB Output is correct
42 Correct 341 ms 6340 KB Output is correct
43 Correct 307 ms 5424 KB Output is correct
44 Correct 340 ms 6268 KB Output is correct
45 Correct 337 ms 6372 KB Output is correct
46 Correct 301 ms 5956 KB Output is correct
47 Correct 312 ms 6028 KB Output is correct
48 Correct 312 ms 5520 KB Output is correct
49 Correct 411 ms 4440 KB Output is correct
50 Correct 472 ms 4392 KB Output is correct
51 Correct 422 ms 4296 KB Output is correct
52 Correct 428 ms 4340 KB Output is correct
53 Correct 321 ms 5340 KB Output is correct
54 Correct 341 ms 6240 KB Output is correct
55 Correct 339 ms 6100 KB Output is correct
56 Correct 347 ms 6264 KB Output is correct
57 Correct 334 ms 4744 KB Output is correct
58 Correct 317 ms 4708 KB Output is correct
59 Correct 346 ms 4780 KB Output is correct
60 Correct 325 ms 4780 KB Output is correct
61 Correct 356 ms 6108 KB Output is correct
62 Correct 314 ms 6124 KB Output is correct
63 Correct 345 ms 6752 KB Output is correct
64 Correct 346 ms 6288 KB Output is correct
65 Correct 298 ms 6248 KB Output is correct
66 Correct 288 ms 5940 KB Output is correct
67 Correct 311 ms 6228 KB Output is correct
68 Correct 306 ms 6448 KB Output is correct
69 Correct 481 ms 4740 KB Output is correct
70 Correct 506 ms 4840 KB Output is correct
71 Correct 506 ms 4768 KB Output is correct
72 Correct 469 ms 4776 KB Output is correct
73 Correct 424 ms 5808 KB Output is correct
74 Correct 500 ms 2932 KB Output is correct
75 Correct 441 ms 6136 KB Output is correct
76 Correct 509 ms 3072 KB Output is correct
77 Correct 437 ms 6156 KB Output is correct
78 Correct 373 ms 6380 KB Output is correct
79 Correct 459 ms 5516 KB Output is correct
80 Correct 328 ms 6700 KB Output is correct
81 Correct 383 ms 6160 KB Output is correct
82 Correct 521 ms 6048 KB Output is correct
83 Correct 338 ms 6568 KB Output is correct
84 Correct 364 ms 6232 KB Output is correct
85 Correct 514 ms 4364 KB Output is correct
86 Correct 513 ms 4332 KB Output is correct
87 Correct 506 ms 4412 KB Output is correct
88 Correct 505 ms 4340 KB Output is correct
89 Correct 480 ms 4892 KB Output is correct
90 Correct 480 ms 4800 KB Output is correct
91 Correct 480 ms 4756 KB Output is correct
92 Correct 473 ms 4768 KB Output is correct
93 Correct 631 ms 3384 KB Output is correct
94 Correct 672 ms 2924 KB Output is correct
95 Correct 429 ms 4944 KB Output is correct
96 Correct 592 ms 2684 KB Output is correct
97 Correct 389 ms 6332 KB Output is correct
98 Correct 354 ms 6536 KB Output is correct
99 Correct 332 ms 6644 KB Output is correct
100 Correct 343 ms 6516 KB Output is correct
101 Correct 448 ms 5604 KB Output is correct
102 Correct 481 ms 6080 KB Output is correct
103 Correct 374 ms 6460 KB Output is correct
104 Correct 395 ms 6344 KB Output is correct
105 Correct 512 ms 4352 KB Output is correct
106 Correct 499 ms 4356 KB Output is correct
107 Correct 522 ms 4420 KB Output is correct
108 Correct 505 ms 4384 KB Output is correct
109 Correct 457 ms 5948 KB Output is correct
110 Correct 435 ms 6156 KB Output is correct
111 Correct 326 ms 6756 KB Output is correct
112 Correct 359 ms 6752 KB Output is correct
113 Correct 484 ms 4756 KB Output is correct
114 Correct 506 ms 4880 KB Output is correct
115 Correct 471 ms 4816 KB Output is correct
116 Correct 478 ms 4840 KB Output is correct
117 Correct 398 ms 6180 KB Output is correct
118 Correct 450 ms 5964 KB Output is correct
119 Correct 493 ms 6120 KB Output is correct
120 Correct 423 ms 6308 KB Output is correct
121 Correct 435 ms 6272 KB Output is correct
122 Correct 374 ms 6448 KB Output is correct
123 Correct 443 ms 6204 KB Output is correct
124 Correct 459 ms 5420 KB Output is correct
125 Correct 1505 ms 9272 KB Output is correct
126 Correct 1286 ms 9264 KB Output is correct
127 Correct 1257 ms 9388 KB Output is correct
128 Correct 1224 ms 9372 KB Output is correct
129 Correct 1291 ms 9328 KB Output is correct
130 Correct 1260 ms 9404 KB Output is correct
131 Correct 1424 ms 5076 KB Output is correct
132 Correct 1454 ms 7816 KB Output is correct
133 Correct 1435 ms 10004 KB Output is correct
134 Correct 1232 ms 5492 KB Output is correct
135 Correct 1368 ms 10480 KB Output is correct
136 Correct 977 ms 4460 KB Output is correct
137 Correct 1250 ms 13116 KB Output is correct
138 Correct 1234 ms 12348 KB Output is correct
139 Correct 1221 ms 12836 KB Output is correct
140 Correct 1214 ms 12820 KB Output is correct
141 Correct 1219 ms 12656 KB Output is correct
142 Correct 1226 ms 14228 KB Output is correct
143 Correct 1218 ms 12308 KB Output is correct
144 Correct 1252 ms 14292 KB Output is correct
145 Correct 1213 ms 12892 KB Output is correct
146 Correct 1241 ms 12364 KB Output is correct
147 Correct 1371 ms 11044 KB Output is correct
148 Correct 1206 ms 14372 KB Output is correct
149 Correct 1509 ms 8356 KB Output is correct
150 Correct 1636 ms 8452 KB Output is correct
151 Correct 1574 ms 8440 KB Output is correct
152 Correct 1534 ms 8432 KB Output is correct
153 Correct 1566 ms 8516 KB Output is correct
154 Correct 1512 ms 8360 KB Output is correct
155 Correct 1231 ms 13024 KB Output is correct
156 Correct 1182 ms 11124 KB Output is correct
157 Correct 1243 ms 12880 KB Output is correct
158 Correct 1247 ms 13004 KB Output is correct
159 Correct 1201 ms 12640 KB Output is correct
160 Correct 1204 ms 12372 KB Output is correct
161 Correct 1261 ms 9388 KB Output is correct
162 Correct 1250 ms 9372 KB Output is correct
163 Correct 1265 ms 9432 KB Output is correct
164 Correct 1280 ms 9412 KB Output is correct
165 Correct 1252 ms 9384 KB Output is correct
166 Correct 1308 ms 9516 KB Output is correct
167 Correct 1301 ms 13196 KB Output is correct
168 Correct 1275 ms 13464 KB Output is correct
169 Correct 1260 ms 12740 KB Output is correct
170 Correct 1254 ms 12804 KB Output is correct
171 Correct 1235 ms 12744 KB Output is correct
172 Correct 1268 ms 11920 KB Output is correct
173 Correct 1232 ms 12960 KB Output is correct
174 Correct 1196 ms 12196 KB Output is correct
175 Correct 1212 ms 12644 KB Output is correct
176 Correct 1227 ms 12908 KB Output is correct
177 Correct 1235 ms 12468 KB Output is correct
178 Correct 1191 ms 12676 KB Output is correct