oj.uz

Submission #800631

# Submission time Handle Problem Language Result Execution time Memory
800631 2023-08-01T17:08:36 Z Johann L-triominoes (CEOI21_ltriominoes) C++14
100 / 100
 240 ms 1804 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

const int maxW = 13;

typedef bitset<1 << maxW> bs;
typedef vector<bs> vbs;
typedef vector<vbs> vvbs;

int W, H, K;
map<int, int> blocked;
vbs mod;
vi group;
vi degin, degout;
vvi adj;
bs dp[2];
vvbs lift;

void dfs(int idx, int base, int next, set<int> &nextdp)
{
    if (idx == W)
    {
        nextdp.insert(next);
        return;
    }
    if (base & (1 << idx))
        dfs(idx + 1, base, next, nextdp);
    else
    {
        // _X my pos: 1 << idx

        // TT
        // _T
        if (idx < W - 1 && ((3 << idx) & next) == 0)
            dfs(idx + 1, base | (1 << idx), next | (3 << idx), nextdp);

        // _TT
        // _T_
        if (idx > 0 && ((3 << (idx - 1)) & next) == 0)
            dfs(idx + 1, base | (1 << idx), next | (3 << (idx - 1)), nextdp);

        // T_
        // TT
        if (idx < W - 1 && (base & (3 << idx)) == 0 && (next & (2 << idx)) == 0)
            dfs(idx + 2, base | (3 << idx), next | (2 << idx), nextdp);

        // _T
        // TT
        if (idx < W - 1 && (base & (3 << idx)) == 0 && (next & (1 << idx)) == 0)
            dfs(idx + 2, base | (3 << idx), next | (1 << idx), nextdp);
    }
}

void step(bs &base, int block = 0)
{
    bs re = 0;
    for (int j = 0; j < 1 << W; ++j)
    {
        if (!base[j])
            continue;
        if (j & block)
            continue;

        for (int u : adj[j | block])
            re[u] = 1;
    }
    swap(base, re);
}

