oj.uz

Submission #613605

# Submission time Handle Problem Language Result Execution time Memory
613605 2022-07-30T07:29:30 Z KoD Segments (IZhO18_segments) C++17
100 / 100
 4753 ms 20644 KB 
#pragma GCC target("avx2")
// #pragma GCC target("popcnt")
#include <bits/stdc++.h>

using u64 = std::uint64_t;
using std::vector;
using std::array;
using std::pair;
using std::tuple;

int popcount(const u64 x) {
    return __builtin_popcountll(x);
}

template <class T>
int lowb(const vector<T>& vec, const T& x) {
    return std::lower_bound(vec.begin(), vec.end(), x) - vec.begin();
}

class bit_vector {
    array<int, 2> all;
    vector<u64> block;
    vector<int> accum;

  public:
    bit_vector() = default;

    explicit bit_vector(const vector<int>& vec) {
        const int n = (int)vec.size();
        const int size = (n + 63) / 64;
        all.fill(0);
        block.resize(size + 1);
        for (int i = 0; i < n; ++i) {
            all[vec[i]] += 1;
            block[i / 64] |= (u64)vec[i] << (i & 63);
        }
        accum.resize(size + 1);
        for (int i = 0; i < size; ++i) {
            accum[i + 1] = accum[i] + popcount(block[i]);
        }
    }

    int count(const int x) const {
        return all[x];
    }

    int count(const int k, const int x) const {
        const u64 mask = ((u64)1 << (k & 63)) - 1;
        const int one = accum[k / 64] + popcount(block[k / 64] & mask);
        return x == 1 ? one : k - one;
    }

    int count(const int l, const int r, const int x) const {
        return count(r, x) - count(l, x);
    }
};

template <int Digit>
class wavelet_matrix {
    array<bit_vector, Digit> bit;

  public:
    wavelet_matrix() = default;

    explicit wavelet_matrix(const vector<int>& vec) {
        const int n = (int)vec.size();
        vector<int> build(n), idx(n), next(n);
        std::iota(idx.begin(), idx.end(), 0);
        for (int d = Digit - 1; d >= 0; --d) {
            auto zero = next.begin();
            auto one = next.rbegin();
            for (int i = 0; i < n; ++i) {
                build[i] = vec[idx[i]] >> d & 1;
                (build[i] ? *one++ : *zero++) = idx[i];
            }
            bit[d] = bit_vector(build);
            std::reverse(next.rbegin(), one);
            std::swap(idx, next);
        }
    }

    int count(int l, int r, const int x) const {
        int ret = 0;
        for (int d = Digit - 1; d >= 0; --d) {
            const int lc = bit[d].count(l, 1);
            const int rc = bit[d].count(r, 1);
            if (x >> d & 1) {
                l = bit[d].count(0) + lc;
                r = bit[d].count(0) + rc;
            } else {
                ret += (rc - lc);
                l -= lc;
                r -= rc;
            }
        }
        return ret + (r - l);
    }
};

class point_container {
    vector<int> xs, ys;
    wavelet_matrix<18> matrix;

  public:
    point_container() = default;

    explicit point_container(vector<pair<int, int>>&& vec) {
        xs.reserve(vec.size());
        ys.reserve(vec.size());
        std::sort(vec.begin(), vec.end());
        for (const auto& [x, y] : vec) {
            xs.push_back(x);
            ys.push_back(y);
        }
        std::sort(ys.begin(), ys.end());
        ys.erase(std::unique(ys.begin(), ys.end()), ys.end());
        vector<int> build;
        build.reserve(vec.size());
        for (const auto& [x, y] : vec) {
            build.push_back(lowb(ys, y));
        }
        matrix = wavelet_matrix<18>(build);
    }

