oj.uz

Submission #776085

# Submission time Handle Problem Language Result Execution time Memory
776085 2023-07-07T09:30:53 Z green_gold_dog Maze (JOI23_ho_t3) C++17
67 / 100
 2000 ms 38424 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]) {
                                nps.insert(y);
                                ll l = y - n, r = y + n + 1;
                                no.insert(make_pair(l, r));
                                continue;
                                auto io = no.upper_bound(make_pair(l, INF));
                                io--;
                                if (io->second >= r) {
                                        continue;
                                }
                                auto it = nps.find(y);
                                ll prev = -INF, next = INF;
                                if (it != nps.begin()) {
                                        it--;
                                        prev = *it;
                                        it++;
                                }
                                it++;
                                if (it != nps.end()) {
                                        next = *it;
                                }
                                if (y - prev - 1 <= n * 2) {
                                        l = io->first;
                                        no.erase(io);
                                }
                                io = no.upper_bound(make_pair(l, INF));
                                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;
                                no.erase(no.find(make_pair(l, r)));
                                continue;
                                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--;
                                        no.insert(make_pair(lo, *it + n + 1));
                                        continue;
                                }
                                if (it == nps.begin()) {
                                        no.erase(io);
                                        no.insert(make_pair(*it - n, ro));
                                        continue;
                                }
                                auto lit = it, rit = it;
                                lit--;
                                if (*rit - *lit - 1 <= n * 2) {
                                        continue;
                                }
                                no.erase(io);
                                no.insert(make_pair(lo, *lit + n + 1));
                                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 1 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 340 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 1 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 316 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 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 25 ms 428 KB Output is correct
