oj.uz

Submission #566578

# Submission time Handle Problem Language Result Execution time Memory
566578 2022-05-22T12:32:36 Z kartel Fountain Parks (IOI21_parks) C++17
100 / 100
 1511 ms 500728 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 (have[cx / 2][cy / 2] && 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 18 ms 23516 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 18 ms 23492 KB Output is correct
5 Correct 18 ms 23564 KB Output is correct
6 Correct 10 ms 19104 KB Output is correct
7 Correct 10 ms 19092 KB Output is correct
8 Correct 10 ms 19024 KB Output is correct
9 Correct 226 ms 54572 KB Output is correct
10 Correct 28 ms 26404 KB Output is correct
11 Correct 78 ms 39880 KB Output is correct
12 Correct 34 ms 27912 KB Output is correct
13 Correct 33 ms 24312 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 14 ms 19324 KB Output is correct
16 Correct 323 ms 54500 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 18 ms 23516 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 18 ms 23492 KB Output is correct
5 Correct 18 ms 23564 KB Output is correct
6 Correct 10 ms 19104 KB Output is correct
7 Correct 10 ms 19092 KB Output is correct
8 Correct 10 ms 19024 KB Output is correct
9 Correct 226 ms 54572 KB Output is correct
10 Correct 28 ms 26404 KB Output is correct
11 Correct 78 ms 39880 KB Output is correct
12 Correct 34 ms 27912 KB Output is correct
13 Correct 33 ms 24312 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 14 ms 19324 KB Output is correct
16 Correct 323 ms 54500 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 21 ms 23472 KB Output is correct
19 Correct 17 ms 23564 KB Output is correct
20 Correct 17 ms 23492 KB Output is correct
21 Correct 11 ms 19028 KB Output is correct
22 Correct 21 ms 23492 KB Output is correct
23 Correct 933 ms 97620 KB Output is correct
24 Correct 19 ms 23492 KB Output is correct
25 Correct 20 ms 23900 KB Output is correct
26 Correct 13 ms 19640 KB Output is correct
27 Correct 14 ms 19760 KB Output is correct
28 Correct 271 ms 52944 KB Output is correct
29 Correct 431 ms 67032 KB Output is correct
30 Correct 679 ms 82256 KB Output is correct
31 Correct 1006 ms 97636 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 18 ms 23468 KB Output is correct
34 Correct 21 ms 23560 KB Output is correct
35 Correct 11 ms 19028 KB Output is correct
36 Correct 11 ms 19028 KB Output is correct
37 Correct 20 ms 23508 KB Output is correct
38 Correct 20 ms 23504 KB Output is correct
39 Correct 17 ms 23492 KB Output is correct
40 Correct 18 ms 23540 KB Output is correct
41 Correct 10 ms 19072 KB Output is correct
42 Correct 17 ms 23548 KB Output is correct
43 Correct 11 ms 19284 KB Output is correct
44 Correct 12 ms 19440 KB Output is correct
45 Correct 322 ms 56108 KB Output is correct
46 Correct 488 ms 70464 KB Output is correct
47 Correct 507 ms 70748 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 18 ms 23516 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 18 ms 23492 KB Output is correct
5 Correct 18 ms 23564 KB Output is correct
6 Correct 10 ms 19104 KB Output is correct
7 Correct 10 ms 19092 KB Output is correct
8 Correct 10 ms 19024 KB Output is correct
9 Correct 226 ms 54572 KB Output is correct
10 Correct 28 ms 26404 KB Output is correct
11 Correct 78 ms 39880 KB Output is correct
12 Correct 34 ms 27912 KB Output is correct
13 Correct 33 ms 24312 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 14 ms 19324 KB Output is correct
16 Correct 323 ms 54500 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 21 ms 23472 KB Output is correct
19 Correct 17 ms 23564 KB Output is correct
20 Correct 17 ms 23492 KB Output is correct
21 Correct 11 ms 19028 KB Output is correct
22 Correct 21 ms 23492 KB Output is correct
23 Correct 933 ms 97620 KB Output is correct
24 Correct 19 ms 23492 KB Output is correct
25 Correct 20 ms 23900 KB Output is correct
26 Correct 13 ms 19640 KB Output is correct
27 Correct 14 ms 19760 KB Output is correct
28 Correct 271 ms 52944 KB Output is correct
29 Correct 431 ms 67032 KB Output is correct
30 Correct 679 ms 82256 KB Output is correct
31 Correct 1006 ms 97636 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 18 ms 23468 KB Output is correct
34 Correct 21 ms 23560 KB Output is correct
35 Correct 11 ms 19028 KB Output is correct
36 Correct 11 ms 19028 KB Output is correct
37 Correct 20 ms 23508 KB Output is correct
38 Correct 20 ms 23504 KB Output is correct
39 Correct 17 ms 23492 KB Output is correct
40 Correct 18 ms 23540 KB Output is correct
41 Correct 10 ms 19072 KB Output is correct
42 Correct 17 ms 23548 KB Output is correct
43 Correct 11 ms 19284 KB Output is correct
44 Correct 12 ms 19440 KB Output is correct
45 Correct 322 ms 56108 KB Output is correct
46 Correct 488 ms 70464 KB Output is correct
47 Correct 507 ms 70748 KB Output is correct
48 Correct 19 ms 23492 KB Output is correct
49 Correct 18 ms 23564 KB Output is correct
50 Correct 18 ms 23492 KB Output is correct
51 Correct 19 ms 23540 KB Output is correct
52 Correct 18 ms 23572 KB Output is correct
53 Correct 18 ms 23492 KB Output is correct
54 Correct 19 ms 23572 KB Output is correct
55 Correct 1098 ms 114604 KB Output is correct
56 Correct 18 ms 23492 KB Output is correct
57 Correct 21 ms 24236 KB Output is correct
58 Correct 33 ms 26264 KB Output is correct
59 Correct 22 ms 21360 KB Output is correct
60 Correct 450 ms 68684 KB Output is correct
61 Correct 710 ms 86928 KB Output is correct
62 Correct 856 ms 98660 KB Output is correct
63 Correct 1084 ms 113604 KB Output is correct
64 Correct 9 ms 19020 KB Output is correct
65 Correct 18 ms 23572 KB Output is correct
66 Correct 9 ms 19028 KB Output is correct
67 Correct 643 ms 85916 KB Output is correct
68 Correct 634 ms 85992 KB Output is correct
69 Correct 664 ms 85676 KB Output is correct
70 Correct 13 ms 19540 KB Output is correct
71 Correct 15 ms 19992 KB Output is correct
72 Correct 316 ms 56276 KB Output is correct
73 Correct 504 ms 71924 KB Output is correct
74 Correct 769 ms 88656 KB Output is correct
75 Correct 798 ms 87612 KB Output is correct
76 Correct 624 ms 85996 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 17 ms 20052 KB Output is correct
79 Correct 272 ms 56288 KB Output is correct
80 Correct 605 ms 72568 KB Output is correct
81 Correct 798 ms 88404 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 18 ms 23516 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 18 ms 23492 KB Output is correct
5 Correct 18 ms 23564 KB Output is correct
6 Correct 10 ms 19104 KB Output is correct
7 Correct 10 ms 19092 KB Output is correct
8 Correct 10 ms 19024 KB Output is correct
9 Correct 226 ms 54572 KB Output is correct
10 Correct 28 ms 26404 KB Output is correct
11 Correct 78 ms 39880 KB Output is correct
12 Correct 34 ms 27912 KB Output is correct
13 Correct 33 ms 24312 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 14 ms 19324 KB Output is correct
16 Correct 323 ms 54500 KB Output is correct
17 Correct 20 ms 23492 KB Output is correct
18 Correct 23 ms 23476 KB Output is correct
19 Correct 11 ms 19096 KB Output is correct
20 Correct 1024 ms 500728 KB Output is correct
21 Correct 931 ms 295376 KB Output is correct
22 Correct 1071 ms 295516 KB Output is correct
23 Correct 640 ms 371660 KB Output is correct
24 Correct 163 ms 43184 KB Output is correct
25 Correct 311 ms 43124 KB Output is correct
26 Correct 230 ms 43128 KB Output is correct
27 Correct 652 ms 89272 KB Output is correct
28 Correct 571 ms 89276 KB Output is correct
29 Correct 601 ms 87980 KB Output is correct
30 Correct 555 ms 88060 KB Output is correct
31 Correct 22 ms 23492 KB Output is correct
32 Correct 52 ms 29444 KB Output is correct
33 Correct 266 ms 432620 KB Output is correct
34 Correct 1000 ms 499728 KB Output is correct
35 Correct 17 ms 20948 KB Output is correct
36 Correct 57 ms 27836 KB Output is correct
37 Correct 130 ms 36516 KB Output is correct
38 Correct 258 ms 51600 KB Output is correct
39 Correct 473 ms 62108 KB Output is correct
40 Correct 633 ms 71152 KB Output is correct
41 Correct 716 ms 81544 KB Output is correct
42 Correct 834 ms 94672 KB Output is correct
43 Correct 23 ms 23484 KB Output is correct
44 Correct 18 ms 23492 KB Output is correct
45 Correct 19 ms 23492 KB Output is correct
46 Correct 13 ms 19008 KB Output is correct
47 Correct 12 ms 19028 KB Output is correct
48 Correct 18 ms 23544 KB Output is correct
49 Correct 18 ms 23492 KB Output is correct
50 Correct 17 ms 23636 KB Output is correct
51 Correct 17 ms 23492 KB Output is correct
52 Correct 11 ms 19048 KB Output is correct
53 Correct 18 ms 23564 KB Output is correct
54 Correct 11 ms 19332 KB Output is correct
55 Correct 12 ms 19412 KB Output is correct
56 Correct 302 ms 56060 KB Output is correct
57 Correct 507 ms 70480 KB Output is correct
58 Correct 496 ms 70728 KB Output is correct
59 Correct 10 ms 19028 KB Output is correct
60 Correct 20 ms 23480 KB Output is correct
61 Correct 10 ms 19028 KB Output is correct
62 Correct 687 ms 85932 KB Output is correct
63 Correct 674 ms 85928 KB Output is correct
64 Correct 655 ms 85748 KB Output is correct
65 Correct 12 ms 19540 KB Output is correct
66 Correct 20 ms 19956 KB Output is correct
67 Correct 344 ms 56292 KB Output is correct
68 Correct 585 ms 71840 KB Output is correct
69 Correct 737 ms 88680 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 18 ms 23516 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 18 ms 23492 KB Output is correct
5 Correct 18 ms 23564 KB Output is correct
6 Correct 10 ms 19104 KB Output is correct
7 Correct 10 ms 19092 KB Output is correct
8 Correct 10 ms 19024 KB Output is correct
9 Correct 226 ms 54572 KB Output is correct
10 Correct 28 ms 26404 KB Output is correct
11 Correct 78 ms 39880 KB Output is correct
12 Correct 34 ms 27912 KB Output is correct
13 Correct 33 ms 24312 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 14 ms 19324 KB Output is correct
16 Correct 323 ms 54500 KB Output is correct
17 Correct 832 ms 486332 KB Output is correct
18 Correct 881 ms 438904 KB Output is correct
19 Correct 1067 ms 433684 KB Output is correct
20 Correct 875 ms 90748 KB Output is correct
21 Correct 643 ms 81996 KB Output is correct
22 Correct 18 ms 23552 KB Output is correct
23 Correct 101 ms 36756 KB Output is correct
24 Correct 27 ms 22252 KB Output is correct
25 Correct 79 ms 29924 KB Output is correct
26 Correct 169 ms 38476 KB Output is correct
27 Correct 364 ms 59068 KB Output is correct
28 Correct 516 ms 66764 KB Output is correct
29 Correct 569 ms 74784 KB Output is correct
30 Correct 725 ms 85692 KB Output is correct
31 Correct 888 ms 93220 KB Output is correct
32 Correct 755 ms 87540 KB Output is correct
33 Correct 642 ms 86056 KB Output is correct
34 Correct 14 ms 19540 KB Output is correct
35 Correct 16 ms 20016 KB Output is correct
36 Correct 312 ms 56308 KB Output is correct
37 Correct 583 ms 72604 KB Output is correct
38 Correct 947 ms 88384 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 18 ms 23516 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 18 ms 23492 KB Output is correct
5 Correct 18 ms 23564 KB Output is correct
6 Correct 10 ms 19104 KB Output is correct
7 Correct 10 ms 19092 KB Output is correct
8 Correct 10 ms 19024 KB Output is correct
9 Correct 226 ms 54572 KB Output is correct
10 Correct 28 ms 26404 KB Output is correct
11 Correct 78 ms 39880 KB Output is correct
12 Correct 34 ms 27912 KB Output is correct
13 Correct 33 ms 24312 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 14 ms 19324 KB Output is correct
16 Correct 323 ms 54500 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 21 ms 23472 KB Output is correct
19 Correct 17 ms 23564 KB Output is correct
20 Correct 17 ms 23492 KB Output is correct
21 Correct 11 ms 19028 KB Output is correct
22 Correct 21 ms 23492 KB Output is correct
23 Correct 933 ms 97620 KB Output is correct
24 Correct 19 ms 23492 KB Output is correct
25 Correct 20 ms 23900 KB Output is correct
26 Correct 13 ms 19640 KB Output is correct
27 Correct 14 ms 19760 KB Output is correct
28 Correct 271 ms 52944 KB Output is correct
29 Correct 431 ms 67032 KB Output is correct
30 Correct 679 ms 82256 KB Output is correct
31 Correct 1006 ms 97636 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 18 ms 23468 KB Output is correct
34 Correct 21 ms 23560 KB Output is correct
35 Correct 11 ms 19028 KB Output is correct
36 Correct 11 ms 19028 KB Output is correct
37 Correct 20 ms 23508 KB Output is correct
38 Correct 20 ms 23504 KB Output is correct
39 Correct 17 ms 23492 KB Output is correct
40 Correct 18 ms 23540 KB Output is correct
41 Correct 10 ms 19072 KB Output is correct
42 Correct 17 ms 23548 KB Output is correct
43 Correct 11 ms 19284 KB Output is correct
44 Correct 12 ms 19440 KB Output is correct
45 Correct 322 ms 56108 KB Output is correct
46 Correct 488 ms 70464 KB Output is correct
47 Correct 507 ms 70748 KB Output is correct
48 Correct 19 ms 23492 KB Output is correct
49 Correct 18 ms 23564 KB Output is correct
50 Correct 18 ms 23492 KB Output is correct
51 Correct 19 ms 23540 KB Output is correct
52 Correct 18 ms 23572 KB Output is correct
53 Correct 18 ms 23492 KB Output is correct
54 Correct 19 ms 23572 KB Output is correct
55 Correct 1098 ms 114604 KB Output is correct
56 Correct 18 ms 23492 KB Output is correct
57 Correct 21 ms 24236 KB Output is correct
58 Correct 33 ms 26264 KB Output is correct
59 Correct 22 ms 21360 KB Output is correct
60 Correct 450 ms 68684 KB Output is correct
61 Correct 710 ms 86928 KB Output is correct
62 Correct 856 ms 98660 KB Output is correct
63 Correct 1084 ms 113604 KB Output is correct
64 Correct 9 ms 19020 KB Output is correct
65 Correct 18 ms 23572 KB Output is correct
66 Correct 9 ms 19028 KB Output is correct
67 Correct 643 ms 85916 KB Output is correct
68 Correct 634 ms 85992 KB Output is correct
69 Correct 664 ms 85676 KB Output is correct
70 Correct 13 ms 19540 KB Output is correct
71 Correct 15 ms 19992 KB Output is correct
72 Correct 316 ms 56276 KB Output is correct
73 Correct 504 ms 71924 KB Output is correct
74 Correct 769 ms 88656 KB Output is correct
75 Correct 798 ms 87612 KB Output is correct
76 Correct 624 ms 85996 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 17 ms 20052 KB Output is correct
79 Correct 272 ms 56288 KB Output is correct
80 Correct 605 ms 72568 KB Output is correct
81 Correct 798 ms 88404 KB Output is correct
82 Correct 20 ms 23492 KB Output is correct
83 Correct 23 ms 23476 KB Output is correct
84 Correct 11 ms 19096 KB Output is correct
85 Correct 1024 ms 500728 KB Output is correct
86 Correct 931 ms 295376 KB Output is correct
87 Correct 1071 ms 295516 KB Output is correct
88 Correct 640 ms 371660 KB Output is correct
89 Correct 163 ms 43184 KB Output is correct
90 Correct 311 ms 43124 KB Output is correct
91 Correct 230 ms 43128 KB Output is correct
92 Correct 652 ms 89272 KB Output is correct
93 Correct 571 ms 89276 KB Output is correct
94 Correct 601 ms 87980 KB Output is correct
95 Correct 555 ms 88060 KB Output is correct
96 Correct 22 ms 23492 KB Output is correct
97 Correct 52 ms 29444 KB Output is correct
98 Correct 266 ms 432620 KB Output is correct
99 Correct 1000 ms 499728 KB Output is correct
100 Correct 17 ms 20948 KB Output is correct
101 Correct 57 ms 27836 KB Output is correct
102 Correct 130 ms 36516 KB Output is correct
103 Correct 258 ms 51600 KB Output is correct
104 Correct 473 ms 62108 KB Output is correct
105 Correct 633 ms 71152 KB Output is correct
106 Correct 716 ms 81544 KB Output is correct
107 Correct 834 ms 94672 KB Output is correct
108 Correct 23 ms 23484 KB Output is correct
109 Correct 18 ms 23492 KB Output is correct
110 Correct 19 ms 23492 KB Output is correct
111 Correct 13 ms 19008 KB Output is correct
112 Correct 12 ms 19028 KB Output is correct
113 Correct 18 ms 23544 KB Output is correct
114 Correct 18 ms 23492 KB Output is correct
115 Correct 17 ms 23636 KB Output is correct
116 Correct 17 ms 23492 KB Output is correct
117 Correct 11 ms 19048 KB Output is correct
118 Correct 18 ms 23564 KB Output is correct
119 Correct 11 ms 19332 KB Output is correct
120 Correct 12 ms 19412 KB Output is correct
121 Correct 302 ms 56060 KB Output is correct
122 Correct 507 ms 70480 KB Output is correct
123 Correct 496 ms 70728 KB Output is correct
124 Correct 10 ms 19028 KB Output is correct
125 Correct 20 ms 23480 KB Output is correct
126 Correct 10 ms 19028 KB Output is correct
127 Correct 687 ms 85932 KB Output is correct
128 Correct 674 ms 85928 KB Output is correct
129 Correct 655 ms 85748 KB Output is correct
130 Correct 12 ms 19540 KB Output is correct
131 Correct 20 ms 19956 KB Output is correct
132 Correct 344 ms 56292 KB Output is correct
133 Correct 585 ms 71840 KB Output is correct
134 Correct 737 ms 88680 KB Output is correct
135 Correct 832 ms 486332 KB Output is correct
136 Correct 881 ms 438904 KB Output is correct
137 Correct 1067 ms 433684 KB Output is correct
138 Correct 875 ms 90748 KB Output is correct
139 Correct 643 ms 81996 KB Output is correct
140 Correct 18 ms 23552 KB Output is correct
141 Correct 101 ms 36756 KB Output is correct
142 Correct 27 ms 22252 KB Output is correct
143 Correct 79 ms 29924 KB Output is correct
144 Correct 169 ms 38476 KB Output is correct
145 Correct 364 ms 59068 KB Output is correct
146 Correct 516 ms 66764 KB Output is correct
147 Correct 569 ms 74784 KB Output is correct
148 Correct 725 ms 85692 KB Output is correct
149 Correct 888 ms 93220 KB Output is correct
150 Correct 755 ms 87540 KB Output is correct
151 Correct 642 ms 86056 KB Output is correct
152 Correct 14 ms 19540 KB Output is correct
153 Correct 16 ms 20016 KB Output is correct
154 Correct 312 ms 56308 KB Output is correct
155 Correct 583 ms 72604 KB Output is correct
156 Correct 947 ms 88384 KB Output is correct
157 Correct 26 ms 23472 KB Output is correct
158 Correct 11 ms 19028 KB Output is correct
159 Correct 17 ms 23492 KB Output is correct
160 Correct 22 ms 23492 KB Output is correct
161 Correct 1483 ms 129896 KB Output is correct
162 Correct 1072 ms 498872 KB Output is correct
163 Correct 1188 ms 366356 KB Output is correct
164 Correct 1189 ms 365368 KB Output is correct
165 Correct 1511 ms 202532 KB Output is correct
166 Correct 1355 ms 143612 KB Output is correct
167 Correct 238 ms 44292 KB Output is correct
168 Correct 79 ms 29200 KB Output is correct
169 Correct 296 ms 43868 KB Output is correct
170 Correct 578 ms 65380 KB Output is correct
171 Correct 795 ms 90160 KB Output is correct
172 Correct 686 ms 73604 KB Output is correct
173 Correct 787 ms 82456 KB Output is correct
174 Correct 1051 ms 91932 KB Output is correct
175 Correct 1212 ms 100460 KB Output is correct
176 Correct 1335 ms 115412 KB Output is correct
177 Correct 1511 ms 123932 KB Output is correct