oj.uz

답안 #868114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868114 2023-10-30T12:50:25 Z sleepntsheep Segments (IZhO18_segments) C++17
75 / 100
 1931 ms 13124 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;
    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 8620 KB Output is correct
3 Correct 7 ms 8796 KB Output is correct
4 Correct 8 ms 8540 KB Output is correct
5 Correct 9 ms 8820 KB Output is correct
6 Correct 9 ms 8792 KB Output is correct
7 Correct 8 ms 8796 KB Output is correct
8 Correct 10 ms 8792 KB Output is correct
9 Correct 9 ms 8796 KB Output is correct
10 Correct 11 ms 8796 KB Output is correct
11 Correct 9 ms 8760 KB Output is correct
12 Correct 7 ms 8796 KB Output is correct
13 Correct 11 ms 8792 KB Output is correct
14 Correct 9 ms 8804 KB Output is correct
15 Correct 7 ms 8536 KB Output is correct
16 Correct 7 ms 8796 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 12 ms 8776 KB Output is correct
19 Correct 8 ms 8796 KB Output is correct
20 Correct 8 ms 8792 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 512 ms 11232 KB Output is correct
2 Correct 509 ms 10756 KB Output is correct
3 Correct 503 ms 10508 KB Output is correct
4 Correct 533 ms 10568 KB Output is correct
5 Correct 817 ms 10832 KB Output is correct
6 Correct 833 ms 11132 KB Output is correct
7 Correct 509 ms 10712 KB Output is correct
8 Correct 500 ms 10612 KB Output is correct
9 Correct 517 ms 10500 KB Output is correct
10 Correct 232 ms 10764 KB Output is correct
11 Correct 295 ms 10932 KB Output is correct
12 Correct 648 ms 10860 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 488 ms 10832 KB Output is correct
2 Correct 479 ms 10672 KB Output is correct
3 Correct 476 ms 10744 KB Output is correct
4 Correct 475 ms 10708 KB Output is correct
5 Correct 727 ms 10800 KB Output is correct
6 Correct 670 ms 10812 KB Output is correct
7 Correct 697 ms 10808 KB Output is correct
8 Correct 833 ms 11056 KB Output is correct
9 Correct 849 ms 10900 KB Output is correct
10 Correct 788 ms 11124 KB Output is correct
11 Correct 515 ms 10760 KB Output is correct
12 Correct 844 ms 10932 KB Output is correct
13 Correct 786 ms 10772 KB Output is correct
14 Correct 617 ms 10760 KB Output is correct
15 Correct 593 ms 11056 KB Output is correct
16 Correct 545 ms 10748 KB Output is correct
17 Correct 592 ms 10696 KB Output is correct
18 Correct 605 ms 11120 KB Output is correct
19 Correct 606 ms 10960 KB Output is correct
20 Correct 611 ms 10716 KB Output is correct
21 Correct 556 ms 10776 KB Output is correct
22 Correct 706 ms 10804 KB Output is correct
23 Correct 817 ms 10944 KB Output is correct
24 Correct 720 ms 10904 KB Output is correct
25 Correct 482 ms 10720 KB Output is correct
26 Correct 497 ms 10708 KB Output is correct
27 Correct 525 ms 10720 KB Output is correct
28 Correct 478 ms 10624 KB Output is correct
29 Correct 791 ms 10828 KB Output is correct
30 Correct 767 ms 10872 KB Output is correct
31 Correct 855 ms 10860 KB Output is correct
32 Correct 798 ms 10876 KB Output is correct
33 Correct 773 ms 10904 KB Output is correct
34 Correct 604 ms 10836 KB Output is correct
35 Correct 701 ms 11248 KB Output is correct
36 Correct 780 ms 10880 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 452 ms 10920 KB Output is correct
2 Correct 484 ms 10732 KB Output is correct
3 Correct 442 ms 10692 KB Output is correct
4 Correct 444 ms 10660 KB Output is correct
5 Correct 702 ms 10956 KB Output is correct
6 Correct 233 ms 10904 KB Output is correct
7 Correct 748 ms 10972 KB Output is correct
8 Correct 237 ms 10836 KB Output is correct
9 Correct 645 ms 10844 KB Output is correct
10 Correct 850 ms 10800 KB Output is correct
11 Correct 547 ms 10760 KB Output is correct
12 Correct 850 ms 10928 KB Output is correct
13 Correct 737 ms 10796 KB Output is correct
14 Correct 651 ms 10852 KB Output is correct
15 Correct 825 ms 10888 KB Output is correct
16 Correct 752 ms 10828 KB Output is correct
17 Correct 527 ms 10632 KB Output is correct
18 Correct 514 ms 10864 KB Output is correct
19 Correct 518 ms 10612 KB Output is correct
20 Correct 518 ms 10692 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 8620 KB Output is correct
3 Correct 7 ms 8796 KB Output is correct
4 Correct 8 ms 8540 KB Output is correct
5 Correct 9 ms 8820 KB Output is correct
6 Correct 9 ms 8792 KB Output is correct
7 Correct 8 ms 8796 KB Output is correct
8 Correct 10 ms 8792 KB Output is correct
9 Correct 9 ms 8796 KB Output is correct
10 Correct 11 ms 8796 KB Output is correct
11 Correct 9 ms 8760 KB Output is correct
12 Correct 7 ms 8796 KB Output is correct
13 Correct 11 ms 8792 KB Output is correct
14 Correct 9 ms 8804 KB Output is correct
15 Correct 7 ms 8536 KB Output is correct
16 Correct 7 ms 8796 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 12 ms 8776 KB Output is correct
19 Correct 8 ms 8796 KB Output is correct
20 Correct 8 ms 8792 KB Output is correct
21 Correct 512 ms 11232 KB Output is correct
22 Correct 509 ms 10756 KB Output is correct
23 Correct 503 ms 10508 KB Output is correct
24 Correct 533 ms 10568 KB Output is correct
25 Correct 817 ms 10832 KB Output is correct
26 Correct 833 ms 11132 KB Output is correct
27 Correct 509 ms 10712 KB Output is correct
28 Correct 500 ms 10612 KB Output is correct
29 Correct 517 ms 10500 KB Output is correct
30 Correct 232 ms 10764 KB Output is correct
31 Correct 295 ms 10932 KB Output is correct
32 Correct 648 ms 10860 KB Output is correct
33 Correct 452 ms 10920 KB Output is correct
34 Correct 484 ms 10732 KB Output is correct
35 Correct 442 ms 10692 KB Output is correct
36 Correct 444 ms 10660 KB Output is correct
37 Correct 702 ms 10956 KB Output is correct
38 Correct 233 ms 10904 KB Output is correct
39 Correct 748 ms 10972 KB Output is correct
40 Correct 237 ms 10836 KB Output is correct
41 Correct 645 ms 10844 KB Output is correct
42 Correct 850 ms 10800 KB Output is correct
43 Correct 547 ms 10760 KB Output is correct
44 Correct 850 ms 10928 KB Output is correct
45 Correct 737 ms 10796 KB Output is correct
46 Correct 651 ms 10852 KB Output is correct
47 Correct 825 ms 10888 KB Output is correct
48 Correct 752 ms 10828 KB Output is correct
49 Correct 527 ms 10632 KB Output is correct
50 Correct 514 ms 10864 KB Output is correct
51 Correct 518 ms 10612 KB Output is correct
52 Correct 518 ms 10692 KB Output is correct
53 Correct 465 ms 10704 KB Output is correct
54 Correct 443 ms 10692 KB Output is correct
55 Correct 451 ms 10700 KB Output is correct
56 Correct 437 ms 10644 KB Output is correct
57 Correct 369 ms 10912 KB Output is correct
58 Correct 154 ms 10912 KB Output is correct
59 Correct 606 ms 10764 KB Output is correct
60 Correct 193 ms 10744 KB Output is correct
61 Correct 759 ms 10836 KB Output is correct
62 Correct 839 ms 10872 KB Output is correct
63 Correct 853 ms 10888 KB Output is correct
64 Correct 838 ms 10908 KB Output is correct
65 Correct 598 ms 10876 KB Output is correct
66 Correct 543 ms 10824 KB Output is correct
67 Correct 758 ms 10932 KB Output is correct
68 Correct 690 ms 10740 KB Output is correct
69 Correct 515 ms 10528 KB Output is correct
70 Correct 512 ms 10484 KB Output is correct
71 Correct 514 ms 10668 KB Output is correct
72 Correct 513 ms 10740 KB Output is correct
73 Correct 594 ms 10800 KB Output is correct
74 Correct 693 ms 10864 KB Output is correct
75 Correct 881 ms 10956 KB Output is correct
76 Correct 843 ms 11060 KB Output is correct
77 Correct 445 ms 10628 KB Output is correct
78 Correct 456 ms 10888 KB Output is correct
79 Correct 439 ms 10720 KB Output is correct
80 Correct 485 ms 10696 KB Output is correct
81 Correct 715 ms 10768 KB Output is correct
82 Correct 590 ms 10828 KB Output is correct
83 Correct 541 ms 10760 KB Output is correct
84 Correct 713 ms 10900 KB Output is correct
85 Correct 774 ms 10880 KB Output is correct
86 Correct 772 ms 10952 KB Output is correct
87 Correct 637 ms 10860 KB Output is correct
88 Correct 536 ms 10796 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8620 KB Output is correct
3 Correct 7 ms 8796 KB Output is correct
4 Correct 8 ms 8540 KB Output is correct
5 Correct 9 ms 8820 KB Output is correct
6 Correct 9 ms 8792 KB Output is correct
7 Correct 8 ms 8796 KB Output is correct
8 Correct 10 ms 8792 KB Output is correct
9 Correct 9 ms 8796 KB Output is correct
10 Correct 11 ms 8796 KB Output is correct
11 Correct 9 ms 8760 KB Output is correct
12 Correct 7 ms 8796 KB Output is correct
13 Correct 11 ms 8792 KB Output is correct
14 Correct 9 ms 8804 KB Output is correct
15 Correct 7 ms 8536 KB Output is correct
16 Correct 7 ms 8796 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 12 ms 8776 KB Output is correct
19 Correct 8 ms 8796 KB Output is correct
20 Correct 8 ms 8792 KB Output is correct
21 Correct 512 ms 11232 KB Output is correct
22 Correct 509 ms 10756 KB Output is correct
23 Correct 503 ms 10508 KB Output is correct
24 Correct 533 ms 10568 KB Output is correct
25 Correct 817 ms 10832 KB Output is correct
26 Correct 833 ms 11132 KB Output is correct
27 Correct 509 ms 10712 KB Output is correct
28 Correct 500 ms 10612 KB Output is correct
29 Correct 517 ms 10500 KB Output is correct
30 Correct 232 ms 10764 KB Output is correct
31 Correct 295 ms 10932 KB Output is correct
32 Correct 648 ms 10860 KB Output is correct
33 Correct 488 ms 10832 KB Output is correct
34 Correct 479 ms 10672 KB Output is correct
35 Correct 476 ms 10744 KB Output is correct
36 Correct 475 ms 10708 KB Output is correct
37 Correct 727 ms 10800 KB Output is correct
38 Correct 670 ms 10812 KB Output is correct
39 Correct 697 ms 10808 KB Output is correct
40 Correct 833 ms 11056 KB Output is correct
41 Correct 849 ms 10900 KB Output is correct
42 Correct 788 ms 11124 KB Output is correct
43 Correct 515 ms 10760 KB Output is correct
44 Correct 844 ms 10932 KB Output is correct
45 Correct 786 ms 10772 KB Output is correct
46 Correct 617 ms 10760 KB Output is correct
47 Correct 593 ms 11056 KB Output is correct
48 Correct 545 ms 10748 KB Output is correct
49 Correct 592 ms 10696 KB Output is correct
50 Correct 605 ms 11120 KB Output is correct
51 Correct 606 ms 10960 KB Output is correct
52 Correct 611 ms 10716 KB Output is correct
53 Correct 556 ms 10776 KB Output is correct
54 Correct 706 ms 10804 KB Output is correct
55 Correct 817 ms 10944 KB Output is correct
56 Correct 720 ms 10904 KB Output is correct
57 Correct 482 ms 10720 KB Output is correct
58 Correct 497 ms 10708 KB Output is correct
59 Correct 525 ms 10720 KB Output is correct
60 Correct 478 ms 10624 KB Output is correct
61 Correct 791 ms 10828 KB Output is correct
62 Correct 767 ms 10872 KB Output is correct
63 Correct 855 ms 10860 KB Output is correct
64 Correct 798 ms 10876 KB Output is correct
65 Correct 773 ms 10904 KB Output is correct
66 Correct 604 ms 10836 KB Output is correct
67 Correct 701 ms 11248 KB Output is correct
68 Correct 780 ms 10880 KB Output is correct
69 Correct 452 ms 10920 KB Output is correct
70 Correct 484 ms 10732 KB Output is correct
71 Correct 442 ms 10692 KB Output is correct
72 Correct 444 ms 10660 KB Output is correct
73 Correct 702 ms 10956 KB Output is correct
74 Correct 233 ms 10904 KB Output is correct
75 Correct 748 ms 10972 KB Output is correct
76 Correct 237 ms 10836 KB Output is correct
77 Correct 645 ms 10844 KB Output is correct
78 Correct 850 ms 10800 KB Output is correct
79 Correct 547 ms 10760 KB Output is correct
80 Correct 850 ms 10928 KB Output is correct
81 Correct 737 ms 10796 KB Output is correct
82 Correct 651 ms 10852 KB Output is correct
83 Correct 825 ms 10888 KB Output is correct
84 Correct 752 ms 10828 KB Output is correct
85 Correct 527 ms 10632 KB Output is correct
86 Correct 514 ms 10864 KB Output is correct
87 Correct 518 ms 10612 KB Output is correct
88 Correct 518 ms 10692 KB Output is correct
89 Correct 465 ms 10704 KB Output is correct
90 Correct 443 ms 10692 KB Output is correct
91 Correct 451 ms 10700 KB Output is correct
92 Correct 437 ms 10644 KB Output is correct
93 Correct 369 ms 10912 KB Output is correct
94 Correct 154 ms 10912 KB Output is correct
95 Correct 606 ms 10764 KB Output is correct
96 Correct 193 ms 10744 KB Output is correct
97 Correct 759 ms 10836 KB Output is correct
98 Correct 839 ms 10872 KB Output is correct
99 Correct 853 ms 10888 KB Output is correct
100 Correct 838 ms 10908 KB Output is correct
101 Correct 598 ms 10876 KB Output is correct
102 Correct 543 ms 10824 KB Output is correct
103 Correct 758 ms 10932 KB Output is correct
104 Correct 690 ms 10740 KB Output is correct
105 Correct 515 ms 10528 KB Output is correct
106 Correct 512 ms 10484 KB Output is correct
107 Correct 514 ms 10668 KB Output is correct
108 Correct 513 ms 10740 KB Output is correct
109 Correct 594 ms 10800 KB Output is correct
110 Correct 693 ms 10864 KB Output is correct
111 Correct 881 ms 10956 KB Output is correct
112 Correct 843 ms 11060 KB Output is correct
113 Correct 445 ms 10628 KB Output is correct
114 Correct 456 ms 10888 KB Output is correct
115 Correct 439 ms 10720 KB Output is correct
116 Correct 485 ms 10696 KB Output is correct
117 Correct 715 ms 10768 KB Output is correct
118 Correct 590 ms 10828 KB Output is correct
119 Correct 541 ms 10760 KB Output is correct
120 Correct 713 ms 10900 KB Output is correct
121 Correct 774 ms 10880 KB Output is correct
122 Correct 772 ms 10952 KB Output is correct
123 Correct 637 ms 10860 KB Output is correct
124 Correct 536 ms 10796 KB Output is correct
125 Correct 1313 ms 12564 KB Output is correct
126 Correct 1272 ms 12352 KB Output is correct
127 Correct 1306 ms 12612 KB Output is correct
128 Correct 1320 ms 12496 KB Output is correct
129 Correct 1292 ms 12520 KB Output is correct
130 Correct 1274 ms 12472 KB Output is correct
131 Correct 566 ms 13124 KB Output is correct
132 Correct 1400 ms 12816 KB Output is correct
133 Correct 1833 ms 12408 KB Output is correct
134 Correct 687 ms 12984 KB Output is correct
135 Correct 1931 ms 12948 KB Output is correct
136 Incorrect 488 ms 12776 KB Output isn't correct
137 Halted 0 ms 0 KB -