oj.uz

답안 #868112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868112 2023-10-30T12:47:12 Z sleepntsheep Segments (IZhO18_segments) C++17
75 / 100
 1910 ms 10044 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[N], o[N];
int e[N], f[N], we[N], wf[N], pf_[N], sz[N], *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;
    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);
        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:65:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     scanf("%d%d", &n, &t);
      |     ~~~~~^~~~~~~~~~~~~~~~
segments.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         scanf("%d%d", &op, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~
segments.cpp:74:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |                 scanf("%d", &y);
      |                 ~~~~~^~~~~~~~~~
segments.cpp:87:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |                 scanf("%d%d", &y, &k); z=0;
      |                 ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 8 ms 8696 KB Output is correct
4 Correct 8 ms 8536 KB Output is correct
5 Correct 9 ms 8540 KB Output is correct
6 Correct 12 ms 8540 KB Output is correct
7 Correct 7 ms 8700 KB Output is correct
8 Correct 10 ms 8540 KB Output is correct
9 Correct 9 ms 8536 KB Output is correct
10 Correct 10 ms 8540 KB Output is correct
11 Correct 7 ms 8672 KB Output is correct
12 Correct 8 ms 8680 KB Output is correct
13 Correct 11 ms 8540 KB Output is correct
14 Correct 9 ms 8540 KB Output is correct
15 Correct 6 ms 8540 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 9 ms 8540 KB Output is correct
18 Correct 11 ms 8536 KB Output is correct
19 Correct 9 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 520 ms 9144 KB Output is correct
2 Correct 502 ms 9412 KB Output is correct
3 Correct 541 ms 9216 KB Output is correct
4 Correct 542 ms 9472 KB Output is correct
5 Correct 817 ms 9572 KB Output is correct
6 Correct 841 ms 9860 KB Output is correct
7 Correct 505 ms 9252 KB Output is correct
8 Correct 509 ms 9144 KB Output is correct
9 Correct 498 ms 9160 KB Output is correct
10 Correct 234 ms 9116 KB Output is correct
11 Correct 309 ms 9104 KB Output is correct
12 Correct 656 ms 9388 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 9440 KB Output is correct
2 Correct 487 ms 9408 KB Output is correct
3 Correct 482 ms 9744 KB Output is correct
4 Correct 500 ms 9396 KB Output is correct
5 Correct 738 ms 9396 KB Output is correct
6 Correct 665 ms 9416 KB Output is correct
7 Correct 707 ms 9448 KB Output is correct
8 Correct 837 ms 9628 KB Output is correct
9 Correct 876 ms 9724 KB Output is correct
10 Correct 789 ms 9692 KB Output is correct
11 Correct 510 ms 9476 KB Output is correct
12 Correct 843 ms 9632 KB Output is correct
13 Correct 764 ms 9816 KB Output is correct
14 Correct 610 ms 9792 KB Output is correct
15 Correct 589 ms 9784 KB Output is correct
16 Correct 544 ms 9460 KB Output is correct
17 Correct 600 ms 9140 KB Output is correct
18 Correct 593 ms 9184 KB Output is correct
19 Correct 614 ms 9280 KB Output is correct
20 Correct 585 ms 9164 KB Output is correct
21 Correct 530 ms 9512 KB Output is correct
22 Correct 710 ms 9880 KB Output is correct
23 Correct 766 ms 9568 KB Output is correct
24 Correct 705 ms 9444 KB Output is correct
25 Correct 475 ms 9424 KB Output is correct
26 Correct 482 ms 9440 KB Output is correct
27 Correct 475 ms 9400 KB Output is correct
28 Correct 512 ms 9380 KB Output is correct
29 Correct 763 ms 9500 KB Output is correct
30 Correct 760 ms 9684 KB Output is correct
31 Correct 847 ms 9792 KB Output is correct
32 Correct 806 ms 9824 KB Output is correct
33 Correct 750 ms 9716 KB Output is correct
34 Correct 581 ms 9524 KB Output is correct
35 Correct 688 ms 9796 KB Output is correct
36 Correct 762 ms 9524 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 9688 KB Output is correct
2 Correct 445 ms 9416 KB Output is correct
3 Correct 442 ms 9476 KB Output is correct
4 Correct 443 ms 9400 KB Output is correct
5 Correct 689 ms 9368 KB Output is correct
6 Correct 240 ms 9368 KB Output is correct
7 Correct 734 ms 9660 KB Output is correct
8 Correct 239 ms 9092 KB Output is correct
9 Correct 638 ms 9516 KB Output is correct
10 Correct 817 ms 9608 KB Output is correct
11 Correct 522 ms 9452 KB Output is correct
12 Correct 852 ms 9644 KB Output is correct
13 Correct 730 ms 9828 KB Output is correct
14 Correct 645 ms 9584 KB Output is correct
15 Correct 817 ms 9608 KB Output is correct
16 Correct 751 ms 9780 KB Output is correct
17 Correct 498 ms 9160 KB Output is correct
18 Correct 497 ms 9204 KB Output is correct
19 Correct 538 ms 9352 KB Output is correct
20 Correct 504 ms 9176 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 8 ms 8696 KB Output is correct
4 Correct 8 ms 8536 KB Output is correct
5 Correct 9 ms 8540 KB Output is correct
6 Correct 12 ms 8540 KB Output is correct
7 Correct 7 ms 8700 KB Output is correct
8 Correct 10 ms 8540 KB Output is correct
9 Correct 9 ms 8536 KB Output is correct
10 Correct 10 ms 8540 KB Output is correct
11 Correct 7 ms 8672 KB Output is correct
12 Correct 8 ms 8680 KB Output is correct
13 Correct 11 ms 8540 KB Output is correct
14 Correct 9 ms 8540 KB Output is correct
15 Correct 6 ms 8540 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 9 ms 8540 KB Output is correct
18 Correct 11 ms 8536 KB Output is correct
19 Correct 9 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct
21 Correct 520 ms 9144 KB Output is correct
22 Correct 502 ms 9412 KB Output is correct
23 Correct 541 ms 9216 KB Output is correct
24 Correct 542 ms 9472 KB Output is correct
25 Correct 817 ms 9572 KB Output is correct
26 Correct 841 ms 9860 KB Output is correct
27 Correct 505 ms 9252 KB Output is correct
28 Correct 509 ms 9144 KB Output is correct
29 Correct 498 ms 9160 KB Output is correct
30 Correct 234 ms 9116 KB Output is correct
31 Correct 309 ms 9104 KB Output is correct
32 Correct 656 ms 9388 KB Output is correct
33 Correct 451 ms 9688 KB Output is correct
34 Correct 445 ms 9416 KB Output is correct
35 Correct 442 ms 9476 KB Output is correct
36 Correct 443 ms 9400 KB Output is correct
37 Correct 689 ms 9368 KB Output is correct
38 Correct 240 ms 9368 KB Output is correct
39 Correct 734 ms 9660 KB Output is correct
40 Correct 239 ms 9092 KB Output is correct
41 Correct 638 ms 9516 KB Output is correct
42 Correct 817 ms 9608 KB Output is correct
43 Correct 522 ms 9452 KB Output is correct
44 Correct 852 ms 9644 KB Output is correct
45 Correct 730 ms 9828 KB Output is correct
46 Correct 645 ms 9584 KB Output is correct
47 Correct 817 ms 9608 KB Output is correct
48 Correct 751 ms 9780 KB Output is correct
49 Correct 498 ms 9160 KB Output is correct
50 Correct 497 ms 9204 KB Output is correct
51 Correct 538 ms 9352 KB Output is correct
52 Correct 504 ms 9176 KB Output is correct
53 Correct 480 ms 9480 KB Output is correct
54 Correct 437 ms 9608 KB Output is correct
55 Correct 434 ms 9424 KB Output is correct
56 Correct 473 ms 9568 KB Output is correct
57 Correct 362 ms 8996 KB Output is correct
58 Correct 166 ms 9144 KB Output is correct
59 Correct 578 ms 9300 KB Output is correct
60 Correct 192 ms 9040 KB Output is correct
61 Correct 737 ms 9744 KB Output is correct
62 Correct 810 ms 9648 KB Output is correct
63 Correct 830 ms 9568 KB Output is correct
64 Correct 820 ms 9632 KB Output is correct
65 Correct 558 ms 9476 KB Output is correct
66 Correct 543 ms 9908 KB Output is correct
67 Correct 759 ms 9648 KB Output is correct
68 Correct 686 ms 9508 KB Output is correct
69 Correct 503 ms 9160 KB Output is correct
70 Correct 504 ms 9212 KB Output is correct
71 Correct 502 ms 9140 KB Output is correct
72 Correct 497 ms 9180 KB Output is correct
73 Correct 616 ms 9716 KB Output is correct
74 Correct 691 ms 9568 KB Output is correct
75 Correct 857 ms 9692 KB Output is correct
76 Correct 832 ms 9716 KB Output is correct
77 Correct 455 ms 9436 KB Output is correct
78 Correct 457 ms 9436 KB Output is correct
79 Correct 437 ms 9424 KB Output is correct
80 Correct 437 ms 9412 KB Output is correct
81 Correct 727 ms 9540 KB Output is correct
82 Correct 602 ms 9488 KB Output is correct
83 Correct 528 ms 9532 KB Output is correct
84 Correct 705 ms 9500 KB Output is correct
85 Correct 765 ms 9900 KB Output is correct
86 Correct 769 ms 9716 KB Output is correct
87 Correct 664 ms 9496 KB Output is correct
88 Correct 529 ms 9476 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 8 ms 8696 KB Output is correct
4 Correct 8 ms 8536 KB Output is correct
5 Correct 9 ms 8540 KB Output is correct
6 Correct 12 ms 8540 KB Output is correct
7 Correct 7 ms 8700 KB Output is correct
8 Correct 10 ms 8540 KB Output is correct
9 Correct 9 ms 8536 KB Output is correct
10 Correct 10 ms 8540 KB Output is correct
11 Correct 7 ms 8672 KB Output is correct
12 Correct 8 ms 8680 KB Output is correct
13 Correct 11 ms 8540 KB Output is correct
14 Correct 9 ms 8540 KB Output is correct
15 Correct 6 ms 8540 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 9 ms 8540 KB Output is correct
18 Correct 11 ms 8536 KB Output is correct
19 Correct 9 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct
21 Correct 520 ms 9144 KB Output is correct
22 Correct 502 ms 9412 KB Output is correct
23 Correct 541 ms 9216 KB Output is correct
24 Correct 542 ms 9472 KB Output is correct
25 Correct 817 ms 9572 KB Output is correct
26 Correct 841 ms 9860 KB Output is correct
27 Correct 505 ms 9252 KB Output is correct
28 Correct 509 ms 9144 KB Output is correct
29 Correct 498 ms 9160 KB Output is correct
30 Correct 234 ms 9116 KB Output is correct
31 Correct 309 ms 9104 KB Output is correct
32 Correct 656 ms 9388 KB Output is correct
33 Correct 496 ms 9440 KB Output is correct
34 Correct 487 ms 9408 KB Output is correct
35 Correct 482 ms 9744 KB Output is correct
36 Correct 500 ms 9396 KB Output is correct
37 Correct 738 ms 9396 KB Output is correct
38 Correct 665 ms 9416 KB Output is correct
39 Correct 707 ms 9448 KB Output is correct
40 Correct 837 ms 9628 KB Output is correct
41 Correct 876 ms 9724 KB Output is correct
42 Correct 789 ms 9692 KB Output is correct
43 Correct 510 ms 9476 KB Output is correct
44 Correct 843 ms 9632 KB Output is correct
45 Correct 764 ms 9816 KB Output is correct
46 Correct 610 ms 9792 KB Output is correct
47 Correct 589 ms 9784 KB Output is correct
48 Correct 544 ms 9460 KB Output is correct
49 Correct 600 ms 9140 KB Output is correct
50 Correct 593 ms 9184 KB Output is correct
51 Correct 614 ms 9280 KB Output is correct
52 Correct 585 ms 9164 KB Output is correct
53 Correct 530 ms 9512 KB Output is correct
54 Correct 710 ms 9880 KB Output is correct
55 Correct 766 ms 9568 KB Output is correct
56 Correct 705 ms 9444 KB Output is correct
57 Correct 475 ms 9424 KB Output is correct
58 Correct 482 ms 9440 KB Output is correct
59 Correct 475 ms 9400 KB Output is correct
60 Correct 512 ms 9380 KB Output is correct
61 Correct 763 ms 9500 KB Output is correct
62 Correct 760 ms 9684 KB Output is correct
63 Correct 847 ms 9792 KB Output is correct
64 Correct 806 ms 9824 KB Output is correct
65 Correct 750 ms 9716 KB Output is correct
66 Correct 581 ms 9524 KB Output is correct
67 Correct 688 ms 9796 KB Output is correct
68 Correct 762 ms 9524 KB Output is correct
69 Correct 451 ms 9688 KB Output is correct
70 Correct 445 ms 9416 KB Output is correct
71 Correct 442 ms 9476 KB Output is correct
72 Correct 443 ms 9400 KB Output is correct
73 Correct 689 ms 9368 KB Output is correct
74 Correct 240 ms 9368 KB Output is correct
75 Correct 734 ms 9660 KB Output is correct
76 Correct 239 ms 9092 KB Output is correct
77 Correct 638 ms 9516 KB Output is correct
78 Correct 817 ms 9608 KB Output is correct
79 Correct 522 ms 9452 KB Output is correct
80 Correct 852 ms 9644 KB Output is correct
81 Correct 730 ms 9828 KB Output is correct
82 Correct 645 ms 9584 KB Output is correct
83 Correct 817 ms 9608 KB Output is correct
84 Correct 751 ms 9780 KB Output is correct
85 Correct 498 ms 9160 KB Output is correct
86 Correct 497 ms 9204 KB Output is correct
87 Correct 538 ms 9352 KB Output is correct
88 Correct 504 ms 9176 KB Output is correct
89 Correct 480 ms 9480 KB Output is correct
90 Correct 437 ms 9608 KB Output is correct
91 Correct 434 ms 9424 KB Output is correct
92 Correct 473 ms 9568 KB Output is correct
93 Correct 362 ms 8996 KB Output is correct
94 Correct 166 ms 9144 KB Output is correct
95 Correct 578 ms 9300 KB Output is correct
96 Correct 192 ms 9040 KB Output is correct
97 Correct 737 ms 9744 KB Output is correct
98 Correct 810 ms 9648 KB Output is correct
99 Correct 830 ms 9568 KB Output is correct
100 Correct 820 ms 9632 KB Output is correct
101 Correct 558 ms 9476 KB Output is correct
102 Correct 543 ms 9908 KB Output is correct
103 Correct 759 ms 9648 KB Output is correct
104 Correct 686 ms 9508 KB Output is correct
105 Correct 503 ms 9160 KB Output is correct
106 Correct 504 ms 9212 KB Output is correct
107 Correct 502 ms 9140 KB Output is correct
108 Correct 497 ms 9180 KB Output is correct
109 Correct 616 ms 9716 KB Output is correct
110 Correct 691 ms 9568 KB Output is correct
111 Correct 857 ms 9692 KB Output is correct
112 Correct 832 ms 9716 KB Output is correct
113 Correct 455 ms 9436 KB Output is correct
114 Correct 457 ms 9436 KB Output is correct
115 Correct 437 ms 9424 KB Output is correct
116 Correct 437 ms 9412 KB Output is correct
117 Correct 727 ms 9540 KB Output is correct
118 Correct 602 ms 9488 KB Output is correct
119 Correct 528 ms 9532 KB Output is correct
120 Correct 705 ms 9500 KB Output is correct
121 Correct 765 ms 9900 KB Output is correct
122 Correct 769 ms 9716 KB Output is correct
123 Correct 664 ms 9496 KB Output is correct
124 Correct 529 ms 9476 KB Output is correct
125 Correct 1280 ms 9996 KB Output is correct
126 Correct 1276 ms 9984 KB Output is correct
127 Correct 1291 ms 9936 KB Output is correct
128 Correct 1282 ms 10012 KB Output is correct
129 Correct 1325 ms 9984 KB Output is correct
130 Correct 1290 ms 10044 KB Output is correct
131 Correct 547 ms 9556 KB Output is correct
132 Correct 1348 ms 9624 KB Output is correct
133 Correct 1791 ms 9760 KB Output is correct
134 Correct 673 ms 9764 KB Output is correct
135 Correct 1910 ms 9840 KB Output is correct
136 Incorrect 460 ms 9300 KB Output isn't correct
137 Halted 0 ms 0 KB -