oj.uz

Submission #781321

# Submission time Handle Problem Language Result Execution time Memory
781321 2023-07-13T03:06:23 Z green_gold_dog Maze (JOI23_ho_t3) C++17
94 / 100
 2000 ms 107916 KB 
#include<bits/stdc++.h>

using namespace std;

typedef int ll;

const ll INF = 1'000'000'000;

template<typename T>
bool assign_min(T& a, T b) {
        if (a > b) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_max(T& a, T b) {
        if (a < b) {
                a = b;
                return true;
        }
        return false;
}

struct segment_tree {
        vector<bool> tree;
        ll size;
        segment_tree(ll n) {
                size = 1;
                while (size < n) {
                        size *= 2;
                }
                tree.resize(size * 2, false);
        }
        vector<ll> set(ll l, ll r) {
                vector<ll> ans;
                set(1, 0, size, l, r, ans);
                return ans;
        }
        void set(ll v, ll l, ll r, ll ql, ll qr, vector<ll>& ans) {
                if (tree[v]) {
                        return;
                }
                if (r <= ql || qr <= l) {
                        return;
                }
                if (r - l == 1) {
                        ans.push_back(l);
                        tree[v] = true;
                        return;
                }
                ll mid = (l + r) / 2;
                set(v * 2, l, mid, ql, qr, ans);
                set(v * 2 + 1, mid, r, ql, qr, ans);
                tree[v] = tree[v * 2] && tree[v * 2 + 1];
        }
};

struct segment_tree_am {
        vector<ll> m, tree;
        ll size;
        segment_tree_am(ll n) {
                size = 1;
                while (size < n) {
                        size *= 2;
                }
                m.resize(size * 2, 0);
                tree.resize(size * 2, 0);
        }
        bool get(ll l, ll r) {
                return get(1, 0, size, l, r);
        }
        bool get(ll v, ll l, ll r, ll ql, ll qr) {
                if (tree[v] != 0) {
                        return false;
                }
                if (ql <= l && r <= qr) {
                        return true;
                }
                if (qr <= l || r <= ql) {
                        return false;
                }
                ll mid = (l + r) / 2;
                return get(v * 2, l, mid, ql, qr) || get(v * 2 + 1, mid, r, ql, qr);
        }
        void add(ll l, ll r, ll x) {
                add(1, 0, size, l, r, x);
        }
        void add(ll v, ll l, ll r, ll ql, ll qr, ll x) {
                if (ql <= l && r <= qr) {
                        tree[v] += x;
                        m[v] += x;
                        return;
                }
                if (qr <= l || r <= ql) {
                        return;
                }
                ll mid = (l + r) / 2;
                add(v * 2, l, mid, ql, qr, x);
                add(v * 2 + 1, mid, r, ql, qr, x);
                tree[v] = min(tree[v * 2], tree[v * 2 + 1]) + m[v];
        }
        ll find_first(ll l, ll r) {
                if (!get(l, r)) {
                        return r;
                }
                return find_first(1, 0, size, l, r);
        }
        ll find_first(ll v, ll l, ll r, ll ql, ll qr) {
                if (r - l == 1) {
                        return l;
                }
                ll mid = (l + r) / 2;
                if (get(v * 2, l, mid, ql, qr)) {
                        return find_first(v * 2, l, mid, ql, qr);
                } else {
                        return find_first(v * 2 + 1, mid, r, ql, qr);
                }
        }
};

void solve() {
        ll n, r, c;
        cin >> r >> c >> n;
        ll sx, sy, gx, gy;
        cin >> sx >> sy >> gx >> gy;
        sx--;
        sy--;
        gx--;
        gy--;
        vector<vector<bool>> arr(r, vector<bool>(c, false));
        vector<vector<bool>> used(r, vector<bool>(c, false));
        vector<segment_tree> dist(r, segment_tree(c));
        for (ll i = 0; i < r; i++) {
                string s;
                cin >> s;
                for (ll j = 0; j < c; j++) {
                        if (s[j] == '.') {
                                arr[i][j] = true;
                        }
                }
        }
        vector<pair<ll, ll>> now;
        now.emplace_back(sx, sy);
        used[sx][sy] = true;
        ll na = 0;
        while (true) {
                vector<pair<ll, ll>> nu;
                vector<vector<ll>> all(r * 2);
                while (!now.empty()) {
                        auto[x, y] = now.back();
                        nu.emplace_back(x, y);
                        if (x == gx && y == gy) {
                                cout << na << '\n';
                                return;
                        }
                        now.pop_back();
                        if (x > 0 && arr[x - 1][y]) {
                                if (!used[x - 1][y]) {
                                        used[x - 1][y] = true;
                                        now.emplace_back(x - 1, y);
                                }
                        }
                        if (x + 1 < r && arr[x + 1][y]) {
                                if (!used[x + 1][y]) {
                                        used[x + 1][y] = true;
                                        now.emplace_back(x + 1, y);
                                }
                        }
                        if (y > 0 && arr[x][y - 1]) {
                                if (!used[x][y - 1]) {
                                        used[x][y - 1] = true;
                                        now.emplace_back(x, y - 1);
                                }
                        }
                        if (y + 1 < c && arr[x][y + 1]) {
                                if (!used[x][y + 1]) {
                                        used[x][y + 1] = true;
                                        now.emplace_back(x, y + 1);
                                }
                        }
                        all[max(x - n + 1, (ll)0) * 2].emplace_back(y);
                        all[(min(x + n, r) - 1) * 2 + 1].emplace_back(y);
                }
                na++;
                for (auto[x, y] : nu) {
                        if (x - n >= 0) {
                                ll i = x - n;
                                for (auto j : dist[i].set(max(y - n + 1, (ll)0), min(y + n, c))) {
                                        if (!used[i][j]) {
                                                used[i][j] = true;
                                                now.emplace_back(i, j);
                                        }
                                }
                        }
                        if (x + n < r) {
                                ll i = x + n;
                                for (auto j : dist[i].set(max(y - n + 1, (ll)0), min(y + n, c))) {
                                        if (!used[i][j]) {
                                                used[i][j] = true;
                                                now.emplace_back(i, j);
                                        }
                                }
                        }
                }
                multiset<ll> nps;
                multiset<pair<ll, ll>> no;
                no.insert(make_pair(-INF, -INF));
                for (ll i = 0; i < r; i++) {
                        for (auto y : all[i * 2]) {
                                ll l = y - n, r = y + n + 1;
                                auto io = no.upper_bound(make_pair(l, INF));
                                auto nio = io;
                                io--;
                                if (io->second >= r) {
                                        nps.insert(y);
                                        continue;
                                }
                                auto it = nps.lower_bound(y);
                                ll prev = -INF, next = INF;
                                if (it != nps.end()) {
                                        next = *it;
                                }
                                if (it != nps.begin()) {
                                        it--;
                                        prev = *it;
                                }
                                nps.insert(y);
                                if (y - prev - 1 <= n * 2) {
                                        l = io->first;
                                        no.erase(io);
                                }
                                io = nio;
                                if (next - y - 1 <= n * 2) {
                                        r = io->second;
                                        no.erase(io);
                                }
                                no.insert(make_pair(l, r));
                        }
                        for (auto[l, r] : no) {
                                for (auto j : dist[i].set(max(l, (ll)0), min(r, c))) {
                                        if (!used[i][j]) {
                                                used[i][j] = true;
                                                now.emplace_back(i, j);
                                        }
                                }
                        }
                        for (auto y : all[i * 2 + 1]) {
                                ll l = y - n, r = y + n + 1;
                                auto io = no.upper_bound(make_pair(l, INF));
                                io--;
                                nps.erase(nps.find(y));
                                if (nps.empty()) {
                                        no.erase(io);
                                        continue;
                                }
                                auto[lo, ro] = *io;
                                auto it = nps.lower_bound(y);
                                if (it != nps.end() && *it == y) {
                                        continue;
                                }
                                if (it == nps.end()) {
                                        no.erase(io);
                                        it--;
                                        if (lo < l) {
                                                no.insert(make_pair(lo, *it + n + 1));
                                        }
                                        continue;
                                }
                                if (it == nps.begin()) {
                                        no.erase(io);
                                        if (ro > r) {
                                                no.insert(make_pair(*it - n, ro));
                                        }
                                        continue;
                                }
                                auto lit = it, rit = it;
                                lit--;
                                if (*rit - *lit - 1 <= n * 2) {
                                        continue;
                                }
                                no.erase(io);
                                if (lo < l) {
                                        no.insert(make_pair(lo, *lit + n + 1));
                                }
                                if (ro > r) {
                                        no.insert(make_pair(*rit - n, ro));
                                }
                        }
                }
        }
}

int main() {
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        solve();
}

Subtask #1
8.0 / 8.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 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 23 ms 428 KB Output is correct
20 Correct 14 ms 456 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 27 ms 468 KB Output is correct
23 Correct 25 ms 440 KB Output is correct
24 Correct 11 ms 484 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 11 ms 468 KB Output is correct
29 Correct 71 ms 532 KB Output is correct
30 Correct 20 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 608 KB Output is correct
33 Correct 63 ms 468 KB Output is correct
34 Correct 33 ms 724 KB Output is correct
35 Correct 52 ms 724 KB Output is correct
36 Correct 41 ms 912 KB Output is correct
37 Correct 63 ms 740 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 869 ms 1836 KB Output is correct
40 Correct 26 ms 340 KB Output is correct
41 Correct 19 ms 792 KB Output is correct
42 Correct 115 ms 544 KB Output is correct
43 Correct 82 ms 636 KB Output is correct
44 Correct 155 ms 1060 KB Output is correct
45 Correct 171 ms 1240 KB Output is correct
46 Correct 47 ms 35708 KB Output is correct
47 Correct 740 ms 1988 KB Output is correct
48 Correct 599 ms 1640 KB Output is correct
49 Correct 202 ms 4248 KB Output is correct
50 Correct 362 ms 4248 KB Output is correct
51 Correct 595 ms 3252 KB Output is correct
52 Correct 419 ms 2408 KB Output is correct
53 Correct 699 ms 1912 KB Output is correct

Subtask #2
19.0 / 19.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct

Subtask #3
16.0 / 16.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 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 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 2 ms 1360 KB Output is correct
27 Correct 2 ms 1456 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 3 ms 2128 KB Output is correct
30 Correct 2 ms 1996 KB Output is correct
31 Correct 5 ms 724 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 3 ms 1984 KB Output is correct
36 Correct 2 ms 1236 KB Output is correct
37 Correct 5 ms 2632 KB Output is correct
38 Correct 5 ms 3012 KB Output is correct
39 Correct 12 ms 6032 KB Output is correct
40 Correct 24 ms 13824 KB Output is correct
41 Correct 45 ms 35584 KB Output is correct
42 Correct 28 ms 19392 KB Output is correct
43 Correct 77 ms 36876 KB Output is correct
44 Correct 46 ms 32356 KB Output is correct
45 Correct 21 ms 10012 KB Output is correct
46 Correct 16 ms 6600 KB Output is correct

Subtask #4
19.0 / 19.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 23 ms 432 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 3 ms 340 KB Output is correct
37 Correct 14 ms 464 KB Output is correct
38 Correct 2 ms 1360 KB Output is correct
39 Correct 2 ms 1456 KB Output is correct
40 Correct 27 ms 468 KB Output is correct
41 Correct 29 ms 424 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 3 ms 2124 KB Output is correct
44 Correct 2 ms 1996 KB Output is correct
45 Correct 11 ms 484 KB Output is correct
46 Correct 16 ms 468 KB Output is correct
47 Correct 13 ms 340 KB Output is correct
48 Correct 10 ms 412 KB Output is correct
49 Correct 8 ms 468 KB Output is correct
50 Correct 12 ms 504 KB Output is correct
51 Correct 6 ms 748 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 11 ms 468 KB Output is correct

Subtask #5
5.0 / 5.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 23 ms 432 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 3 ms 340 KB Output is correct
37 Correct 14 ms 464 KB Output is correct
38 Correct 2 ms 1360 KB Output is correct
39 Correct 2 ms 1456 KB Output is correct
40 Correct 27 ms 468 KB Output is correct
41 Correct 29 ms 424 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 3 ms 2124 KB Output is correct
44 Correct 2 ms 1996 KB Output is correct
45 Correct 11 ms 484 KB Output is correct
46 Correct 16 ms 468 KB Output is correct
47 Correct 13 ms 340 KB Output is correct
48 Correct 10 ms 412 KB Output is correct
49 Correct 8 ms 468 KB Output is correct
50 Correct 12 ms 504 KB Output is correct
51 Correct 6 ms 748 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 11 ms 468 KB Output is correct
55 Correct 71 ms 532 KB Output is correct
56 Correct 20 ms 340 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 47 ms 340 KB Output is correct
59 Correct 3 ms 1984 KB Output is correct
60 Correct 76 ms 584 KB Output is correct
61 Correct 65 ms 516 KB Output is correct
62 Correct 2 ms 1236 KB Output is correct
63 Correct 5 ms 2632 KB Output is correct
64 Correct 5 ms 3012 KB Output is correct
65 Correct 36 ms 724 KB Output is correct
66 Correct 51 ms 724 KB Output is correct
67 Correct 42 ms 596 KB Output is correct
68 Correct 30 ms 468 KB Output is correct
69 Correct 31 ms 660 KB Output is correct
70 Correct 31 ms 908 KB Output is correct
71 Correct 27 ms 1512 KB Output is correct
72 Correct 42 ms 912 KB Output is correct
73 Correct 65 ms 756 KB Output is correct
74 Correct 4 ms 468 KB Output is correct

Subtask #6
19.0 / 19.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 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 23 ms 428 KB Output is correct
20 Correct 14 ms 456 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 27 ms 468 KB Output is correct
23 Correct 25 ms 440 KB Output is correct
24 Correct 11 ms 484 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 11 ms 468 KB Output is correct
29 Correct 71 ms 532 KB Output is correct
30 Correct 20 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 608 KB Output is correct
33 Correct 63 ms 468 KB Output is correct
34 Correct 33 ms 724 KB Output is correct
35 Correct 52 ms 724 KB Output is correct
36 Correct 41 ms 912 KB Output is correct
37 Correct 63 ms 740 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 869 ms 1836 KB Output is correct
40 Correct 26 ms 340 KB Output is correct
41 Correct 19 ms 792 KB Output is correct
42 Correct 115 ms 544 KB Output is correct
43 Correct 82 ms 636 KB Output is correct
44 Correct 155 ms 1060 KB Output is correct
45 Correct 171 ms 1240 KB Output is correct
46 Correct 47 ms 35708 KB Output is correct
47 Correct 740 ms 1988 KB Output is correct
48 Correct 599 ms 1640 KB Output is correct
49 Correct 202 ms 4248 KB Output is correct
50 Correct 362 ms 4248 KB Output is correct
51 Correct 595 ms 3252 KB Output is correct
52 Correct 419 ms 2408 KB Output is correct
53 Correct 699 ms 1912 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 0 ms 340 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 0 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 0 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 0 ms 212 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 0 ms 340 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 0 ms 340 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 0 ms 212 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 0 ms 212 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 1 ms 212 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 0 ms 340 KB Output is correct
110 Correct 3 ms 340 KB Output is correct
111 Correct 2 ms 1360 KB Output is correct
112 Correct 2 ms 1456 KB Output is correct
113 Correct 1 ms 980 KB Output is correct
114 Correct 3 ms 2128 KB Output is correct
115 Correct 2 ms 1996 KB Output is correct
116 Correct 5 ms 724 KB Output is correct
117 Correct 1 ms 340 KB Output is correct
118 Correct 2 ms 340 KB Output is correct
119 Correct 1 ms 468 KB Output is correct
120 Correct 3 ms 1984 KB Output is correct
121 Correct 2 ms 1236 KB Output is correct
122 Correct 5 ms 2632 KB Output is correct
123 Correct 5 ms 3012 KB Output is correct
124 Correct 12 ms 6032 KB Output is correct
125 Correct 24 ms 13824 KB Output is correct
126 Correct 45 ms 35584 KB Output is correct
127 Correct 28 ms 19392 KB Output is correct
128 Correct 77 ms 36876 KB Output is correct
129 Correct 46 ms 32356 KB Output is correct
130 Correct 21 ms 10012 KB Output is correct
131 Correct 16 ms 6600 KB Output is correct
132 Correct 23 ms 432 KB Output is correct
133 Correct 0 ms 340 KB Output is correct
134 Correct 1 ms 212 KB Output is correct
135 Correct 3 ms 340 KB Output is correct
136 Correct 14 ms 464 KB Output is correct
137 Correct 2 ms 1360 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 27 ms 468 KB Output is correct
140 Correct 29 ms 424 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 3 ms 2124 KB Output is correct
143 Correct 2 ms 1996 KB Output is correct
144 Correct 11 ms 484 KB Output is correct
145 Correct 16 ms 468 KB Output is correct
146 Correct 13 ms 340 KB Output is correct
147 Correct 10 ms 412 KB Output is correct
148 Correct 8 ms 468 KB Output is correct
149 Correct 12 ms 504 KB Output is correct
150 Correct 6 ms 748 KB Output is correct
151 Correct 1 ms 340 KB Output is correct
152 Correct 2 ms 340 KB Output is correct
153 Correct 11 ms 468 KB Output is correct
154 Correct 71 ms 532 KB Output is correct
155 Correct 20 ms 340 KB Output is correct
156 Correct 1 ms 468 KB Output is correct
157 Correct 47 ms 340 KB Output is correct
158 Correct 3 ms 1984 KB Output is correct
159 Correct 76 ms 584 KB Output is correct
160 Correct 65 ms 516 KB Output is correct
161 Correct 2 ms 1236 KB Output is correct
162 Correct 5 ms 2632 KB Output is correct
163 Correct 5 ms 3012 KB Output is correct
164 Correct 36 ms 724 KB Output is correct
165 Correct 51 ms 724 KB Output is correct
166 Correct 42 ms 596 KB Output is correct
167 Correct 30 ms 468 KB Output is correct
168 Correct 31 ms 660 KB Output is correct
169 Correct 31 ms 908 KB Output is correct
170 Correct 27 ms 1512 KB Output is correct
171 Correct 42 ms 912 KB Output is correct
172 Correct 65 ms 756 KB Output is correct
173 Correct 4 ms 468 KB Output is correct
174 Correct 21 ms 468 KB Output is correct
175 Correct 102 ms 760 KB Output is correct
176 Correct 106 ms 1192 KB Output is correct
177 Correct 259 ms 1052 KB Output is correct
178 Correct 32 ms 1364 KB Output is correct
179 Correct 162 ms 1812 KB Output is correct
180 Correct 311 ms 2192 KB Output is correct
181 Correct 329 ms 3204 KB Output is correct
182 Correct 364 ms 7356 KB Output is correct
183 Correct 376 ms 13244 KB Output is correct

Subtask #7
8.0 / 8.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 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 23 ms 428 KB Output is correct
20 Correct 14 ms 456 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 27 ms 468 KB Output is correct
23 Correct 25 ms 440 KB Output is correct
24 Correct 11 ms 484 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 11 ms 468 KB Output is correct
29 Correct 71 ms 532 KB Output is correct
30 Correct 20 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 608 KB Output is correct
33 Correct 63 ms 468 KB Output is correct
34 Correct 33 ms 724 KB Output is correct
35 Correct 52 ms 724 KB Output is correct
36 Correct 41 ms 912 KB Output is correct
37 Correct 63 ms 740 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 869 ms 1836 KB Output is correct
40 Correct 26 ms 340 KB Output is correct
41 Correct 19 ms 792 KB Output is correct
42 Correct 115 ms 544 KB Output is correct
43 Correct 82 ms 636 KB Output is correct
44 Correct 155 ms 1060 KB Output is correct
45 Correct 171 ms 1240 KB Output is correct
46 Correct 47 ms 35708 KB Output is correct
47 Correct 740 ms 1988 KB Output is correct
48 Correct 599 ms 1640 KB Output is correct
49 Correct 202 ms 4248 KB Output is correct
50 Correct 362 ms 4248 KB Output is correct
51 Correct 595 ms 3252 KB Output is correct
52 Correct 419 ms 2408 KB Output is correct
53 Correct 699 ms 1912 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 0 ms 340 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 0 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 0 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 0 ms 212 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 0 ms 340 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 0 ms 340 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 0 ms 212 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 0 ms 212 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 1 ms 212 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 0 ms 340 KB Output is correct
110 Correct 3 ms 340 KB Output is correct
111 Correct 2 ms 1360 KB Output is correct
112 Correct 2 ms 1456 KB Output is correct
113 Correct 1 ms 980 KB Output is correct
114 Correct 3 ms 2128 KB Output is correct
115 Correct 2 ms 1996 KB Output is correct
116 Correct 5 ms 724 KB Output is correct
117 Correct 1 ms 340 KB Output is correct
118 Correct 2 ms 340 KB Output is correct
119 Correct 1 ms 468 KB Output is correct
120 Correct 3 ms 1984 KB Output is correct
121 Correct 2 ms 1236 KB Output is correct
122 Correct 5 ms 2632 KB Output is correct
123 Correct 5 ms 3012 KB Output is correct
124 Correct 12 ms 6032 KB Output is correct
125 Correct 24 ms 13824 KB Output is correct
126 Correct 45 ms 35584 KB Output is correct
127 Correct 28 ms 19392 KB Output is correct
128 Correct 77 ms 36876 KB Output is correct
129 Correct 46 ms 32356 KB Output is correct
130 Correct 21 ms 10012 KB Output is correct
131 Correct 16 ms 6600 KB Output is correct
132 Correct 23 ms 432 KB Output is correct
133 Correct 0 ms 340 KB Output is correct
134 Correct 1 ms 212 KB Output is correct
135 Correct 3 ms 340 KB Output is correct
136 Correct 14 ms 464 KB Output is correct
137 Correct 2 ms 1360 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 27 ms 468 KB Output is correct
140 Correct 29 ms 424 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 3 ms 2124 KB Output is correct
143 Correct 2 ms 1996 KB Output is correct
144 Correct 11 ms 484 KB Output is correct
145 Correct 16 ms 468 KB Output is correct
146 Correct 13 ms 340 KB Output is correct
147 Correct 10 ms 412 KB Output is correct
148 Correct 8 ms 468 KB Output is correct
149 Correct 12 ms 504 KB Output is correct
150 Correct 6 ms 748 KB Output is correct
151 Correct 1 ms 340 KB Output is correct
152 Correct 2 ms 340 KB Output is correct
153 Correct 11 ms 468 KB Output is correct
154 Correct 71 ms 532 KB Output is correct
155 Correct 20 ms 340 KB Output is correct
156 Correct 1 ms 468 KB Output is correct
157 Correct 47 ms 340 KB Output is correct
158 Correct 3 ms 1984 KB Output is correct
159 Correct 76 ms 584 KB Output is correct
160 Correct 65 ms 516 KB Output is correct
161 Correct 2 ms 1236 KB Output is correct
162 Correct 5 ms 2632 KB Output is correct
163 Correct 5 ms 3012 KB Output is correct
164 Correct 36 ms 724 KB Output is correct
165 Correct 51 ms 724 KB Output is correct
166 Correct 42 ms 596 KB Output is correct
167 Correct 30 ms 468 KB Output is correct
168 Correct 31 ms 660 KB Output is correct
169 Correct 31 ms 908 KB Output is correct
170 Correct 27 ms 1512 KB Output is correct
171 Correct 42 ms 912 KB Output is correct
172 Correct 65 ms 756 KB Output is correct
173 Correct 4 ms 468 KB Output is correct
174 Correct 21 ms 468 KB Output is correct
175 Correct 102 ms 760 KB Output is correct
176 Correct 106 ms 1192 KB Output is correct
177 Correct 259 ms 1052 KB Output is correct
178 Correct 32 ms 1364 KB Output is correct
179 Correct 162 ms 1812 KB Output is correct
180 Correct 311 ms 2192 KB Output is correct
181 Correct 329 ms 3204 KB Output is correct
182 Correct 364 ms 7356 KB Output is correct
183 Correct 376 ms 13244 KB Output is correct
184 Correct 1692 ms 2568 KB Output is correct
185 Correct 141 ms 1440 KB Output is correct
186 Correct 26 ms 13100 KB Output is correct
187 Correct 95 ms 5084 KB Output is correct
188 Correct 61 ms 43940 KB Output is correct
189 Correct 1247 ms 2872 KB Output is correct
190 Correct 557 ms 2440 KB Output is correct
191 Correct 21 ms 13228 KB Output is correct
192 Correct 174 ms 107916 KB Output is correct
193 Correct 86 ms 45032 KB Output is correct
194 Correct 637 ms 8288 KB Output is correct
195 Correct 768 ms 8288 KB Output is correct
196 Correct 622 ms 2524 KB Output is correct
197 Correct 305 ms 4032 KB Output is correct
198 Correct 347 ms 5820 KB Output is correct
199 Correct 702 ms 9928 KB Output is correct
200 Correct 596 ms 4976 KB Output is correct
201 Correct 1088 ms 3800 KB Output is correct
202 Correct 1641 ms 2864 KB Output is correct

Subtask #8
0 / 6.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 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 23 ms 428 KB Output is correct
20 Correct 14 ms 456 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 27 ms 468 KB Output is correct
23 Correct 25 ms 440 KB Output is correct
24 Correct 11 ms 484 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 11 ms 468 KB Output is correct
29 Correct 71 ms 532 KB Output is correct
30 Correct 20 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 608 KB Output is correct
33 Correct 63 ms 468 KB Output is correct
34 Correct 33 ms 724 KB Output is correct
35 Correct 52 ms 724 KB Output is correct
36 Correct 41 ms 912 KB Output is correct
37 Correct 63 ms 740 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 869 ms 1836 KB Output is correct
40 Correct 26 ms 340 KB Output is correct
41 Correct 19 ms 792 KB Output is correct
42 Correct 115 ms 544 KB Output is correct
43 Correct 82 ms 636 KB Output is correct
44 Correct 155 ms 1060 KB Output is correct
45 Correct 171 ms 1240 KB Output is correct
46 Correct 47 ms 35708 KB Output is correct
47 Correct 740 ms 1988 KB Output is correct
48 Correct 599 ms 1640 KB Output is correct
49 Correct 202 ms 4248 KB Output is correct
50 Correct 362 ms 4248 KB Output is correct
51 Correct 595 ms 3252 KB Output is correct
52 Correct 419 ms 2408 KB Output is correct
53 Correct 699 ms 1912 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 0 ms 340 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 0 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 0 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 0 ms 212 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 0 ms 340 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 0 ms 340 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 0 ms 212 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 0 ms 212 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 1 ms 212 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 0 ms 340 KB Output is correct
110 Correct 3 ms 340 KB Output is correct
111 Correct 2 ms 1360 KB Output is correct
112 Correct 2 ms 1456 KB Output is correct
113 Correct 1 ms 980 KB Output is correct
114 Correct 3 ms 2128 KB Output is correct
115 Correct 2 ms 1996 KB Output is correct
116 Correct 5 ms 724 KB Output is correct
117 Correct 1 ms 340 KB Output is correct
118 Correct 2 ms 340 KB Output is correct
119 Correct 1 ms 468 KB Output is correct
120 Correct 3 ms 1984 KB Output is correct
121 Correct 2 ms 1236 KB Output is correct
122 Correct 5 ms 2632 KB Output is correct
123 Correct 5 ms 3012 KB Output is correct
124 Correct 12 ms 6032 KB Output is correct
125 Correct 24 ms 13824 KB Output is correct
126 Correct 45 ms 35584 KB Output is correct
127 Correct 28 ms 19392 KB Output is correct
128 Correct 77 ms 36876 KB Output is correct
129 Correct 46 ms 32356 KB Output is correct
130 Correct 21 ms 10012 KB Output is correct
131 Correct 16 ms 6600 KB Output is correct
132 Correct 23 ms 432 KB Output is correct
133 Correct 0 ms 340 KB Output is correct
134 Correct 1 ms 212 KB Output is correct
135 Correct 3 ms 340 KB Output is correct
136 Correct 14 ms 464 KB Output is correct
137 Correct 2 ms 1360 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 27 ms 468 KB Output is correct
140 Correct 29 ms 424 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 3 ms 2124 KB Output is correct
143 Correct 2 ms 1996 KB Output is correct
144 Correct 11 ms 484 KB Output is correct
145 Correct 16 ms 468 KB Output is correct
146 Correct 13 ms 340 KB Output is correct
147 Correct 10 ms 412 KB Output is correct
148 Correct 8 ms 468 KB Output is correct
149 Correct 12 ms 504 KB Output is correct
150 Correct 6 ms 748 KB Output is correct
151 Correct 1 ms 340 KB Output is correct
152 Correct 2 ms 340 KB Output is correct
153 Correct 11 ms 468 KB Output is correct
154 Correct 71 ms 532 KB Output is correct
155 Correct 20 ms 340 KB Output is correct
156 Correct 1 ms 468 KB Output is correct
157 Correct 47 ms 340 KB Output is correct
158 Correct 3 ms 1984 KB Output is correct
159 Correct 76 ms 584 KB Output is correct
160 Correct 65 ms 516 KB Output is correct
161 Correct 2 ms 1236 KB Output is correct
162 Correct 5 ms 2632 KB Output is correct
163 Correct 5 ms 3012 KB Output is correct
164 Correct 36 ms 724 KB Output is correct
165 Correct 51 ms 724 KB Output is correct
166 Correct 42 ms 596 KB Output is correct
167 Correct 30 ms 468 KB Output is correct
168 Correct 31 ms 660 KB Output is correct
169 Correct 31 ms 908 KB Output is correct
170 Correct 27 ms 1512 KB Output is correct
171 Correct 42 ms 912 KB Output is correct
172 Correct 65 ms 756 KB Output is correct
173 Correct 4 ms 468 KB Output is correct
174 Correct 21 ms 468 KB Output is correct
175 Correct 102 ms 760 KB Output is correct
176 Correct 106 ms 1192 KB Output is correct
177 Correct 259 ms 1052 KB Output is correct
178 Correct 32 ms 1364 KB Output is correct
179 Correct 162 ms 1812 KB Output is correct
180 Correct 311 ms 2192 KB Output is correct
181 Correct 329 ms 3204 KB Output is correct
182 Correct 364 ms 7356 KB Output is correct
183 Correct 376 ms 13244 KB Output is correct
184 Correct 1692 ms 2568 KB Output is correct
185 Correct 141 ms 1440 KB Output is correct
186 Correct 26 ms 13100 KB Output is correct
187 Correct 95 ms 5084 KB Output is correct
188 Correct 61 ms 43940 KB Output is correct
189 Correct 1247 ms 2872 KB Output is correct
190 Correct 557 ms 2440 KB Output is correct
191 Correct 21 ms 13228 KB Output is correct
192 Correct 174 ms 107916 KB Output is correct
193 Correct 86 ms 45032 KB Output is correct
194 Correct 637 ms 8288 KB Output is correct
195 Correct 768 ms 8288 KB Output is correct
196 Correct 622 ms 2524 KB Output is correct
197 Correct 305 ms 4032 KB Output is correct
198 Correct 347 ms 5820 KB Output is correct
199 Correct 702 ms 9928 KB Output is correct
200 Correct 596 ms 4976 KB Output is correct
201 Correct 1088 ms 3800 KB Output is correct
202 Correct 1641 ms 2864 KB Output is correct
203 Execution timed out 2064 ms 4960 KB Time limit exceeded
204 Halted 0 ms 0 KB -