oj.uz

답안 #613610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613610 2022-07-30T07:38:20 Z KoD Segments (IZhO18_segments) C++17
100 / 100
 4587 ms 16324 KB 
#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 read() {
    char c = getchar_unlocked();
    while (c < '0' or '9' < c) {
        c = getchar_unlocked();
    }
    int ret = 0;
    while ('0' <= c and c <= '9') {
        ret = ret * 10 + (c - '0');
        c = getchar_unlocked();
    }
    return ret;
}

void write(int x) {
    static char buf[10] = {};
    int i = 0;
    if (x == 0) {
        putchar_unlocked('0');
    } else {
        while (x > 0) {
            buf[i++] = '0' + (x % 10);
            x /= 10;
        }
        while (i > 0) {
            putchar_unlocked(buf[--i]);
        }
    }
    putchar_unlocked('\n');
}

int main() {
    const int Q = read();
    const int T = read();
    int Answer = 0;

    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();
        }
        const int t = read();
        if (t == 1) {
            int a = read();
            int b = read();
            if (T == 1) {
                a ^= Answer;
                b ^= Answer;
            }
            if (a > b) {
                std::swap(a, b);
            }
            add(a, b);
        } else if (t == 2) {
            remove(read() - 1);
        } else {
            int a = read();
            int b = read();
            if (T == 1) {
                a ^= Answer;
                b ^= Answer;
            }
            if (a > b) {
                std::swap(a, b);
            }
            Answer = solve(a, b, read() - 1);
            write(Answer);
        }
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 10 ms 556 KB Output is correct
6 Correct 7 ms 556 KB Output is correct
7 Correct 14 ms 368 KB Output is correct
8 Correct 18 ms 468 KB Output is correct
9 Correct 16 ms 340 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 44 ms 376 KB Output is correct
12 Correct 48 ms 484 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 20 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 20 ms 360 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 17 ms 340 KB Output is correct
20 Correct 18 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 672 ms 4852 KB Output is correct
2 Correct 683 ms 4848 KB Output is correct
3 Correct 678 ms 4788 KB Output is correct
4 Correct 1113 ms 4996 KB Output is correct
5 Correct 1155 ms 7792 KB Output is correct
6 Correct 1138 ms 7832 KB Output is correct
7 Correct 715 ms 4892 KB Output is correct
8 Correct 677 ms 4864 KB Output is correct
9 Correct 641 ms 4920 KB Output is correct
10 Correct 1126 ms 2724 KB Output is correct
11 Correct 1464 ms 3112 KB Output is correct
12 Correct 705 ms 6148 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 1380 KB Output is correct
2 Correct 108 ms 1404 KB Output is correct
3 Correct 141 ms 1448 KB Output is correct
4 Correct 104 ms 1420 KB Output is correct
5 Correct 968 ms 6220 KB Output is correct
6 Correct 796 ms 5532 KB Output is correct
7 Correct 1110 ms 5872 KB Output is correct
8 Correct 1115 ms 7912 KB Output is correct
9 Correct 1166 ms 7796 KB Output is correct
10 Correct 1076 ms 6180 KB Output is correct
11 Correct 379 ms 1900 KB Output is correct
12 Correct 1124 ms 6188 KB Output is correct
13 Correct 1045 ms 5504 KB Output is correct
14 Correct 747 ms 3724 KB Output is correct
15 Correct 706 ms 3292 KB Output is correct
16 Correct 631 ms 2944 KB Output is correct
17 Correct 642 ms 4848 KB Output is correct
18 Correct 651 ms 4896 KB Output is correct
19 Correct 706 ms 4864 KB Output is correct
20 Correct 644 ms 4868 KB Output is correct
21 Correct 456 ms 1948 KB Output is correct
22 Correct 960 ms 4860 KB Output is correct
23 Correct 976 ms 5008 KB Output is correct
24 Correct 909 ms 4248 KB Output is correct
25 Correct 127 ms 1456 KB Output is correct
26 Correct 124 ms 1384 KB Output is correct
27 Correct 112 ms 1412 KB Output is correct
28 Correct 111 ms 1444 KB Output is correct
29 Correct 1022 ms 5536 KB Output is correct
30 Correct 1008 ms 5460 KB Output is correct
31 Correct 1176 ms 8028 KB Output is correct
32 Correct 1061 ms 6200 KB Output is correct
33 Correct 1049 ms 5948 KB Output is correct
34 Correct 706 ms 3448 KB Output is correct
35 Correct 922 ms 5076 KB Output is correct
36 Correct 1046 ms 6184 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 1392 KB Output is correct
2 Correct 108 ms 1388 KB Output is correct
3 Correct 114 ms 1356 KB Output is correct
4 Correct 140 ms 1432 KB Output is correct
5 Correct 1194 ms 6312 KB Output is correct
6 Correct 1964 ms 2216 KB Output is correct
7 Correct 1090 ms 7340 KB Output is correct
8 Correct 1703 ms 2736 KB Output is correct
9 Correct 840 ms 4072 KB Output is correct
10 Correct 1046 ms 6940 KB Output is correct
11 Correct 621 ms 2408 KB Output is correct
12 Correct 1191 ms 7768 KB Output is correct
13 Correct 963 ms 5520 KB Output is correct
14 Correct 788 ms 3620 KB Output is correct
15 Correct 1135 ms 7752 KB Output is correct
16 Correct 1002 ms 5988 KB Output is correct
17 Correct 673 ms 4924 KB Output is correct
18 Correct 637 ms 4916 KB Output is correct
19 Correct 639 ms 4916 KB Output is correct
20 Correct 624 ms 4860 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 10 ms 556 KB Output is correct
6 Correct 7 ms 556 KB Output is correct
7 Correct 14 ms 368 KB Output is correct
8 Correct 18 ms 468 KB Output is correct
9 Correct 16 ms 340 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 44 ms 376 KB Output is correct
12 Correct 48 ms 484 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 20 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 20 ms 360 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 17 ms 340 KB Output is correct
20 Correct 18 ms 376 KB Output is correct
21 Correct 672 ms 4852 KB Output is correct
22 Correct 683 ms 4848 KB Output is correct
23 Correct 678 ms 4788 KB Output is correct
24 Correct 1113 ms 4996 KB Output is correct
25 Correct 1155 ms 7792 KB Output is correct
26 Correct 1138 ms 7832 KB Output is correct
27 Correct 715 ms 4892 KB Output is correct
28 Correct 677 ms 4864 KB Output is correct
29 Correct 641 ms 4920 KB Output is correct
30 Correct 1126 ms 2724 KB Output is correct
31 Correct 1464 ms 3112 KB Output is correct
32 Correct 705 ms 6148 KB Output is correct
33 Correct 98 ms 1392 KB Output is correct
34 Correct 108 ms 1388 KB Output is correct
35 Correct 114 ms 1356 KB Output is correct
36 Correct 140 ms 1432 KB Output is correct
37 Correct 1194 ms 6312 KB Output is correct
38 Correct 1964 ms 2216 KB Output is correct
39 Correct 1090 ms 7340 KB Output is correct
40 Correct 1703 ms 2736 KB Output is correct
41 Correct 840 ms 4072 KB Output is correct
42 Correct 1046 ms 6940 KB Output is correct
43 Correct 621 ms 2408 KB Output is correct
44 Correct 1191 ms 7768 KB Output is correct
45 Correct 963 ms 5520 KB Output is correct
46 Correct 788 ms 3620 KB Output is correct
47 Correct 1135 ms 7752 KB Output is correct
48 Correct 1002 ms 5988 KB Output is correct
49 Correct 673 ms 4924 KB Output is correct
50 Correct 637 ms 4916 KB Output is correct
51 Correct 639 ms 4916 KB Output is correct
52 Correct 624 ms 4860 KB Output is correct
53 Correct 128 ms 1444 KB Output is correct
54 Correct 107 ms 1432 KB Output is correct
55 Correct 106 ms 1368 KB Output is correct
56 Correct 122 ms 1480 KB Output is correct
57 Correct 356 ms 3452 KB Output is correct
58 Correct 1279 ms 2108 KB Output is correct
59 Correct 892 ms 5668 KB Output is correct
60 Correct 327 ms 2176 KB Output is correct
61 Correct 1058 ms 5712 KB Output is correct
62 Correct 1132 ms 7344 KB Output is correct
63 Correct 1097 ms 7860 KB Output is correct
64 Correct 1155 ms 7552 KB Output is correct
65 Correct 684 ms 2808 KB Output is correct
66 Correct 624 ms 2752 KB Output is correct
67 Correct 1014 ms 5904 KB Output is correct
68 Correct 909 ms 5584 KB Output is correct
69 Correct 659 ms 4972 KB Output is correct
70 Correct 641 ms 4948 KB Output is correct
71 Correct 651 ms 4808 KB Output is correct
72 Correct 634 ms 4876 KB Output is correct
73 Correct 736 ms 3600 KB Output is correct
74 Correct 923 ms 4884 KB Output is correct
75 Correct 1184 ms 8040 KB Output is correct
76 Correct 1113 ms 7920 KB Output is correct
77 Correct 109 ms 1364 KB Output is correct
78 Correct 105 ms 1408 KB Output is correct
79 Correct 110 ms 1408 KB Output is correct
80 Correct 121 ms 1488 KB Output is correct
81 Correct 944 ms 4684 KB Output is correct
82 Correct 748 ms 3460 KB Output is correct
83 Correct 587 ms 2360 KB Output is correct
84 Correct 919 ms 4820 KB Output is correct
85 Correct 1004 ms 6292 KB Output is correct
86 Correct 1004 ms 6148 KB Output is correct
87 Correct 810 ms 4272 KB Output is correct
88 Correct 623 ms 2328 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 10 ms 556 KB Output is correct
6 Correct 7 ms 556 KB Output is correct
7 Correct 14 ms 368 KB Output is correct
8 Correct 18 ms 468 KB Output is correct
9 Correct 16 ms 340 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 44 ms 376 KB Output is correct
12 Correct 48 ms 484 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 20 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 20 ms 360 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 17 ms 340 KB Output is correct
20 Correct 18 ms 376 KB Output is correct
21 Correct 672 ms 4852 KB Output is correct
22 Correct 683 ms 4848 KB Output is correct
23 Correct 678 ms 4788 KB Output is correct
24 Correct 1113 ms 4996 KB Output is correct
25 Correct 1155 ms 7792 KB Output is correct
26 Correct 1138 ms 7832 KB Output is correct
27 Correct 715 ms 4892 KB Output is correct
28 Correct 677 ms 4864 KB Output is correct
29 Correct 641 ms 4920 KB Output is correct
30 Correct 1126 ms 2724 KB Output is correct
31 Correct 1464 ms 3112 KB Output is correct
32 Correct 705 ms 6148 KB Output is correct
33 Correct 115 ms 1380 KB Output is correct
34 Correct 108 ms 1404 KB Output is correct
35 Correct 141 ms 1448 KB Output is correct
36 Correct 104 ms 1420 KB Output is correct
37 Correct 968 ms 6220 KB Output is correct
38 Correct 796 ms 5532 KB Output is correct
39 Correct 1110 ms 5872 KB Output is correct
40 Correct 1115 ms 7912 KB Output is correct
41 Correct 1166 ms 7796 KB Output is correct
42 Correct 1076 ms 6180 KB Output is correct
43 Correct 379 ms 1900 KB Output is correct
44 Correct 1124 ms 6188 KB Output is correct
45 Correct 1045 ms 5504 KB Output is correct
46 Correct 747 ms 3724 KB Output is correct
47 Correct 706 ms 3292 KB Output is correct
48 Correct 631 ms 2944 KB Output is correct
49 Correct 642 ms 4848 KB Output is correct
50 Correct 651 ms 4896 KB Output is correct
51 Correct 706 ms 4864 KB Output is correct
52 Correct 644 ms 4868 KB Output is correct
53 Correct 456 ms 1948 KB Output is correct
54 Correct 960 ms 4860 KB Output is correct
55 Correct 976 ms 5008 KB Output is correct
56 Correct 909 ms 4248 KB Output is correct
57 Correct 127 ms 1456 KB Output is correct
58 Correct 124 ms 1384 KB Output is correct
59 Correct 112 ms 1412 KB Output is correct
60 Correct 111 ms 1444 KB Output is correct
61 Correct 1022 ms 5536 KB Output is correct
62 Correct 1008 ms 5460 KB Output is correct
63 Correct 1176 ms 8028 KB Output is correct
64 Correct 1061 ms 6200 KB Output is correct
65 Correct 1049 ms 5948 KB Output is correct
66 Correct 706 ms 3448 KB Output is correct
67 Correct 922 ms 5076 KB Output is correct
68 Correct 1046 ms 6184 KB Output is correct
69 Correct 98 ms 1392 KB Output is correct
70 Correct 108 ms 1388 KB Output is correct
71 Correct 114 ms 1356 KB Output is correct
72 Correct 140 ms 1432 KB Output is correct
73 Correct 1194 ms 6312 KB Output is correct
74 Correct 1964 ms 2216 KB Output is correct
75 Correct 1090 ms 7340 KB Output is correct
76 Correct 1703 ms 2736 KB Output is correct
77 Correct 840 ms 4072 KB Output is correct
78 Correct 1046 ms 6940 KB Output is correct
79 Correct 621 ms 2408 KB Output is correct
80 Correct 1191 ms 7768 KB Output is correct
81 Correct 963 ms 5520 KB Output is correct
82 Correct 788 ms 3620 KB Output is correct
83 Correct 1135 ms 7752 KB Output is correct
84 Correct 1002 ms 5988 KB Output is correct
85 Correct 673 ms 4924 KB Output is correct
86 Correct 637 ms 4916 KB Output is correct
87 Correct 639 ms 4916 KB Output is correct
88 Correct 624 ms 4860 KB Output is correct
89 Correct 128 ms 1444 KB Output is correct
90 Correct 107 ms 1432 KB Output is correct
91 Correct 106 ms 1368 KB Output is correct
92 Correct 122 ms 1480 KB Output is correct
93 Correct 356 ms 3452 KB Output is correct
94 Correct 1279 ms 2108 KB Output is correct
95 Correct 892 ms 5668 KB Output is correct
96 Correct 327 ms 2176 KB Output is correct
97 Correct 1058 ms 5712 KB Output is correct
98 Correct 1132 ms 7344 KB Output is correct
99 Correct 1097 ms 7860 KB Output is correct
100 Correct 1155 ms 7552 KB Output is correct
101 Correct 684 ms 2808 KB Output is correct
102 Correct 624 ms 2752 KB Output is correct
103 Correct 1014 ms 5904 KB Output is correct
104 Correct 909 ms 5584 KB Output is correct
105 Correct 659 ms 4972 KB Output is correct
106 Correct 641 ms 4948 KB Output is correct
107 Correct 651 ms 4808 KB Output is correct
108 Correct 634 ms 4876 KB Output is correct
109 Correct 736 ms 3600 KB Output is correct
110 Correct 923 ms 4884 KB Output is correct
111 Correct 1184 ms 8040 KB Output is correct
112 Correct 1113 ms 7920 KB Output is correct
113 Correct 109 ms 1364 KB Output is correct
114 Correct 105 ms 1408 KB Output is correct
115 Correct 110 ms 1408 KB Output is correct
116 Correct 121 ms 1488 KB Output is correct
117 Correct 944 ms 4684 KB Output is correct
118 Correct 748 ms 3460 KB Output is correct
119 Correct 587 ms 2360 KB Output is correct
120 Correct 919 ms 4820 KB Output is correct
121 Correct 1004 ms 6292 KB Output is correct
122 Correct 1004 ms 6148 KB Output is correct
123 Correct 810 ms 4272 KB Output is correct
124 Correct 623 ms 2328 KB Output is correct
125 Correct 235 ms 2544 KB Output is correct
126 Correct 244 ms 2524 KB Output is correct
127 Correct 265 ms 2548 KB Output is correct
128 Correct 241 ms 2516 KB Output is correct
129 Correct 216 ms 2464 KB Output is correct
130 Correct 254 ms 2528 KB Output is correct
131 Correct 3085 ms 4184 KB Output is correct
132 Correct 1194 ms 8372 KB Output is correct
133 Correct 2391 ms 12484 KB Output is correct
134 Correct 1436 ms 4876 KB Output is correct
135 Correct 3679 ms 12672 KB Output is correct
136 Correct 4433 ms 3184 KB Output is correct
137 Correct 4574 ms 15952 KB Output is correct
138 Correct 3462 ms 11140 KB Output is correct
139 Correct 4122 ms 13080 KB Output is correct
140 Correct 4402 ms 15108 KB Output is correct
141 Correct 3788 ms 12624 KB Output is correct
142 Correct 1047 ms 3568 KB Output is correct
143 Correct 1800 ms 6264 KB Output is correct
144 Correct 681 ms 3172 KB Output is correct
145 Correct 4381 ms 14888 KB Output is correct
146 Correct 2496 ms 7756 KB Output is correct
147 Correct 1896 ms 6080 KB Output is correct
148 Correct 1708 ms 5884 KB Output is correct
149 Correct 2465 ms 9140 KB Output is correct
150 Correct 2522 ms 9028 KB Output is correct
151 Correct 2488 ms 9084 KB Output is correct
152 Correct 2467 ms 9060 KB Output is correct
153 Correct 2500 ms 9124 KB Output is correct
154 Correct 2492 ms 9228 KB Output is correct
155 Correct 1421 ms 4464 KB Output is correct
156 Correct 1954 ms 6708 KB Output is correct
157 Correct 4344 ms 14744 KB Output is correct
158 Correct 4468 ms 15912 KB Output is correct
159 Correct 3442 ms 11272 KB Output is correct
160 Correct 2640 ms 8992 KB Output is correct
161 Correct 269 ms 2544 KB Output is correct
162 Correct 251 ms 2516 KB Output is correct
163 Correct 244 ms 2556 KB Output is correct
164 Correct 279 ms 2736 KB Output is correct
165 Correct 251 ms 2516 KB Output is correct
166 Correct 225 ms 2456 KB Output is correct
167 Correct 4580 ms 16324 KB Output is correct
168 Correct 4587 ms 16256 KB Output is correct
169 Correct 4319 ms 15116 KB Output is correct
170 Correct 4201 ms 14368 KB Output is correct
171 Correct 3718 ms 12360 KB Output is correct
172 Correct 2322 ms 7532 KB Output is correct
173 Correct 4520 ms 14744 KB Output is correct
174 Correct 2420 ms 8076 KB Output is correct
175 Correct 3885 ms 12836 KB Output is correct
176 Correct 1698 ms 5752 KB Output is correct
177 Correct 3462 ms 10560 KB Output is correct
178 Correct 3334 ms 10336 KB Output is correct