oj.uz

Submission #868119

# Submission time Handle Problem Language Result Execution time Memory
868119 2023-10-30T12:57:56 Z sleepntsheep Segments (IZhO18_segments) C++17
75 / 100
 1851 ms 10828 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;
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);
    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 id = 1, S = 0, 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, cnt; j * V <= na; ++j)
                        {
                            /* r - j->l + 1 < k === j->l > r - k + 1 */
                            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;
                printf("%d\n", lastans = (z += S));
                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 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 7 ms 8872 KB Output is correct
4 Correct 6 ms 9048 KB Output is correct
5 Correct 9 ms 9072 KB Output is correct
6 Correct 9 ms 9052 KB Output is correct
7 Correct 7 ms 8876 KB Output is correct
8 Correct 10 ms 9052 KB Output is correct
9 Correct 10 ms 9072 KB Output is correct
10 Correct 10 ms 9092 KB Output is correct
11 Correct 7 ms 9052 KB Output is correct
12 Correct 7 ms 9052 KB Output is correct
13 Correct 11 ms 9096 KB Output is correct
14 Correct 9 ms 9048 KB Output is correct
15 Correct 6 ms 9052 KB Output is correct
16 Correct 7 ms 9048 KB Output is correct
17 Correct 8 ms 9048 KB Output is correct
18 Correct 10 ms 9052 KB Output is correct
19 Correct 8 ms 9048 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 9544 KB Output is correct
2 Correct 500 ms 9560 KB Output is correct
3 Correct 501 ms 9540 KB Output is correct
4 Correct 536 ms 9600 KB Output is correct
5 Correct 799 ms 10200 KB Output is correct
6 Correct 826 ms 10152 KB Output is correct
7 Correct 498 ms 9536 KB Output is correct
8 Correct 507 ms 9752 KB Output is correct
9 Correct 501 ms 9824 KB Output is correct
10 Correct 227 ms 9404 KB Output is correct
11 Correct 291 ms 9712 KB Output is correct
12 Correct 636 ms 9824 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 10220 KB Output is correct
2 Correct 470 ms 9808 KB Output is correct
3 Correct 483 ms 9872 KB Output is correct
4 Correct 479 ms 10024 KB Output is correct
5 Correct 714 ms 9720 KB Output is correct
6 Correct 656 ms 9596 KB Output is correct
7 Correct 690 ms 9772 KB Output is correct
8 Correct 832 ms 9968 KB Output is correct
9 Correct 829 ms 9968 KB Output is correct
10 Correct 777 ms 9896 KB Output is correct
11 Correct 495 ms 9848 KB Output is correct
12 Correct 793 ms 10008 KB Output is correct
13 Correct 716 ms 9880 KB Output is correct
14 Correct 590 ms 9904 KB Output is correct
15 Correct 584 ms 10408 KB Output is correct
16 Correct 530 ms 9868 KB Output is correct
17 Correct 636 ms 9540 KB Output is correct
18 Correct 602 ms 9636 KB Output is correct
19 Correct 598 ms 9788 KB Output is correct
20 Correct 584 ms 9568 KB Output is correct
21 Correct 524 ms 10256 KB Output is correct
22 Correct 676 ms 9948 KB Output is correct
23 Correct 735 ms 10008 KB Output is correct
24 Correct 695 ms 9872 KB Output is correct
25 Correct 473 ms 9824 KB Output is correct
26 Correct 471 ms 9808 KB Output is correct
27 Correct 483 ms 9820 KB Output is correct
28 Correct 472 ms 9952 KB Output is correct
29 Correct 745 ms 10012 KB Output is correct
30 Correct 752 ms 10028 KB Output is correct
31 Correct 829 ms 9992 KB Output is correct
32 Correct 777 ms 10004 KB Output is correct
33 Correct 723 ms 9880 KB Output is correct
34 Correct 566 ms 9896 KB Output is correct
35 Correct 672 ms 9924 KB Output is correct
36 Correct 745 ms 10240 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 9788 KB Output is correct
2 Correct 442 ms 9800 KB Output is correct
3 Correct 429 ms 9796 KB Output is correct
4 Correct 427 ms 9812 KB Output is correct
5 Correct 689 ms 9924 KB Output is correct
6 Correct 224 ms 9396 KB Output is correct
7 Correct 724 ms 10052 KB Output is correct
8 Correct 235 ms 9412 KB Output is correct
9 Correct 619 ms 9868 KB Output is correct
10 Correct 769 ms 10040 KB Output is correct
11 Correct 511 ms 10228 KB Output is correct
12 Correct 831 ms 10172 KB Output is correct
13 Correct 713 ms 10344 KB Output is correct
14 Correct 599 ms 9916 KB Output is correct
15 Correct 799 ms 10008 KB Output is correct
16 Correct 727 ms 9992 KB Output is correct
17 Correct 505 ms 9800 KB Output is correct
18 Correct 497 ms 9540 KB Output is correct
19 Correct 503 ms 9560 KB Output is correct
20 Correct 503 ms 9984 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 7 ms 8872 KB Output is correct
4 Correct 6 ms 9048 KB Output is correct
5 Correct 9 ms 9072 KB Output is correct
6 Correct 9 ms 9052 KB Output is correct
7 Correct 7 ms 8876 KB Output is correct
8 Correct 10 ms 9052 KB Output is correct
9 Correct 10 ms 9072 KB Output is correct
10 Correct 10 ms 9092 KB Output is correct
11 Correct 7 ms 9052 KB Output is correct
12 Correct 7 ms 9052 KB Output is correct
13 Correct 11 ms 9096 KB Output is correct
14 Correct 9 ms 9048 KB Output is correct
15 Correct 6 ms 9052 KB Output is correct
16 Correct 7 ms 9048 KB Output is correct
17 Correct 8 ms 9048 KB Output is correct
18 Correct 10 ms 9052 KB Output is correct
19 Correct 8 ms 9048 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct
21 Correct 520 ms 9544 KB Output is correct
22 Correct 500 ms 9560 KB Output is correct
23 Correct 501 ms 9540 KB Output is correct
24 Correct 536 ms 9600 KB Output is correct
25 Correct 799 ms 10200 KB Output is correct
26 Correct 826 ms 10152 KB Output is correct
27 Correct 498 ms 9536 KB Output is correct
28 Correct 507 ms 9752 KB Output is correct
29 Correct 501 ms 9824 KB Output is correct
30 Correct 227 ms 9404 KB Output is correct
31 Correct 291 ms 9712 KB Output is correct
32 Correct 636 ms 9824 KB Output is correct
33 Correct 438 ms 9788 KB Output is correct
34 Correct 442 ms 9800 KB Output is correct
35 Correct 429 ms 9796 KB Output is correct
36 Correct 427 ms 9812 KB Output is correct
37 Correct 689 ms 9924 KB Output is correct
38 Correct 224 ms 9396 KB Output is correct
39 Correct 724 ms 10052 KB Output is correct
40 Correct 235 ms 9412 KB Output is correct
41 Correct 619 ms 9868 KB Output is correct
42 Correct 769 ms 10040 KB Output is correct
43 Correct 511 ms 10228 KB Output is correct
44 Correct 831 ms 10172 KB Output is correct
45 Correct 713 ms 10344 KB Output is correct
46 Correct 599 ms 9916 KB Output is correct
47 Correct 799 ms 10008 KB Output is correct
48 Correct 727 ms 9992 KB Output is correct
49 Correct 505 ms 9800 KB Output is correct
50 Correct 497 ms 9540 KB Output is correct
51 Correct 503 ms 9560 KB Output is correct
52 Correct 503 ms 9984 KB Output is correct
53 Correct 430 ms 9816 KB Output is correct
54 Correct 435 ms 10048 KB Output is correct
55 Correct 427 ms 9744 KB Output is correct
56 Correct 431 ms 9988 KB Output is correct
57 Correct 369 ms 9516 KB Output is correct
58 Correct 154 ms 9556 KB Output is correct
59 Correct 567 ms 9664 KB Output is correct
60 Correct 198 ms 9640 KB Output is correct
61 Correct 721 ms 9864 KB Output is correct
62 Correct 790 ms 9956 KB Output is correct
63 Correct 807 ms 9972 KB Output is correct
64 Correct 803 ms 10036 KB Output is correct
65 Correct 540 ms 9948 KB Output is correct
66 Correct 526 ms 10172 KB Output is correct
67 Correct 742 ms 10228 KB Output is correct
68 Correct 667 ms 9952 KB Output is correct
69 Correct 500 ms 9720 KB Output is correct
70 Correct 502 ms 9552 KB Output is correct
71 Correct 494 ms 9556 KB Output is correct
72 Correct 501 ms 9644 KB Output is correct
73 Correct 572 ms 9952 KB Output is correct
74 Correct 668 ms 9908 KB Output is correct
75 Correct 837 ms 10020 KB Output is correct
76 Correct 822 ms 9996 KB Output is correct
77 Correct 430 ms 9960 KB Output is correct
78 Correct 427 ms 9788 KB Output is correct
79 Correct 434 ms 9816 KB Output is correct
80 Correct 427 ms 10032 KB Output is correct
81 Correct 671 ms 9924 KB Output is correct
82 Correct 575 ms 10088 KB Output is correct
83 Correct 505 ms 9956 KB Output is correct
84 Correct 675 ms 9916 KB Output is correct
85 Correct 741 ms 9980 KB Output is correct
86 Correct 762 ms 10280 KB Output is correct
87 Correct 626 ms 10092 KB Output is correct
88 Correct 519 ms 10068 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 7 ms 8872 KB Output is correct
4 Correct 6 ms 9048 KB Output is correct
5 Correct 9 ms 9072 KB Output is correct
6 Correct 9 ms 9052 KB Output is correct
7 Correct 7 ms 8876 KB Output is correct
8 Correct 10 ms 9052 KB Output is correct
9 Correct 10 ms 9072 KB Output is correct
10 Correct 10 ms 9092 KB Output is correct
11 Correct 7 ms 9052 KB Output is correct
12 Correct 7 ms 9052 KB Output is correct
13 Correct 11 ms 9096 KB Output is correct
14 Correct 9 ms 9048 KB Output is correct
15 Correct 6 ms 9052 KB Output is correct
16 Correct 7 ms 9048 KB Output is correct
17 Correct 8 ms 9048 KB Output is correct
18 Correct 10 ms 9052 KB Output is correct
19 Correct 8 ms 9048 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct
21 Correct 520 ms 9544 KB Output is correct
22 Correct 500 ms 9560 KB Output is correct
23 Correct 501 ms 9540 KB Output is correct
24 Correct 536 ms 9600 KB Output is correct
25 Correct 799 ms 10200 KB Output is correct
26 Correct 826 ms 10152 KB Output is correct
27 Correct 498 ms 9536 KB Output is correct
28 Correct 507 ms 9752 KB Output is correct
29 Correct 501 ms 9824 KB Output is correct
30 Correct 227 ms 9404 KB Output is correct
31 Correct 291 ms 9712 KB Output is correct
32 Correct 636 ms 9824 KB Output is correct
33 Correct 477 ms 10220 KB Output is correct
34 Correct 470 ms 9808 KB Output is correct
35 Correct 483 ms 9872 KB Output is correct
36 Correct 479 ms 10024 KB Output is correct
37 Correct 714 ms 9720 KB Output is correct
38 Correct 656 ms 9596 KB Output is correct
39 Correct 690 ms 9772 KB Output is correct
40 Correct 832 ms 9968 KB Output is correct
41 Correct 829 ms 9968 KB Output is correct
42 Correct 777 ms 9896 KB Output is correct
43 Correct 495 ms 9848 KB Output is correct
44 Correct 793 ms 10008 KB Output is correct
45 Correct 716 ms 9880 KB Output is correct
46 Correct 590 ms 9904 KB Output is correct
47 Correct 584 ms 10408 KB Output is correct
48 Correct 530 ms 9868 KB Output is correct
49 Correct 636 ms 9540 KB Output is correct
50 Correct 602 ms 9636 KB Output is correct
51 Correct 598 ms 9788 KB Output is correct
52 Correct 584 ms 9568 KB Output is correct
53 Correct 524 ms 10256 KB Output is correct
54 Correct 676 ms 9948 KB Output is correct
55 Correct 735 ms 10008 KB Output is correct
56 Correct 695 ms 9872 KB Output is correct
57 Correct 473 ms 9824 KB Output is correct
58 Correct 471 ms 9808 KB Output is correct
59 Correct 483 ms 9820 KB Output is correct
60 Correct 472 ms 9952 KB Output is correct
61 Correct 745 ms 10012 KB Output is correct
62 Correct 752 ms 10028 KB Output is correct
63 Correct 829 ms 9992 KB Output is correct
64 Correct 777 ms 10004 KB Output is correct
65 Correct 723 ms 9880 KB Output is correct
66 Correct 566 ms 9896 KB Output is correct
67 Correct 672 ms 9924 KB Output is correct
68 Correct 745 ms 10240 KB Output is correct
69 Correct 438 ms 9788 KB Output is correct
70 Correct 442 ms 9800 KB Output is correct
71 Correct 429 ms 9796 KB Output is correct
72 Correct 427 ms 9812 KB Output is correct
73 Correct 689 ms 9924 KB Output is correct
74 Correct 224 ms 9396 KB Output is correct
75 Correct 724 ms 10052 KB Output is correct
76 Correct 235 ms 9412 KB Output is correct
77 Correct 619 ms 9868 KB Output is correct
78 Correct 769 ms 10040 KB Output is correct
79 Correct 511 ms 10228 KB Output is correct
80 Correct 831 ms 10172 KB Output is correct
81 Correct 713 ms 10344 KB Output is correct
82 Correct 599 ms 9916 KB Output is correct
83 Correct 799 ms 10008 KB Output is correct
84 Correct 727 ms 9992 KB Output is correct
85 Correct 505 ms 9800 KB Output is correct
86 Correct 497 ms 9540 KB Output is correct
87 Correct 503 ms 9560 KB Output is correct
88 Correct 503 ms 9984 KB Output is correct
89 Correct 430 ms 9816 KB Output is correct
90 Correct 435 ms 10048 KB Output is correct
91 Correct 427 ms 9744 KB Output is correct
92 Correct 431 ms 9988 KB Output is correct
93 Correct 369 ms 9516 KB Output is correct
94 Correct 154 ms 9556 KB Output is correct
95 Correct 567 ms 9664 KB Output is correct
96 Correct 198 ms 9640 KB Output is correct
97 Correct 721 ms 9864 KB Output is correct
98 Correct 790 ms 9956 KB Output is correct
99 Correct 807 ms 9972 KB Output is correct
100 Correct 803 ms 10036 KB Output is correct
101 Correct 540 ms 9948 KB Output is correct
102 Correct 526 ms 10172 KB Output is correct
103 Correct 742 ms 10228 KB Output is correct
104 Correct 667 ms 9952 KB Output is correct
105 Correct 500 ms 9720 KB Output is correct
106 Correct 502 ms 9552 KB Output is correct
107 Correct 494 ms 9556 KB Output is correct
108 Correct 501 ms 9644 KB Output is correct
109 Correct 572 ms 9952 KB Output is correct
110 Correct 668 ms 9908 KB Output is correct
111 Correct 837 ms 10020 KB Output is correct
112 Correct 822 ms 9996 KB Output is correct
113 Correct 430 ms 9960 KB Output is correct
114 Correct 427 ms 9788 KB Output is correct
115 Correct 434 ms 9816 KB Output is correct
116 Correct 427 ms 10032 KB Output is correct
117 Correct 671 ms 9924 KB Output is correct
118 Correct 575 ms 10088 KB Output is correct
119 Correct 505 ms 9956 KB Output is correct
120 Correct 675 ms 9916 KB Output is correct
121 Correct 741 ms 9980 KB Output is correct
122 Correct 762 ms 10280 KB Output is correct
123 Correct 626 ms 10092 KB Output is correct
124 Correct 519 ms 10068 KB Output is correct
125 Correct 1257 ms 10628 KB Output is correct
126 Correct 1237 ms 10764 KB Output is correct
127 Correct 1269 ms 10828 KB Output is correct
128 Correct 1253 ms 10568 KB Output is correct
129 Correct 1257 ms 10564 KB Output is correct
130 Correct 1231 ms 10700 KB Output is correct
131 Correct 555 ms 10420 KB Output is correct
132 Correct 1348 ms 10248 KB Output is correct
133 Correct 1739 ms 10544 KB Output is correct
134 Correct 662 ms 10284 KB Output is correct
135 Correct 1851 ms 10456 KB Output is correct
136 Incorrect 453 ms 9844 KB Output isn't correct
137 Halted 0 ms 0 KB -