    int count(const int xl, const int xr, const int y) const {
        return matrix.count(lowb(xs, xl), lowb(xs, xr), lowb(ys, y));
    }
};

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int Q, T, Answer = 0;
    std::cin >> Q >> T;

    int N = 0, M = 0;
    vector<int> X(Q), Y(Q), list;
    vector<char> active(Q), focus(Q);
    point_container P1, P2;

    const auto build = [&] {
        M = N;
        vector<pair<int, int>> p1, p2;
        p1.reserve(M);
        p2.reserve(M);
        for (int i = 0; i < M; ++i) {
            if (active[i]) {
                p1.emplace_back(X[i], Y[i]);
                p2.emplace_back(X[i], Y[i] - X[i]);
            }
        }
        P1 = point_container(std::move(p1));
        P2 = point_container(std::move(p2));
        for (const int i : list) {
            focus[i] = false;
        }
        list.clear();
    };

    const auto add = [&](const int x, const int y) {
        X[N] = x;
        Y[N] = y;
        active[N] = true;
        focus[N] = true;
        list.push_back(N);
        N += 1;
    };

    const auto remove = [&](const int id) {
        if (!focus[id]) {
            focus[id] = true;
            list.push_back(id);
        }
        active[id] = false;
    };

    const auto solve = [&](const int l, const int r, const int k) {
        if (r - l < k) {
            return 0;
        }
        int ret = 0;
        if (M > 0) {
            ret += P1.count(0, l, l + k);
            ret += P2.count(l, r - k + 1, k);
        }
        for (const int id : list) {
            if (id < M) {
                if (!active[id] and ((X[id] <= l and Y[id] >= l + k) or (l <= X[id] and X[id] <= r - k and Y[id] >= X[id] + k))) {
                    ret -= 1;
                }
            } else {
                if (active[id] and ((X[id] <= l and Y[id] >= l + k) or (l <= X[id] and X[id] <= r - k and Y[id] >= X[id] + k))) {
                    ret += 1;
                }
            }
        }
        return ret;
    };

    for (int q = 0; q < Q; ++q) {
        if ((int)list.size() > 3500) {
            build();
        }
        int t;
        std::cin >> t;
        if (t == 1) {
            int a, b;
            std::cin >> a >> b;
            if (T == 1) {
                a ^= Answer;
                b ^= Answer;
            }
            if (a > b) {
                std::swap(a, b);
            }
            add(a, b);
        } else if (t == 2) {
            int id;
            std::cin >> id;
            remove(id - 1);
        } else {
            int a, b, k;
            std::cin >> a >> b >> k;
            if (T == 1) {
                a ^= Answer;
                b ^= Answer;
            }
            if (a > b) {
                std::swap(a, b);
            }
            Answer = solve(a, b, k - 1);
            std::cout << Answer << '\n';
        }
    }
    return 0;
}

