oj.uz

Submission #566588

# Submission time Handle Problem Language Result Execution time Memory
566588 2022-05-22T12:41:21 Z kartel Fountain Parks (IOI21_parks) C++17
100 / 100
 1385 ms 500740 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;

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];
        }
        q.push(i); mk[i] = 1;
        while (sz(q)) {
            int v = q.front(); q.pop();

            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];
                q.push(u);
                mk[u] = 1;
            }
        }
    }

    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 19 ms 23492 KB Output is correct
2 Correct 19 ms 23504 KB Output is correct
3 Correct 11 ms 19028 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 17 ms 23568 KB Output is correct
6 Correct 11 ms 19004 KB Output is correct
7 Correct 14 ms 19028 KB Output is correct
8 Correct 13 ms 19044 KB Output is correct
9 Correct 282 ms 54600 KB Output is correct
10 Correct 28 ms 26348 KB Output is correct
11 Correct 76 ms 39828 KB Output is correct
12 Correct 33 ms 27828 KB Output is correct
13 Correct 34 ms 24340 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 15 ms 19316 KB Output is correct
16 Correct 231 ms 54604 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23492 KB Output is correct
2 Correct 19 ms 23504 KB Output is correct
3 Correct 11 ms 19028 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 17 ms 23568 KB Output is correct
6 Correct 11 ms 19004 KB Output is correct
7 Correct 14 ms 19028 KB Output is correct
8 Correct 13 ms 19044 KB Output is correct
9 Correct 282 ms 54600 KB Output is correct
10 Correct 28 ms 26348 KB Output is correct
11 Correct 76 ms 39828 KB Output is correct
12 Correct 33 ms 27828 KB Output is correct
13 Correct 34 ms 24340 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 15 ms 19316 KB Output is correct
16 Correct 231 ms 54604 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 18 ms 23492 KB Output is correct
19 Correct 18 ms 23568 KB Output is correct
20 Correct 18 ms 23568 KB Output is correct
21 Correct 10 ms 19132 KB Output is correct
22 Correct 18 ms 23540 KB Output is correct
23 Correct 947 ms 97668 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 21 ms 24004 KB Output is correct
26 Correct 13 ms 19616 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 249 ms 53044 KB Output is correct
29 Correct 555 ms 66968 KB Output is correct
30 Correct 776 ms 82232 KB Output is correct
31 Correct 1006 ms 97768 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 20 ms 23560 KB Output is correct
34 Correct 19 ms 23492 KB Output is correct
35 Correct 12 ms 19020 KB Output is correct
36 Correct 11 ms 19084 KB Output is correct
37 Correct 19 ms 23472 KB Output is correct
38 Correct 19 ms 23464 KB Output is correct
39 Correct 19 ms 23512 KB Output is correct
40 Correct 17 ms 23492 KB Output is correct
41 Correct 13 ms 19028 KB Output is correct
42 Correct 19 ms 23568 KB Output is correct
43 Correct 12 ms 19272 KB Output is correct
44 Correct 12 ms 19420 KB Output is correct
45 Correct 308 ms 56068 KB Output is correct
46 Correct 551 ms 70568 KB Output is correct
47 Correct 519 ms 70844 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23492 KB Output is correct
2 Correct 19 ms 23504 KB Output is correct
3 Correct 11 ms 19028 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 17 ms 23568 KB Output is correct
6 Correct 11 ms 19004 KB Output is correct
7 Correct 14 ms 19028 KB Output is correct
8 Correct 13 ms 19044 KB Output is correct
9 Correct 282 ms 54600 KB Output is correct
10 Correct 28 ms 26348 KB Output is correct
11 Correct 76 ms 39828 KB Output is correct
12 Correct 33 ms 27828 KB Output is correct
13 Correct 34 ms 24340 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 15 ms 19316 KB Output is correct
16 Correct 231 ms 54604 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 18 ms 23492 KB Output is correct
19 Correct 18 ms 23568 KB Output is correct
20 Correct 18 ms 23568 KB Output is correct
21 Correct 10 ms 19132 KB Output is correct
22 Correct 18 ms 23540 KB Output is correct
23 Correct 947 ms 97668 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 21 ms 24004 KB Output is correct
26 Correct 13 ms 19616 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 249 ms 53044 KB Output is correct
29 Correct 555 ms 66968 KB Output is correct
30 Correct 776 ms 82232 KB Output is correct
31 Correct 1006 ms 97768 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 20 ms 23560 KB Output is correct
34 Correct 19 ms 23492 KB Output is correct
35 Correct 12 ms 19020 KB Output is correct
36 Correct 11 ms 19084 KB Output is correct
37 Correct 19 ms 23472 KB Output is correct
38 Correct 19 ms 23464 KB Output is correct
39 Correct 19 ms 23512 KB Output is correct
40 Correct 17 ms 23492 KB Output is correct
41 Correct 13 ms 19028 KB Output is correct
42 Correct 19 ms 23568 KB Output is correct
43 Correct 12 ms 19272 KB Output is correct
44 Correct 12 ms 19420 KB Output is correct
45 Correct 308 ms 56068 KB Output is correct
46 Correct 551 ms 70568 KB Output is correct
47 Correct 519 ms 70844 KB Output is correct
48 Correct 18 ms 23568 KB Output is correct
49 Correct 19 ms 23556 KB Output is correct
50 Correct 18 ms 23580 KB Output is correct
51 Correct 18 ms 23492 KB Output is correct
52 Correct 20 ms 23576 KB Output is correct
53 Correct 21 ms 23492 KB Output is correct
54 Correct 23 ms 23504 KB Output is correct
55 Correct 1100 ms 104008 KB Output is correct
56 Correct 18 ms 23492 KB Output is correct
57 Correct 23 ms 24236 KB Output is correct
58 Correct 32 ms 25960 KB Output is correct
59 Correct 24 ms 21332 KB Output is correct
60 Correct 392 ms 63468 KB Output is correct
61 Correct 660 ms 79968 KB Output is correct
62 Correct 1041 ms 89972 KB Output is correct
63 Correct 1385 ms 103228 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 21 ms 23568 KB Output is correct
66 Correct 11 ms 19028 KB Output is correct
67 Correct 770 ms 85912 KB Output is correct
68 Correct 807 ms 86008 KB Output is correct
69 Correct 772 ms 85692 KB Output is correct
70 Correct 17 ms 19540 KB Output is correct
71 Correct 18 ms 19960 KB Output is correct
72 Correct 329 ms 56252 KB Output is correct
73 Correct 652 ms 71876 KB Output is correct
74 Correct 889 ms 88764 KB Output is correct
75 Correct 905 ms 87560 KB Output is correct
76 Correct 769 ms 85952 KB Output is correct
77 Correct 14 ms 19540 KB Output is correct
78 Correct 18 ms 20060 KB Output is correct
79 Correct 323 ms 56176 KB Output is correct
80 Correct 596 ms 72636 KB Output is correct
81 Correct 788 ms 88512 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23492 KB Output is correct
2 Correct 19 ms 23504 KB Output is correct
3 Correct 11 ms 19028 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 17 ms 23568 KB Output is correct
6 Correct 11 ms 19004 KB Output is correct
7 Correct 14 ms 19028 KB Output is correct
8 Correct 13 ms 19044 KB Output is correct
9 Correct 282 ms 54600 KB Output is correct
10 Correct 28 ms 26348 KB Output is correct
11 Correct 76 ms 39828 KB Output is correct
12 Correct 33 ms 27828 KB Output is correct
13 Correct 34 ms 24340 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 15 ms 19316 KB Output is correct
16 Correct 231 ms 54604 KB Output is correct
17 Correct 18 ms 23492 KB Output is correct
18 Correct 19 ms 23492 KB Output is correct
19 Correct 12 ms 19032 KB Output is correct
20 Correct 1119 ms 500740 KB Output is correct
21 Correct 1002 ms 295340 KB Output is correct
22 Correct 1063 ms 295448 KB Output is correct
23 Correct 675 ms 371660 KB Output is correct
24 Correct 205 ms 43140 KB Output is correct
25 Correct 264 ms 43176 KB Output is correct
26 Correct 291 ms 43200 KB Output is correct
27 Correct 552 ms 89240 KB Output is correct
28 Correct 553 ms 89148 KB Output is correct
29 Correct 540 ms 88160 KB Output is correct
30 Correct 574 ms 88144 KB Output is correct
31 Correct 17 ms 23528 KB Output is correct
32 Correct 53 ms 29388 KB Output is correct
33 Correct 296 ms 432516 KB Output is correct
34 Correct 979 ms 499756 KB Output is correct
35 Correct 18 ms 20936 KB Output is correct
36 Correct 54 ms 27840 KB Output is correct
37 Correct 107 ms 36396 KB Output is correct
38 Correct 275 ms 51600 KB Output is correct
39 Correct 436 ms 62220 KB Output is correct
40 Correct 544 ms 71212 KB Output is correct
41 Correct 736 ms 81696 KB Output is correct
42 Correct 920 ms 94508 KB Output is correct
43 Correct 22 ms 23492 KB Output is correct
44 Correct 19 ms 23464 KB Output is correct
45 Correct 20 ms 23516 KB Output is correct
46 Correct 10 ms 19132 KB Output is correct
47 Correct 12 ms 19028 KB Output is correct
48 Correct 18 ms 23568 KB Output is correct
49 Correct 18 ms 23548 KB Output is correct
50 Correct 18 ms 23492 KB Output is correct
51 Correct 20 ms 23492 KB Output is correct
52 Correct 12 ms 19028 KB Output is correct
53 Correct 18 ms 23528 KB Output is correct
54 Correct 11 ms 19284 KB Output is correct
55 Correct 13 ms 19412 KB Output is correct
56 Correct 271 ms 56272 KB Output is correct
57 Correct 542 ms 70472 KB Output is correct
58 Correct 597 ms 70724 KB Output is correct
59 Correct 10 ms 19028 KB Output is correct
60 Correct 18 ms 23492 KB Output is correct
61 Correct 11 ms 19040 KB Output is correct
62 Correct 719 ms 85944 KB Output is correct
63 Correct 605 ms 85928 KB Output is correct
64 Correct 691 ms 85716 KB Output is correct
65 Correct 14 ms 19556 KB Output is correct
66 Correct 17 ms 19840 KB Output is correct
67 Correct 385 ms 56460 KB Output is correct
68 Correct 614 ms 71816 KB Output is correct
69 Correct 859 ms 88672 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23492 KB Output is correct
2 Correct 19 ms 23504 KB Output is correct
3 Correct 11 ms 19028 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 17 ms 23568 KB Output is correct
6 Correct 11 ms 19004 KB Output is correct
7 Correct 14 ms 19028 KB Output is correct
8 Correct 13 ms 19044 KB Output is correct
9 Correct 282 ms 54600 KB Output is correct
10 Correct 28 ms 26348 KB Output is correct
11 Correct 76 ms 39828 KB Output is correct
12 Correct 33 ms 27828 KB Output is correct
13 Correct 34 ms 24340 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 15 ms 19316 KB Output is correct
16 Correct 231 ms 54604 KB Output is correct
17 Correct 851 ms 486296 KB Output is correct
18 Correct 889 ms 438956 KB Output is correct
19 Correct 1143 ms 433648 KB Output is correct
20 Correct 880 ms 90764 KB Output is correct
21 Correct 682 ms 81984 KB Output is correct
22 Correct 23 ms 23492 KB Output is correct
23 Correct 103 ms 36772 KB Output is correct
24 Correct 28 ms 22204 KB Output is correct
25 Correct 78 ms 29904 KB Output is correct
26 Correct 131 ms 38424 KB Output is correct
27 Correct 353 ms 59060 KB Output is correct
28 Correct 439 ms 66716 KB Output is correct
29 Correct 556 ms 74756 KB Output is correct
30 Correct 745 ms 85736 KB Output is correct
31 Correct 875 ms 93268 KB Output is correct
32 Correct 757 ms 87596 KB Output is correct
33 Correct 683 ms 86120 KB Output is correct
34 Correct 15 ms 19540 KB Output is correct
35 Correct 17 ms 19952 KB Output is correct
36 Correct 333 ms 56232 KB Output is correct
37 Correct 551 ms 72600 KB Output is correct
38 Correct 868 ms 88436 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23492 KB Output is correct
2 Correct 19 ms 23504 KB Output is correct
3 Correct 11 ms 19028 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 17 ms 23568 KB Output is correct
6 Correct 11 ms 19004 KB Output is correct
7 Correct 14 ms 19028 KB Output is correct
8 Correct 13 ms 19044 KB Output is correct
9 Correct 282 ms 54600 KB Output is correct
10 Correct 28 ms 26348 KB Output is correct
11 Correct 76 ms 39828 KB Output is correct
12 Correct 33 ms 27828 KB Output is correct
13 Correct 34 ms 24340 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 15 ms 19316 KB Output is correct
16 Correct 231 ms 54604 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 18 ms 23492 KB Output is correct
19 Correct 18 ms 23568 KB Output is correct
20 Correct 18 ms 23568 KB Output is correct
21 Correct 10 ms 19132 KB Output is correct
22 Correct 18 ms 23540 KB Output is correct
23 Correct 947 ms 97668 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 21 ms 24004 KB Output is correct
26 Correct 13 ms 19616 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 249 ms 53044 KB Output is correct
29 Correct 555 ms 66968 KB Output is correct
30 Correct 776 ms 82232 KB Output is correct
31 Correct 1006 ms 97768 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 20 ms 23560 KB Output is correct
34 Correct 19 ms 23492 KB Output is correct
35 Correct 12 ms 19020 KB Output is correct
36 Correct 11 ms 19084 KB Output is correct
37 Correct 19 ms 23472 KB Output is correct
38 Correct 19 ms 23464 KB Output is correct
39 Correct 19 ms 23512 KB Output is correct
40 Correct 17 ms 23492 KB Output is correct
41 Correct 13 ms 19028 KB Output is correct
42 Correct 19 ms 23568 KB Output is correct
43 Correct 12 ms 19272 KB Output is correct
44 Correct 12 ms 19420 KB Output is correct
45 Correct 308 ms 56068 KB Output is correct
46 Correct 551 ms 70568 KB Output is correct
47 Correct 519 ms 70844 KB Output is correct
48 Correct 18 ms 23568 KB Output is correct
49 Correct 19 ms 23556 KB Output is correct
50 Correct 18 ms 23580 KB Output is correct
51 Correct 18 ms 23492 KB Output is correct
52 Correct 20 ms 23576 KB Output is correct
53 Correct 21 ms 23492 KB Output is correct
54 Correct 23 ms 23504 KB Output is correct
55 Correct 1100 ms 104008 KB Output is correct
56 Correct 18 ms 23492 KB Output is correct
57 Correct 23 ms 24236 KB Output is correct
58 Correct 32 ms 25960 KB Output is correct
59 Correct 24 ms 21332 KB Output is correct
60 Correct 392 ms 63468 KB Output is correct
61 Correct 660 ms 79968 KB Output is correct
62 Correct 1041 ms 89972 KB Output is correct
63 Correct 1385 ms 103228 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 21 ms 23568 KB Output is correct
66 Correct 11 ms 19028 KB Output is correct
67 Correct 770 ms 85912 KB Output is correct
68 Correct 807 ms 86008 KB Output is correct
69 Correct 772 ms 85692 KB Output is correct
70 Correct 17 ms 19540 KB Output is correct
71 Correct 18 ms 19960 KB Output is correct
72 Correct 329 ms 56252 KB Output is correct
73 Correct 652 ms 71876 KB Output is correct
74 Correct 889 ms 88764 KB Output is correct
75 Correct 905 ms 87560 KB Output is correct
76 Correct 769 ms 85952 KB Output is correct
77 Correct 14 ms 19540 KB Output is correct
78 Correct 18 ms 20060 KB Output is correct
79 Correct 323 ms 56176 KB Output is correct
80 Correct 596 ms 72636 KB Output is correct
81 Correct 788 ms 88512 KB Output is correct
82 Correct 18 ms 23492 KB Output is correct
83 Correct 19 ms 23492 KB Output is correct
84 Correct 12 ms 19032 KB Output is correct
85 Correct 1119 ms 500740 KB Output is correct
86 Correct 1002 ms 295340 KB Output is correct
87 Correct 1063 ms 295448 KB Output is correct
88 Correct 675 ms 371660 KB Output is correct
89 Correct 205 ms 43140 KB Output is correct
90 Correct 264 ms 43176 KB Output is correct
91 Correct 291 ms 43200 KB Output is correct
92 Correct 552 ms 89240 KB Output is correct
93 Correct 553 ms 89148 KB Output is correct
94 Correct 540 ms 88160 KB Output is correct
95 Correct 574 ms 88144 KB Output is correct
96 Correct 17 ms 23528 KB Output is correct
97 Correct 53 ms 29388 KB Output is correct
98 Correct 296 ms 432516 KB Output is correct
99 Correct 979 ms 499756 KB Output is correct
100 Correct 18 ms 20936 KB Output is correct
101 Correct 54 ms 27840 KB Output is correct
102 Correct 107 ms 36396 KB Output is correct
103 Correct 275 ms 51600 KB Output is correct
104 Correct 436 ms 62220 KB Output is correct
105 Correct 544 ms 71212 KB Output is correct
106 Correct 736 ms 81696 KB Output is correct
107 Correct 920 ms 94508 KB Output is correct
108 Correct 22 ms 23492 KB Output is correct
109 Correct 19 ms 23464 KB Output is correct
110 Correct 20 ms 23516 KB Output is correct
111 Correct 10 ms 19132 KB Output is correct
112 Correct 12 ms 19028 KB Output is correct
113 Correct 18 ms 23568 KB Output is correct
114 Correct 18 ms 23548 KB Output is correct
115 Correct 18 ms 23492 KB Output is correct
116 Correct 20 ms 23492 KB Output is correct
117 Correct 12 ms 19028 KB Output is correct
118 Correct 18 ms 23528 KB Output is correct
119 Correct 11 ms 19284 KB Output is correct
120 Correct 13 ms 19412 KB Output is correct
121 Correct 271 ms 56272 KB Output is correct
122 Correct 542 ms 70472 KB Output is correct
123 Correct 597 ms 70724 KB Output is correct
124 Correct 10 ms 19028 KB Output is correct
125 Correct 18 ms 23492 KB Output is correct
126 Correct 11 ms 19040 KB Output is correct
127 Correct 719 ms 85944 KB Output is correct
128 Correct 605 ms 85928 KB Output is correct
129 Correct 691 ms 85716 KB Output is correct
130 Correct 14 ms 19556 KB Output is correct
131 Correct 17 ms 19840 KB Output is correct
132 Correct 385 ms 56460 KB Output is correct
133 Correct 614 ms 71816 KB Output is correct
134 Correct 859 ms 88672 KB Output is correct
135 Correct 851 ms 486296 KB Output is correct
136 Correct 889 ms 438956 KB Output is correct
137 Correct 1143 ms 433648 KB Output is correct
138 Correct 880 ms 90764 KB Output is correct
139 Correct 682 ms 81984 KB Output is correct
140 Correct 23 ms 23492 KB Output is correct
141 Correct 103 ms 36772 KB Output is correct
142 Correct 28 ms 22204 KB Output is correct
143 Correct 78 ms 29904 KB Output is correct
144 Correct 131 ms 38424 KB Output is correct
145 Correct 353 ms 59060 KB Output is correct
146 Correct 439 ms 66716 KB Output is correct
147 Correct 556 ms 74756 KB Output is correct
148 Correct 745 ms 85736 KB Output is correct
149 Correct 875 ms 93268 KB Output is correct
150 Correct 757 ms 87596 KB Output is correct
151 Correct 683 ms 86120 KB Output is correct
152 Correct 15 ms 19540 KB Output is correct
153 Correct 17 ms 19952 KB Output is correct
154 Correct 333 ms 56232 KB Output is correct
155 Correct 551 ms 72600 KB Output is correct
156 Correct 868 ms 88436 KB Output is correct
157 Correct 18 ms 23580 KB Output is correct
158 Correct 11 ms 19032 KB Output is correct
159 Correct 18 ms 23532 KB Output is correct
160 Correct 17 ms 23492 KB Output is correct
161 Correct 1384 ms 114496 KB Output is correct
162 Correct 1004 ms 498912 KB Output is correct
163 Correct 1006 ms 366376 KB Output is correct
164 Correct 985 ms 365532 KB Output is correct
165 Correct 1347 ms 196552 KB Output is correct
166 Correct 1330 ms 136680 KB Output is correct
167 Correct 182 ms 43968 KB Output is correct
168 Correct 72 ms 28276 KB Output is correct
169 Correct 207 ms 43332 KB Output is correct
170 Correct 426 ms 64728 KB Output is correct
171 Correct 787 ms 89728 KB Output is correct
172 Correct 559 ms 69312 KB Output is correct
173 Correct 755 ms 77296 KB Output is correct
174 Correct 886 ms 85596 KB Output is correct
175 Correct 1078 ms 93732 KB Output is correct
176 Correct 1258 ms 107280 KB Output is correct
177 Correct 1315 ms 115520 KB Output is correct