oj.uz

Submission #868105

# Submission time Handle Problem Language Result Execution time Memory
868105 2023-10-30T12:37:11 Z sleepntsheep Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 13484 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];

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];
    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));
    V = 666666;


    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 - 1) R = M - 1, Z = M;
                    else L = M + 1;
                }
                if (Z != -1)
                {
                    assert(0);
                    z -= Z;
                    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:64:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     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 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 4 ms 4644 KB Output is correct
5 Correct 5 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 4 ms 6588 KB Output is correct
10 Correct 3 ms 6692 KB Output is correct
11 Correct 6 ms 4676 KB Output is correct
12 Correct 6 ms 4444 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 4 ms 6492 KB Output is correct
15 Correct 4 ms 4444 KB Output is correct
16 Correct 4 ms 4636 KB Output is correct
17 Correct 4 ms 4444 KB Output is correct
18 Correct 3 ms 6588 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 4 ms 4444 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1598 ms 7088 KB Output is correct
2 Correct 1582 ms 9788 KB Output is correct
3 Correct 1594 ms 9548 KB Output is correct
4 Correct 1572 ms 10036 KB Output is correct
5 Correct 359 ms 8796 KB Output is correct
6 Correct 197 ms 8992 KB Output is correct
7 Correct 1598 ms 9536 KB Output is correct
8 Correct 1587 ms 9808 KB Output is correct
9 Correct 1595 ms 9528 KB Output is correct
10 Correct 999 ms 9940 KB Output is correct
11 Correct 1246 ms 9808 KB Output is correct
12 Correct 1321 ms 9108 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 722 ms 6844 KB Output is correct
2 Correct 716 ms 6652 KB Output is correct
3 Correct 707 ms 6492 KB Output is correct
4 Correct 714 ms 6652 KB Output is correct
5 Correct 1287 ms 7148 KB Output is correct
6 Correct 1515 ms 6740 KB Output is correct
7 Correct 1420 ms 7224 KB Output is correct
8 Correct 346 ms 6488 KB Output is correct
9 Correct 217 ms 6492 KB Output is correct
10 Correct 581 ms 6568 KB Output is correct
11 Correct 728 ms 6656 KB Output is correct
12 Correct 564 ms 6568 KB Output is correct
13 Correct 659 ms 6864 KB Output is correct
14 Correct 799 ms 6892 KB Output is correct
15 Correct 805 ms 6776 KB Output is correct
16 Correct 788 ms 6760 KB Output is correct
17 Correct 1576 ms 6936 KB Output is correct
18 Correct 1581 ms 6828 KB Output is correct
19 Correct 1584 ms 6876 KB Output is correct
20 Correct 1585 ms 7352 KB Output is correct
21 Correct 739 ms 6704 KB Output is correct
22 Correct 788 ms 6568 KB Output is correct
23 Correct 728 ms 6488 KB Output is correct
24 Correct 779 ms 6848 KB Output is correct
25 Correct 712 ms 6876 KB Output is correct
26 Correct 718 ms 6692 KB Output is correct
27 Correct 711 ms 6740 KB Output is correct
28 Correct 706 ms 6736 KB Output is correct
29 Correct 687 ms 6572 KB Output is correct
30 Correct 683 ms 6744 KB Output is correct
31 Correct 198 ms 6740 KB Output is correct
32 Correct 579 ms 6576 KB Output is correct
33 Correct 637 ms 6836 KB Output is correct
34 Correct 803 ms 6840 KB Output is correct
35 Correct 736 ms 6644 KB Output is correct
36 Correct 598 ms 6892 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 715 ms 6492 KB Output is correct
2 Correct 705 ms 8636 KB Output is correct
3 Correct 722 ms 8784 KB Output is correct
4 Correct 711 ms 8532 KB Output is correct
5 Correct 1130 ms 9144 KB Output is correct
6 Correct 771 ms 10108 KB Output is correct
7 Correct 905 ms 9044 KB Output is correct
8 Correct 1040 ms 9980 KB Output is correct
9 Correct 778 ms 8788 KB Output is correct
10 Correct 514 ms 8816 KB Output is correct
11 Correct 781 ms 8820 KB Output is correct
12 Correct 121 ms 8804 KB Output is correct
13 Correct 661 ms 9044 KB Output is correct
14 Correct 793 ms 9052 KB Output is correct
15 Correct 236 ms 8532 KB Output is correct
16 Correct 616 ms 8788 KB Output is correct
17 Correct 1569 ms 9440 KB Output is correct
18 Correct 1573 ms 9640 KB Output is correct
19 Correct 1583 ms 9524 KB Output is correct
20 Correct 1596 ms 9856 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 4 ms 4644 KB Output is correct
5 Correct 5 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 4 ms 6588 KB Output is correct
10 Correct 3 ms 6692 KB Output is correct
11 Correct 6 ms 4676 KB Output is correct
12 Correct 6 ms 4444 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 4 ms 6492 KB Output is correct
15 Correct 4 ms 4444 KB Output is correct
16 Correct 4 ms 4636 KB Output is correct
17 Correct 4 ms 4444 KB Output is correct
18 Correct 3 ms 6588 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 4 ms 4444 KB Output is correct
21 Correct 1598 ms 7088 KB Output is correct
22 Correct 1582 ms 9788 KB Output is correct
23 Correct 1594 ms 9548 KB Output is correct
24 Correct 1572 ms 10036 KB Output is correct
25 Correct 359 ms 8796 KB Output is correct
26 Correct 197 ms 8992 KB Output is correct
27 Correct 1598 ms 9536 KB Output is correct
28 Correct 1587 ms 9808 KB Output is correct
29 Correct 1595 ms 9528 KB Output is correct
30 Correct 999 ms 9940 KB Output is correct
31 Correct 1246 ms 9808 KB Output is correct
32 Correct 1321 ms 9108 KB Output is correct
33 Correct 715 ms 6492 KB Output is correct
34 Correct 705 ms 8636 KB Output is correct
35 Correct 722 ms 8784 KB Output is correct
36 Correct 711 ms 8532 KB Output is correct
37 Correct 1130 ms 9144 KB Output is correct
38 Correct 771 ms 10108 KB Output is correct
39 Correct 905 ms 9044 KB Output is correct
40 Correct 1040 ms 9980 KB Output is correct
41 Correct 778 ms 8788 KB Output is correct
42 Correct 514 ms 8816 KB Output is correct
43 Correct 781 ms 8820 KB Output is correct
44 Correct 121 ms 8804 KB Output is correct
45 Correct 661 ms 9044 KB Output is correct
46 Correct 793 ms 9052 KB Output is correct
47 Correct 236 ms 8532 KB Output is correct
48 Correct 616 ms 8788 KB Output is correct
49 Correct 1569 ms 9440 KB Output is correct
50 Correct 1573 ms 9640 KB Output is correct
51 Correct 1583 ms 9524 KB Output is correct
52 Correct 1596 ms 9856 KB Output is correct
53 Correct 719 ms 8932 KB Output is correct
54 Correct 710 ms 8988 KB Output is correct
55 Correct 711 ms 8532 KB Output is correct
56 Correct 722 ms 8716 KB Output is correct
57 Correct 1374 ms 9784 KB Output is correct
58 Correct 540 ms 9812 KB Output is correct
59 Correct 1507 ms 9568 KB Output is correct
60 Correct 463 ms 10264 KB Output is correct
61 Correct 653 ms 9068 KB Output is correct
62 Correct 292 ms 8736 KB Output is correct
63 Correct 167 ms 8784 KB Output is correct
64 Correct 277 ms 9060 KB Output is correct
65 Correct 798 ms 9040 KB Output is correct
66 Correct 796 ms 9048 KB Output is correct
67 Correct 606 ms 8792 KB Output is correct
68 Correct 746 ms 8648 KB Output is correct
69 Correct 1580 ms 9552 KB Output is correct
70 Correct 1578 ms 9312 KB Output is correct
71 Correct 1577 ms 9524 KB Output is correct
72 Correct 1570 ms 9512 KB Output is correct
73 Correct 799 ms 8776 KB Output is correct
74 Correct 737 ms 9028 KB Output is correct
75 Correct 69 ms 8796 KB Output is correct
76 Correct 159 ms 8808 KB Output is correct
77 Correct 705 ms 8724 KB Output is correct
78 Correct 715 ms 8724 KB Output is correct
79 Correct 728 ms 8860 KB Output is correct
80 Correct 719 ms 8712 KB Output is correct
81 Correct 757 ms 8788 KB Output is correct
82 Correct 796 ms 8788 KB Output is correct
83 Correct 797 ms 8972 KB Output is correct
84 Correct 751 ms 8784 KB Output is correct
85 Correct 603 ms 8788 KB Output is correct
86 Correct 576 ms 8804 KB Output is correct
87 Correct 790 ms 8868 KB Output is correct
88 Correct 773 ms 8616 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 4 ms 4644 KB Output is correct
5 Correct 5 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 4 ms 6588 KB Output is correct
10 Correct 3 ms 6692 KB Output is correct
11 Correct 6 ms 4676 KB Output is correct
12 Correct 6 ms 4444 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 4 ms 6492 KB Output is correct
15 Correct 4 ms 4444 KB Output is correct
16 Correct 4 ms 4636 KB Output is correct
17 Correct 4 ms 4444 KB Output is correct
18 Correct 3 ms 6588 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 4 ms 4444 KB Output is correct
21 Correct 1598 ms 7088 KB Output is correct
22 Correct 1582 ms 9788 KB Output is correct
23 Correct 1594 ms 9548 KB Output is correct
24 Correct 1572 ms 10036 KB Output is correct
25 Correct 359 ms 8796 KB Output is correct
26 Correct 197 ms 8992 KB Output is correct
27 Correct 1598 ms 9536 KB Output is correct
28 Correct 1587 ms 9808 KB Output is correct
29 Correct 1595 ms 9528 KB Output is correct
30 Correct 999 ms 9940 KB Output is correct
31 Correct 1246 ms 9808 KB Output is correct
32 Correct 1321 ms 9108 KB Output is correct
33 Correct 722 ms 6844 KB Output is correct
34 Correct 716 ms 6652 KB Output is correct
35 Correct 707 ms 6492 KB Output is correct
36 Correct 714 ms 6652 KB Output is correct
37 Correct 1287 ms 7148 KB Output is correct
38 Correct 1515 ms 6740 KB Output is correct
39 Correct 1420 ms 7224 KB Output is correct
40 Correct 346 ms 6488 KB Output is correct
41 Correct 217 ms 6492 KB Output is correct
42 Correct 581 ms 6568 KB Output is correct
43 Correct 728 ms 6656 KB Output is correct
44 Correct 564 ms 6568 KB Output is correct
45 Correct 659 ms 6864 KB Output is correct
46 Correct 799 ms 6892 KB Output is correct
47 Correct 805 ms 6776 KB Output is correct
48 Correct 788 ms 6760 KB Output is correct
49 Correct 1576 ms 6936 KB Output is correct
50 Correct 1581 ms 6828 KB Output is correct
51 Correct 1584 ms 6876 KB Output is correct
52 Correct 1585 ms 7352 KB Output is correct
53 Correct 739 ms 6704 KB Output is correct
54 Correct 788 ms 6568 KB Output is correct
55 Correct 728 ms 6488 KB Output is correct
56 Correct 779 ms 6848 KB Output is correct
57 Correct 712 ms 6876 KB Output is correct
58 Correct 718 ms 6692 KB Output is correct
59 Correct 711 ms 6740 KB Output is correct
60 Correct 706 ms 6736 KB Output is correct
61 Correct 687 ms 6572 KB Output is correct
62 Correct 683 ms 6744 KB Output is correct
63 Correct 198 ms 6740 KB Output is correct
64 Correct 579 ms 6576 KB Output is correct
65 Correct 637 ms 6836 KB Output is correct
66 Correct 803 ms 6840 KB Output is correct
67 Correct 736 ms 6644 KB Output is correct
68 Correct 598 ms 6892 KB Output is correct
69 Correct 715 ms 6492 KB Output is correct
70 Correct 705 ms 8636 KB Output is correct
71 Correct 722 ms 8784 KB Output is correct
72 Correct 711 ms 8532 KB Output is correct
73 Correct 1130 ms 9144 KB Output is correct
74 Correct 771 ms 10108 KB Output is correct
75 Correct 905 ms 9044 KB Output is correct
76 Correct 1040 ms 9980 KB Output is correct
77 Correct 778 ms 8788 KB Output is correct
78 Correct 514 ms 8816 KB Output is correct
79 Correct 781 ms 8820 KB Output is correct
80 Correct 121 ms 8804 KB Output is correct
81 Correct 661 ms 9044 KB Output is correct
82 Correct 793 ms 9052 KB Output is correct
83 Correct 236 ms 8532 KB Output is correct
84 Correct 616 ms 8788 KB Output is correct
85 Correct 1569 ms 9440 KB Output is correct
86 Correct 1573 ms 9640 KB Output is correct
87 Correct 1583 ms 9524 KB Output is correct
88 Correct 1596 ms 9856 KB Output is correct
89 Correct 719 ms 8932 KB Output is correct
90 Correct 710 ms 8988 KB Output is correct
91 Correct 711 ms 8532 KB Output is correct
92 Correct 722 ms 8716 KB Output is correct
93 Correct 1374 ms 9784 KB Output is correct
94 Correct 540 ms 9812 KB Output is correct
95 Correct 1507 ms 9568 KB Output is correct
96 Correct 463 ms 10264 KB Output is correct
97 Correct 653 ms 9068 KB Output is correct
98 Correct 292 ms 8736 KB Output is correct
99 Correct 167 ms 8784 KB Output is correct
100 Correct 277 ms 9060 KB Output is correct
101 Correct 798 ms 9040 KB Output is correct
102 Correct 796 ms 9048 KB Output is correct
103 Correct 606 ms 8792 KB Output is correct
104 Correct 746 ms 8648 KB Output is correct
105 Correct 1580 ms 9552 KB Output is correct
106 Correct 1578 ms 9312 KB Output is correct
107 Correct 1577 ms 9524 KB Output is correct
108 Correct 1570 ms 9512 KB Output is correct
109 Correct 799 ms 8776 KB Output is correct
110 Correct 737 ms 9028 KB Output is correct
111 Correct 69 ms 8796 KB Output is correct
112 Correct 159 ms 8808 KB Output is correct
113 Correct 705 ms 8724 KB Output is correct
114 Correct 715 ms 8724 KB Output is correct
115 Correct 728 ms 8860 KB Output is correct
116 Correct 719 ms 8712 KB Output is correct
117 Correct 757 ms 8788 KB Output is correct
118 Correct 796 ms 8788 KB Output is correct
119 Correct 797 ms 8972 KB Output is correct
120 Correct 751 ms 8784 KB Output is correct
121 Correct 603 ms 8788 KB Output is correct
122 Correct 576 ms 8804 KB Output is correct
123 Correct 790 ms 8868 KB Output is correct
124 Correct 773 ms 8616 KB Output is correct
125 Correct 2864 ms 11120 KB Output is correct
126 Correct 2824 ms 10920 KB Output is correct
127 Correct 2818 ms 11196 KB Output is correct
128 Correct 2800 ms 10792 KB Output is correct
129 Correct 2808 ms 11272 KB Output is correct
130 Correct 2803 ms 10932 KB Output is correct
131 Correct 2273 ms 13484 KB Output is correct
132 Execution timed out 5025 ms 12112 KB Time limit exceeded
133 Halted 0 ms 0 KB -