oj.uz

Submission #566570

# Submission time Handle Problem Language Result Execution time Memory
566570 2022-05-22T12:19:09 Z kartel Fountain Parks (IOI21_parks) C++17
100 / 100
 1792 ms 129104 KB 
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "ext/pb_ds/assoc_container.hpp"
#include "parks.h"
#define F first
#define S second
#define pb push_back
#define sz(x) (int)x.size()
#define el "\n"
#define all(x) (x).begin(), (x).end()

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;

const int N = 2e5 + 500;

mt19937 rnd(time(0));

const int steps[4][2] = {{0, 2}, {2, 0}, {0, -2}, {-2, 0}};
const int dsteps[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};

pair <int, int> road[10][10];

pair <int, int> block[N * 2];
int pr[N];
int cmp[2 * N], to[2 * N];
vector <int> g[2 * N], gr[2 * N], ord;
bool mk[2 * N];

int f(int v) {return (pr[v] == v ? v : pr[v] = f(pr[v]));}
void link(int v, int u) {
    v = f(v); u = f(u);
    if (v == u) {
        return;
    }
    pr[u] = v;
}

int nt(int x) {return (x < N ? x + N : x - N);}

void add_impl(int a, int b) {
    int na = nt(a), nb = nt(b);

    g[na].pb(b); gr[b].pb(na);
    g[nb].pb(a); gr[a].pb(nb);
}

void dfs(int v) {
    mk[v] = 1;
    for (auto &u : g[v]) {
        if (mk[u]) {
            continue;
        }
        dfs(u);
    }
    ord.pb(v);
}
vector <pair <int, int> > pts;

void dfsd(int v) {
    mk[v] = 1;
    for (auto &u : g[v]) {
        if (mk[u]) {
            continue;
        }
        int dx = pts[v].F - pts[u].F;
        int dy = pts[v].S - pts[u].S;
        block[u] = road[dx + 4][dy + 4];
        dfsd(u);
    }
}

inline ll geth(int a, int b) {return ((ll)a << 20) + b;}

void get_erased_2x2(vector <int> &x, vector <int> &y, unordered_map<ll, int> &del) {
    unordered_map <ll, int> cnt, who;

    for (int i = 0; i < sz(x); i++) {
        who[geth(x[i], y[i])] = i;
        for (int j = 0; j < 4; j++) {
            int cx = x[i] + dsteps[j][0];
            int cy = y[i] + dsteps[j][1];

            cnt[geth(cx, cy)]++;
            if (cnt[geth(cx, cy)] == 4) {
                pts.pb({cx, cy});
            }
        }
    }
    sort(all(pts));
    cnt.clear();
    int ptr = 0;
    for (auto &[x, y] : pts) {
        cnt[geth(x, y)] = ptr++;
    }

    ptr = 0;
    for (auto &[x, y] : pts) {
        int par = (x / 2 + y / 2) % 2;
        for (int i = 0; i < 2; i++) {
            int cx = x + steps[i * 2 + par][0];
            int cy = y + steps[i * 2 + par][1];

            if (cnt.find(geth(cx, cy)) == cnt.end()) {
                continue;
            }
            g[cnt[geth(cx, cy)]].pb(ptr);
        }
        ptr++;
    }

    queue <int> q;
    for (int i = 0; i < sz(pts); i++) {
        if (mk[i]) {
            continue;
        }

        int par = (pts[i].F / 2 + pts[i].S / 2) & 1;
        if (par & 1) {
            block[i] = road[-2 + 4][0 + 4];
        } else {
            block[i] = road[0 + 4][-2 + 4];
        }
        dfsd(i);
    }

    for (int i = 0; i < sz(pts); i++) {
        auto &[x, y] = pts[i];

        auto &[a, b] = block[i];
        int v = who[geth(x + dsteps[a][0], y + dsteps[a][1])];
        int u = who[geth(x + dsteps[b][0], y + dsteps[b][1])];

        del[geth(v, u)] = del[geth(u, v)] = 1;
    }
}