void mul(bs &base, int liftidx, bs &re, int block = 0)
{
    re = 0;
    for (int j = 0; j < 1 << W; ++j)
    {
        if (!base[j])
            continue;
        if (j & block)
            continue;

        re |= lift[liftidx][j | block];
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> W >> H >> K;
    for (int k = 0, x, y; k < K; ++k)
    {
        cin >> x >> y;
        --x, --y;
        blocked[y] = blocked[y] | (1 << x);
    }

    degin.assign(1 << W, 0), degout.assign(1 << W, 0);
    adj.resize(1 << W);
    for (int i = 0; i < 1 << W; ++i)
    {
        set<int> tmp;
        dfs(0, i, 0, tmp);
        degout[i] = sz(tmp);
        for (int u : tmp)
            adj[i].push_back(u), ++degin[u];
    }

    if (W <= 3)
    {

        lift.assign(ceil(log2(H) + 1), vbs(1 << W));
        for (int i = 0; i < 1 << W; ++i)
            for (int j : adj[i])
                lift[0][i][j] = 1;

        for (int j = 1; j < sz(lift); ++j)
            for (int i = 0; i < 1 << W; ++i)
                mul(lift[j - 1][i], j - 1, lift[j][i]);

        if (false)
        {
            dp[0] = 0;
            dp[0][0] = true;
            for (int i = 0; i < H; ++i)
            {
                int ii = i & 1;
                int ni = ii ^ 1;
                dp[ni] = 0;

                mul(dp[ii], 0, dp[ni], blocked[i]);
            }

            if (dp[H & 1][0])
                cout << "YES\n";
            else
                cout << "NO\n";
        }
        else
        {
            bs start = 0, tmp;
            start[0] = 1;
            blocked[H - 1] = blocked[H - 1] | 0;
            int h = 0;
            for (pii p : blocked)
            {
                for (int j = sz(lift) - 1; j >= 0; --j)
                {
                    if (p.first - h >= (1 << j))
                    {
                        h += (1 << j);
                        mul(start, j, tmp);
                        swap(start, tmp);
                    }
                }
                mul(start, 0, tmp, p.second);
                swap(start, tmp);
                ++h;
            }

            if (start[0])
                cout << "YES\n";
            else
                cout << "NO\n";
        }
    }
    else
    {
        group.assign(1 << W, -1);
        mod.assign(3, 0);
        if (W % 3 == 0)
        {
            int idx = 0;
            for (int i = 0; i < 1 << W; ++i)
            {
                if (group[i] != -1 || degout[i] == 0)
                    continue;
                bs start = 0;
                start[i] = 1;
                for (int j = 0; j < 12; ++j)
                    step(start);

                if (degin[i] == 0)
                {
                    int j = 0;
                    while (!start[j])
                        ++j;
                    group[i] = group[j];
                    continue;
                }

                mod[idx] = start;
                for (int j = 0; j < (1 << W); ++j)
                    if (start[j])
                        group[j] = idx;
                ++idx;
            }
            assert(idx == 3);
        }
        else
        {
            bs start = 0;
            start[0] = 1;
            for (int j = 0; j < 12; ++j)
                step(start);

            for (int idx = 0; idx < 3; ++idx)
            {
                for (int i = 0; i < 1 << W; ++i)
                    if (start[i])
                        group[i] = idx;
                mod[idx] = start;
                step(start);
            }
        }

        bs start = 0;
        start[0] = 1;
        blocked[H - 1] = blocked[H - 1] | 0;
        int h = 0;
        for (pii p : blocked)
        {
            int delta = p.first - h;
            if (delta >= 11)
            {
                set<int> G;
                if (W % 3 == 0)
                {
                    for (int i = 0; i < 1 << W; ++i)
                        if (start[i])
                            G.insert(group[i]);
                }
                else
                {
                    for (int i = 0; i < 1 << W; ++i)
                        if (start[i])
                            G.insert((group[i] + delta) % 3);
                }
                start = 0;
                for (int g : G)
                    start |= mod[g];
                h = p.first;
            }
            else
            {
                for (; h < p.first; ++h)
                    step(start);
            }
            step(start, p.second);
            ++h;
        }

        if (start[0])
            cout << "YES\n";
        else
            cout << "NO\n";
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 10 ms 928 KB Output is correct
16 Correct 88 ms 1772 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 30 ms 852 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 59 ms 1748 KB Output is correct
21 Correct 24 ms 916 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 32 ms 1768 KB Output is correct
26 Correct 56 ms 1696 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 10 ms 876 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 23 ms 1680 KB Output is correct
19 Correct 23 ms 1712 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 452 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 444 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 452 KB Output is correct
20 Correct 1 ms 476 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 452 KB Output is correct
30 Correct 2 ms 452 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 448 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 476 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 476 KB Output is correct
48 Correct 1 ms 580 KB Output is correct
49 Correct 1 ms 340 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 216 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 216 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 216 KB Output is correct
29 Correct 0 ms 220 KB Output is correct
30 Correct 0 ms 224 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 220 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 224 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 224 KB Output is correct
37 Correct 1 ms 352 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 13 ms 944 KB Output is correct
5 Correct 5 ms 480 KB Output is correct
6 Correct 6 ms 480 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 9 ms 852 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 10 ms 908 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 14 ms 856 KB Output is correct
21 Correct 6 ms 544 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 40 ms 1724 KB Output is correct
25 Correct 16 ms 852 KB Output is correct
26 Correct 38 ms 1756 KB Output is correct
27 Correct 38 ms 1724 KB Output is correct
28 Correct 27 ms 1756 KB Output is correct
29 Correct 29 ms 1668 KB Output is correct
30 Correct 47 ms 1716 KB Output is correct
31 Correct 27 ms 1740 KB Output is correct
32 Correct 28 ms 1748 KB Output is correct
33 Correct 14 ms 876 KB Output is correct
34 Correct 32 ms 1780 KB Output is correct
35 Correct 39 ms 1772 KB Output is correct
36 Correct 39 ms 1736 KB Output is correct
37 Correct 11 ms 940 KB Output is correct
38 Correct 14 ms 936 KB Output is correct
39 Correct 6 ms 476 KB Output is correct
40 Correct 35 ms 1756 KB Output is correct
41 Correct 6 ms 548 KB Output is correct
42 Correct 34 ms 1772 KB Output is correct
43 Correct 45 ms 1748 KB Output is correct
44 Correct 41 ms 1804 KB Output is correct
45 Correct 33 ms 1740 KB Output is correct
46 Correct 11 ms 852 KB Output is correct
47 Correct 230 ms 1764 KB Output is correct
48 Correct 191 ms 1748 KB Output is correct
49 Correct 69 ms 1756 KB Output is correct
50 Correct 15 ms 540 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 10 ms 928 KB Output is correct
16 Correct 88 ms 1772 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 30 ms 852 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 59 ms 1748 KB Output is correct
21 Correct 24 ms 916 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 32 ms 1768 KB Output is correct
26 Correct 56 ms 1696 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 10 ms 876 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 452 KB Output is correct
43 Correct 1 ms 460 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 23 ms 1680 KB Output is correct
46 Correct 23 ms 1712 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 452 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 0 ms 340 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 0 ms 468 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 444 KB Output is correct
61 Correct 1 ms 452 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 1 ms 452 KB Output is correct
71 Correct 1 ms 476 KB Output is correct
72 Correct 1 ms 468 KB Output is correct
73 Correct 1 ms 468 KB Output is correct
74 Correct 1 ms 468 KB Output is correct
75 Correct 1 ms 468 KB Output is correct
76 Correct 1 ms 468 KB Output is correct
77 Correct 1 ms 596 KB Output is correct
78 Correct 1 ms 468 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 1 ms 452 KB Output is correct
81 Correct 2 ms 452 KB Output is correct
82 Correct 1 ms 468 KB Output is correct
83 Correct 1 ms 468 KB Output is correct
84 Correct 1 ms 468 KB Output is correct
85 Correct 1 ms 448 KB Output is correct
86 Correct 1 ms 468 KB Output is correct
87 Correct 1 ms 468 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 1 ms 340 KB Output is correct
90 Correct 1 ms 468 KB Output is correct
91 Correct 1 ms 476 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 468 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 596 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 476 KB Output is correct
99 Correct 1 ms 580 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 0 ms 340 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 0 ms 212 KB Output is correct
106 Correct 0 ms 212 KB Output is correct
107 Correct 0 ms 212 KB Output is correct
108 Correct 0 ms 212 KB Output is correct
109 Correct 0 ms 212 KB Output is correct
110 Correct 0 ms 340 KB Output is correct
111 Correct 1 ms 340 KB Output is correct
112 Correct 1 ms 340 KB Output is correct
113 Correct 1 ms 340 KB Output is correct
114 Correct 0 ms 212 KB Output is correct
115 Correct 1 ms 340 KB Output is correct
116 Correct 1 ms 212 KB Output is correct
117 Correct 0 ms 340 KB Output is correct
118 Correct 0 ms 212 KB Output is correct
119 Correct 1 ms 212 KB Output is correct
120 Correct 1 ms 340 KB Output is correct
121 Correct 1 ms 216 KB Output is correct
122 Correct 1 ms 344 KB Output is correct
123 Correct 1 ms 216 KB Output is correct
124 Correct 1 ms 340 KB Output is correct
125 Correct 1 ms 344 KB Output is correct
126 Correct 1 ms 344 KB Output is correct
127 Correct 1 ms 340 KB Output is correct
128 Correct 0 ms 216 KB Output is correct
129 Correct 0 ms 220 KB Output is correct
130 Correct 0 ms 224 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 1 ms 220 KB Output is correct
133 Correct 1 ms 348 KB Output is correct
134 Correct 1 ms 224 KB Output is correct
135 Correct 1 ms 344 KB Output is correct
136 Correct 1 ms 224 KB Output is correct
137 Correct 1 ms 352 KB Output is correct
138 Correct 1 ms 352 KB Output is correct
139 Correct 1 ms 220 KB Output is correct
140 Correct 1 ms 348 KB Output is correct
141 Correct 13 ms 944 KB Output is correct
142 Correct 5 ms 480 KB Output is correct
143 Correct 6 ms 480 KB Output is correct
144 Correct 2 ms 340 KB Output is correct
145 Correct 3 ms 340 KB Output is correct
146 Correct 2 ms 348 KB Output is correct
147 Correct 2 ms 340 KB Output is correct
148 Correct 9 ms 852 KB Output is correct
149 Correct 4 ms 468 KB Output is correct
150 Correct 1 ms 344 KB Output is correct
151 Correct 10 ms 908 KB Output is correct
152 Correct 1 ms 340 KB Output is correct
153 Correct 1 ms 340 KB Output is correct
154 Correct 2 ms 340 KB Output is correct
155 Correct 1 ms 340 KB Output is correct
156 Correct 1 ms 352 KB Output is correct
157 Correct 14 ms 856 KB Output is correct
158 Correct 6 ms 544 KB Output is correct
159 Correct 1 ms 340 KB Output is correct
160 Correct 2 ms 340 KB Output is correct
161 Correct 40 ms 1724 KB Output is correct
162 Correct 16 ms 852 KB Output is correct
163 Correct 38 ms 1756 KB Output is correct
164 Correct 38 ms 1724 KB Output is correct
165 Correct 27 ms 1756 KB Output is correct
166 Correct 29 ms 1668 KB Output is correct
167 Correct 47 ms 1716 KB Output is correct
168 Correct 27 ms 1740 KB Output is correct
169 Correct 28 ms 1748 KB Output is correct
170 Correct 14 ms 876 KB Output is correct
171 Correct 32 ms 1780 KB Output is correct
172 Correct 39 ms 1772 KB Output is correct
173 Correct 39 ms 1736 KB Output is correct
174 Correct 11 ms 940 KB Output is correct
175 Correct 14 ms 936 KB Output is correct
176 Correct 6 ms 476 KB Output is correct
177 Correct 35 ms 1756 KB Output is correct
178 Correct 6 ms 548 KB Output is correct
179 Correct 34 ms 1772 KB Output is correct
180 Correct 45 ms 1748 KB Output is correct
181 Correct 41 ms 1804 KB Output is correct
182 Correct 33 ms 1740 KB Output is correct
183 Correct 11 ms 852 KB Output is correct
184 Correct 230 ms 1764 KB Output is correct
185 Correct 191 ms 1748 KB Output is correct
186 Correct 69 ms 1756 KB Output is correct
187 Correct 15 ms 540 KB Output is correct
188 Correct 33 ms 1748 KB Output is correct
189 Correct 1 ms 340 KB Output is correct
190 Correct 1 ms 468 KB Output is correct
191 Correct 1 ms 452 KB Output is correct
192 Correct 1 ms 324 KB Output is correct
193 Correct 1 ms 212 KB Output is correct
194 Correct 1 ms 468 KB Output is correct
195 Correct 1 ms 328 KB Output is correct
196 Correct 1 ms 468 KB Output is correct
197 Correct 1 ms 576 KB Output is correct
198 Correct 1 ms 468 KB Output is correct
199 Correct 6 ms 468 KB Output is correct
200 Correct 1 ms 468 KB Output is correct
201 Correct 2 ms 320 KB Output is correct
202 Correct 2 ms 328 KB Output is correct
203 Correct 0 ms 212 KB Output is correct
204 Correct 0 ms 212 KB Output is correct
205 Correct 0 ms 324 KB Output is correct
206 Correct 0 ms 212 KB Output is correct
207 Correct 1 ms 340 KB Output is correct
208 Correct 119 ms 1780 KB Output is correct
209 Correct 142 ms 1708 KB Output is correct
210 Correct 1 ms 340 KB Output is correct
211 Correct 1 ms 340 KB Output is correct
212 Correct 14 ms 904 KB Output is correct
213 Correct 1 ms 468 KB Output is correct
214 Correct 2 ms 324 KB Output is correct
215 Correct 1 ms 292 KB Output is correct
216 Correct 39 ms 1748 KB Output is correct
217 Correct 39 ms 1688 KB Output is correct
218 Correct 1 ms 468 KB Output is correct
219 Correct 1 ms 476 KB Output is correct
220 Correct 1 ms 340 KB Output is correct
221 Correct 1 ms 340 KB Output is correct
222 Correct 1 ms 596 KB Output is correct
223 Correct 1 ms 340 KB Output is correct
224 Correct 240 ms 1684 KB Output is correct
225 Correct 1 ms 476 KB Output is correct
226 Correct 1 ms 340 KB Output is correct
227 Correct 1 ms 340 KB Output is correct
228 Correct 29 ms 1688 KB Output is correct
229 Correct 27 ms 1740 KB Output is correct
230 Correct 32 ms 1760 KB Output is correct
231 Correct 32 ms 1740 KB Output is correct
232 Correct 1 ms 596 KB Output is correct
233 Correct 1 ms 452 KB Output is correct
234 Correct 39 ms 1708 KB Output is correct
235 Correct 1 ms 468 KB Output is correct
236 Correct 14 ms 852 KB Output is correct
237 Correct 1 ms 340 KB Output is correct
238 Correct 1 ms 340 KB Output is correct
239 Correct 6 ms 596 KB Output is correct
240 Correct 35 ms 1732 KB Output is correct
241 Correct 1 ms 212 KB Output is correct
242 Correct 1 ms 340 KB Output is correct
243 Correct 1 ms 324 KB Output is correct
244 Correct 1 ms 324 KB Output is correct
245 Correct 10 ms 832 KB Output is correct