oj.uz

Submission #566574

# Submission time Handle Problem Language Result Execution time Memory
566574 2022-05-22T12:27:05 Z kartel Fountain Parks (IOI21_parks) C++17
100 / 100
 1214 ms 500804 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 + 4;

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];
bitset<N / 2> have[N / 2];

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;
        if (have[x[i] / 2 + 1][y[i] / 2] && have[x[i] / 2][y[i] / 2 + 1] && have[x[i] / 2 + 1][y[i] / 2 + 1]) {
            pts.pb({x[i] + 1, y[i] + 1});
        }
    }
    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;

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

    get_erased_2x2(x, y, del);
    for (int i = 0; i < n; i++) {
        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 17 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 17 ms 23492 KB Output is correct
5 Correct 17 ms 23488 KB Output is correct
6 Correct 10 ms 19100 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 217 ms 54508 KB Output is correct
10 Correct 26 ms 26332 KB Output is correct
11 Correct 72 ms 39844 KB Output is correct
12 Correct 32 ms 27836 KB Output is correct
13 Correct 32 ms 24448 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 12 ms 19284 KB Output is correct
16 Correct 225 ms 54516 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 17 ms 23492 KB Output is correct
5 Correct 17 ms 23488 KB Output is correct
6 Correct 10 ms 19100 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 217 ms 54508 KB Output is correct
10 Correct 26 ms 26332 KB Output is correct
11 Correct 72 ms 39844 KB Output is correct
12 Correct 32 ms 27836 KB Output is correct
13 Correct 32 ms 24448 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 12 ms 19284 KB Output is correct
16 Correct 225 ms 54516 KB Output is correct
17 Correct 18 ms 23492 KB Output is correct
18 Correct 16 ms 23572 KB Output is correct
19 Correct 18 ms 23528 KB Output is correct
20 Correct 17 ms 23464 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 18 ms 23620 KB Output is correct
23 Correct 858 ms 97600 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 20 ms 23964 KB Output is correct
26 Correct 13 ms 19700 KB Output is correct
27 Correct 14 ms 19796 KB Output is correct
28 Correct 245 ms 52880 KB Output is correct
29 Correct 422 ms 66948 KB Output is correct
30 Correct 664 ms 82292 KB Output is correct
31 Correct 864 ms 97592 KB Output is correct
32 Correct 17 ms 23492 KB Output is correct
33 Correct 17 ms 23508 KB Output is correct
34 Correct 17 ms 23492 KB Output is correct
35 Correct 10 ms 19028 KB Output is correct
36 Correct 10 ms 19028 KB Output is correct
37 Correct 17 ms 23464 KB Output is correct
38 Correct 19 ms 23492 KB Output is correct
39 Correct 17 ms 23492 KB Output is correct
40 Correct 18 ms 23624 KB Output is correct
41 Correct 10 ms 19028 KB Output is correct
42 Correct 18 ms 23532 KB Output is correct
43 Correct 12 ms 19284 KB Output is correct
44 Correct 12 ms 19412 KB Output is correct
45 Correct 259 ms 56228 KB Output is correct
46 Correct 450 ms 70472 KB Output is correct
47 Correct 446 ms 70716 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 17 ms 23492 KB Output is correct
5 Correct 17 ms 23488 KB Output is correct
6 Correct 10 ms 19100 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 217 ms 54508 KB Output is correct
10 Correct 26 ms 26332 KB Output is correct
11 Correct 72 ms 39844 KB Output is correct
12 Correct 32 ms 27836 KB Output is correct
13 Correct 32 ms 24448 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 12 ms 19284 KB Output is correct
16 Correct 225 ms 54516 KB Output is correct
17 Correct 18 ms 23492 KB Output is correct
18 Correct 16 ms 23572 KB Output is correct
19 Correct 18 ms 23528 KB Output is correct
20 Correct 17 ms 23464 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 18 ms 23620 KB Output is correct
23 Correct 858 ms 97600 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 20 ms 23964 KB Output is correct
26 Correct 13 ms 19700 KB Output is correct
27 Correct 14 ms 19796 KB Output is correct
28 Correct 245 ms 52880 KB Output is correct
29 Correct 422 ms 66948 KB Output is correct
30 Correct 664 ms 82292 KB Output is correct
31 Correct 864 ms 97592 KB Output is correct
32 Correct 17 ms 23492 KB Output is correct
33 Correct 17 ms 23508 KB Output is correct
34 Correct 17 ms 23492 KB Output is correct
35 Correct 10 ms 19028 KB Output is correct
36 Correct 10 ms 19028 KB Output is correct
37 Correct 17 ms 23464 KB Output is correct
38 Correct 19 ms 23492 KB Output is correct
39 Correct 17 ms 23492 KB Output is correct
40 Correct 18 ms 23624 KB Output is correct
41 Correct 10 ms 19028 KB Output is correct
42 Correct 18 ms 23532 KB Output is correct
43 Correct 12 ms 19284 KB Output is correct
44 Correct 12 ms 19412 KB Output is correct
45 Correct 259 ms 56228 KB Output is correct
46 Correct 450 ms 70472 KB Output is correct
47 Correct 446 ms 70716 KB Output is correct
48 Correct 18 ms 23656 KB Output is correct
49 Correct 17 ms 23492 KB Output is correct
50 Correct 17 ms 23492 KB Output is correct
51 Correct 17 ms 23492 KB Output is correct
52 Correct 17 ms 23492 KB Output is correct
53 Correct 17 ms 23520 KB Output is correct
54 Correct 17 ms 23492 KB Output is correct
55 Correct 1073 ms 114372 KB Output is correct
56 Correct 19 ms 23492 KB Output is correct
57 Correct 22 ms 24324 KB Output is correct
58 Correct 31 ms 26268 KB Output is correct
59 Correct 22 ms 21332 KB Output is correct
60 Correct 371 ms 68584 KB Output is correct
61 Correct 611 ms 86876 KB Output is correct
62 Correct 771 ms 98580 KB Output is correct
63 Correct 1058 ms 113788 KB Output is correct
64 Correct 10 ms 19028 KB Output is correct
65 Correct 17 ms 23504 KB Output is correct
66 Correct 11 ms 19036 KB Output is correct
67 Correct 608 ms 86088 KB Output is correct
68 Correct 619 ms 86076 KB Output is correct
69 Correct 609 ms 85688 KB Output is correct
70 Correct 11 ms 19540 KB Output is correct
71 Correct 14 ms 19924 KB Output is correct
72 Correct 277 ms 56272 KB Output is correct
73 Correct 511 ms 71912 KB Output is correct
74 Correct 745 ms 88660 KB Output is correct
75 Correct 729 ms 87500 KB Output is correct
76 Correct 610 ms 85912 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 19 ms 19956 KB Output is correct
79 Correct 306 ms 56272 KB Output is correct
80 Correct 514 ms 72708 KB Output is correct
81 Correct 744 ms 88508 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 17 ms 23492 KB Output is correct
5 Correct 17 ms 23488 KB Output is correct
6 Correct 10 ms 19100 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 217 ms 54508 KB Output is correct
10 Correct 26 ms 26332 KB Output is correct
11 Correct 72 ms 39844 KB Output is correct
12 Correct 32 ms 27836 KB Output is correct
13 Correct 32 ms 24448 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 12 ms 19284 KB Output is correct
16 Correct 225 ms 54516 KB Output is correct
17 Correct 18 ms 23492 KB Output is correct
18 Correct 17 ms 23508 KB Output is correct
19 Correct 10 ms 19084 KB Output is correct
20 Correct 936 ms 500804 KB Output is correct
21 Correct 849 ms 295212 KB Output is correct
22 Correct 1057 ms 295700 KB Output is correct
23 Correct 556 ms 371628 KB Output is correct
24 Correct 180 ms 43120 KB Output is correct
25 Correct 234 ms 43164 KB Output is correct
26 Correct 216 ms 43204 KB Output is correct
27 Correct 552 ms 89256 KB Output is correct
28 Correct 584 ms 89248 KB Output is correct
29 Correct 508 ms 87968 KB Output is correct
30 Correct 510 ms 87992 KB Output is correct
31 Correct 17 ms 23580 KB Output is correct
32 Correct 48 ms 29432 KB Output is correct
33 Correct 234 ms 432680 KB Output is correct
34 Correct 882 ms 499848 KB Output is correct
35 Correct 17 ms 20948 KB Output is correct
36 Correct 55 ms 27868 KB Output is correct
37 Correct 105 ms 36488 KB Output is correct
38 Correct 260 ms 51636 KB Output is correct
39 Correct 385 ms 62156 KB Output is correct
40 Correct 519 ms 71196 KB Output is correct
41 Correct 629 ms 81608 KB Output is correct
42 Correct 770 ms 94524 KB Output is correct
43 Correct 18 ms 23492 KB Output is correct
44 Correct 18 ms 23564 KB Output is correct
45 Correct 17 ms 23464 KB Output is correct
46 Correct 10 ms 19012 KB Output is correct
47 Correct 11 ms 19088 KB Output is correct
48 Correct 17 ms 23484 KB Output is correct
49 Correct 19 ms 23492 KB Output is correct
50 Correct 18 ms 23492 KB Output is correct
51 Correct 18 ms 23492 KB Output is correct
52 Correct 11 ms 19028 KB Output is correct
53 Correct 17 ms 23492 KB Output is correct
54 Correct 11 ms 19412 KB Output is correct
55 Correct 12 ms 19464 KB Output is correct
56 Correct 261 ms 56156 KB Output is correct
57 Correct 451 ms 70476 KB Output is correct
58 Correct 450 ms 70768 KB Output is correct
59 Correct 10 ms 19028 KB Output is correct
60 Correct 17 ms 23576 KB Output is correct
61 Correct 10 ms 19028 KB Output is correct
62 Correct 645 ms 85908 KB Output is correct
63 Correct 648 ms 86076 KB Output is correct
64 Correct 610 ms 85744 KB Output is correct
65 Correct 12 ms 19540 KB Output is correct
66 Correct 15 ms 19924 KB Output is correct
67 Correct 281 ms 56360 KB Output is correct
68 Correct 500 ms 71896 KB Output is correct
69 Correct 751 ms 88672 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 17 ms 23492 KB Output is correct
5 Correct 17 ms 23488 KB Output is correct
6 Correct 10 ms 19100 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 217 ms 54508 KB Output is correct
10 Correct 26 ms 26332 KB Output is correct
11 Correct 72 ms 39844 KB Output is correct
12 Correct 32 ms 27836 KB Output is correct
13 Correct 32 ms 24448 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 12 ms 19284 KB Output is correct
16 Correct 225 ms 54516 KB Output is correct
17 Correct 838 ms 486476 KB Output is correct
18 Correct 946 ms 438864 KB Output is correct
19 Correct 1087 ms 433664 KB Output is correct
20 Correct 893 ms 90672 KB Output is correct
21 Correct 535 ms 82044 KB Output is correct
22 Correct 17 ms 23492 KB Output is correct
23 Correct 83 ms 36788 KB Output is correct
24 Correct 29 ms 22228 KB Output is correct
25 Correct 78 ms 29972 KB Output is correct
26 Correct 131 ms 38480 KB Output is correct
27 Correct 319 ms 59032 KB Output is correct
28 Correct 434 ms 66724 KB Output is correct
29 Correct 598 ms 74876 KB Output is correct
30 Correct 672 ms 85868 KB Output is correct
31 Correct 778 ms 93268 KB Output is correct
32 Correct 730 ms 87540 KB Output is correct
33 Correct 619 ms 85876 KB Output is correct
34 Correct 13 ms 19540 KB Output is correct
35 Correct 17 ms 20052 KB Output is correct
36 Correct 273 ms 56248 KB Output is correct
37 Correct 495 ms 72552 KB Output is correct
38 Correct 732 ms 88516 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23492 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 17 ms 23492 KB Output is correct
5 Correct 17 ms 23488 KB Output is correct
6 Correct 10 ms 19100 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 217 ms 54508 KB Output is correct
10 Correct 26 ms 26332 KB Output is correct
11 Correct 72 ms 39844 KB Output is correct
12 Correct 32 ms 27836 KB Output is correct
13 Correct 32 ms 24448 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 12 ms 19284 KB Output is correct
16 Correct 225 ms 54516 KB Output is correct
17 Correct 18 ms 23492 KB Output is correct
18 Correct 16 ms 23572 KB Output is correct
19 Correct 18 ms 23528 KB Output is correct
20 Correct 17 ms 23464 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 18 ms 23620 KB Output is correct
23 Correct 858 ms 97600 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 20 ms 23964 KB Output is correct
26 Correct 13 ms 19700 KB Output is correct
27 Correct 14 ms 19796 KB Output is correct
28 Correct 245 ms 52880 KB Output is correct
29 Correct 422 ms 66948 KB Output is correct
30 Correct 664 ms 82292 KB Output is correct
31 Correct 864 ms 97592 KB Output is correct
32 Correct 17 ms 23492 KB Output is correct
33 Correct 17 ms 23508 KB Output is correct
34 Correct 17 ms 23492 KB Output is correct
35 Correct 10 ms 19028 KB Output is correct
36 Correct 10 ms 19028 KB Output is correct
37 Correct 17 ms 23464 KB Output is correct
38 Correct 19 ms 23492 KB Output is correct
39 Correct 17 ms 23492 KB Output is correct
40 Correct 18 ms 23624 KB Output is correct
41 Correct 10 ms 19028 KB Output is correct
42 Correct 18 ms 23532 KB Output is correct
43 Correct 12 ms 19284 KB Output is correct
44 Correct 12 ms 19412 KB Output is correct
45 Correct 259 ms 56228 KB Output is correct
46 Correct 450 ms 70472 KB Output is correct
47 Correct 446 ms 70716 KB Output is correct
48 Correct 18 ms 23656 KB Output is correct
49 Correct 17 ms 23492 KB Output is correct
50 Correct 17 ms 23492 KB Output is correct
51 Correct 17 ms 23492 KB Output is correct
52 Correct 17 ms 23492 KB Output is correct
53 Correct 17 ms 23520 KB Output is correct
54 Correct 17 ms 23492 KB Output is correct
55 Correct 1073 ms 114372 KB Output is correct
56 Correct 19 ms 23492 KB Output is correct
57 Correct 22 ms 24324 KB Output is correct
58 Correct 31 ms 26268 KB Output is correct
59 Correct 22 ms 21332 KB Output is correct
60 Correct 371 ms 68584 KB Output is correct
61 Correct 611 ms 86876 KB Output is correct
62 Correct 771 ms 98580 KB Output is correct
63 Correct 1058 ms 113788 KB Output is correct
64 Correct 10 ms 19028 KB Output is correct
65 Correct 17 ms 23504 KB Output is correct
66 Correct 11 ms 19036 KB Output is correct
67 Correct 608 ms 86088 KB Output is correct
68 Correct 619 ms 86076 KB Output is correct
69 Correct 609 ms 85688 KB Output is correct
70 Correct 11 ms 19540 KB Output is correct
71 Correct 14 ms 19924 KB Output is correct
72 Correct 277 ms 56272 KB Output is correct
73 Correct 511 ms 71912 KB Output is correct
74 Correct 745 ms 88660 KB Output is correct
75 Correct 729 ms 87500 KB Output is correct
76 Correct 610 ms 85912 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 19 ms 19956 KB Output is correct
79 Correct 306 ms 56272 KB Output is correct
80 Correct 514 ms 72708 KB Output is correct
81 Correct 744 ms 88508 KB Output is correct
82 Correct 18 ms 23492 KB Output is correct
83 Correct 17 ms 23508 KB Output is correct
84 Correct 10 ms 19084 KB Output is correct
85 Correct 936 ms 500804 KB Output is correct
86 Correct 849 ms 295212 KB Output is correct
87 Correct 1057 ms 295700 KB Output is correct
88 Correct 556 ms 371628 KB Output is correct
89 Correct 180 ms 43120 KB Output is correct
90 Correct 234 ms 43164 KB Output is correct
91 Correct 216 ms 43204 KB Output is correct
92 Correct 552 ms 89256 KB Output is correct
93 Correct 584 ms 89248 KB Output is correct
94 Correct 508 ms 87968 KB Output is correct
95 Correct 510 ms 87992 KB Output is correct
96 Correct 17 ms 23580 KB Output is correct
97 Correct 48 ms 29432 KB Output is correct
98 Correct 234 ms 432680 KB Output is correct
99 Correct 882 ms 499848 KB Output is correct
100 Correct 17 ms 20948 KB Output is correct
101 Correct 55 ms 27868 KB Output is correct
102 Correct 105 ms 36488 KB Output is correct
103 Correct 260 ms 51636 KB Output is correct
104 Correct 385 ms 62156 KB Output is correct
105 Correct 519 ms 71196 KB Output is correct
106 Correct 629 ms 81608 KB Output is correct
107 Correct 770 ms 94524 KB Output is correct
108 Correct 18 ms 23492 KB Output is correct
109 Correct 18 ms 23564 KB Output is correct
110 Correct 17 ms 23464 KB Output is correct
111 Correct 10 ms 19012 KB Output is correct
112 Correct 11 ms 19088 KB Output is correct
113 Correct 17 ms 23484 KB Output is correct
114 Correct 19 ms 23492 KB Output is correct
115 Correct 18 ms 23492 KB Output is correct
116 Correct 18 ms 23492 KB Output is correct
117 Correct 11 ms 19028 KB Output is correct
118 Correct 17 ms 23492 KB Output is correct
119 Correct 11 ms 19412 KB Output is correct
120 Correct 12 ms 19464 KB Output is correct
121 Correct 261 ms 56156 KB Output is correct
122 Correct 451 ms 70476 KB Output is correct
123 Correct 450 ms 70768 KB Output is correct
124 Correct 10 ms 19028 KB Output is correct
125 Correct 17 ms 23576 KB Output is correct
126 Correct 10 ms 19028 KB Output is correct
127 Correct 645 ms 85908 KB Output is correct
128 Correct 648 ms 86076 KB Output is correct
129 Correct 610 ms 85744 KB Output is correct
130 Correct 12 ms 19540 KB Output is correct
131 Correct 15 ms 19924 KB Output is correct
132 Correct 281 ms 56360 KB Output is correct
133 Correct 500 ms 71896 KB Output is correct
134 Correct 751 ms 88672 KB Output is correct
135 Correct 838 ms 486476 KB Output is correct
136 Correct 946 ms 438864 KB Output is correct
137 Correct 1087 ms 433664 KB Output is correct
138 Correct 893 ms 90672 KB Output is correct
139 Correct 535 ms 82044 KB Output is correct
140 Correct 17 ms 23492 KB Output is correct
141 Correct 83 ms 36788 KB Output is correct
142 Correct 29 ms 22228 KB Output is correct
143 Correct 78 ms 29972 KB Output is correct
144 Correct 131 ms 38480 KB Output is correct
145 Correct 319 ms 59032 KB Output is correct
146 Correct 434 ms 66724 KB Output is correct
147 Correct 598 ms 74876 KB Output is correct
148 Correct 672 ms 85868 KB Output is correct
149 Correct 778 ms 93268 KB Output is correct
150 Correct 730 ms 87540 KB Output is correct
151 Correct 619 ms 85876 KB Output is correct
152 Correct 13 ms 19540 KB Output is correct
153 Correct 17 ms 20052 KB Output is correct
154 Correct 273 ms 56248 KB Output is correct
155 Correct 495 ms 72552 KB Output is correct
156 Correct 732 ms 88516 KB Output is correct
157 Correct 17 ms 23564 KB Output is correct
158 Correct 11 ms 19028 KB Output is correct
159 Correct 17 ms 23568 KB Output is correct
160 Correct 19 ms 23496 KB Output is correct
161 Correct 1149 ms 130004 KB Output is correct
162 Correct 861 ms 499120 KB Output is correct
163 Correct 941 ms 366416 KB Output is correct
164 Correct 921 ms 365524 KB Output is correct
165 Correct 1178 ms 202624 KB Output is correct
166 Correct 1139 ms 143756 KB Output is correct
167 Correct 181 ms 44364 KB Output is correct
168 Correct 61 ms 29148 KB Output is correct
169 Correct 198 ms 44044 KB Output is correct
170 Correct 426 ms 65404 KB Output is correct
171 Correct 611 ms 90292 KB Output is correct
172 Correct 504 ms 73684 KB Output is correct
173 Correct 645 ms 82480 KB Output is correct
174 Correct 780 ms 91760 KB Output is correct
175 Correct 920 ms 100576 KB Output is correct
176 Correct 1044 ms 115464 KB Output is correct
177 Correct 1214 ms 123908 KB Output is correct