oj.uz

Submission #868107

# Submission time Handle Problem Language Result Execution time Memory
868107 2023-10-30T12:40:31 Z sleepntsheep Segments (IZhO18_segments) C++17
75 / 100
 1897 ms 15864 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
#define V0 6666
int V;

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

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;
    if (a->r - a->l != b->r - b->l) return ((a->r - a->l) - (b->r - b->l));
    if (a->l != b->l) return a->l - b->l;
    return a->w - b->w;
}

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

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

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);
        if (op == 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;
        }
        else if (op == 2)
        {
            c[nc++] = (struct line){o[x].l, o[x].r, -1};
            if (nc == V) rebuild();
            --S;
        }
        else
        {
            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)
                {
                    if (Z)
                        z -= pf[Z-1];
                    int zb = Z/V, sb = zb+1;
                    for (struct line *j = a + Z; j < a + sb * V; ++j) if (j->r < l + k - 1 || j->l > r - k + 1) z -= 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)
            {
                if (min(j->r, r) - max(j->l, l) + 1 < k) z -= j->w;
                //if (j->r < l + k - 1 || j->l > r - k + 1) z -= j->w;
            }
            lastans = (z += S);
            printf("%d\n", z);
        }
    }
    return 0;
}

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%d%d", &n, &t);
      |     ~~~~~^~~~~~~~~~~~~~~~