20 Correct 14 ms 460 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 28 ms 496 KB Output is correct
23 Correct 29 ms 340 KB Output is correct
24 Correct 20 ms 464 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 11 ms 460 KB Output is correct
29 Correct 79 ms 676 KB Output is correct
30 Correct 24 ms 468 KB Output is correct
31 Correct 3 ms 2112 KB Output is correct
32 Correct 92 ms 804 KB Output is correct
33 Correct 70 ms 684 KB Output is correct
34 Correct 60 ms 972 KB Output is correct
35 Correct 51 ms 948 KB Output is correct
36 Correct 42 ms 1592 KB Output is correct
37 Correct 63 ms 1128 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 941 ms 3304 KB Output is correct
40 Correct 27 ms 596 KB Output is correct
41 Correct 31 ms 980 KB Output is correct
42 Correct 128 ms 716 KB Output is correct
43 Correct 88 ms 964 KB Output is correct
44 Correct 193 ms 1704 KB Output is correct
45 Correct 180 ms 2168 KB Output is correct
46 Correct 46 ms 37124 KB Output is correct
47 Correct 810 ms 3768 KB Output is correct
48 Correct 667 ms 3372 KB Output is correct
49 Correct 392 ms 5528 KB Output is correct
50 Correct 375 ms 5584 KB Output is correct
51 Correct 644 ms 7288 KB Output is correct
52 Correct 458 ms 4688 KB Output is correct
53 Correct 672 ms 3608 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 340 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 1 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 340 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 1 ms 212 KB Output is correct
31 Correct 1 ms 340 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 1 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 340 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 340 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 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 1 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 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 2 ms 1360 KB Output is correct
27 Correct 2 ms 1480 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 2124 KB Output is correct
31 Correct 124 ms 844 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 3 ms 2100 KB Output is correct
36 Correct 2 ms 1364 KB Output is correct
37 Correct 6 ms 2752 KB Output is correct
38 Correct 5 ms 3268 KB Output is correct
39 Correct 13 ms 6408 KB Output is correct
40 Correct 24 ms 15000 KB Output is correct
41 Correct 45 ms 37156 KB Output is correct
42 Correct 31 ms 20836 KB Output is correct
43 Correct 74 ms 38424 KB Output is correct
44 Correct 46 ms 33804 KB Output is correct
45 Correct 21 ms 11492 KB Output is correct
46 Correct 17 ms 7964 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 340 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 1 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 340 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 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 25 ms 448 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 14 ms 460 KB Output is correct
38 Correct 2 ms 1360 KB Output is correct
39 Correct 2 ms 1456 KB Output is correct
40 Correct 31 ms 588 KB Output is correct
41 Correct 29 ms 440 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 4 ms 2124 KB Output is correct
44 Correct 2 ms 2108 KB Output is correct
45 Correct 20 ms 548 KB Output is correct
46 Correct 16 ms 468 KB Output is correct
47 Correct 24 ms 468 KB Output is correct
48 Correct 66 ms 468 KB Output is correct
49 Correct 94 ms 596 KB Output is correct
50 Correct 210 ms 632 KB Output is correct
51 Correct 127 ms 972 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 2 ms 448 KB Output is correct
54 Correct 11 ms 576 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 340 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 1 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 340 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 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 25 ms 448 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 14 ms 460 KB Output is correct
38 Correct 2 ms 1360 KB Output is correct
39 Correct 2 ms 1456 KB Output is correct
40 Correct 31 ms 588 KB Output is correct
41 Correct 29 ms 440 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 4 ms 2124 KB Output is correct
44 Correct 2 ms 2108 KB Output is correct
45 Correct 20 ms 548 KB Output is correct
46 Correct 16 ms 468 KB Output is correct
47 Correct 24 ms 468 KB Output is correct
48 Correct 66 ms 468 KB Output is correct
49 Correct 94 ms 596 KB Output is correct
50 Correct 210 ms 632 KB Output is correct
51 Correct 127 ms 972 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 2 ms 448 KB Output is correct
54 Correct 11 ms 576 KB Output is correct
55 Correct 82 ms 684 KB Output is correct
56 Correct 21 ms 468 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 98 ms 556 KB Output is correct
59 Correct 3 ms 2112 KB Output is correct
60 Correct 78 ms 752 KB Output is correct
61 Correct 70 ms 596 KB Output is correct
62 Correct 2 ms 1364 KB Output is correct
63 Correct 6 ms 2752 KB Output is correct
64 Correct 6 ms 3268 KB Output is correct
65 Correct 60 ms 920 KB Output is correct
66 Correct 53 ms 920 KB Output is correct
67 Correct 92 ms 724 KB Output is correct
68 Correct 324 ms 692 KB Output is correct
69 Correct 499 ms 908 KB Output is correct
70 Correct 500 ms 1336 KB Output is correct
71 Correct 946 ms 2424 KB Output is correct
72 Correct 43 ms 1660 KB Output is correct
73 Correct 63 ms 1104 KB Output is correct
74 Correct 4 ms 724 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 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 1 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 316 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 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 25 ms 428 KB Output is correct
20 Correct 14 ms 460 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 28 ms 496 KB Output is correct
23 Correct 29 ms 340 KB Output is correct
24 Correct 20 ms 464 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 11 ms 460 KB Output is correct
29 Correct 79 ms 676 KB Output is correct
30 Correct 24 ms 468 KB Output is correct
31 Correct 3 ms 2112 KB Output is correct
32 Correct 92 ms 804 KB Output is correct
33 Correct 70 ms 684 KB Output is correct
34 Correct 60 ms 972 KB Output is correct
35 Correct 51 ms 948 KB Output is correct
36 Correct 42 ms 1592 KB Output is correct
37 Correct 63 ms 1128 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 941 ms 3304 KB Output is correct
40 Correct 27 ms 596 KB Output is correct
41 Correct 31 ms 980 KB Output is correct
42 Correct 128 ms 716 KB Output is correct
43 Correct 88 ms 964 KB Output is correct
44 Correct 193 ms 1704 KB Output is correct
45 Correct 180 ms 2168 KB Output is correct
46 Correct 46 ms 37124 KB Output is correct
47 Correct 810 ms 3768 KB Output is correct
48 Correct 667 ms 3372 KB Output is correct
49 Correct 392 ms 5528 KB Output is correct
50 Correct 375 ms 5584 KB Output is correct
51 Correct 644 ms 7288 KB Output is correct
52 Correct 458 ms 4688 KB Output is correct
53 Correct 672 ms 3608 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 340 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 1 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 340 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 1 ms 212 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 1 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 340 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 340 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 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 1 ms 212 KB Output is correct
104 Correct 1 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 340 KB Output is correct
109 Correct 0 ms 340 KB Output is correct
110 Correct 4 ms 340 KB Output is correct
111 Correct 2 ms 1360 KB Output is correct
112 Correct 2 ms 1480 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 2124 KB Output is correct
116 Correct 124 ms 844 KB Output is correct
117 Correct 1 ms 340 KB Output is correct
118 Correct 3 ms 468 KB Output is correct
119 Correct 1 ms 588 KB Output is correct
120 Correct 3 ms 2100 KB Output is correct
121 Correct 2 ms 1364 KB Output is correct
122 Correct 6 ms 2752 KB Output is correct
123 Correct 5 ms 3268 KB Output is correct
124 Correct 13 ms 6408 KB Output is correct
125 Correct 24 ms 15000 KB Output is correct
126 Correct 45 ms 37156 KB Output is correct
127 Correct 31 ms 20836 KB Output is correct
128 Correct 74 ms 38424 KB Output is correct
129 Correct 46 ms 33804 KB Output is correct
130 Correct 21 ms 11492 KB Output is correct
131 Correct 17 ms 7964 KB Output is correct
132 Correct 25 ms 448 KB Output is correct
133 Correct 0 ms 340 KB Output is correct
134 Correct 1 ms 212 KB Output is correct
135 Correct 5 ms 340 KB Output is correct
136 Correct 14 ms 460 KB Output is correct
137 Correct 2 ms 1360 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 31 ms 588 KB Output is correct
140 Correct 29 ms 440 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 4 ms 2124 KB Output is correct
143 Correct 2 ms 2108 KB Output is correct
144 Correct 20 ms 548 KB Output is correct
145 Correct 16 ms 468 KB Output is correct
146 Correct 24 ms 468 KB Output is correct
147 Correct 66 ms 468 KB Output is correct
148 Correct 94 ms 596 KB Output is correct
149 Correct 210 ms 632 KB Output is correct
150 Correct 127 ms 972 KB Output is correct
151 Correct 1 ms 468 KB Output is correct
152 Correct 2 ms 448 KB Output is correct
153 Correct 11 ms 576 KB Output is correct
154 Correct 82 ms 684 KB Output is correct
155 Correct 21 ms 468 KB Output is correct
156 Correct 1 ms 596 KB Output is correct
157 Correct 98 ms 556 KB Output is correct
158 Correct 3 ms 2112 KB Output is correct
159 Correct 78 ms 752 KB Output is correct
160 Correct 70 ms 596 KB Output is correct
161 Correct 2 ms 1364 KB Output is correct
162 Correct 6 ms 2752 KB Output is correct
163 Correct 6 ms 3268 KB Output is correct
164 Correct 60 ms 920 KB Output is correct
165 Correct 53 ms 920 KB Output is correct
166 Correct 92 ms 724 KB Output is correct
167 Correct 324 ms 692 KB Output is correct
168 Correct 499 ms 908 KB Output is correct
169 Correct 500 ms 1336 KB Output is correct
170 Correct 946 ms 2424 KB Output is correct
171 Correct 43 ms 1660 KB Output is correct
172 Correct 63 ms 1104 KB Output is correct
173 Correct 4 ms 724 KB Output is correct
174 Correct 44 ms 660 KB Output is correct
175 Correct 1064 ms 1208 KB Output is correct
176 Correct 184 ms 1948 KB Output is correct
177 Correct 1444 ms 2024 KB Output is correct
178 Correct 172 ms 2648 KB Output is correct
179 Execution timed out 2074 ms 3612 KB Time limit exceeded
180 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 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 1 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 316 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 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 25 ms 428 KB Output is correct
20 Correct 14 ms 460 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 28 ms 496 KB Output is correct
23 Correct 29 ms 340 KB Output is correct
24 Correct 20 ms 464 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 11 ms 460 KB Output is correct
29 Correct 79 ms 676 KB Output is correct
30 Correct 24 ms 468 KB Output is correct
31 Correct 3 ms 2112 KB Output is correct
32 Correct 92 ms 804 KB Output is correct
33 Correct 70 ms 684 KB Output is correct
34 Correct 60 ms 972 KB Output is correct
35 Correct 51 ms 948 KB Output is correct
36 Correct 42 ms 1592 KB Output is correct
37 Correct 63 ms 1128 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 941 ms 3304 KB Output is correct
40 Correct 27 ms 596 KB Output is correct
41 Correct 31 ms 980 KB Output is correct
42 Correct 128 ms 716 KB Output is correct
43 Correct 88 ms 964 KB Output is correct
44 Correct 193 ms 1704 KB Output is correct
45 Correct 180 ms 2168 KB Output is correct
46 Correct 46 ms 37124 KB Output is correct
47 Correct 810 ms 3768 KB Output is correct
48 Correct 667 ms 3372 KB Output is correct
49 Correct 392 ms 5528 KB Output is correct
50 Correct 375 ms 5584 KB Output is correct
51 Correct 644 ms 7288 KB Output is correct
52 Correct 458 ms 4688 KB Output is correct
53 Correct 672 ms 3608 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 340 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 1 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 340 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 1 ms 212 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 1 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 340 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 340 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 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 1 ms 212 KB Output is correct
104 Correct 1 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 340 KB Output is correct
109 Correct 0 ms 340 KB Output is correct
110 Correct 4 ms 340 KB Output is correct
111 Correct 2 ms 1360 KB Output is correct
112 Correct 2 ms 1480 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 2124 KB Output is correct
116 Correct 124 ms 844 KB Output is correct
117 Correct 1 ms 340 KB Output is correct
118 Correct 3 ms 468 KB Output is correct
119 Correct 1 ms 588 KB Output is correct
120 Correct 3 ms 2100 KB Output is correct
121 Correct 2 ms 1364 KB Output is correct
122 Correct 6 ms 2752 KB Output is correct
123 Correct 5 ms 3268 KB Output is correct
124 Correct 13 ms 6408 KB Output is correct
125 Correct 24 ms 15000 KB Output is correct
126 Correct 45 ms 37156 KB Output is correct
127 Correct 31 ms 20836 KB Output is correct
128 Correct 74 ms 38424 KB Output is correct
129 Correct 46 ms 33804 KB Output is correct
130 Correct 21 ms 11492 KB Output is correct
131 Correct 17 ms 7964 KB Output is correct
132 Correct 25 ms 448 KB Output is correct
133 Correct 0 ms 340 KB Output is correct
134 Correct 1 ms 212 KB Output is correct
135 Correct 5 ms 340 KB Output is correct
136 Correct 14 ms 460 KB Output is correct
137 Correct 2 ms 1360 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 31 ms 588 KB Output is correct
140 Correct 29 ms 440 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 4 ms 2124 KB Output is correct
143 Correct 2 ms 2108 KB Output is correct
144 Correct 20 ms 548 KB Output is correct
145 Correct 16 ms 468 KB Output is correct
146 Correct 24 ms 468 KB Output is correct
147 Correct 66 ms 468 KB Output is correct
148 Correct 94 ms 596 KB Output is correct
149 Correct 210 ms 632 KB Output is correct
150 Correct 127 ms 972 KB Output is correct
151 Correct 1 ms 468 KB Output is correct
152 Correct 2 ms 448 KB Output is correct
153 Correct 11 ms 576 KB Output is correct
154 Correct 82 ms 684 KB Output is correct
155 Correct 21 ms 468 KB Output is correct
156 Correct 1 ms 596 KB Output is correct
157 Correct 98 ms 556 KB Output is correct
158 Correct 3 ms 2112 KB Output is correct
159 Correct 78 ms 752 KB Output is correct
160 Correct 70 ms 596 KB Output is correct
161 Correct 2 ms 1364 KB Output is correct
162 Correct 6 ms 2752 KB Output is correct
163 Correct 6 ms 3268 KB Output is correct
164 Correct 60 ms 920 KB Output is correct
165 Correct 53 ms 920 KB Output is correct
166 Correct 92 ms 724 KB Output is correct
167 Correct 324 ms 692 KB Output is correct
168 Correct 499 ms 908 KB Output is correct
169 Correct 500 ms 1336 KB Output is correct
170 Correct 946 ms 2424 KB Output is correct
171 Correct 43 ms 1660 KB Output is correct
172 Correct 63 ms 1104 KB Output is correct
173 Correct 4 ms 724 KB Output is correct
174 Correct 44 ms 660 KB Output is correct
175 Correct 1064 ms 1208 KB Output is correct
176 Correct 184 ms 1948 KB Output is correct
177 Correct 1444 ms 2024 KB Output is correct
178 Correct 172 ms 2648 KB Output is correct
179 Execution timed out 2074 ms 3612 KB Time limit exceeded
180 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 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 1 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 316 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 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 25 ms 428 KB Output is correct
20 Correct 14 ms 460 KB Output is correct
21 Correct 2 ms 1456 KB Output is correct
22 Correct 28 ms 496 KB Output is correct
23 Correct 29 ms 340 KB Output is correct
24 Correct 20 ms 464 KB Output is correct
25 Correct 16 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 11 ms 460 KB Output is correct
29 Correct 79 ms 676 KB Output is correct
30 Correct 24 ms 468 KB Output is correct
31 Correct 3 ms 2112 KB Output is correct
32 Correct 92 ms 804 KB Output is correct
33 Correct 70 ms 684 KB Output is correct
34 Correct 60 ms 972 KB Output is correct
35 Correct 51 ms 948 KB Output is correct
36 Correct 42 ms 1592 KB Output is correct
37 Correct 63 ms 1128 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 941 ms 3304 KB Output is correct
40 Correct 27 ms 596 KB Output is correct
41 Correct 31 ms 980 KB Output is correct
42 Correct 128 ms 716 KB Output is correct
43 Correct 88 ms 964 KB Output is correct
44 Correct 193 ms 1704 KB Output is correct
45 Correct 180 ms 2168 KB Output is correct
46 Correct 46 ms 37124 KB Output is correct
47 Correct 810 ms 3768 KB Output is correct
48 Correct 667 ms 3372 KB Output is correct
49 Correct 392 ms 5528 KB Output is correct
50 Correct 375 ms 5584 KB Output is correct
51 Correct 644 ms 7288 KB Output is correct
52 Correct 458 ms 4688 KB Output is correct
53 Correct 672 ms 3608 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 340 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 1 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 340 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 1 ms 212 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 1 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 340 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 340 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 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 1 ms 212 KB Output is correct
104 Correct 1 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 340 KB Output is correct
109 Correct 0 ms 340 KB Output is correct
110 Correct 4 ms 340 KB Output is correct
111 Correct 2 ms 1360 KB Output is correct
112 Correct 2 ms 1480 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 2124 KB Output is correct
116 Correct 124 ms 844 KB Output is correct
117 Correct 1 ms 340 KB Output is correct
118 Correct 3 ms 468 KB Output is correct
119 Correct 1 ms 588 KB Output is correct
120 Correct 3 ms 2100 KB Output is correct
121 Correct 2 ms 1364 KB Output is correct
122 Correct 6 ms 2752 KB Output is correct
123 Correct 5 ms 3268 KB Output is correct
124 Correct 13 ms 6408 KB Output is correct
125 Correct 24 ms 15000 KB Output is correct
126 Correct 45 ms 37156 KB Output is correct
127 Correct 31 ms 20836 KB Output is correct
128 Correct 74 ms 38424 KB Output is correct
129 Correct 46 ms 33804 KB Output is correct
130 Correct 21 ms 11492 KB Output is correct
131 Correct 17 ms 7964 KB Output is correct
132 Correct 25 ms 448 KB Output is correct
133 Correct 0 ms 340 KB Output is correct
134 Correct 1 ms 212 KB Output is correct
135 Correct 5 ms 340 KB Output is correct
136 Correct 14 ms 460 KB Output is correct
137 Correct 2 ms 1360 KB Output is correct
138 Correct 2 ms 1456 KB Output is correct
139 Correct 31 ms 588 KB Output is correct
140 Correct 29 ms 440 KB Output is correct
141 Correct 1 ms 980 KB Output is correct
142 Correct 4 ms 2124 KB Output is correct
143 Correct 2 ms 2108 KB Output is correct
144 Correct 20 ms 548 KB Output is correct
145 Correct 16 ms 468 KB Output is correct
146 Correct 24 ms 468 KB Output is correct
147 Correct 66 ms 468 KB Output is correct
148 Correct 94 ms 596 KB Output is correct
149 Correct 210 ms 632 KB Output is correct
150 Correct 127 ms 972 KB Output is correct
151 Correct 1 ms 468 KB Output is correct
152 Correct 2 ms 448 KB Output is correct
153 Correct 11 ms 576 KB Output is correct
154 Correct 82 ms 684 KB Output is correct
155 Correct 21 ms 468 KB Output is correct
156 Correct 1 ms 596 KB Output is correct
157 Correct 98 ms 556 KB Output is correct
158 Correct 3 ms 2112 KB Output is correct
159 Correct 78 ms 752 KB Output is correct
160 Correct 70 ms 596 KB Output is correct
161 Correct 2 ms 1364 KB Output is correct
162 Correct 6 ms 2752 KB Output is correct
163 Correct 6 ms 3268 KB Output is correct
164 Correct 60 ms 920 KB Output is correct
165 Correct 53 ms 920 KB Output is correct
166 Correct 92 ms 724 KB Output is correct
167 Correct 324 ms 692 KB Output is correct
168 Correct 499 ms 908 KB Output is correct
169 Correct 500 ms 1336 KB Output is correct
170 Correct 946 ms 2424 KB Output is correct
171 Correct 43 ms 1660 KB Output is correct
172 Correct 63 ms 1104 KB Output is correct
173 Correct 4 ms 724 KB Output is correct
174 Correct 44 ms 660 KB Output is correct
175 Correct 1064 ms 1208 KB Output is correct
176 Correct 184 ms 1948 KB Output is correct
177 Correct 1444 ms 2024 KB Output is correct
178 Correct 172 ms 2648 KB Output is correct
179 Execution timed out 2074 ms 3612 KB Time limit exceeded
180 Halted 0 ms 0 KB -