oj.uz

Submission #781323

# Submission time Handle Problem Language Result Execution time Memory
781323 2023-07-13T03:07:24 Z green_gold_dog Maze (JOI23_ho_t3) C++17
94 / 100
 2000 ms 107976 KB 
#pragma GCC optimize("Ofast")
#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 1 ms 212 KB Output is correct
14 Correct 1 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 440 KB Output is correct
20 Correct 13 ms 340 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 31 ms 468 KB Output is correct
23 Correct 24 ms 340 KB Output is correct
24 Correct 12 ms 468 KB Output is correct
25 Correct 15 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 69 ms 516 KB Output is correct
30 Correct 24 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 620 KB Output is correct
33 Correct 61 ms 536 KB Output is correct
34 Correct 35 ms 724 KB Output is correct
35 Correct 45 ms 724 KB Output is correct
36 Correct 42 ms 912 KB Output is correct
37 Correct 64 ms 712 KB Output is correct
38 Correct 4 ms 596 KB Output is correct
39 Correct 832 ms 1804 KB Output is correct
40 Correct 25 ms 340 KB Output is correct
41 Correct 20 ms 792 KB Output is correct
42 Correct 109 ms 544 KB Output is correct
43 Correct 78 ms 636 KB Output is correct
44 Correct 149 ms 1060 KB Output is correct
45 Correct 162 ms 1236 KB Output is correct
46 Correct 47 ms 35604 KB Output is correct
47 Correct 745 ms 1992 KB Output is correct
48 Correct 597 ms 1820 KB Output is correct
49 Correct 219 ms 4248 KB Output is correct
50 Correct 319 ms 4248 KB Output is correct
51 Correct 603 ms 3220 KB Output is correct
52 Correct 423 ms 2464 KB Output is correct
53 Correct 693 ms 1876 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 1 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 328 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 212 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 0 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 1 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 340 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 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 240 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 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 0 ms 212 KB Output is correct
23 Correct 1 ms 212 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 4 ms 2124 KB Output is correct
30 Correct 3 ms 2004 KB Output is correct
31 Correct 6 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 1360 KB Output is correct
37 Correct 5 ms 2632 KB Output is correct
38 Correct 5 ms 3060 KB Output is correct
39 Correct 13 ms 5956 KB Output is correct
40 Correct 25 ms 13748 KB Output is correct
41 Correct 47 ms 35612 KB Output is correct
42 Correct 31 ms 19460 KB Output is correct
43 Correct 76 ms 36900 KB Output is correct
44 Correct 50 ms 32272 KB Output is correct
45 Correct 21 ms 10004 KB Output is correct
46 Correct 17 ms 6472 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 1 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 328 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 212 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 0 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 1 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 340 KB Output is correct
33 Correct 24 ms 468 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 468 KB Output is correct
38 Correct 2 ms 1276 KB Output is correct
39 Correct 2 ms 1456 KB Output is correct
40 Correct 27 ms 484 KB Output is correct
41 Correct 24 ms 420 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 4 ms 2124 KB Output is correct
44 Correct 3 ms 1996 KB Output is correct
45 Correct 14 ms 476 KB Output is correct
46 Correct 15 ms 468 KB Output is correct
47 Correct 13 ms 432 KB Output is correct
48 Correct 11 ms 340 KB Output is correct
49 Correct 9 ms 468 KB Output is correct
50 Correct 13 ms 468 KB Output is correct
51 Correct 6 ms 724 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 2 ms 356 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 1 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 328 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 212 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 0 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 1 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 340 KB Output is correct
33 Correct 24 ms 468 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 468 KB Output is correct
38 Correct 2 ms 1276 KB Output is correct
39 Correct 2 ms 1456 KB Output is correct
40 Correct 27 ms 484 KB Output is correct
41 Correct 24 ms 420 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 4 ms 2124 KB Output is correct
44 Correct 3 ms 1996 KB Output is correct
45 Correct 14 ms 476 KB Output is correct
46 Correct 15 ms 468 KB Output is correct
47 Correct 13 ms 432 KB Output is correct
48 Correct 11 ms 340 KB Output is correct
49 Correct 9 ms 468 KB Output is correct
50 Correct 13 ms 468 KB Output is correct
51 Correct 6 ms 724 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 2 ms 356 KB Output is correct
54 Correct 11 ms 468 KB Output is correct
55 Correct 72 ms 468 KB Output is correct
56 Correct 19 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 75 ms 596 KB Output is correct
61 Correct 61 ms 524 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 35 ms 724 KB Output is correct
66 Correct 59 ms 724 KB Output is correct
67 Correct 43 ms 596 KB Output is correct
68 Correct 33 ms 468 KB Output is correct
69 Correct 35 ms 596 KB Output is correct
70 Correct 35 ms 852 KB Output is correct
71 Correct 30 ms 1492 KB Output is correct
72 Correct 42 ms 920 KB Output is correct
73 Correct 70 ms 868 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 1 ms 212 KB Output is correct
14 Correct 1 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 440 KB Output is correct
20 Correct 13 ms 340 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 31 ms 468 KB Output is correct
23 Correct 24 ms 340 KB Output is correct
24 Correct 12 ms 468 KB Output is correct
25 Correct 15 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 69 ms 516 KB Output is correct
30 Correct 24 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 620 KB Output is correct
33 Correct 61 ms 536 KB Output is correct
34 Correct 35 ms 724 KB Output is correct
35 Correct 45 ms 724 KB Output is correct
36 Correct 42 ms 912 KB Output is correct
37 Correct 64 ms 712 KB Output is correct
38 Correct 4 ms 596 KB Output is correct
39 Correct 832 ms 1804 KB Output is correct
40 Correct 25 ms 340 KB Output is correct
41 Correct 20 ms 792 KB Output is correct
42 Correct 109 ms 544 KB Output is correct
43 Correct 78 ms 636 KB Output is correct
44 Correct 149 ms 1060 KB Output is correct
45 Correct 162 ms 1236 KB Output is correct
46 Correct 47 ms 35604 KB Output is correct
47 Correct 745 ms 1992 KB Output is correct
48 Correct 597 ms 1820 KB Output is correct
49 Correct 219 ms 4248 KB Output is correct
50 Correct 319 ms 4248 KB Output is correct
51 Correct 603 ms 3220 KB Output is correct
52 Correct 423 ms 2464 KB Output is correct
53 Correct 693 ms 1876 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 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 328 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 212 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 0 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 1 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 340 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 0 ms 212 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 1 ms 240 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 0 ms 212 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 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 0 ms 212 KB Output is correct
108 Correct 1 ms 212 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 4 ms 2124 KB Output is correct
115 Correct 3 ms 2004 KB Output is correct
116 Correct 6 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 1360 KB Output is correct
122 Correct 5 ms 2632 KB Output is correct
123 Correct 5 ms 3060 KB Output is correct
124 Correct 13 ms 5956 KB Output is correct
125 Correct 25 ms 13748 KB Output is correct
126 Correct 47 ms 35612 KB Output is correct
127 Correct 31 ms 19460 KB Output is correct
128 Correct 76 ms 36900 KB Output is correct
129 Correct 50 ms 32272 KB Output is correct
130 Correct 21 ms 10004 KB Output is correct
131 Correct 17 ms 6472 KB Output is correct
132 Correct 24 ms 468 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 468 KB Output is correct
137 Correct 2 ms 1276 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 27 ms 484 KB Output is correct
140 Correct 24 ms 420 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 4 ms 2124 KB Output is correct
143 Correct 3 ms 1996 KB Output is correct
144 Correct 14 ms 476 KB Output is correct
145 Correct 15 ms 468 KB Output is correct
146 Correct 13 ms 432 KB Output is correct
147 Correct 11 ms 340 KB Output is correct
148 Correct 9 ms 468 KB Output is correct
149 Correct 13 ms 468 KB Output is correct
150 Correct 6 ms 724 KB Output is correct
151 Correct 1 ms 340 KB Output is correct
152 Correct 2 ms 356 KB Output is correct
153 Correct 11 ms 468 KB Output is correct
154 Correct 72 ms 468 KB Output is correct
155 Correct 19 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 75 ms 596 KB Output is correct
160 Correct 61 ms 524 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 35 ms 724 KB Output is correct
165 Correct 59 ms 724 KB Output is correct
166 Correct 43 ms 596 KB Output is correct
167 Correct 33 ms 468 KB Output is correct
168 Correct 35 ms 596 KB Output is correct
169 Correct 35 ms 852 KB Output is correct
170 Correct 30 ms 1492 KB Output is correct
171 Correct 42 ms 920 KB Output is correct
172 Correct 70 ms 868 KB Output is correct
173 Correct 4 ms 468 KB Output is correct
174 Correct 21 ms 468 KB Output is correct
175 Correct 109 ms 752 KB Output is correct
176 Correct 103 ms 1180 KB Output is correct
177 Correct 261 ms 1064 KB Output is correct
178 Correct 32 ms 1376 KB Output is correct
179 Correct 178 ms 1816 KB Output is correct
180 Correct 347 ms 2184 KB Output is correct
181 Correct 363 ms 3272 KB Output is correct
182 Correct 391 ms 7324 KB Output is correct
183 Correct 404 ms 13180 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 1 ms 212 KB Output is correct
14 Correct 1 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 440 KB Output is correct
20 Correct 13 ms 340 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 31 ms 468 KB Output is correct
23 Correct 24 ms 340 KB Output is correct
24 Correct 12 ms 468 KB Output is correct
25 Correct 15 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 69 ms 516 KB Output is correct
30 Correct 24 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 620 KB Output is correct
33 Correct 61 ms 536 KB Output is correct
34 Correct 35 ms 724 KB Output is correct
35 Correct 45 ms 724 KB Output is correct
36 Correct 42 ms 912 KB Output is correct
37 Correct 64 ms 712 KB Output is correct
38 Correct 4 ms 596 KB Output is correct
39 Correct 832 ms 1804 KB Output is correct
40 Correct 25 ms 340 KB Output is correct
41 Correct 20 ms 792 KB Output is correct
42 Correct 109 ms 544 KB Output is correct
43 Correct 78 ms 636 KB Output is correct
44 Correct 149 ms 1060 KB Output is correct
45 Correct 162 ms 1236 KB Output is correct
46 Correct 47 ms 35604 KB Output is correct
47 Correct 745 ms 1992 KB Output is correct
48 Correct 597 ms 1820 KB Output is correct
49 Correct 219 ms 4248 KB Output is correct
50 Correct 319 ms 4248 KB Output is correct
51 Correct 603 ms 3220 KB Output is correct
52 Correct 423 ms 2464 KB Output is correct
53 Correct 693 ms 1876 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 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 328 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 212 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 0 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 1 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 340 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 0 ms 212 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 1 ms 240 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 0 ms 212 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 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 0 ms 212 KB Output is correct
108 Correct 1 ms 212 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 4 ms 2124 KB Output is correct
115 Correct 3 ms 2004 KB Output is correct
116 Correct 6 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 1360 KB Output is correct
122 Correct 5 ms 2632 KB Output is correct
123 Correct 5 ms 3060 KB Output is correct
124 Correct 13 ms 5956 KB Output is correct
125 Correct 25 ms 13748 KB Output is correct
126 Correct 47 ms 35612 KB Output is correct
127 Correct 31 ms 19460 KB Output is correct
128 Correct 76 ms 36900 KB Output is correct
129 Correct 50 ms 32272 KB Output is correct
130 Correct 21 ms 10004 KB Output is correct
131 Correct 17 ms 6472 KB Output is correct
132 Correct 24 ms 468 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 468 KB Output is correct
137 Correct 2 ms 1276 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 27 ms 484 KB Output is correct
140 Correct 24 ms 420 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 4 ms 2124 KB Output is correct
143 Correct 3 ms 1996 KB Output is correct
144 Correct 14 ms 476 KB Output is correct
145 Correct 15 ms 468 KB Output is correct
146 Correct 13 ms 432 KB Output is correct
147 Correct 11 ms 340 KB Output is correct
148 Correct 9 ms 468 KB Output is correct
149 Correct 13 ms 468 KB Output is correct
150 Correct 6 ms 724 KB Output is correct
151 Correct 1 ms 340 KB Output is correct
152 Correct 2 ms 356 KB Output is correct
153 Correct 11 ms 468 KB Output is correct
154 Correct 72 ms 468 KB Output is correct
155 Correct 19 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 75 ms 596 KB Output is correct
160 Correct 61 ms 524 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 35 ms 724 KB Output is correct
165 Correct 59 ms 724 KB Output is correct
166 Correct 43 ms 596 KB Output is correct
167 Correct 33 ms 468 KB Output is correct
168 Correct 35 ms 596 KB Output is correct
169 Correct 35 ms 852 KB Output is correct
170 Correct 30 ms 1492 KB Output is correct
171 Correct 42 ms 920 KB Output is correct
172 Correct 70 ms 868 KB Output is correct
173 Correct 4 ms 468 KB Output is correct
174 Correct 21 ms 468 KB Output is correct
175 Correct 109 ms 752 KB Output is correct
176 Correct 103 ms 1180 KB Output is correct
177 Correct 261 ms 1064 KB Output is correct
178 Correct 32 ms 1376 KB Output is correct
179 Correct 178 ms 1816 KB Output is correct
180 Correct 347 ms 2184 KB Output is correct
181 Correct 363 ms 3272 KB Output is correct
182 Correct 391 ms 7324 KB Output is correct
183 Correct 404 ms 13180 KB Output is correct
184 Correct 1598 ms 2660 KB Output is correct
185 Correct 140 ms 1416 KB Output is correct
186 Correct 27 ms 13152 KB Output is correct
187 Correct 95 ms 5140 KB Output is correct
188 Correct 64 ms 43896 KB Output is correct
189 Correct 1259 ms 2972 KB Output is correct
190 Correct 533 ms 2428 KB Output is correct
191 Correct 21 ms 13124 KB Output is correct
192 Correct 198 ms 107976 KB Output is correct
193 Correct 85 ms 45032 KB Output is correct
194 Correct 689 ms 8412 KB Output is correct
195 Correct 695 ms 8288 KB Output is correct
196 Correct 680 ms 2460 KB Output is correct
197 Correct 330 ms 4148 KB Output is correct
198 Correct 359 ms 5708 KB Output is correct
199 Correct 741 ms 10028 KB Output is correct
200 Correct 599 ms 5024 KB Output is correct
201 Correct 1138 ms 3732 KB Output is correct
202 Correct 1623 ms 2928 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 1 ms 212 KB Output is correct
14 Correct 1 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 440 KB Output is correct
20 Correct 13 ms 340 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 31 ms 468 KB Output is correct
23 Correct 24 ms 340 KB Output is correct
24 Correct 12 ms 468 KB Output is correct
25 Correct 15 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 69 ms 516 KB Output is correct
30 Correct 24 ms 340 KB Output is correct
31 Correct 3 ms 1984 KB Output is correct
32 Correct 75 ms 620 KB Output is correct
33 Correct 61 ms 536 KB Output is correct
34 Correct 35 ms 724 KB Output is correct
35 Correct 45 ms 724 KB Output is correct
36 Correct 42 ms 912 KB Output is correct
37 Correct 64 ms 712 KB Output is correct
38 Correct 4 ms 596 KB Output is correct
39 Correct 832 ms 1804 KB Output is correct
40 Correct 25 ms 340 KB Output is correct
41 Correct 20 ms 792 KB Output is correct
42 Correct 109 ms 544 KB Output is correct
43 Correct 78 ms 636 KB Output is correct
44 Correct 149 ms 1060 KB Output is correct
45 Correct 162 ms 1236 KB Output is correct
46 Correct 47 ms 35604 KB Output is correct
47 Correct 745 ms 1992 KB Output is correct
48 Correct 597 ms 1820 KB Output is correct
49 Correct 219 ms 4248 KB Output is correct
50 Correct 319 ms 4248 KB Output is correct
51 Correct 603 ms 3220 KB Output is correct
52 Correct 423 ms 2464 KB Output is correct
53 Correct 693 ms 1876 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 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 328 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 212 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 0 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 1 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 340 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 0 ms 212 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 1 ms 240 KB Output is correct
95 Correct 0 ms 340 KB Output is correct
96 Correct 0 ms 340 KB Output is correct
97 Correct 0 ms 212 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 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 0 ms 212 KB Output is correct
108 Correct 1 ms 212 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 4 ms 2124 KB Output is correct
115 Correct 3 ms 2004 KB Output is correct
116 Correct 6 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 1360 KB Output is correct
122 Correct 5 ms 2632 KB Output is correct
123 Correct 5 ms 3060 KB Output is correct
124 Correct 13 ms 5956 KB Output is correct
125 Correct 25 ms 13748 KB Output is correct
126 Correct 47 ms 35612 KB Output is correct
127 Correct 31 ms 19460 KB Output is correct
128 Correct 76 ms 36900 KB Output is correct
129 Correct 50 ms 32272 KB Output is correct
130 Correct 21 ms 10004 KB Output is correct
131 Correct 17 ms 6472 KB Output is correct
132 Correct 24 ms 468 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 468 KB Output is correct
137 Correct 2 ms 1276 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 27 ms 484 KB Output is correct
140 Correct 24 ms 420 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 4 ms 2124 KB Output is correct
143 Correct 3 ms 1996 KB Output is correct
144 Correct 14 ms 476 KB Output is correct
145 Correct 15 ms 468 KB Output is correct
146 Correct 13 ms 432 KB Output is correct
147 Correct 11 ms 340 KB Output is correct
148 Correct 9 ms 468 KB Output is correct
149 Correct 13 ms 468 KB Output is correct
150 Correct 6 ms 724 KB Output is correct
151 Correct 1 ms 340 KB Output is correct
152 Correct 2 ms 356 KB Output is correct
153 Correct 11 ms 468 KB Output is correct
154 Correct 72 ms 468 KB Output is correct
155 Correct 19 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 75 ms 596 KB Output is correct
160 Correct 61 ms 524 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 35 ms 724 KB Output is correct
165 Correct 59 ms 724 KB Output is correct
166 Correct 43 ms 596 KB Output is correct
167 Correct 33 ms 468 KB Output is correct
168 Correct 35 ms 596 KB Output is correct
169 Correct 35 ms 852 KB Output is correct
170 Correct 30 ms 1492 KB Output is correct
171 Correct 42 ms 920 KB Output is correct
172 Correct 70 ms 868 KB Output is correct
173 Correct 4 ms 468 KB Output is correct
174 Correct 21 ms 468 KB Output is correct
175 Correct 109 ms 752 KB Output is correct
176 Correct 103 ms 1180 KB Output is correct
177 Correct 261 ms 1064 KB Output is correct
178 Correct 32 ms 1376 KB Output is correct
179 Correct 178 ms 1816 KB Output is correct
180 Correct 347 ms 2184 KB Output is correct
181 Correct 363 ms 3272 KB Output is correct
182 Correct 391 ms 7324 KB Output is correct
183 Correct 404 ms 13180 KB Output is correct
184 Correct 1598 ms 2660 KB Output is correct
185 Correct 140 ms 1416 KB Output is correct
186 Correct 27 ms 13152 KB Output is correct
187 Correct 95 ms 5140 KB Output is correct
188 Correct 64 ms 43896 KB Output is correct
189 Correct 1259 ms 2972 KB Output is correct
190 Correct 533 ms 2428 KB Output is correct
191 Correct 21 ms 13124 KB Output is correct
192 Correct 198 ms 107976 KB Output is correct
193 Correct 85 ms 45032 KB Output is correct
194 Correct 689 ms 8412 KB Output is correct
195 Correct 695 ms 8288 KB Output is correct
196 Correct 680 ms 2460 KB Output is correct
197 Correct 330 ms 4148 KB Output is correct
198 Correct 359 ms 5708 KB Output is correct
199 Correct 741 ms 10028 KB Output is correct
200 Correct 599 ms 5024 KB Output is correct
201 Correct 1138 ms 3732 KB Output is correct
202 Correct 1623 ms 2928 KB Output is correct
203 Execution timed out 2063 ms 5132 KB Time limit exceeded
204 Halted 0 ms 0 KB -