segments.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |         scanf("%d%d", &op, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~
segments.cpp:74:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |             scanf("%d", &y);
      |             ~~~~~^~~~~~~~~~
segments.cpp:89:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |             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 8540 KB Output is correct
3 Correct 7 ms 8952 KB Output is correct
4 Correct 7 ms 8540 KB Output is correct
5 Correct 9 ms 8708 KB Output is correct
6 Correct 9 ms 8712 KB Output is correct
7 Correct 8 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 9 ms 8536 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 10 ms 8676 KB Output is correct
14 Correct 11 ms 8796 KB Output is correct
15 Correct 7 ms 8540 KB Output is correct
16 Correct 7 ms 8540 KB Output is correct
17 Correct 8 ms 8668 KB Output is correct
18 Correct 10 ms 8540 KB Output is correct
19 Correct 8 ms 8540 KB Output is correct
20 Correct 8 ms 8536 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 9336 KB Output is correct
2 Correct 510 ms 9324 KB Output is correct
3 Correct 503 ms 9708 KB Output is correct
4 Correct 535 ms 9572 KB Output is correct
5 Correct 808 ms 10252 KB Output is correct
6 Correct 843 ms 10368 KB Output is correct
7 Correct 503 ms 9556 KB Output is correct
8 Correct 511 ms 9344 KB Output is correct
9 Correct 506 ms 9320 KB Output is correct
10 Correct 229 ms 9020 KB Output is correct
11 Correct 293 ms 9156 KB Output is correct
12 Correct 668 ms 9724 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 9880 KB Output is correct
2 Correct 479 ms 9784 KB Output is correct
3 Correct 480 ms 9808 KB Output is correct
4 Correct 481 ms 9808 KB Output is correct
5 Correct 719 ms 9728 KB Output is correct
6 Correct 669 ms 9460 KB Output is correct
7 Correct 696 ms 9572 KB Output is correct
8 Correct 840 ms 10256 KB Output is correct
9 Correct 868 ms 10352 KB Output is correct
10 Correct 811 ms 10516 KB Output is correct
11 Correct 528 ms 9860 KB Output is correct
12 Correct 816 ms 10400 KB Output is correct
13 Correct 784 ms 10468 KB Output is correct
14 Correct 606 ms 9920 KB Output is correct
15 Correct 602 ms 9928 KB Output is correct
16 Correct 584 ms 9960 KB Output is correct
17 Correct 607 ms 9472 KB Output is correct
18 Correct 608 ms 9376 KB Output is correct
19 Correct 594 ms 9500 KB Output is correct
20 Correct 640 ms 9384 KB Output is correct
21 Correct 553 ms 9960 KB Output is correct
22 Correct 710 ms 9960 KB Output is correct
23 Correct 781 ms 10176 KB Output is correct
24 Correct 725 ms 9988 KB Output is correct
25 Correct 516 ms 9708 KB Output is correct
26 Correct 506 ms 9696 KB Output is correct
27 Correct 512 ms 9716 KB Output is correct
28 Correct 529 ms 9800 KB Output is correct
29 Correct 804 ms 10072 KB Output is correct
30 Correct 766 ms 10208 KB Output is correct
31 Correct 891 ms 10604 KB Output is correct
32 Correct 797 ms 10204 KB Output is correct
33 Correct 769 ms 10072 KB Output is correct
34 Correct 588 ms 10000 KB Output is correct
35 Correct 741 ms 10192 KB Output is correct
36 Correct 779 ms 10280 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 464 ms 9756 KB Output is correct
2 Correct 470 ms 9812 KB Output is correct
3 Correct 445 ms 9776 KB Output is correct
4 Correct 494 ms 9668 KB Output is correct
5 Correct 708 ms 9816 KB Output is correct
6 Correct 241 ms 9064 KB Output is correct
7 Correct 741 ms 10068 KB Output is correct
8 Correct 263 ms 9112 KB Output is correct
9 Correct 677 ms 9940 KB Output is correct
10 Correct 835 ms 10228 KB Output is correct
11 Correct 550 ms 9840 KB Output is correct
12 Correct 852 ms 10400 KB Output is correct
13 Correct 746 ms 10188 KB Output is correct
14 Correct 692 ms 9948 KB Output is correct
15 Correct 821 ms 10356 KB Output is correct
16 Correct 777 ms 10160 KB Output is correct
17 Correct 517 ms 9660 KB Output is correct
18 Correct 503 ms 9316 KB Output is correct
19 Correct 540 ms 9328 KB Output is correct
20 Correct 517 ms 9444 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 8540 KB Output is correct
3 Correct 7 ms 8952 KB Output is correct
4 Correct 7 ms 8540 KB Output is correct
5 Correct 9 ms 8708 KB Output is correct
6 Correct 9 ms 8712 KB Output is correct
7 Correct 8 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 9 ms 8536 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 10 ms 8676 KB Output is correct
14 Correct 11 ms 8796 KB Output is correct
15 Correct 7 ms 8540 KB Output is correct
16 Correct 7 ms 8540 KB Output is correct
17 Correct 8 ms 8668 KB Output is correct
18 Correct 10 ms 8540 KB Output is correct
19 Correct 8 ms 8540 KB Output is correct
20 Correct 8 ms 8536 KB Output is correct
21 Correct 526 ms 9336 KB Output is correct
22 Correct 510 ms 9324 KB Output is correct
23 Correct 503 ms 9708 KB Output is correct
24 Correct 535 ms 9572 KB Output is correct
25 Correct 808 ms 10252 KB Output is correct
26 Correct 843 ms 10368 KB Output is correct
27 Correct 503 ms 9556 KB Output is correct
28 Correct 511 ms 9344 KB Output is correct
29 Correct 506 ms 9320 KB Output is correct
30 Correct 229 ms 9020 KB Output is correct
31 Correct 293 ms 9156 KB Output is correct
32 Correct 668 ms 9724 KB Output is correct
33 Correct 464 ms 9756 KB Output is correct
34 Correct 470 ms 9812 KB Output is correct
35 Correct 445 ms 9776 KB Output is correct
36 Correct 494 ms 9668 KB Output is correct
37 Correct 708 ms 9816 KB Output is correct
38 Correct 241 ms 9064 KB Output is correct
39 Correct 741 ms 10068 KB Output is correct
40 Correct 263 ms 9112 KB Output is correct
41 Correct 677 ms 9940 KB Output is correct
42 Correct 835 ms 10228 KB Output is correct
43 Correct 550 ms 9840 KB Output is correct
44 Correct 852 ms 10400 KB Output is correct
45 Correct 746 ms 10188 KB Output is correct
46 Correct 692 ms 9948 KB Output is correct
47 Correct 821 ms 10356 KB Output is correct
48 Correct 777 ms 10160 KB Output is correct
49 Correct 517 ms 9660 KB Output is correct
50 Correct 503 ms 9316 KB Output is correct
51 Correct 540 ms 9328 KB Output is correct
52 Correct 517 ms 9444 KB Output is correct
53 Correct 444 ms 9684 KB Output is correct
54 Correct 464 ms 9792 KB Output is correct
55 Correct 498 ms 9844 KB Output is correct
56 Correct 462 ms 9640 KB Output is correct
57 Correct 389 ms 9288 KB Output is correct
58 Correct 159 ms 9076 KB Output is correct
59 Correct 595 ms 9504 KB Output is correct
60 Correct 200 ms 9312 KB Output is correct
61 Correct 785 ms 10288 KB Output is correct
62 Correct 806 ms 10360 KB Output is correct
63 Correct 845 ms 10512 KB Output is correct
64 Correct 817 ms 10788 KB Output is correct
65 Correct 578 ms 10004 KB Output is correct
66 Correct 537 ms 9900 KB Output is correct
67 Correct 759 ms 10172 KB Output is correct
68 Correct 682 ms 10124 KB Output is correct
69 Correct 509 ms 9592 KB Output is correct
70 Correct 500 ms 9324 KB Output is correct
71 Correct 505 ms 9456 KB Output is correct
72 Correct 512 ms 9420 KB Output is correct
73 Correct 585 ms 10168 KB Output is correct
74 Correct 688 ms 10000 KB Output is correct
75 Correct 858 ms 10376 KB Output is correct
76 Correct 819 ms 10304 KB Output is correct
77 Correct 437 ms 9656 KB Output is correct
78 Correct 443 ms 9748 KB Output is correct
79 Correct 446 ms 9716 KB Output is correct
80 Correct 440 ms 9916 KB Output is correct
81 Correct 694 ms 10244 KB Output is correct
82 Correct 584 ms 10196 KB Output is correct
83 Correct 521 ms 9832 KB Output is correct
84 Correct 693 ms 10308 KB Output is correct
85 Correct 761 ms 10208 KB Output is correct
86 Correct 781 ms 10548 KB Output is correct
87 Correct 635 ms 10024 KB Output is correct
88 Correct 530 ms 10104 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 8540 KB Output is correct
3 Correct 7 ms 8952 KB Output is correct
4 Correct 7 ms 8540 KB Output is correct
5 Correct 9 ms 8708 KB Output is correct
6 Correct 9 ms 8712 KB Output is correct
7 Correct 8 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 9 ms 8536 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 10 ms 8676 KB Output is correct
14 Correct 11 ms 8796 KB Output is correct
15 Correct 7 ms 8540 KB Output is correct
16 Correct 7 ms 8540 KB Output is correct
17 Correct 8 ms 8668 KB Output is correct
18 Correct 10 ms 8540 KB Output is correct
19 Correct 8 ms 8540 KB Output is correct
20 Correct 8 ms 8536 KB Output is correct
21 Correct 526 ms 9336 KB Output is correct
22 Correct 510 ms 9324 KB Output is correct
23 Correct 503 ms 9708 KB Output is correct
24 Correct 535 ms 9572 KB Output is correct
25 Correct 808 ms 10252 KB Output is correct
26 Correct 843 ms 10368 KB Output is correct
27 Correct 503 ms 9556 KB Output is correct
28 Correct 511 ms 9344 KB Output is correct
29 Correct 506 ms 9320 KB Output is correct
30 Correct 229 ms 9020 KB Output is correct
31 Correct 293 ms 9156 KB Output is correct
32 Correct 668 ms 9724 KB Output is correct
33 Correct 483 ms 9880 KB Output is correct
34 Correct 479 ms 9784 KB Output is correct
35 Correct 480 ms 9808 KB Output is correct
36 Correct 481 ms 9808 KB Output is correct
37 Correct 719 ms 9728 KB Output is correct
38 Correct 669 ms 9460 KB Output is correct
39 Correct 696 ms 9572 KB Output is correct
40 Correct 840 ms 10256 KB Output is correct
41 Correct 868 ms 10352 KB Output is correct
42 Correct 811 ms 10516 KB Output is correct
43 Correct 528 ms 9860 KB Output is correct
44 Correct 816 ms 10400 KB Output is correct
45 Correct 784 ms 10468 KB Output is correct
46 Correct 606 ms 9920 KB Output is correct
47 Correct 602 ms 9928 KB Output is correct
48 Correct 584 ms 9960 KB Output is correct
49 Correct 607 ms 9472 KB Output is correct
50 Correct 608 ms 9376 KB Output is correct
51 Correct 594 ms 9500 KB Output is correct
52 Correct 640 ms 9384 KB Output is correct
53 Correct 553 ms 9960 KB Output is correct
54 Correct 710 ms 9960 KB Output is correct
55 Correct 781 ms 10176 KB Output is correct
56 Correct 725 ms 9988 KB Output is correct
57 Correct 516 ms 9708 KB Output is correct
58 Correct 506 ms 9696 KB Output is correct
59 Correct 512 ms 9716 KB Output is correct
60 Correct 529 ms 9800 KB Output is correct
61 Correct 804 ms 10072 KB Output is correct
62 Correct 766 ms 10208 KB Output is correct
63 Correct 891 ms 10604 KB Output is correct
64 Correct 797 ms 10204 KB Output is correct
65 Correct 769 ms 10072 KB Output is correct
66 Correct 588 ms 10000 KB Output is correct
67 Correct 741 ms 10192 KB Output is correct
68 Correct 779 ms 10280 KB Output is correct
69 Correct 464 ms 9756 KB Output is correct
70 Correct 470 ms 9812 KB Output is correct
71 Correct 445 ms 9776 KB Output is correct
72 Correct 494 ms 9668 KB Output is correct
73 Correct 708 ms 9816 KB Output is correct
74 Correct 241 ms 9064 KB Output is correct
75 Correct 741 ms 10068 KB Output is correct
76 Correct 263 ms 9112 KB Output is correct
77 Correct 677 ms 9940 KB Output is correct
78 Correct 835 ms 10228 KB Output is correct
79 Correct 550 ms 9840 KB Output is correct
80 Correct 852 ms 10400 KB Output is correct
81 Correct 746 ms 10188 KB Output is correct
82 Correct 692 ms 9948 KB Output is correct
83 Correct 821 ms 10356 KB Output is correct
84 Correct 777 ms 10160 KB Output is correct
85 Correct 517 ms 9660 KB Output is correct
86 Correct 503 ms 9316 KB Output is correct
87 Correct 540 ms 9328 KB Output is correct
88 Correct 517 ms 9444 KB Output is correct
89 Correct 444 ms 9684 KB Output is correct
90 Correct 464 ms 9792 KB Output is correct
91 Correct 498 ms 9844 KB Output is correct
92 Correct 462 ms 9640 KB Output is correct
93 Correct 389 ms 9288 KB Output is correct
94 Correct 159 ms 9076 KB Output is correct
95 Correct 595 ms 9504 KB Output is correct
96 Correct 200 ms 9312 KB Output is correct
97 Correct 785 ms 10288 KB Output is correct
98 Correct 806 ms 10360 KB Output is correct
99 Correct 845 ms 10512 KB Output is correct
100 Correct 817 ms 10788 KB Output is correct
101 Correct 578 ms 10004 KB Output is correct
102 Correct 537 ms 9900 KB Output is correct
103 Correct 759 ms 10172 KB Output is correct
104 Correct 682 ms 10124 KB Output is correct
105 Correct 509 ms 9592 KB Output is correct
106 Correct 500 ms 9324 KB Output is correct
107 Correct 505 ms 9456 KB Output is correct
108 Correct 512 ms 9420 KB Output is correct
109 Correct 585 ms 10168 KB Output is correct
110 Correct 688 ms 10000 KB Output is correct
111 Correct 858 ms 10376 KB Output is correct
112 Correct 819 ms 10304 KB Output is correct
113 Correct 437 ms 9656 KB Output is correct
114 Correct 443 ms 9748 KB Output is correct
115 Correct 446 ms 9716 KB Output is correct
116 Correct 440 ms 9916 KB Output is correct
117 Correct 694 ms 10244 KB Output is correct
118 Correct 584 ms 10196 KB Output is correct
119 Correct 521 ms 9832 KB Output is correct
120 Correct 693 ms 10308 KB Output is correct
121 Correct 761 ms 10208 KB Output is correct
122 Correct 781 ms 10548 KB Output is correct
123 Correct 635 ms 10024 KB Output is correct
124 Correct 530 ms 10104 KB Output is correct
125 Correct 1292 ms 11388 KB Output is correct
126 Correct 1286 ms 11228 KB Output is correct
127 Correct 1294 ms 11592 KB Output is correct
128 Correct 1300 ms 11256 KB Output is correct
129 Correct 1296 ms 11256 KB Output is correct
130 Correct 1274 ms 11224 KB Output is correct
131 Correct 544 ms 9592 KB Output is correct
132 Correct 1359 ms 10704 KB Output is correct
133 Correct 1779 ms 15784 KB Output is correct
134 Correct 676 ms 15812 KB Output is correct
135 Correct 1897 ms 15864 KB Output is correct
136 Incorrect 455 ms 15752 KB Output isn't correct
137 Halted 0 ms 0 KB -