oj.uz

Submission #868115

# Submission time Handle Problem Language Result Execution time Memory
868115 2023-10-30T12:50:43 Z sleepntsheep Segments (IZhO18_segments) C++17
75 / 100
 1845 ms 10224 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,tune=native")

#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define N 200005
int V;

int n, t, na, nc, S, id = 1;
struct line { int l, r, w; } a[N], c[99000], o[N];
int e[N], f[N], we[N], wf[N], pf_[N], sz[99000], *pf = pf_+1;

inline int max(int a, int b)  { return b>a?b:a; }
inline int min(int a, int b)  { return b<a?b:a; }

int compare_length(const void *a0, const void *b0)
{
    const struct line *a = (const struct line*)a0, *b = (const struct line*)b0;
    return ((a->r - a->l) - (b->r - b->l));
}

int compare_left_increasing_index(const void *a0, const void *b0)
{
    const int aa = *(const int*)a0, bb = *(const int*)b0;
    return a[aa].l - a[bb].l;
}

int compare_right_increasing_index(const void *a0, const void *b0)
{
    const int aa = *(const int*)a0, bb = *(const int*)b0;
    return a[aa].r - a[bb].r;
}

inline void rebuild()
{
    for (; nc;) a[na++] = c[--nc];
    qsort(a, na, sizeof *a, compare_length);
    memset(sz, 0, sizeof *sz * (na / V + 1));
    for (int i = 0; i < na; ++i) e[i] = f[i] = i, ++sz[i/V];
    pf[0] = a[0].w;
    for (int i = 1; i < na; ++i) pf[i] = pf[i-1] + a[i].w;
    for (int i = 0; i * V <= na; ++i)
    {
        qsort(e+i*V, sz[i], sizeof *e, compare_left_increasing_index);
        qsort(f+i*V, sz[i], sizeof *f, compare_right_increasing_index);

        we[i*V+sz[i]-1] = a[e[i*V+sz[i]-1]].w;
        for (int j = i*V+sz[i]-1; --j >= i*V;) we[j] = we[j+1] + a[e[j]].w;
        wf[i*V] = a[f[i*V]].w;
        for (int j = i*V+1; j < i*V+sz[i]; ++j) wf[j] = wf[j-1] + a[f[j]].w;
    }
}

int main(void)
{
    scanf("%d%d", &n, &t);
    V = sqrt(n * log2(n));

    for (int z = 0, lastans = 0, op, x, y, k, l, r; n--;)
    {
        scanf("%d%d", &op, &x);
        switch (op)
        {
            case 1:
                scanf("%d", &y);
                l = x ^ (t * lastans), r = y ^ (t * lastans);
                if (l>r) { int t=l;l=r;r=t;}
                o[id++] = c[nc++] = (struct line){l, r, 1};
                if (nc == V) rebuild();
                ++S;
                break;
            case 2:
                c[nc++] = (struct line){o[x].l, o[x].r, -1};
                if (nc == V) rebuild();
                --S;
                break;
            default:
                scanf("%d%d", &y, &k); z=0;
                l = x ^ (t * lastans), r = y ^ (t * lastans);
                if (l>r) { int t=l;l=r;r=t;}
                /* count in static */
                {
                    int Z = -1;
                    for (int L = 0, R = na-1; L <= R; )
                    {
                        int M = (L+R)/2;
                        if (a[M].r - a[M].l + 1 >= k) R = M - 1, Z = M;
                        else L = M + 1;
                    }
                    if (Z != -1)
                    {
                        z -= pf[Z-1];
                        int zb = Z/V, sb = zb+1;
                        for (struct line *j = a + Z; j < a + sb * V; ++j) z -= (j->r < l + k - 1 || j->l > r - k + 1) * j->w;
                        for (int j = sb; j * V <= na; ++j)
                        {
                            /* r - j->l + 1 < k === j->l > r - k + 1 */
                            int cnt = 0;
                            for (int L = 0, R = sz[j]-1; L <= R;)
                            {
                                int M = (L+R)/2;
                                if (a[e[j*V+M]].l > r - k + 1) R = M - 1, cnt = we[j*V+M];
                                else L = M + 1;
                            }
                            z -= cnt;
                            cnt = 0;
                            /* j->r - l + 1 < k === j->l < k + l - 1 */
                            for (int L = 0, R = sz[j]-1; L <= R;)
                            {
                                int M = (L+R)/2;
                                if (a[f[j*V+M]].r < k + l - 1) L = M + 1, cnt = wf[j*V+M];
                                else R = M - 1;
                            }
                            z -= cnt;
                        }
                    }
                }

                /* count in buffer */
                for (struct line *j = c; j < c + nc; ++j) z -= (min(j->r, r) - max(j->l, l) + 1 < k) * j->w;
                lastans = (z += S);
                printf("%d\n", z);
                break;
        }
    }
    return 0;
}

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     scanf("%d%d", &n, &t);
      |     ~~~~~^~~~~~~~~~~~~~~~