/*
6 1
1 1 2
3 2 4 2
1 3 5
3 2 3 1
2 1
3 0 3 1

6 0
1 3 10
1 3 5
3 6 10 6
2 1
1 3 10
3 6 4 2
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 8 ms 468 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 16 ms 384 KB Output is correct
8 Correct 19 ms 532 KB Output is correct
9 Correct 17 ms 400 KB Output is correct
10 Correct 6 ms 468 KB Output is correct
11 Correct 48 ms 400 KB Output is correct
12 Correct 47 ms 384 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 18 ms 404 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 19 ms 404 KB Output is correct
18 Correct 6 ms 468 KB Output is correct
19 Correct 20 ms 408 KB Output is correct
20 Correct 17 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 687 ms 4832 KB Output is correct
2 Correct 684 ms 4936 KB Output is correct
3 Correct 684 ms 4880 KB Output is correct
4 Correct 1093 ms 4996 KB Output is correct
5 Correct 1132 ms 7880 KB Output is correct
6 Correct 1181 ms 7812 KB Output is correct
7 Correct 680 ms 4960 KB Output is correct
8 Correct 660 ms 4820 KB Output is correct
9 Correct 640 ms 4812 KB Output is correct
10 Correct 1115 ms 2704 KB Output is correct
11 Correct 1367 ms 3148 KB Output is correct
12 Correct 686 ms 6400 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 1516 KB Output is correct
2 Correct 118 ms 1428 KB Output is correct
3 Correct 144 ms 1484 KB Output is correct
4 Correct 121 ms 1456 KB Output is correct
5 Correct 886 ms 6328 KB Output is correct
6 Correct 689 ms 5564 KB Output is correct
7 Correct 1065 ms 5896 KB Output is correct
8 Correct 1068 ms 7796 KB Output is correct
9 Correct 1159 ms 7900 KB Output is correct
10 Correct 1004 ms 6092 KB Output is correct
11 Correct 384 ms 1812 KB Output is correct
12 Correct 1080 ms 6284 KB Output is correct
13 Correct 998 ms 5712 KB Output is correct
14 Correct 719 ms 3740 KB Output is correct
15 Correct 692 ms 3388 KB Output is correct
16 Correct 608 ms 2772 KB Output is correct
17 Correct 661 ms 4872 KB Output is correct
18 Correct 662 ms 4828 KB Output is correct
19 Correct 671 ms 4864 KB Output is correct
20 Correct 666 ms 4924 KB Output is correct
21 Correct 478 ms 2096 KB Output is correct
22 Correct 885 ms 4656 KB Output is correct
23 Correct 965 ms 4964 KB Output is correct
24 Correct 906 ms 4536 KB Output is correct
25 Correct 141 ms 1508 KB Output is correct
26 Correct 129 ms 1432 KB Output is correct
27 Correct 141 ms 1472 KB Output is correct
28 Correct 120 ms 1444 KB Output is correct
29 Correct 992 ms 5628 KB Output is correct
30 Correct 987 ms 5728 KB Output is correct
31 Correct 1146 ms 7896 KB Output is correct
32 Correct 1037 ms 6204 KB Output is correct
33 Correct 1022 ms 5748 KB Output is correct
34 Correct 713 ms 3416 KB Output is correct
35 Correct 954 ms 5108 KB Output is correct
36 Correct 987 ms 6328 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 1368 KB Output is correct
2 Correct 124 ms 1428 KB Output is correct
3 Correct 133 ms 1440 KB Output is correct
4 Correct 133 ms 1432 KB Output is correct
5 Correct 1222 ms 6256 KB Output is correct
6 Correct 1940 ms 2208 KB Output is correct
7 Correct 1098 ms 7500 KB Output is correct
8 Correct 1760 ms 2564 KB Output is correct
9 Correct 846 ms 4268 KB Output is correct
10 Correct 1062 ms 6816 KB Output is correct
11 Correct 640 ms 2416 KB Output is correct
12 Correct 1200 ms 7776 KB Output is correct
13 Correct 972 ms 5680 KB Output is correct
14 Correct 821 ms 3748 KB Output is correct
15 Correct 1151 ms 7684 KB Output is correct
16 Correct 1026 ms 5792 KB Output is correct
17 Correct 689 ms 4916 KB Output is correct
18 Correct 661 ms 4936 KB Output is correct
19 Correct 711 ms 4892 KB Output is correct
20 Correct 713 ms 4964 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 8 ms 468 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 16 ms 384 KB Output is correct
8 Correct 19 ms 532 KB Output is correct
9 Correct 17 ms 400 KB Output is correct
10 Correct 6 ms 468 KB Output is correct
11 Correct 48 ms 400 KB Output is correct
12 Correct 47 ms 384 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 18 ms 404 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 19 ms 404 KB Output is correct
18 Correct 6 ms 468 KB Output is correct
19 Correct 20 ms 408 KB Output is correct
20 Correct 17 ms 340 KB Output is correct
21 Correct 687 ms 4832 KB Output is correct
22 Correct 684 ms 4936 KB Output is correct
23 Correct 684 ms 4880 KB Output is correct
24 Correct 1093 ms 4996 KB Output is correct
25 Correct 1132 ms 7880 KB Output is correct
26 Correct 1181 ms 7812 KB Output is correct
27 Correct 680 ms 4960 KB Output is correct
28 Correct 660 ms 4820 KB Output is correct
29 Correct 640 ms 4812 KB Output is correct
30 Correct 1115 ms 2704 KB Output is correct
31 Correct 1367 ms 3148 KB Output is correct
32 Correct 686 ms 6400 KB Output is correct
33 Correct 118 ms 1368 KB Output is correct
34 Correct 124 ms 1428 KB Output is correct
35 Correct 133 ms 1440 KB Output is correct
36 Correct 133 ms 1432 KB Output is correct
37 Correct 1222 ms 6256 KB Output is correct
38 Correct 1940 ms 2208 KB Output is correct
39 Correct 1098 ms 7500 KB Output is correct
40 Correct 1760 ms 2564 KB Output is correct
41 Correct 846 ms 4268 KB Output is correct
42 Correct 1062 ms 6816 KB Output is correct
43 Correct 640 ms 2416 KB Output is correct
44 Correct 1200 ms 7776 KB Output is correct
45 Correct 972 ms 5680 KB Output is correct
46 Correct 821 ms 3748 KB Output is correct
47 Correct 1151 ms 7684 KB Output is correct
48 Correct 1026 ms 5792 KB Output is correct
49 Correct 689 ms 4916 KB Output is correct
50 Correct 661 ms 4936 KB Output is correct
51 Correct 711 ms 4892 KB Output is correct
52 Correct 713 ms 4964 KB Output is correct
53 Correct 147 ms 1512 KB Output is correct
54 Correct 143 ms 1432 KB Output is correct
55 Correct 130 ms 1412 KB Output is correct
56 Correct 138 ms 1420 KB Output is correct
57 Correct 386 ms 3524 KB Output is correct
58 Correct 1337 ms 2196 KB Output is correct
59 Correct 936 ms 5516 KB Output is correct
60 Correct 398 ms 2136 KB Output is correct
61 Correct 1020 ms 5680 KB Output is correct
62 Correct 1174 ms 7516 KB Output is correct
63 Correct 1139 ms 7892 KB Output is correct
64 Correct 1162 ms 7420 KB Output is correct
65 Correct 681 ms 3104 KB Output is correct
66 Correct 635 ms 2588 KB Output is correct
67 Correct 1034 ms 6016 KB Output is correct
68 Correct 918 ms 5092 KB Output is correct
69 Correct 653 ms 4856 KB Output is correct
70 Correct 668 ms 4880 KB Output is correct
71 Correct 675 ms 4904 KB Output is correct
72 Correct 651 ms 4952 KB Output is correct
73 Correct 746 ms 3460 KB Output is correct
74 Correct 966 ms 4960 KB Output is correct
75 Correct 1187 ms 8152 KB Output is correct
76 Correct 1139 ms 7792 KB Output is correct
77 Correct 137 ms 1520 KB Output is correct
78 Correct 126 ms 1380 KB Output is correct
79 Correct 129 ms 1452 KB Output is correct
80 Correct 140 ms 1508 KB Output is correct
81 Correct 925 ms 4624 KB Output is correct
82 Correct 756 ms 3288 KB Output is correct
83 Correct 613 ms 2424 KB Output is correct
84 Correct 937 ms 4752 KB Output is correct
85 Correct 1024 ms 6292 KB Output is correct
86 Correct 1022 ms 6100 KB Output is correct
87 Correct 841 ms 4428 KB Output is correct
88 Correct 613 ms 2352 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 8 ms 468 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 16 ms 384 KB Output is correct
8 Correct 19 ms 532 KB Output is correct
9 Correct 17 ms 400 KB Output is correct
10 Correct 6 ms 468 KB Output is correct
11 Correct 48 ms 400 KB Output is correct
12 Correct 47 ms 384 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 18 ms 404 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 19 ms 404 KB Output is correct
18 Correct 6 ms 468 KB Output is correct
19 Correct 20 ms 408 KB Output is correct
20 Correct 17 ms 340 KB Output is correct
21 Correct 687 ms 4832 KB Output is correct
22 Correct 684 ms 4936 KB Output is correct
23 Correct 684 ms 4880 KB Output is correct
24 Correct 1093 ms 4996 KB Output is correct
25 Correct 1132 ms 7880 KB Output is correct
26 Correct 1181 ms 7812 KB Output is correct
27 Correct 680 ms 4960 KB Output is correct
28 Correct 660 ms 4820 KB Output is correct
29 Correct 640 ms 4812 KB Output is correct
30 Correct 1115 ms 2704 KB Output is correct
31 Correct 1367 ms 3148 KB Output is correct
32 Correct 686 ms 6400 KB Output is correct
33 Correct 145 ms 1516 KB Output is correct
34 Correct 118 ms 1428 KB Output is correct
35 Correct 144 ms 1484 KB Output is correct
36 Correct 121 ms 1456 KB Output is correct
37 Correct 886 ms 6328 KB Output is correct
38 Correct 689 ms 5564 KB Output is correct
39 Correct 1065 ms 5896 KB Output is correct
40 Correct 1068 ms 7796 KB Output is correct
41 Correct 1159 ms 7900 KB Output is correct
42 Correct 1004 ms 6092 KB Output is correct
43 Correct 384 ms 1812 KB Output is correct
44 Correct 1080 ms 6284 KB Output is correct
45 Correct 998 ms 5712 KB Output is correct
46 Correct 719 ms 3740 KB Output is correct
47 Correct 692 ms 3388 KB Output is correct
48 Correct 608 ms 2772 KB Output is correct
49 Correct 661 ms 4872 KB Output is correct
50 Correct 662 ms 4828 KB Output is correct
51 Correct 671 ms 4864 KB Output is correct
52 Correct 666 ms 4924 KB Output is correct
53 Correct 478 ms 2096 KB Output is correct
54 Correct 885 ms 4656 KB Output is correct
55 Correct 965 ms 4964 KB Output is correct
56 Correct 906 ms 4536 KB Output is correct
57 Correct 141 ms 1508 KB Output is correct
58 Correct 129 ms 1432 KB Output is correct
59 Correct 141 ms 1472 KB Output is correct
60 Correct 120 ms 1444 KB Output is correct
61 Correct 992 ms 5628 KB Output is correct
62 Correct 987 ms 5728 KB Output is correct
63 Correct 1146 ms 7896 KB Output is correct
64 Correct 1037 ms 6204 KB Output is correct
65 Correct 1022 ms 5748 KB Output is correct
66 Correct 713 ms 3416 KB Output is correct
67 Correct 954 ms 5108 KB Output is correct
68 Correct 987 ms 6328 KB Output is correct
69 Correct 118 ms 1368 KB Output is correct
70 Correct 124 ms 1428 KB Output is correct
71 Correct 133 ms 1440 KB Output is correct
72 Correct 133 ms 1432 KB Output is correct
73 Correct 1222 ms 6256 KB Output is correct
74 Correct 1940 ms 2208 KB Output is correct
75 Correct 1098 ms 7500 KB Output is correct
76 Correct 1760 ms 2564 KB Output is correct
77 Correct 846 ms 4268 KB Output is correct
78 Correct 1062 ms 6816 KB Output is correct
79 Correct 640 ms 2416 KB Output is correct
80 Correct 1200 ms 7776 KB Output is correct
81 Correct 972 ms 5680 KB Output is correct
82 Correct 821 ms 3748 KB Output is correct
83 Correct 1151 ms 7684 KB Output is correct
84 Correct 1026 ms 5792 KB Output is correct
85 Correct 689 ms 4916 KB Output is correct
86 Correct 661 ms 4936 KB Output is correct
87 Correct 711 ms 4892 KB Output is correct
88 Correct 713 ms 4964 KB Output is correct
89 Correct 147 ms 1512 KB Output is correct
90 Correct 143 ms 1432 KB Output is correct
91 Correct 130 ms 1412 KB Output is correct
92 Correct 138 ms 1420 KB Output is correct
93 Correct 386 ms 3524 KB Output is correct
94 Correct 1337 ms 2196 KB Output is correct
95 Correct 936 ms 5516 KB Output is correct
96 Correct 398 ms 2136 KB Output is correct
97 Correct 1020 ms 5680 KB Output is correct
98 Correct 1174 ms 7516 KB Output is correct
99 Correct 1139 ms 7892 KB Output is correct
100 Correct 1162 ms 7420 KB Output is correct
101 Correct 681 ms 3104 KB Output is correct
102 Correct 635 ms 2588 KB Output is correct
103 Correct 1034 ms 6016 KB Output is correct
104 Correct 918 ms 5092 KB Output is correct
105 Correct 653 ms 4856 KB Output is correct
106 Correct 668 ms 4880 KB Output is correct
107 Correct 675 ms 4904 KB Output is correct
108 Correct 651 ms 4952 KB Output is correct
109 Correct 746 ms 3460 KB Output is correct
110 Correct 966 ms 4960 KB Output is correct
111 Correct 1187 ms 8152 KB Output is correct
112 Correct 1139 ms 7792 KB Output is correct
113 Correct 137 ms 1520 KB Output is correct
114 Correct 126 ms 1380 KB Output is correct
115 Correct 129 ms 1452 KB Output is correct
116 Correct 140 ms 1508 KB Output is correct
117 Correct 925 ms 4624 KB Output is correct
118 Correct 756 ms 3288 KB Output is correct
119 Correct 613 ms 2424 KB Output is correct
120 Correct 937 ms 4752 KB Output is correct
121 Correct 1024 ms 6292 KB Output is correct
122 Correct 1022 ms 6100 KB Output is correct
123 Correct 841 ms 4428 KB Output is correct
124 Correct 613 ms 2352 KB Output is correct
125 Correct 269 ms 2580 KB Output is correct
126 Correct 292 ms 2540 KB Output is correct
127 Correct 303 ms 2552 KB Output is correct
128 Correct 289 ms 2656 KB Output is correct
129 Correct 257 ms 2544 KB Output is correct
130 Correct 300 ms 2496 KB Output is correct
131 Correct 3070 ms 4188 KB Output is correct
132 Correct 1254 ms 8432 KB Output is correct
133 Correct 2464 ms 12584 KB Output is correct
134 Correct 1493 ms 4720 KB Output is correct
135 Correct 3738 ms 12852 KB Output is correct
136 Correct 4385 ms 3332 KB Output is correct
137 Correct 4526 ms 16092 KB Output is correct
138 Correct 3474 ms 14596 KB Output is correct
139 Correct 4135 ms 17204 KB Output is correct
140 Correct 4484 ms 19532 KB Output is correct
141 Correct 3876 ms 16072 KB Output is correct
142 Correct 1101 ms 7976 KB Output is correct
143 Correct 1838 ms 9404 KB Output is correct
144 Correct 726 ms 7224 KB Output is correct
145 Correct 4493 ms 18564 KB Output is correct
146 Correct 2546 ms 12388 KB Output is correct
147 Correct 1943 ms 9984 KB Output is correct
148 Correct 1786 ms 9792 KB Output is correct
149 Correct 2587 ms 13212 KB Output is correct
150 Correct 2600 ms 13216 KB Output is correct
151 Correct 2598 ms 13204 KB Output is correct
152 Correct 2550 ms 13136 KB Output is correct
153 Correct 2595 ms 13072 KB Output is correct
154 Correct 2634 ms 13084 KB Output is correct
155 Correct 1440 ms 8252 KB Output is correct
156 Correct 2019 ms 10048 KB Output is correct
157 Correct 4452 ms 19044 KB Output is correct
158 Correct 4560 ms 20228 KB Output is correct
159 Correct 3533 ms 15484 KB Output is correct
160 Correct 2742 ms 12856 KB Output is correct
161 Correct 306 ms 6712 KB Output is correct
162 Correct 315 ms 6652 KB Output is correct
163 Correct 307 ms 6760 KB Output is correct
164 Correct 371 ms 6800 KB Output is correct
165 Correct 318 ms 6768 KB Output is correct
166 Correct 271 ms 6708 KB Output is correct
167 Correct 4730 ms 20644 KB Output is correct
168 Correct 4753 ms 20572 KB Output is correct
169 Correct 4401 ms 19640 KB Output is correct
170 Correct 4314 ms 17864 KB Output is correct
171 Correct 3865 ms 16072 KB Output is correct
172 Correct 2401 ms 11376 KB Output is correct
173 Correct 4652 ms 19092 KB Output is correct
174 Correct 2506 ms 11564 KB Output is correct
175 Correct 4026 ms 16932 KB Output is correct
176 Correct 1790 ms 9556 KB Output is correct
177 Correct 3553 ms 14976 KB Output is correct
178 Correct 3362 ms 14796 KB Output is correct