oj.uz

Submission #868123

# Submission time Handle Problem Language Result Execution time Memory
868123 2023-10-30T13:03:33 Z sleepntsheep Segments (IZhO18_segments) C++17
75 / 100
 1890 ms 10884 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 -= (min(j->r, r) - max(j->l, l) + 1 < k) * j->w;
                        for (int j = sb, cnt; j * V <= na + 1; ++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 8 ms 9032 KB Output is correct
4 Correct 7 ms 9048 KB Output is correct
5 Correct 9 ms 9048 KB Output is correct
6 Correct 9 ms 9052 KB Output is correct
7 Correct 8 ms 9072 KB Output is correct
8 Correct 10 ms 9052 KB Output is correct
9 Correct 10 ms 9076 KB Output is correct
10 Correct 10 ms 9048 KB Output is correct
11 Correct 9 ms 9048 KB Output is correct
12 Correct 8 ms 9052 KB Output is correct
13 Correct 11 ms 9056 KB Output is correct
14 Correct 9 ms 9044 KB Output is correct
15 Correct 7 ms 9060 KB Output is correct
16 Correct 7 ms 9052 KB Output is correct
17 Correct 8 ms 9076 KB Output is correct
18 Correct 10 ms 9084 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 546 ms 9660 KB Output is correct
2 Correct 501 ms 9560 KB Output is correct
3 Correct 505 ms 9528 KB Output is correct
4 Correct 539 ms 9588 KB Output is correct
5 Correct 841 ms 10344 KB Output is correct
6 Correct 828 ms 10068 KB Output is correct
7 Correct 500 ms 9552 KB Output is correct
8 Correct 514 ms 9700 KB Output is correct
9 Correct 513 ms 9776 KB Output is correct
10 Correct 232 ms 9532 KB Output is correct
11 Correct 295 ms 9504 KB Output is correct
12 Correct 647 ms 9928 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 10132 KB Output is correct
2 Correct 471 ms 9780 KB Output is correct
3 Correct 477 ms 9784 KB Output is correct
4 Correct 510 ms 10052 KB Output is correct
5 Correct 715 ms 9772 KB Output is correct
6 Correct 661 ms 9644 KB Output is correct
7 Correct 700 ms 9720 KB Output is correct
8 Correct 829 ms 9940 KB Output is correct
9 Correct 836 ms 9992 KB Output is correct
10 Correct 807 ms 9960 KB Output is correct
11 Correct 531 ms 9872 KB Output is correct
12 Correct 801 ms 10060 KB Output is correct
13 Correct 719 ms 10024 KB Output is correct
14 Correct 588 ms 9952 KB Output is correct
15 Correct 594 ms 9944 KB Output is correct
16 Correct 576 ms 10120 KB Output is correct
17 Correct 583 ms 9540 KB Output is correct
18 Correct 592 ms 9560 KB Output is correct
19 Correct 613 ms 9688 KB Output is correct
20 Correct 593 ms 9596 KB Output is correct
21 Correct 521 ms 9860 KB Output is correct
22 Correct 714 ms 9920 KB Output is correct
23 Correct 752 ms 9992 KB Output is correct
24 Correct 720 ms 10096 KB Output is correct
25 Correct 475 ms 10088 KB Output is correct
26 Correct 472 ms 9880 KB Output is correct
27 Correct 476 ms 9996 KB Output is correct
28 Correct 467 ms 9804 KB Output is correct
29 Correct 757 ms 9940 KB Output is correct
30 Correct 739 ms 9884 KB Output is correct
31 Correct 828 ms 10176 KB Output is correct
32 Correct 781 ms 10236 KB Output is correct
33 Correct 734 ms 9904 KB Output is correct
34 Correct 583 ms 10132 KB Output is correct
35 Correct 679 ms 9904 KB Output is correct
36 Correct 746 ms 9860 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 9780 KB Output is correct
2 Correct 446 ms 9928 KB Output is correct
3 Correct 429 ms 9780 KB Output is correct
4 Correct 452 ms 9812 KB Output is correct
5 Correct 688 ms 9800 KB Output is correct
6 Correct 231 ms 9548 KB Output is correct
7 Correct 759 ms 9860 KB Output is correct
8 Correct 243 ms 9436 KB Output is correct
9 Correct 641 ms 9880 KB Output is correct
10 Correct 770 ms 10360 KB Output is correct
11 Correct 516 ms 10156 KB Output is correct
12 Correct 849 ms 10080 KB Output is correct
13 Correct 720 ms 10004 KB Output is correct
14 Correct 605 ms 9900 KB Output is correct
15 Correct 809 ms 9996 KB Output is correct
16 Correct 739 ms 10244 KB Output is correct
17 Correct 506 ms 9548 KB Output is correct
18 Correct 502 ms 9540 KB Output is correct
19 Correct 504 ms 9756 KB Output is correct
20 Correct 505 ms 9716 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 8 ms 9032 KB Output is correct
4 Correct 7 ms 9048 KB Output is correct
5 Correct 9 ms 9048 KB Output is correct
6 Correct 9 ms 9052 KB Output is correct
7 Correct 8 ms 9072 KB Output is correct
8 Correct 10 ms 9052 KB Output is correct
9 Correct 10 ms 9076 KB Output is correct
10 Correct 10 ms 9048 KB Output is correct
11 Correct 9 ms 9048 KB Output is correct
12 Correct 8 ms 9052 KB Output is correct
13 Correct 11 ms 9056 KB Output is correct
14 Correct 9 ms 9044 KB Output is correct
15 Correct 7 ms 9060 KB Output is correct
16 Correct 7 ms 9052 KB Output is correct
17 Correct 8 ms 9076 KB Output is correct
18 Correct 10 ms 9084 KB Output is correct
19 Correct 8 ms 9048 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct
21 Correct 546 ms 9660 KB Output is correct
22 Correct 501 ms 9560 KB Output is correct
23 Correct 505 ms 9528 KB Output is correct
24 Correct 539 ms 9588 KB Output is correct
25 Correct 841 ms 10344 KB Output is correct
26 Correct 828 ms 10068 KB Output is correct
27 Correct 500 ms 9552 KB Output is correct
28 Correct 514 ms 9700 KB Output is correct
29 Correct 513 ms 9776 KB Output is correct
30 Correct 232 ms 9532 KB Output is correct
31 Correct 295 ms 9504 KB Output is correct
32 Correct 647 ms 9928 KB Output is correct
33 Correct 442 ms 9780 KB Output is correct
34 Correct 446 ms 9928 KB Output is correct
35 Correct 429 ms 9780 KB Output is correct
36 Correct 452 ms 9812 KB Output is correct
37 Correct 688 ms 9800 KB Output is correct
38 Correct 231 ms 9548 KB Output is correct
39 Correct 759 ms 9860 KB Output is correct
40 Correct 243 ms 9436 KB Output is correct
41 Correct 641 ms 9880 KB Output is correct
42 Correct 770 ms 10360 KB Output is correct
43 Correct 516 ms 10156 KB Output is correct
44 Correct 849 ms 10080 KB Output is correct
45 Correct 720 ms 10004 KB Output is correct
46 Correct 605 ms 9900 KB Output is correct
47 Correct 809 ms 9996 KB Output is correct
48 Correct 739 ms 10244 KB Output is correct
49 Correct 506 ms 9548 KB Output is correct
50 Correct 502 ms 9540 KB Output is correct
51 Correct 504 ms 9756 KB Output is correct
52 Correct 505 ms 9716 KB Output is correct
53 Correct 452 ms 9816 KB Output is correct
54 Correct 436 ms 9820 KB Output is correct
55 Correct 454 ms 9796 KB Output is correct
56 Correct 448 ms 10064 KB Output is correct
57 Correct 385 ms 9516 KB Output is correct
58 Correct 153 ms 9356 KB Output is correct
59 Correct 574 ms 9668 KB Output is correct
60 Correct 194 ms 9392 KB Output is correct
61 Correct 722 ms 10012 KB Output is correct
62 Correct 841 ms 10372 KB Output is correct
63 Correct 813 ms 9980 KB Output is correct
64 Correct 856 ms 10140 KB Output is correct
65 Correct 538 ms 9872 KB Output is correct
66 Correct 539 ms 10000 KB Output is correct
67 Correct 780 ms 10060 KB Output is correct
68 Correct 675 ms 9984 KB Output is correct
69 Correct 506 ms 9592 KB Output is correct
70 Correct 508 ms 9772 KB Output is correct
71 Correct 513 ms 9660 KB Output is correct
72 Correct 521 ms 9564 KB Output is correct
73 Correct 575 ms 9896 KB Output is correct
74 Correct 682 ms 10060 KB Output is correct
75 Correct 857 ms 10036 KB Output is correct
76 Correct 815 ms 10236 KB Output is correct
77 Correct 434 ms 9824 KB Output is correct
78 Correct 447 ms 10008 KB Output is correct
79 Correct 429 ms 9796 KB Output is correct
80 Correct 442 ms 9708 KB Output is correct
81 Correct 681 ms 9900 KB Output is correct
82 Correct 598 ms 9896 KB Output is correct
83 Correct 511 ms 9836 KB Output is correct
84 Correct 679 ms 10284 KB Output is correct
85 Correct 760 ms 10080 KB Output is correct
86 Correct 747 ms 9868 KB Output is correct
87 Correct 634 ms 9984 KB Output is correct
88 Correct 513 ms 9872 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 8 ms 9032 KB Output is correct
4 Correct 7 ms 9048 KB Output is correct
5 Correct 9 ms 9048 KB Output is correct
6 Correct 9 ms 9052 KB Output is correct
7 Correct 8 ms 9072 KB Output is correct
8 Correct 10 ms 9052 KB Output is correct
9 Correct 10 ms 9076 KB Output is correct
10 Correct 10 ms 9048 KB Output is correct
11 Correct 9 ms 9048 KB Output is correct
12 Correct 8 ms 9052 KB Output is correct
13 Correct 11 ms 9056 KB Output is correct
14 Correct 9 ms 9044 KB Output is correct
15 Correct 7 ms 9060 KB Output is correct
16 Correct 7 ms 9052 KB Output is correct
17 Correct 8 ms 9076 KB Output is correct
18 Correct 10 ms 9084 KB Output is correct
19 Correct 8 ms 9048 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct
21 Correct 546 ms 9660 KB Output is correct
22 Correct 501 ms 9560 KB Output is correct
23 Correct 505 ms 9528 KB Output is correct
24 Correct 539 ms 9588 KB Output is correct
25 Correct 841 ms 10344 KB Output is correct
26 Correct 828 ms 10068 KB Output is correct
27 Correct 500 ms 9552 KB Output is correct
28 Correct 514 ms 9700 KB Output is correct
29 Correct 513 ms 9776 KB Output is correct
30 Correct 232 ms 9532 KB Output is correct
31 Correct 295 ms 9504 KB Output is correct
32 Correct 647 ms 9928 KB Output is correct
33 Correct 479 ms 10132 KB Output is correct
34 Correct 471 ms 9780 KB Output is correct
35 Correct 477 ms 9784 KB Output is correct
36 Correct 510 ms 10052 KB Output is correct
37 Correct 715 ms 9772 KB Output is correct
38 Correct 661 ms 9644 KB Output is correct
39 Correct 700 ms 9720 KB Output is correct
40 Correct 829 ms 9940 KB Output is correct
41 Correct 836 ms 9992 KB Output is correct
42 Correct 807 ms 9960 KB Output is correct
43 Correct 531 ms 9872 KB Output is correct
44 Correct 801 ms 10060 KB Output is correct
45 Correct 719 ms 10024 KB Output is correct
46 Correct 588 ms 9952 KB Output is correct
47 Correct 594 ms 9944 KB Output is correct
48 Correct 576 ms 10120 KB Output is correct
49 Correct 583 ms 9540 KB Output is correct
50 Correct 592 ms 9560 KB Output is correct
51 Correct 613 ms 9688 KB Output is correct
52 Correct 593 ms 9596 KB Output is correct
53 Correct 521 ms 9860 KB Output is correct
54 Correct 714 ms 9920 KB Output is correct
55 Correct 752 ms 9992 KB Output is correct
56 Correct 720 ms 10096 KB Output is correct
57 Correct 475 ms 10088 KB Output is correct
58 Correct 472 ms 9880 KB Output is correct
59 Correct 476 ms 9996 KB Output is correct
60 Correct 467 ms 9804 KB Output is correct
61 Correct 757 ms 9940 KB Output is correct
62 Correct 739 ms 9884 KB Output is correct
63 Correct 828 ms 10176 KB Output is correct
64 Correct 781 ms 10236 KB Output is correct
65 Correct 734 ms 9904 KB Output is correct
66 Correct 583 ms 10132 KB Output is correct
67 Correct 679 ms 9904 KB Output is correct
68 Correct 746 ms 9860 KB Output is correct
69 Correct 442 ms 9780 KB Output is correct
70 Correct 446 ms 9928 KB Output is correct
71 Correct 429 ms 9780 KB Output is correct
72 Correct 452 ms 9812 KB Output is correct
73 Correct 688 ms 9800 KB Output is correct
74 Correct 231 ms 9548 KB Output is correct
75 Correct 759 ms 9860 KB Output is correct
76 Correct 243 ms 9436 KB Output is correct
77 Correct 641 ms 9880 KB Output is correct
78 Correct 770 ms 10360 KB Output is correct
79 Correct 516 ms 10156 KB Output is correct
80 Correct 849 ms 10080 KB Output is correct
81 Correct 720 ms 10004 KB Output is correct
82 Correct 605 ms 9900 KB Output is correct
83 Correct 809 ms 9996 KB Output is correct
84 Correct 739 ms 10244 KB Output is correct
85 Correct 506 ms 9548 KB Output is correct
86 Correct 502 ms 9540 KB Output is correct
87 Correct 504 ms 9756 KB Output is correct
88 Correct 505 ms 9716 KB Output is correct
89 Correct 452 ms 9816 KB Output is correct
90 Correct 436 ms 9820 KB Output is correct
91 Correct 454 ms 9796 KB Output is correct
92 Correct 448 ms 10064 KB Output is correct
93 Correct 385 ms 9516 KB Output is correct
94 Correct 153 ms 9356 KB Output is correct
95 Correct 574 ms 9668 KB Output is correct
96 Correct 194 ms 9392 KB Output is correct
97 Correct 722 ms 10012 KB Output is correct
98 Correct 841 ms 10372 KB Output is correct
99 Correct 813 ms 9980 KB Output is correct
100 Correct 856 ms 10140 KB Output is correct
101 Correct 538 ms 9872 KB Output is correct
102 Correct 539 ms 10000 KB Output is correct
103 Correct 780 ms 10060 KB Output is correct
104 Correct 675 ms 9984 KB Output is correct
105 Correct 506 ms 9592 KB Output is correct
106 Correct 508 ms 9772 KB Output is correct
107 Correct 513 ms 9660 KB Output is correct
108 Correct 521 ms 9564 KB Output is correct
109 Correct 575 ms 9896 KB Output is correct
110 Correct 682 ms 10060 KB Output is correct
111 Correct 857 ms 10036 KB Output is correct
112 Correct 815 ms 10236 KB Output is correct
113 Correct 434 ms 9824 KB Output is correct
114 Correct 447 ms 10008 KB Output is correct
115 Correct 429 ms 9796 KB Output is correct
116 Correct 442 ms 9708 KB Output is correct
117 Correct 681 ms 9900 KB Output is correct
118 Correct 598 ms 9896 KB Output is correct
119 Correct 511 ms 9836 KB Output is correct
120 Correct 679 ms 10284 KB Output is correct
121 Correct 760 ms 10080 KB Output is correct
122 Correct 747 ms 9868 KB Output is correct
123 Correct 634 ms 9984 KB Output is correct
124 Correct 513 ms 9872 KB Output is correct
125 Correct 1274 ms 10884 KB Output is correct
126 Correct 1243 ms 10592 KB Output is correct
127 Correct 1262 ms 10632 KB Output is correct
128 Correct 1267 ms 10556 KB Output is correct
129 Correct 1264 ms 10444 KB Output is correct
130 Correct 1265 ms 10792 KB Output is correct
131 Correct 559 ms 9996 KB Output is correct
132 Correct 1374 ms 10260 KB Output is correct
133 Correct 1820 ms 10304 KB Output is correct
134 Correct 672 ms 10028 KB Output is correct
135 Correct 1890 ms 10516 KB Output is correct
136 Incorrect 491 ms 10044 KB Output isn't correct
137 Halted 0 ms 0 KB -