segments.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         scanf("%d%d", &op, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~
segments.cpp:68:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |                 scanf("%d", &y);
      |                 ~~~~~^~~~~~~~~~
segments.cpp:81:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |                 scanf("%d%d", &y, &k); z=0;
      |                 ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8612 KB Output is correct
3 Correct 8 ms 8684 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 9 ms 8540 KB Output is correct
6 Correct 9 ms 8696 KB Output is correct
7 Correct 7 ms 8540 KB Output is correct
8 Correct 9 ms 8540 KB Output is correct
9 Correct 9 ms 8540 KB Output is correct
10 Correct 10 ms 8536 KB Output is correct
11 Correct 7 ms 8540 KB Output is correct
12 Correct 7 ms 8656 KB Output is correct
13 Correct 10 ms 8632 KB Output is correct
14 Correct 10 ms 8704 KB Output is correct
15 Correct 8 ms 8540 KB Output is correct
16 Correct 6 ms 8540 KB Output is correct
17 Correct 8 ms 8536 KB Output is correct
18 Correct 10 ms 8712 KB Output is correct
19 Correct 10 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 527 ms 9148 KB Output is correct
2 Correct 500 ms 9152 KB Output is correct
3 Correct 503 ms 9224 KB Output is correct
4 Correct 529 ms 9244 KB Output is correct
5 Correct 806 ms 9568 KB Output is correct
6 Correct 819 ms 9780 KB Output is correct
7 Correct 505 ms 9184 KB Output is correct
8 Correct 531 ms 9164 KB Output is correct
9 Correct 500 ms 9136 KB Output is correct
10 Correct 235 ms 9340 KB Output is correct
11 Correct 291 ms 9132 KB Output is correct
12 Correct 663 ms 9328 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 9452 KB Output is correct
2 Correct 479 ms 9420 KB Output is correct
3 Correct 485 ms 9604 KB Output is correct
4 Correct 468 ms 9444 KB Output is correct
5 Correct 762 ms 9412 KB Output is correct
6 Correct 679 ms 9348 KB Output is correct
7 Correct 729 ms 9320 KB Output is correct
8 Correct 829 ms 9672 KB Output is correct
9 Correct 836 ms 9684 KB Output is correct
10 Correct 798 ms 9612 KB Output is correct
11 Correct 510 ms 9444 KB Output is correct
12 Correct 797 ms 9720 KB Output is correct
13 Correct 717 ms 9496 KB Output is correct
14 Correct 604 ms 9504 KB Output is correct
15 Correct 603 ms 9520 KB Output is correct
16 Correct 531 ms 9512 KB Output is correct
17 Correct 587 ms 9136 KB Output is correct
18 Correct 594 ms 9172 KB Output is correct
19 Correct 590 ms 9388 KB Output is correct
20 Correct 604 ms 9532 KB Output is correct
21 Correct 511 ms 9468 KB Output is correct
22 Correct 723 ms 9684 KB Output is correct
23 Correct 770 ms 9680 KB Output is correct
24 Correct 693 ms 9588 KB Output is correct
25 Correct 476 ms 9416 KB Output is correct
26 Correct 492 ms 9456 KB Output is correct
27 Correct 483 ms 9520 KB Output is correct
28 Correct 467 ms 9420 KB Output is correct
29 Correct 745 ms 9428 KB Output is correct
30 Correct 786 ms 9464 KB Output is correct
31 Correct 831 ms 9612 KB Output is correct
32 Correct 805 ms 9580 KB Output is correct
33 Correct 759 ms 9628 KB Output is correct
34 Correct 577 ms 9608 KB Output is correct
35 Correct 672 ms 9452 KB Output is correct
36 Correct 758 ms 9620 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 9516 KB Output is correct
2 Correct 447 ms 9600 KB Output is correct
3 Correct 437 ms 9424 KB Output is correct
4 Correct 458 ms 9512 KB Output is correct
5 Correct 698 ms 9396 KB Output is correct
6 Correct 223 ms 9084 KB Output is correct
7 Correct 730 ms 9472 KB Output is correct
8 Correct 236 ms 9136 KB Output is correct
9 Correct 666 ms 9708 KB Output is correct
10 Correct 776 ms 9596 KB Output is correct
11 Correct 509 ms 9472 KB Output is correct
12 Correct 822 ms 9668 KB Output is correct
13 Correct 728 ms 9576 KB Output is correct
14 Correct 619 ms 9508 KB Output is correct
15 Correct 812 ms 9616 KB Output is correct
16 Correct 734 ms 9472 KB Output is correct
17 Correct 499 ms 9156 KB Output is correct
18 Correct 496 ms 9184 KB Output is correct
19 Correct 521 ms 9152 KB Output is correct
20 Correct 501 ms 9152 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8612 KB Output is correct
3 Correct 8 ms 8684 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 9 ms 8540 KB Output is correct
6 Correct 9 ms 8696 KB Output is correct
7 Correct 7 ms 8540 KB Output is correct
8 Correct 9 ms 8540 KB Output is correct
9 Correct 9 ms 8540 KB Output is correct
10 Correct 10 ms 8536 KB Output is correct
11 Correct 7 ms 8540 KB Output is correct
12 Correct 7 ms 8656 KB Output is correct
13 Correct 10 ms 8632 KB Output is correct
14 Correct 10 ms 8704 KB Output is correct
15 Correct 8 ms 8540 KB Output is correct
16 Correct 6 ms 8540 KB Output is correct
17 Correct 8 ms 8536 KB Output is correct
18 Correct 10 ms 8712 KB Output is correct
19 Correct 10 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct
21 Correct 527 ms 9148 KB Output is correct
22 Correct 500 ms 9152 KB Output is correct
23 Correct 503 ms 9224 KB Output is correct
24 Correct 529 ms 9244 KB Output is correct
25 Correct 806 ms 9568 KB Output is correct
26 Correct 819 ms 9780 KB Output is correct
27 Correct 505 ms 9184 KB Output is correct
28 Correct 531 ms 9164 KB Output is correct
29 Correct 500 ms 9136 KB Output is correct
30 Correct 235 ms 9340 KB Output is correct
31 Correct 291 ms 9132 KB Output is correct
32 Correct 663 ms 9328 KB Output is correct
33 Correct 458 ms 9516 KB Output is correct
34 Correct 447 ms 9600 KB Output is correct
35 Correct 437 ms 9424 KB Output is correct
36 Correct 458 ms 9512 KB Output is correct
37 Correct 698 ms 9396 KB Output is correct
38 Correct 223 ms 9084 KB Output is correct
39 Correct 730 ms 9472 KB Output is correct
40 Correct 236 ms 9136 KB Output is correct
41 Correct 666 ms 9708 KB Output is correct
42 Correct 776 ms 9596 KB Output is correct
43 Correct 509 ms 9472 KB Output is correct
44 Correct 822 ms 9668 KB Output is correct
45 Correct 728 ms 9576 KB Output is correct
46 Correct 619 ms 9508 KB Output is correct
47 Correct 812 ms 9616 KB Output is correct
48 Correct 734 ms 9472 KB Output is correct
49 Correct 499 ms 9156 KB Output is correct
50 Correct 496 ms 9184 KB Output is correct
51 Correct 521 ms 9152 KB Output is correct
52 Correct 501 ms 9152 KB Output is correct
53 Correct 430 ms 9404 KB Output is correct
54 Correct 442 ms 9416 KB Output is correct
55 Correct 429 ms 9424 KB Output is correct
56 Correct 450 ms 9408 KB Output is correct
57 Correct 374 ms 9004 KB Output is correct
58 Correct 150 ms 9040 KB Output is correct
59 Correct 568 ms 9224 KB Output is correct
60 Correct 203 ms 9300 KB Output is correct
61 Correct 735 ms 9568 KB Output is correct
62 Correct 808 ms 9592 KB Output is correct
63 Correct 819 ms 9604 KB Output is correct
64 Correct 808 ms 9588 KB Output is correct
65 Correct 546 ms 9524 KB Output is correct
66 Correct 535 ms 9492 KB Output is correct
67 Correct 750 ms 9612 KB Output is correct
68 Correct 667 ms 9512 KB Output is correct
69 Correct 503 ms 9156 KB Output is correct
70 Correct 511 ms 9440 KB Output is correct
71 Correct 501 ms 9204 KB Output is correct
72 Correct 507 ms 9192 KB Output is correct
73 Correct 590 ms 9592 KB Output is correct
74 Correct 678 ms 9640 KB Output is correct
75 Correct 834 ms 9632 KB Output is correct
76 Correct 813 ms 9632 KB Output is correct
77 Correct 433 ms 9420 KB Output is correct
78 Correct 435 ms 9672 KB Output is correct
79 Correct 453 ms 9432 KB Output is correct
80 Correct 440 ms 9456 KB Output is correct
81 Correct 692 ms 9544 KB Output is correct
82 Correct 573 ms 9596 KB Output is correct
83 Correct 534 ms 9628 KB Output is correct
84 Correct 694 ms 9704 KB Output is correct
85 Correct 753 ms 9608 KB Output is correct
86 Correct 760 ms 9864 KB Output is correct
87 Correct 643 ms 9520 KB Output is correct
88 Correct 542 ms 9536 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8612 KB Output is correct
3 Correct 8 ms 8684 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 9 ms 8540 KB Output is correct
6 Correct 9 ms 8696 KB Output is correct
7 Correct 7 ms 8540 KB Output is correct
8 Correct 9 ms 8540 KB Output is correct
9 Correct 9 ms 8540 KB Output is correct
10 Correct 10 ms 8536 KB Output is correct
11 Correct 7 ms 8540 KB Output is correct
12 Correct 7 ms 8656 KB Output is correct
13 Correct 10 ms 8632 KB Output is correct
14 Correct 10 ms 8704 KB Output is correct
15 Correct 8 ms 8540 KB Output is correct
16 Correct 6 ms 8540 KB Output is correct
17 Correct 8 ms 8536 KB Output is correct
18 Correct 10 ms 8712 KB Output is correct
19 Correct 10 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct
21 Correct 527 ms 9148 KB Output is correct
22 Correct 500 ms 9152 KB Output is correct
23 Correct 503 ms 9224 KB Output is correct
24 Correct 529 ms 9244 KB Output is correct
25 Correct 806 ms 9568 KB Output is correct
26 Correct 819 ms 9780 KB Output is correct
27 Correct 505 ms 9184 KB Output is correct
28 Correct 531 ms 9164 KB Output is correct
29 Correct 500 ms 9136 KB Output is correct
30 Correct 235 ms 9340 KB Output is correct
31 Correct 291 ms 9132 KB Output is correct
32 Correct 663 ms 9328 KB Output is correct
33 Correct 478 ms 9452 KB Output is correct
34 Correct 479 ms 9420 KB Output is correct
35 Correct 485 ms 9604 KB Output is correct
36 Correct 468 ms 9444 KB Output is correct
37 Correct 762 ms 9412 KB Output is correct
38 Correct 679 ms 9348 KB Output is correct
39 Correct 729 ms 9320 KB Output is correct
40 Correct 829 ms 9672 KB Output is correct
41 Correct 836 ms 9684 KB Output is correct
42 Correct 798 ms 9612 KB Output is correct
43 Correct 510 ms 9444 KB Output is correct
44 Correct 797 ms 9720 KB Output is correct
45 Correct 717 ms 9496 KB Output is correct
46 Correct 604 ms 9504 KB Output is correct
47 Correct 603 ms 9520 KB Output is correct
48 Correct 531 ms 9512 KB Output is correct
49 Correct 587 ms 9136 KB Output is correct
50 Correct 594 ms 9172 KB Output is correct
51 Correct 590 ms 9388 KB Output is correct
52 Correct 604 ms 9532 KB Output is correct
53 Correct 511 ms 9468 KB Output is correct
54 Correct 723 ms 9684 KB Output is correct
55 Correct 770 ms 9680 KB Output is correct
56 Correct 693 ms 9588 KB Output is correct
57 Correct 476 ms 9416 KB Output is correct
58 Correct 492 ms 9456 KB Output is correct
59 Correct 483 ms 9520 KB Output is correct
60 Correct 467 ms 9420 KB Output is correct
61 Correct 745 ms 9428 KB Output is correct
62 Correct 786 ms 9464 KB Output is correct
63 Correct 831 ms 9612 KB Output is correct
64 Correct 805 ms 9580 KB Output is correct
65 Correct 759 ms 9628 KB Output is correct
66 Correct 577 ms 9608 KB Output is correct
67 Correct 672 ms 9452 KB Output is correct
68 Correct 758 ms 9620 KB Output is correct
69 Correct 458 ms 9516 KB Output is correct
70 Correct 447 ms 9600 KB Output is correct
71 Correct 437 ms 9424 KB Output is correct
72 Correct 458 ms 9512 KB Output is correct
73 Correct 698 ms 9396 KB Output is correct
74 Correct 223 ms 9084 KB Output is correct
75 Correct 730 ms 9472 KB Output is correct
76 Correct 236 ms 9136 KB Output is correct
77 Correct 666 ms 9708 KB Output is correct
78 Correct 776 ms 9596 KB Output is correct
79 Correct 509 ms 9472 KB Output is correct
80 Correct 822 ms 9668 KB Output is correct
81 Correct 728 ms 9576 KB Output is correct
82 Correct 619 ms 9508 KB Output is correct
83 Correct 812 ms 9616 KB Output is correct
84 Correct 734 ms 9472 KB Output is correct
85 Correct 499 ms 9156 KB Output is correct
86 Correct 496 ms 9184 KB Output is correct
87 Correct 521 ms 9152 KB Output is correct
88 Correct 501 ms 9152 KB Output is correct
89 Correct 430 ms 9404 KB Output is correct
90 Correct 442 ms 9416 KB Output is correct
91 Correct 429 ms 9424 KB Output is correct
92 Correct 450 ms 9408 KB Output is correct
93 Correct 374 ms 9004 KB Output is correct
94 Correct 150 ms 9040 KB Output is correct
95 Correct 568 ms 9224 KB Output is correct
96 Correct 203 ms 9300 KB Output is correct
97 Correct 735 ms 9568 KB Output is correct
98 Correct 808 ms 9592 KB Output is correct
99 Correct 819 ms 9604 KB Output is correct
100 Correct 808 ms 9588 KB Output is correct
101 Correct 546 ms 9524 KB Output is correct
102 Correct 535 ms 9492 KB Output is correct
103 Correct 750 ms 9612 KB Output is correct
104 Correct 667 ms 9512 KB Output is correct
105 Correct 503 ms 9156 KB Output is correct
106 Correct 511 ms 9440 KB Output is correct
107 Correct 501 ms 9204 KB Output is correct
108 Correct 507 ms 9192 KB Output is correct
109 Correct 590 ms 9592 KB Output is correct
110 Correct 678 ms 9640 KB Output is correct
111 Correct 834 ms 9632 KB Output is correct
112 Correct 813 ms 9632 KB Output is correct
113 Correct 433 ms 9420 KB Output is correct
114 Correct 435 ms 9672 KB Output is correct
115 Correct 453 ms 9432 KB Output is correct
116 Correct 440 ms 9456 KB Output is correct
117 Correct 692 ms 9544 KB Output is correct
118 Correct 573 ms 9596 KB Output is correct
119 Correct 534 ms 9628 KB Output is correct
120 Correct 694 ms 9704 KB Output is correct
121 Correct 753 ms 9608 KB Output is correct
122 Correct 760 ms 9864 KB Output is correct
123 Correct 643 ms 9520 KB Output is correct
124 Correct 542 ms 9536 KB Output is correct
125 Correct 1287 ms 10156 KB Output is correct
126 Correct 1242 ms 10184 KB Output is correct
127 Correct 1250 ms 10224 KB Output is correct
128 Correct 1253 ms 10212 KB Output is correct
129 Correct 1253 ms 10172 KB Output is correct
130 Correct 1230 ms 10224 KB Output is correct
131 Correct 549 ms 9732 KB Output is correct
132 Correct 1344 ms 9696 KB Output is correct
133 Correct 1727 ms 9984 KB Output is correct
134 Correct 650 ms 9648 KB Output is correct
135 Correct 1845 ms 9996 KB Output is correct
136 Incorrect 453 ms 9576 KB Output isn't correct
137 Halted 0 ms 0 KB -