int construct_roads(vector <int> x, vector <int> y) {
    int n = sz(x);

    road[0 + 4][2 + 4]  = {2, 0}; road[2 + 4][0 + 4]  = {0, 1};
    road[0 + 4][-2 + 4] = {1, 3}; road[-2 + 4][0 + 4] = {3, 2};

    unordered_map <ll, int> mp;
    vector <pair <int, int> > r;
    unordered_map <ll, int> del;
    vector <int> pm(n);
    iota(all(pm), 0);
    shuffle(all(pm), rnd);

    bool sd = 1;
    for (int i = 0; i < n; i++) {
        mp[geth(x[i], y[i])] = i;
        pr[i] = i;
        sd &= (x[i] >= 2 && x[i] <= 4);
    }

    get_erased_2x2(x, y, del);
    for (auto &i : pm) {
        for (int j = 0; j < 4; j++) {
            int cx = x[i] + steps[j][0];
            int cy = y[i] + steps[j][1];

            if (mp.find(geth(cx, cy)) != mp.end() && f(i) != f(mp[geth(cx, cy)])) {
                int to = mp[geth(cx, cy)];
                if (del.find(geth(i, to)) != del.end()) {
                    continue;
                }
                link(i, to);
                r.pb({i, to});
            }
        }
    }
    sort(all(r));
    r.resize(unique(all(r)) - r.begin());

    for (int i = 0; i < n; i++) {
        if (f(i) != f(0)) {
            return 0;
        }
    }
    vector <int> u, v, A, B;
    unordered_map <ll, vector <int> > e;

    for (int i = 0; i < sz(r); i++) {
        int a = r[i].F, b = r[i].S;
        u.pb(a); v.pb(b);
        if (abs(x[a] - x[b]) == 0) {
            int lx = x[a];
            int ly = min(y[a], y[b]);

            e[geth(lx - 1, ly + 1)].pb(i);
            e[geth(lx + 1, ly + 1)].pb(nt(i));
        } else {
            int lx = min(x[a], x[b]);
            int ly = y[a];

            e[geth(lx + 1, ly + 1)].pb(i);
            e[geth(lx + 1, ly - 1)].pb(nt(i));
        }
    }
    for (int i = 0; i < 2 * N; i++) {
        mk[i] = 0;
        g[i].clear();
    }
    for (auto &[p, v] : e) {
        if (sz(v) == 1) {
            continue;
        }
        for (auto &a : v) {
            for (auto &b : v) {
                if (a == b) {
                    continue;
                }
                add_impl(a, b);
            }
        }
    }

    for (int i = 0; i < 2 * N; i++) {
        cmp[i] = -1;
        if (mk[i]) {
            continue;
        }
        dfs(i);
    }
    reverse(all(ord));

    int C = 0;
    for (auto v : ord) {
        function <void(int)> dfsr = [&](int v) {
            if (cmp[v] != -1) {
                return;
            }
            cmp[v] = C;
            for (auto u : gr[v]) {
                dfsr(u);
            }
        };

        dfsr(v);
        C++;
    }

    for (int i = 0; i < N; i++) {
        if (cmp[i] == cmp[nt(i)]) {
            return 0;
        }
        to[i] = (cmp[i] > cmp[nt(i)]);
    }

    for (int i = 0; i < sz(r); i++) {
        int a = r[i].F, b = r[i].S;
        if (abs(x[a] - x[b]) == 0) {
            int lx = x[a];
            int ly = min(y[a], y[b]);

            if (to[i]) {
                A.pb(lx + 1);
            } else {
                A.pb(lx - 1);
            }
            B.pb(ly + 1);
        } else {
            int lx = min(x[a], x[b]);
            int ly = y[a];

            if (to[i]) {
                B.pb(ly - 1);
            } else {
                B.pb(ly + 1);
            }
            A.pb(lx + 1);
        }
    }

    build(u, v, A, B);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 11 ms 19156 KB Output is correct
4 Correct 16 ms 23496 KB Output is correct
5 Correct 17 ms 23592 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 9 ms 19156 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 391 ms 55496 KB Output is correct
10 Correct 29 ms 26600 KB Output is correct
11 Correct 92 ms 40044 KB Output is correct
12 Correct 38 ms 28052 KB Output is correct
13 Correct 44 ms 29216 KB Output is correct
14 Correct 13 ms 19224 KB Output is correct
15 Correct 11 ms 19512 KB Output is correct
16 Correct 375 ms 55320 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 11 ms 19156 KB Output is correct
4 Correct 16 ms 23496 KB Output is correct
5 Correct 17 ms 23592 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 9 ms 19156 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 391 ms 55496 KB Output is correct
10 Correct 29 ms 26600 KB Output is correct
11 Correct 92 ms 40044 KB Output is correct
12 Correct 38 ms 28052 KB Output is correct
13 Correct 44 ms 29216 KB Output is correct
14 Correct 13 ms 19224 KB Output is correct
15 Correct 11 ms 19512 KB Output is correct
16 Correct 375 ms 55320 KB Output is correct
17 Correct 16 ms 23556 KB Output is correct
18 Correct 20 ms 23620 KB Output is correct
19 Correct 17 ms 23600 KB Output is correct
20 Correct 18 ms 23620 KB Output is correct
21 Correct 13 ms 19144 KB Output is correct
22 Correct 18 ms 23492 KB Output is correct
23 Correct 1370 ms 99436 KB Output is correct
24 Correct 20 ms 23492 KB Output is correct
25 Correct 19 ms 24032 KB Output is correct
26 Correct 13 ms 19744 KB Output is correct
27 Correct 15 ms 19884 KB Output is correct
28 Correct 339 ms 53376 KB Output is correct
29 Correct 718 ms 67844 KB Output is correct
30 Correct 1087 ms 82560 KB Output is correct
31 Correct 1466 ms 98652 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 22 ms 23492 KB Output is correct
34 Correct 18 ms 23492 KB Output is correct
35 Correct 10 ms 19052 KB Output is correct
36 Correct 10 ms 19156 KB Output is correct
37 Correct 17 ms 23592 KB Output is correct
38 Correct 17 ms 23492 KB Output is correct
39 Correct 17 ms 23500 KB Output is correct
40 Correct 16 ms 23544 KB Output is correct
41 Correct 11 ms 19048 KB Output is correct
42 Correct 18 ms 23492 KB Output is correct
43 Correct 12 ms 19500 KB Output is correct
44 Correct 14 ms 19684 KB Output is correct
45 Correct 414 ms 56916 KB Output is correct
46 Correct 709 ms 72356 KB Output is correct
47 Correct 706 ms 71716 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 11 ms 19156 KB Output is correct
4 Correct 16 ms 23496 KB Output is correct
5 Correct 17 ms 23592 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 9 ms 19156 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 391 ms 55496 KB Output is correct
10 Correct 29 ms 26600 KB Output is correct
11 Correct 92 ms 40044 KB Output is correct
12 Correct 38 ms 28052 KB Output is correct
13 Correct 44 ms 29216 KB Output is correct
14 Correct 13 ms 19224 KB Output is correct
15 Correct 11 ms 19512 KB Output is correct
16 Correct 375 ms 55320 KB Output is correct
17 Correct 16 ms 23556 KB Output is correct
18 Correct 20 ms 23620 KB Output is correct
19 Correct 17 ms 23600 KB Output is correct
20 Correct 18 ms 23620 KB Output is correct
21 Correct 13 ms 19144 KB Output is correct
22 Correct 18 ms 23492 KB Output is correct
23 Correct 1370 ms 99436 KB Output is correct
24 Correct 20 ms 23492 KB Output is correct
25 Correct 19 ms 24032 KB Output is correct
26 Correct 13 ms 19744 KB Output is correct
27 Correct 15 ms 19884 KB Output is correct
28 Correct 339 ms 53376 KB Output is correct
29 Correct 718 ms 67844 KB Output is correct
30 Correct 1087 ms 82560 KB Output is correct
31 Correct 1466 ms 98652 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 22 ms 23492 KB Output is correct
34 Correct 18 ms 23492 KB Output is correct
35 Correct 10 ms 19052 KB Output is correct
36 Correct 10 ms 19156 KB Output is correct
37 Correct 17 ms 23592 KB Output is correct
38 Correct 17 ms 23492 KB Output is correct
39 Correct 17 ms 23500 KB Output is correct
40 Correct 16 ms 23544 KB Output is correct
41 Correct 11 ms 19048 KB Output is correct
42 Correct 18 ms 23492 KB Output is correct
43 Correct 12 ms 19500 KB Output is correct
44 Correct 14 ms 19684 KB Output is correct
45 Correct 414 ms 56916 KB Output is correct
46 Correct 709 ms 72356 KB Output is correct
47 Correct 706 ms 71716 KB Output is correct
48 Correct 17 ms 23492 KB Output is correct
49 Correct 18 ms 23492 KB Output is correct
50 Correct 19 ms 23600 KB Output is correct
51 Correct 19 ms 23640 KB Output is correct
52 Correct 19 ms 23548 KB Output is correct
53 Correct 18 ms 23508 KB Output is correct
54 Correct 20 ms 23620 KB Output is correct
55 Correct 1510 ms 114296 KB Output is correct
56 Correct 17 ms 23592 KB Output is correct
57 Correct 21 ms 24308 KB Output is correct
58 Correct 33 ms 26348 KB Output is correct
59 Correct 24 ms 21480 KB Output is correct
60 Correct 581 ms 69264 KB Output is correct
61 Correct 999 ms 87252 KB Output is correct
62 Correct 1292 ms 98912 KB Output is correct
63 Correct 1792 ms 114380 KB Output is correct
64 Correct 9 ms 19156 KB Output is correct
65 Correct 17 ms 23492 KB Output is correct
66 Correct 9 ms 19156 KB Output is correct
67 Correct 1176 ms 86792 KB Output is correct
68 Correct 1244 ms 86812 KB Output is correct
69 Correct 1239 ms 86624 KB Output is correct
70 Correct 18 ms 19796 KB Output is correct
71 Correct 22 ms 20564 KB Output is correct
72 Correct 491 ms 57040 KB Output is correct
73 Correct 952 ms 73372 KB Output is correct
74 Correct 1443 ms 89396 KB Output is correct
75 Correct 1319 ms 88352 KB Output is correct
76 Correct 1166 ms 86808 KB Output is correct
77 Correct 15 ms 19924 KB Output is correct
78 Correct 20 ms 20704 KB Output is correct
79 Correct 468 ms 56576 KB Output is correct
80 Correct 736 ms 73292 KB Output is correct
81 Correct 1188 ms 89340 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 11 ms 19156 KB Output is correct
4 Correct 16 ms 23496 KB Output is correct
5 Correct 17 ms 23592 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 9 ms 19156 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 391 ms 55496 KB Output is correct
10 Correct 29 ms 26600 KB Output is correct
11 Correct 92 ms 40044 KB Output is correct
12 Correct 38 ms 28052 KB Output is correct
13 Correct 44 ms 29216 KB Output is correct
14 Correct 13 ms 19224 KB Output is correct
15 Correct 11 ms 19512 KB Output is correct
16 Correct 375 ms 55320 KB Output is correct
17 Correct 18 ms 23492 KB Output is correct
18 Correct 21 ms 23576 KB Output is correct
19 Correct 11 ms 19044 KB Output is correct
20 Correct 1130 ms 98840 KB Output is correct
21 Correct 1196 ms 94676 KB Output is correct
22 Correct 1225 ms 94860 KB Output is correct
23 Correct 674 ms 74852 KB Output is correct
24 Correct 530 ms 80968 KB Output is correct
25 Correct 545 ms 60296 KB Output is correct
26 Correct 587 ms 60320 KB Output is correct
27 Correct 924 ms 86824 KB Output is correct
28 Correct 930 ms 86852 KB Output is correct
29 Correct 915 ms 87004 KB Output is correct
30 Correct 863 ms 86856 KB Output is correct
31 Correct 21 ms 23492 KB Output is correct
32 Correct 51 ms 28204 KB Output is correct
33 Correct 157 ms 42604 KB Output is correct
34 Correct 974 ms 98004 KB Output is correct
35 Correct 21 ms 20820 KB Output is correct
36 Correct 85 ms 28052 KB Output is correct
37 Correct 267 ms 37244 KB Output is correct
38 Correct 328 ms 51160 KB Output is correct
39 Correct 575 ms 60600 KB Output is correct
40 Correct 755 ms 71932 KB Output is correct
41 Correct 969 ms 81732 KB Output is correct
42 Correct 1145 ms 90848 KB Output is correct
43 Correct 21 ms 23492 KB Output is correct
44 Correct 22 ms 23492 KB Output is correct
45 Correct 18 ms 23572 KB Output is correct
46 Correct 12 ms 19140 KB Output is correct
47 Correct 12 ms 19156 KB Output is correct
48 Correct 18 ms 23492 KB Output is correct
49 Correct 17 ms 23492 KB Output is correct
50 Correct 19 ms 23504 KB Output is correct
51 Correct 17 ms 23592 KB Output is correct
52 Correct 10 ms 19156 KB Output is correct
53 Correct 20 ms 23500 KB Output is correct
54 Correct 12 ms 19412 KB Output is correct
55 Correct 13 ms 19664 KB Output is correct
56 Correct 461 ms 56840 KB Output is correct
57 Correct 694 ms 72264 KB Output is correct
58 Correct 675 ms 72364 KB Output is correct
59 Correct 11 ms 19156 KB Output is correct
60 Correct 17 ms 23492 KB Output is correct
61 Correct 10 ms 19092 KB Output is correct
62 Correct 1067 ms 86900 KB Output is correct
63 Correct 1056 ms 86912 KB Output is correct
64 Correct 1025 ms 86552 KB Output is correct
65 Correct 14 ms 19992 KB Output is correct
66 Correct 18 ms 20580 KB Output is correct
67 Correct 475 ms 57040 KB Output is correct
68 Correct 756 ms 73440 KB Output is correct
69 Correct 1107 ms 89560 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 11 ms 19156 KB Output is correct
4 Correct 16 ms 23496 KB Output is correct
5 Correct 17 ms 23592 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 9 ms 19156 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 391 ms 55496 KB Output is correct
10 Correct 29 ms 26600 KB Output is correct
11 Correct 92 ms 40044 KB Output is correct
12 Correct 38 ms 28052 KB Output is correct
13 Correct 44 ms 29216 KB Output is correct
14 Correct 13 ms 19224 KB Output is correct
15 Correct 11 ms 19512 KB Output is correct
16 Correct 375 ms 55320 KB Output is correct
17 Correct 929 ms 85936 KB Output is correct
18 Correct 962 ms 86032 KB Output is correct
19 Correct 1080 ms 98088 KB Output is correct
20 Correct 1044 ms 89500 KB Output is correct
21 Correct 787 ms 79884 KB Output is correct
22 Correct 17 ms 23596 KB Output is correct
23 Correct 99 ms 33936 KB Output is correct
24 Correct 38 ms 22444 KB Output is correct
25 Correct 139 ms 31072 KB Output is correct
26 Correct 240 ms 41224 KB Output is correct
27 Correct 470 ms 57236 KB Output is correct
28 Correct 599 ms 65028 KB Output is correct
29 Correct 789 ms 75504 KB Output is correct
30 Correct 993 ms 83756 KB Output is correct
31 Correct 1186 ms 90448 KB Output is correct
32 Correct 1135 ms 88476 KB Output is correct
33 Correct 971 ms 86816 KB Output is correct
34 Correct 15 ms 19924 KB Output is correct
35 Correct 20 ms 20692 KB Output is correct
36 Correct 436 ms 56944 KB Output is correct
37 Correct 764 ms 74492 KB Output is correct
38 Correct 1187 ms 89252 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 11 ms 19156 KB Output is correct
4 Correct 16 ms 23496 KB Output is correct
5 Correct 17 ms 23592 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 9 ms 19156 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 391 ms 55496 KB Output is correct
10 Correct 29 ms 26600 KB Output is correct
11 Correct 92 ms 40044 KB Output is correct
12 Correct 38 ms 28052 KB Output is correct
13 Correct 44 ms 29216 KB Output is correct
14 Correct 13 ms 19224 KB Output is correct
15 Correct 11 ms 19512 KB Output is correct
16 Correct 375 ms 55320 KB Output is correct
17 Correct 16 ms 23556 KB Output is correct
18 Correct 20 ms 23620 KB Output is correct
19 Correct 17 ms 23600 KB Output is correct
20 Correct 18 ms 23620 KB Output is correct
21 Correct 13 ms 19144 KB Output is correct
22 Correct 18 ms 23492 KB Output is correct
23 Correct 1370 ms 99436 KB Output is correct
24 Correct 20 ms 23492 KB Output is correct
25 Correct 19 ms 24032 KB Output is correct
26 Correct 13 ms 19744 KB Output is correct
27 Correct 15 ms 19884 KB Output is correct
28 Correct 339 ms 53376 KB Output is correct
29 Correct 718 ms 67844 KB Output is correct
30 Correct 1087 ms 82560 KB Output is correct
31 Correct 1466 ms 98652 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 22 ms 23492 KB Output is correct
34 Correct 18 ms 23492 KB Output is correct
35 Correct 10 ms 19052 KB Output is correct
36 Correct 10 ms 19156 KB Output is correct
37 Correct 17 ms 23592 KB Output is correct
38 Correct 17 ms 23492 KB Output is correct
39 Correct 17 ms 23500 KB Output is correct
40 Correct 16 ms 23544 KB Output is correct
41 Correct 11 ms 19048 KB Output is correct
42 Correct 18 ms 23492 KB Output is correct
43 Correct 12 ms 19500 KB Output is correct
44 Correct 14 ms 19684 KB Output is correct
45 Correct 414 ms 56916 KB Output is correct
46 Correct 709 ms 72356 KB Output is correct
47 Correct 706 ms 71716 KB Output is correct
48 Correct 17 ms 23492 KB Output is correct
49 Correct 18 ms 23492 KB Output is correct
50 Correct 19 ms 23600 KB Output is correct
51 Correct 19 ms 23640 KB Output is correct
52 Correct 19 ms 23548 KB Output is correct
53 Correct 18 ms 23508 KB Output is correct
54 Correct 20 ms 23620 KB Output is correct
55 Correct 1510 ms 114296 KB Output is correct
56 Correct 17 ms 23592 KB Output is correct
57 Correct 21 ms 24308 KB Output is correct
58 Correct 33 ms 26348 KB Output is correct
59 Correct 24 ms 21480 KB Output is correct
60 Correct 581 ms 69264 KB Output is correct
61 Correct 999 ms 87252 KB Output is correct
62 Correct 1292 ms 98912 KB Output is correct
63 Correct 1792 ms 114380 KB Output is correct
64 Correct 9 ms 19156 KB Output is correct
65 Correct 17 ms 23492 KB Output is correct
66 Correct 9 ms 19156 KB Output is correct
67 Correct 1176 ms 86792 KB Output is correct
68 Correct 1244 ms 86812 KB Output is correct
69 Correct 1239 ms 86624 KB Output is correct
70 Correct 18 ms 19796 KB Output is correct
71 Correct 22 ms 20564 KB Output is correct
72 Correct 491 ms 57040 KB Output is correct
73 Correct 952 ms 73372 KB Output is correct
74 Correct 1443 ms 89396 KB Output is correct
75 Correct 1319 ms 88352 KB Output is correct
76 Correct 1166 ms 86808 KB Output is correct
77 Correct 15 ms 19924 KB Output is correct
78 Correct 20 ms 20704 KB Output is correct
79 Correct 468 ms 56576 KB Output is correct
80 Correct 736 ms 73292 KB Output is correct
81 Correct 1188 ms 89340 KB Output is correct
82 Correct 18 ms 23492 KB Output is correct
83 Correct 21 ms 23576 KB Output is correct
84 Correct 11 ms 19044 KB Output is correct
85 Correct 1130 ms 98840 KB Output is correct
86 Correct 1196 ms 94676 KB Output is correct
87 Correct 1225 ms 94860 KB Output is correct
88 Correct 674 ms 74852 KB Output is correct
89 Correct 530 ms 80968 KB Output is correct
90 Correct 545 ms 60296 KB Output is correct
91 Correct 587 ms 60320 KB Output is correct
92 Correct 924 ms 86824 KB Output is correct
93 Correct 930 ms 86852 KB Output is correct
94 Correct 915 ms 87004 KB Output is correct
95 Correct 863 ms 86856 KB Output is correct
96 Correct 21 ms 23492 KB Output is correct
97 Correct 51 ms 28204 KB Output is correct
98 Correct 157 ms 42604 KB Output is correct
99 Correct 974 ms 98004 KB Output is correct
100 Correct 21 ms 20820 KB Output is correct
101 Correct 85 ms 28052 KB Output is correct
102 Correct 267 ms 37244 KB Output is correct
103 Correct 328 ms 51160 KB Output is correct
104 Correct 575 ms 60600 KB Output is correct
105 Correct 755 ms 71932 KB Output is correct
106 Correct 969 ms 81732 KB Output is correct
107 Correct 1145 ms 90848 KB Output is correct
108 Correct 21 ms 23492 KB Output is correct
109 Correct 22 ms 23492 KB Output is correct
110 Correct 18 ms 23572 KB Output is correct
111 Correct 12 ms 19140 KB Output is correct
112 Correct 12 ms 19156 KB Output is correct
113 Correct 18 ms 23492 KB Output is correct
114 Correct 17 ms 23492 KB Output is correct
115 Correct 19 ms 23504 KB Output is correct
116 Correct 17 ms 23592 KB Output is correct
117 Correct 10 ms 19156 KB Output is correct
118 Correct 20 ms 23500 KB Output is correct
119 Correct 12 ms 19412 KB Output is correct
120 Correct 13 ms 19664 KB Output is correct
121 Correct 461 ms 56840 KB Output is correct
122 Correct 694 ms 72264 KB Output is correct
123 Correct 675 ms 72364 KB Output is correct
124 Correct 11 ms 19156 KB Output is correct
125 Correct 17 ms 23492 KB Output is correct
126 Correct 10 ms 19092 KB Output is correct
127 Correct 1067 ms 86900 KB Output is correct
128 Correct 1056 ms 86912 KB Output is correct
129 Correct 1025 ms 86552 KB Output is correct
130 Correct 14 ms 19992 KB Output is correct
131 Correct 18 ms 20580 KB Output is correct
132 Correct 475 ms 57040 KB Output is correct
133 Correct 756 ms 73440 KB Output is correct
134 Correct 1107 ms 89560 KB Output is correct
135 Correct 929 ms 85936 KB Output is correct
136 Correct 962 ms 86032 KB Output is correct
137 Correct 1080 ms 98088 KB Output is correct
138 Correct 1044 ms 89500 KB Output is correct
139 Correct 787 ms 79884 KB Output is correct
140 Correct 17 ms 23596 KB Output is correct
141 Correct 99 ms 33936 KB Output is correct
142 Correct 38 ms 22444 KB Output is correct
143 Correct 139 ms 31072 KB Output is correct
144 Correct 240 ms 41224 KB Output is correct
145 Correct 470 ms 57236 KB Output is correct
146 Correct 599 ms 65028 KB Output is correct
147 Correct 789 ms 75504 KB Output is correct
148 Correct 993 ms 83756 KB Output is correct
149 Correct 1186 ms 90448 KB Output is correct
150 Correct 1135 ms 88476 KB Output is correct
151 Correct 971 ms 86816 KB Output is correct
152 Correct 15 ms 19924 KB Output is correct
153 Correct 20 ms 20692 KB Output is correct
154 Correct 436 ms 56944 KB Output is correct
155 Correct 764 ms 74492 KB Output is correct
156 Correct 1187 ms 89252 KB Output is correct
157 Correct 17 ms 23596 KB Output is correct
158 Correct 10 ms 19156 KB Output is correct
159 Correct 23 ms 23592 KB Output is correct
160 Correct 18 ms 23492 KB Output is correct
161 Correct 1549 ms 129104 KB Output is correct
162 Correct 980 ms 97568 KB Output is correct
163 Correct 1198 ms 97440 KB Output is correct
164 Correct 1205 ms 97240 KB Output is correct
165 Correct 1565 ms 113780 KB Output is correct
166 Correct 1397 ms 119948 KB Output is correct
167 Correct 272 ms 42788 KB Output is correct
168 Correct 86 ms 28184 KB Output is correct
169 Correct 298 ms 40736 KB Output is correct
170 Correct 606 ms 59440 KB Output is correct
171 Correct 941 ms 78704 KB Output is correct
172 Correct 736 ms 72500 KB Output is correct
173 Correct 787 ms 80892 KB Output is correct
174 Correct 1040 ms 89840 KB Output is correct
175 Correct 1330 ms 98336 KB Output is correct
176 Correct 1414 ms 113688 KB Output is correct
177 Correct 1565 ms 122632 KB Output is correct