oj.uz

Submission #566602

# Submission time Handle Problem Language Result Execution time Memory
566602 2022-05-22T12:52:43 Z kartel Fountain Parks (IOI21_parks) C++17
100 / 100
 1309 ms 500896 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]));}
inline 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);}

inline 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;
    queue <int> q;
    for (auto v : ord) {
        q.push(v);
        cmp[v] = C;
        while (sz(q)) {
            int v = q.front(); q.pop();
            for (auto &u : gr[v]) {
                if (cmp[u] != -1) {
                    continue;
                }
                cmp[u] = C;
                q.push(u);
            }
        }
        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 24 ms 23492 KB Output is correct
2 Correct 33 ms 23440 KB Output is correct
3 Correct 18 ms 19048 KB Output is correct
4 Correct 28 ms 23472 KB Output is correct
5 Correct 21 ms 23492 KB Output is correct
6 Correct 11 ms 19084 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 288 ms 54508 KB Output is correct
10 Correct 29 ms 26336 KB Output is correct
11 Correct 82 ms 39808 KB Output is correct
12 Correct 40 ms 27876 KB Output is correct
13 Correct 31 ms 24292 KB Output is correct
14 Correct 19 ms 19136 KB Output is correct
15 Correct 13 ms 19284 KB Output is correct
16 Correct 292 ms 54512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23492 KB Output is correct
2 Correct 33 ms 23440 KB Output is correct
3 Correct 18 ms 19048 KB Output is correct
4 Correct 28 ms 23472 KB Output is correct
5 Correct 21 ms 23492 KB Output is correct
6 Correct 11 ms 19084 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 288 ms 54508 KB Output is correct
10 Correct 29 ms 26336 KB Output is correct
11 Correct 82 ms 39808 KB Output is correct
12 Correct 40 ms 27876 KB Output is correct
13 Correct 31 ms 24292 KB Output is correct
14 Correct 19 ms 19136 KB Output is correct
15 Correct 13 ms 19284 KB Output is correct
16 Correct 292 ms 54512 KB Output is correct
17 Correct 20 ms 23452 KB Output is correct
18 Correct 24 ms 23568 KB Output is correct
19 Correct 19 ms 23564 KB Output is correct
20 Correct 20 ms 23464 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 20 ms 23500 KB Output is correct
23 Correct 1118 ms 97684 KB Output is correct
24 Correct 19 ms 23560 KB Output is correct
25 Correct 21 ms 23968 KB Output is correct
26 Correct 12 ms 19720 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 291 ms 52856 KB Output is correct
29 Correct 505 ms 67116 KB Output is correct
30 Correct 821 ms 82232 KB Output is correct
31 Correct 1182 ms 97584 KB Output is correct
32 Correct 20 ms 23432 KB Output is correct
33 Correct 35 ms 23488 KB Output is correct
34 Correct 20 ms 23516 KB Output is correct
35 Correct 12 ms 19052 KB Output is correct
36 Correct 11 ms 19056 KB Output is correct
37 Correct 19 ms 23492 KB Output is correct
38 Correct 21 ms 23564 KB Output is correct
39 Correct 21 ms 23560 KB Output is correct
40 Correct 24 ms 23504 KB Output is correct
41 Correct 12 ms 19028 KB Output is correct
42 Correct 20 ms 23532 KB Output is correct
43 Correct 20 ms 19252 KB Output is correct
44 Correct 13 ms 19412 KB Output is correct
45 Correct 342 ms 56148 KB Output is correct
46 Correct 562 ms 70444 KB Output is correct
47 Correct 544 ms 70900 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23492 KB Output is correct
2 Correct 33 ms 23440 KB Output is correct
3 Correct 18 ms 19048 KB Output is correct
4 Correct 28 ms 23472 KB Output is correct
5 Correct 21 ms 23492 KB Output is correct
6 Correct 11 ms 19084 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 288 ms 54508 KB Output is correct
10 Correct 29 ms 26336 KB Output is correct
11 Correct 82 ms 39808 KB Output is correct
12 Correct 40 ms 27876 KB Output is correct
13 Correct 31 ms 24292 KB Output is correct
14 Correct 19 ms 19136 KB Output is correct
15 Correct 13 ms 19284 KB Output is correct
16 Correct 292 ms 54512 KB Output is correct
17 Correct 20 ms 23452 KB Output is correct
18 Correct 24 ms 23568 KB Output is correct
19 Correct 19 ms 23564 KB Output is correct
20 Correct 20 ms 23464 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 20 ms 23500 KB Output is correct
23 Correct 1118 ms 97684 KB Output is correct
24 Correct 19 ms 23560 KB Output is correct
25 Correct 21 ms 23968 KB Output is correct
26 Correct 12 ms 19720 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 291 ms 52856 KB Output is correct
29 Correct 505 ms 67116 KB Output is correct
30 Correct 821 ms 82232 KB Output is correct
31 Correct 1182 ms 97584 KB Output is correct
32 Correct 20 ms 23432 KB Output is correct
33 Correct 35 ms 23488 KB Output is correct
34 Correct 20 ms 23516 KB Output is correct
35 Correct 12 ms 19052 KB Output is correct
36 Correct 11 ms 19056 KB Output is correct
37 Correct 19 ms 23492 KB Output is correct
38 Correct 21 ms 23564 KB Output is correct
39 Correct 21 ms 23560 KB Output is correct
40 Correct 24 ms 23504 KB Output is correct
41 Correct 12 ms 19028 KB Output is correct
42 Correct 20 ms 23532 KB Output is correct
43 Correct 20 ms 19252 KB Output is correct
44 Correct 13 ms 19412 KB Output is correct
45 Correct 342 ms 56148 KB Output is correct
46 Correct 562 ms 70444 KB Output is correct
47 Correct 544 ms 70900 KB Output is correct
48 Correct 20 ms 23484 KB Output is correct
49 Correct 20 ms 23484 KB Output is correct
50 Correct 21 ms 23488 KB Output is correct
51 Correct 22 ms 23536 KB Output is correct
52 Correct 23 ms 23572 KB Output is correct
53 Correct 22 ms 23476 KB Output is correct
54 Correct 20 ms 23492 KB Output is correct
55 Correct 1309 ms 104100 KB Output is correct
56 Correct 20 ms 23484 KB Output is correct
57 Correct 27 ms 24184 KB Output is correct
58 Correct 33 ms 25924 KB Output is correct
59 Correct 22 ms 21332 KB Output is correct
60 Correct 487 ms 63400 KB Output is correct
61 Correct 894 ms 79832 KB Output is correct
62 Correct 941 ms 89780 KB Output is correct
63 Correct 1251 ms 103156 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 20 ms 23500 KB Output is correct
66 Correct 11 ms 19132 KB Output is correct
67 Correct 711 ms 85944 KB Output is correct
68 Correct 692 ms 86028 KB Output is correct
69 Correct 645 ms 85692 KB Output is correct
70 Correct 13 ms 19540 KB Output is correct
71 Correct 18 ms 19836 KB Output is correct
72 Correct 293 ms 56296 KB Output is correct
73 Correct 519 ms 72028 KB Output is correct
74 Correct 772 ms 88652 KB Output is correct
75 Correct 806 ms 87488 KB Output is correct
76 Correct 698 ms 86000 KB Output is correct
77 Correct 17 ms 19540 KB Output is correct
78 Correct 19 ms 20056 KB Output is correct
79 Correct 271 ms 56184 KB Output is correct
80 Correct 548 ms 72644 KB Output is correct
81 Correct 792 ms 88600 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23492 KB Output is correct
2 Correct 33 ms 23440 KB Output is correct
3 Correct 18 ms 19048 KB Output is correct
4 Correct 28 ms 23472 KB Output is correct
5 Correct 21 ms 23492 KB Output is correct
6 Correct 11 ms 19084 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 288 ms 54508 KB Output is correct
10 Correct 29 ms 26336 KB Output is correct
11 Correct 82 ms 39808 KB Output is correct
12 Correct 40 ms 27876 KB Output is correct
13 Correct 31 ms 24292 KB Output is correct
14 Correct 19 ms 19136 KB Output is correct
15 Correct 13 ms 19284 KB Output is correct
16 Correct 292 ms 54512 KB Output is correct
17 Correct 20 ms 23564 KB Output is correct
18 Correct 21 ms 23540 KB Output is correct
19 Correct 11 ms 19028 KB Output is correct
20 Correct 1077 ms 500896 KB Output is correct
21 Correct 925 ms 295232 KB Output is correct
22 Correct 992 ms 295596 KB Output is correct
23 Correct 631 ms 371600 KB Output is correct
24 Correct 186 ms 43168 KB Output is correct
25 Correct 257 ms 43132 KB Output is correct
26 Correct 218 ms 43204 KB Output is correct
27 Correct 577 ms 89240 KB Output is correct
28 Correct 576 ms 89412 KB Output is correct
29 Correct 577 ms 88140 KB Output is correct
30 Correct 564 ms 88040 KB Output is correct
31 Correct 19 ms 23492 KB Output is correct
32 Correct 48 ms 29412 KB Output is correct
33 Correct 257 ms 432564 KB Output is correct
34 Correct 970 ms 499772 KB Output is correct
35 Correct 17 ms 21008 KB Output is correct
36 Correct 60 ms 27796 KB Output is correct
37 Correct 106 ms 36508 KB Output is correct
38 Correct 277 ms 51600 KB Output is correct
39 Correct 397 ms 62120 KB Output is correct
40 Correct 534 ms 71168 KB Output is correct
41 Correct 678 ms 81680 KB Output is correct
42 Correct 805 ms 94624 KB Output is correct
43 Correct 19 ms 23492 KB Output is correct
44 Correct 19 ms 23492 KB Output is correct
45 Correct 21 ms 23492 KB Output is correct
46 Correct 11 ms 19128 KB Output is correct
47 Correct 12 ms 19060 KB Output is correct
48 Correct 23 ms 23512 KB Output is correct
49 Correct 20 ms 23576 KB Output is correct
50 Correct 20 ms 23492 KB Output is correct
51 Correct 20 ms 23576 KB Output is correct
52 Correct 11 ms 19028 KB Output is correct
53 Correct 21 ms 23520 KB Output is correct
54 Correct 12 ms 19284 KB Output is correct
55 Correct 12 ms 19412 KB Output is correct
56 Correct 276 ms 56112 KB Output is correct
57 Correct 469 ms 70428 KB Output is correct
58 Correct 449 ms 70908 KB Output is correct
59 Correct 10 ms 19028 KB Output is correct
60 Correct 20 ms 23492 KB Output is correct
61 Correct 12 ms 19028 KB Output is correct
62 Correct 623 ms 85932 KB Output is correct
63 Correct 632 ms 85988 KB Output is correct
64 Correct 640 ms 85632 KB Output is correct
65 Correct 12 ms 19540 KB Output is correct
66 Correct 15 ms 19924 KB Output is correct
67 Correct 305 ms 56292 KB Output is correct
68 Correct 505 ms 71900 KB Output is correct
69 Correct 764 ms 88760 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23492 KB Output is correct
2 Correct 33 ms 23440 KB Output is correct
3 Correct 18 ms 19048 KB Output is correct
4 Correct 28 ms 23472 KB Output is correct
5 Correct 21 ms 23492 KB Output is correct
6 Correct 11 ms 19084 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 288 ms 54508 KB Output is correct
10 Correct 29 ms 26336 KB Output is correct
11 Correct 82 ms 39808 KB Output is correct
12 Correct 40 ms 27876 KB Output is correct
13 Correct 31 ms 24292 KB Output is correct
14 Correct 19 ms 19136 KB Output is correct
15 Correct 13 ms 19284 KB Output is correct
16 Correct 292 ms 54512 KB Output is correct
17 Correct 764 ms 486392 KB Output is correct
18 Correct 817 ms 438992 KB Output is correct
19 Correct 1038 ms 433624 KB Output is correct
20 Correct 790 ms 90840 KB Output is correct
21 Correct 554 ms 82008 KB Output is correct
22 Correct 23 ms 23544 KB Output is correct
23 Correct 97 ms 36692 KB Output is correct
24 Correct 26 ms 22248 KB Output is correct
25 Correct 82 ms 29908 KB Output is correct
26 Correct 137 ms 38384 KB Output is correct
27 Correct 370 ms 59028 KB Output is correct
28 Correct 503 ms 66752 KB Output is correct
29 Correct 620 ms 74800 KB Output is correct
30 Correct 758 ms 85788 KB Output is correct
31 Correct 844 ms 93220 KB Output is correct
32 Correct 754 ms 87656 KB Output is correct
33 Correct 639 ms 85956 KB Output is correct
34 Correct 15 ms 19540 KB Output is correct
35 Correct 16 ms 20052 KB Output is correct
36 Correct 304 ms 56288 KB Output is correct
37 Correct 562 ms 72604 KB Output is correct
38 Correct 824 ms 88476 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23492 KB Output is correct
2 Correct 33 ms 23440 KB Output is correct
3 Correct 18 ms 19048 KB Output is correct
4 Correct 28 ms 23472 KB Output is correct
5 Correct 21 ms 23492 KB Output is correct
6 Correct 11 ms 19084 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 288 ms 54508 KB Output is correct
10 Correct 29 ms 26336 KB Output is correct
11 Correct 82 ms 39808 KB Output is correct
12 Correct 40 ms 27876 KB Output is correct
13 Correct 31 ms 24292 KB Output is correct
14 Correct 19 ms 19136 KB Output is correct
15 Correct 13 ms 19284 KB Output is correct
16 Correct 292 ms 54512 KB Output is correct
17 Correct 20 ms 23452 KB Output is correct
18 Correct 24 ms 23568 KB Output is correct
19 Correct 19 ms 23564 KB Output is correct
20 Correct 20 ms 23464 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 20 ms 23500 KB Output is correct
23 Correct 1118 ms 97684 KB Output is correct
24 Correct 19 ms 23560 KB Output is correct
25 Correct 21 ms 23968 KB Output is correct
26 Correct 12 ms 19720 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 291 ms 52856 KB Output is correct
29 Correct 505 ms 67116 KB Output is correct
30 Correct 821 ms 82232 KB Output is correct
31 Correct 1182 ms 97584 KB Output is correct
32 Correct 20 ms 23432 KB Output is correct
33 Correct 35 ms 23488 KB Output is correct
34 Correct 20 ms 23516 KB Output is correct
35 Correct 12 ms 19052 KB Output is correct
36 Correct 11 ms 19056 KB Output is correct
37 Correct 19 ms 23492 KB Output is correct
38 Correct 21 ms 23564 KB Output is correct
39 Correct 21 ms 23560 KB Output is correct
40 Correct 24 ms 23504 KB Output is correct
41 Correct 12 ms 19028 KB Output is correct
42 Correct 20 ms 23532 KB Output is correct
43 Correct 20 ms 19252 KB Output is correct
44 Correct 13 ms 19412 KB Output is correct
45 Correct 342 ms 56148 KB Output is correct
46 Correct 562 ms 70444 KB Output is correct
47 Correct 544 ms 70900 KB Output is correct
48 Correct 20 ms 23484 KB Output is correct
49 Correct 20 ms 23484 KB Output is correct
50 Correct 21 ms 23488 KB Output is correct
51 Correct 22 ms 23536 KB Output is correct
52 Correct 23 ms 23572 KB Output is correct
53 Correct 22 ms 23476 KB Output is correct
54 Correct 20 ms 23492 KB Output is correct
55 Correct 1309 ms 104100 KB Output is correct
56 Correct 20 ms 23484 KB Output is correct
57 Correct 27 ms 24184 KB Output is correct
58 Correct 33 ms 25924 KB Output is correct
59 Correct 22 ms 21332 KB Output is correct
60 Correct 487 ms 63400 KB Output is correct
61 Correct 894 ms 79832 KB Output is correct
62 Correct 941 ms 89780 KB Output is correct
63 Correct 1251 ms 103156 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 20 ms 23500 KB Output is correct
66 Correct 11 ms 19132 KB Output is correct
67 Correct 711 ms 85944 KB Output is correct
68 Correct 692 ms 86028 KB Output is correct
69 Correct 645 ms 85692 KB Output is correct
70 Correct 13 ms 19540 KB Output is correct
71 Correct 18 ms 19836 KB Output is correct
72 Correct 293 ms 56296 KB Output is correct
73 Correct 519 ms 72028 KB Output is correct
74 Correct 772 ms 88652 KB Output is correct
75 Correct 806 ms 87488 KB Output is correct
76 Correct 698 ms 86000 KB Output is correct
77 Correct 17 ms 19540 KB Output is correct
78 Correct 19 ms 20056 KB Output is correct
79 Correct 271 ms 56184 KB Output is correct
80 Correct 548 ms 72644 KB Output is correct
81 Correct 792 ms 88600 KB Output is correct
82 Correct 20 ms 23564 KB Output is correct
83 Correct 21 ms 23540 KB Output is correct
84 Correct 11 ms 19028 KB Output is correct
85 Correct 1077 ms 500896 KB Output is correct
86 Correct 925 ms 295232 KB Output is correct
87 Correct 992 ms 295596 KB Output is correct
88 Correct 631 ms 371600 KB Output is correct
89 Correct 186 ms 43168 KB Output is correct
90 Correct 257 ms 43132 KB Output is correct
91 Correct 218 ms 43204 KB Output is correct
92 Correct 577 ms 89240 KB Output is correct
93 Correct 576 ms 89412 KB Output is correct
94 Correct 577 ms 88140 KB Output is correct
95 Correct 564 ms 88040 KB Output is correct
96 Correct 19 ms 23492 KB Output is correct
97 Correct 48 ms 29412 KB Output is correct
98 Correct 257 ms 432564 KB Output is correct
99 Correct 970 ms 499772 KB Output is correct
100 Correct 17 ms 21008 KB Output is correct
101 Correct 60 ms 27796 KB Output is correct
102 Correct 106 ms 36508 KB Output is correct
103 Correct 277 ms 51600 KB Output is correct
104 Correct 397 ms 62120 KB Output is correct
105 Correct 534 ms 71168 KB Output is correct
106 Correct 678 ms 81680 KB Output is correct
107 Correct 805 ms 94624 KB Output is correct
108 Correct 19 ms 23492 KB Output is correct
109 Correct 19 ms 23492 KB Output is correct
110 Correct 21 ms 23492 KB Output is correct
111 Correct 11 ms 19128 KB Output is correct
112 Correct 12 ms 19060 KB Output is correct
113 Correct 23 ms 23512 KB Output is correct
114 Correct 20 ms 23576 KB Output is correct
115 Correct 20 ms 23492 KB Output is correct
116 Correct 20 ms 23576 KB Output is correct
117 Correct 11 ms 19028 KB Output is correct
118 Correct 21 ms 23520 KB Output is correct
119 Correct 12 ms 19284 KB Output is correct
120 Correct 12 ms 19412 KB Output is correct
121 Correct 276 ms 56112 KB Output is correct
122 Correct 469 ms 70428 KB Output is correct
123 Correct 449 ms 70908 KB Output is correct
124 Correct 10 ms 19028 KB Output is correct
125 Correct 20 ms 23492 KB Output is correct
126 Correct 12 ms 19028 KB Output is correct
127 Correct 623 ms 85932 KB Output is correct
128 Correct 632 ms 85988 KB Output is correct
129 Correct 640 ms 85632 KB Output is correct
130 Correct 12 ms 19540 KB Output is correct
131 Correct 15 ms 19924 KB Output is correct
132 Correct 305 ms 56292 KB Output is correct
133 Correct 505 ms 71900 KB Output is correct
134 Correct 764 ms 88760 KB Output is correct
135 Correct 764 ms 486392 KB Output is correct
136 Correct 817 ms 438992 KB Output is correct
137 Correct 1038 ms 433624 KB Output is correct
138 Correct 790 ms 90840 KB Output is correct
139 Correct 554 ms 82008 KB Output is correct
140 Correct 23 ms 23544 KB Output is correct
141 Correct 97 ms 36692 KB Output is correct
142 Correct 26 ms 22248 KB Output is correct
143 Correct 82 ms 29908 KB Output is correct
144 Correct 137 ms 38384 KB Output is correct
145 Correct 370 ms 59028 KB Output is correct
146 Correct 503 ms 66752 KB Output is correct
147 Correct 620 ms 74800 KB Output is correct
148 Correct 758 ms 85788 KB Output is correct
149 Correct 844 ms 93220 KB Output is correct
150 Correct 754 ms 87656 KB Output is correct
151 Correct 639 ms 85956 KB Output is correct
152 Correct 15 ms 19540 KB Output is correct
153 Correct 16 ms 20052 KB Output is correct
154 Correct 304 ms 56288 KB Output is correct
155 Correct 562 ms 72604 KB Output is correct
156 Correct 824 ms 88476 KB Output is correct
157 Correct 24 ms 23504 KB Output is correct
158 Correct 10 ms 19052 KB Output is correct
159 Correct 19 ms 23472 KB Output is correct
160 Correct 20 ms 23492 KB Output is correct
161 Correct 1243 ms 114564 KB Output is correct
162 Correct 926 ms 498900 KB Output is correct
163 Correct 1020 ms 366740 KB Output is correct
164 Correct 988 ms 365404 KB Output is correct
165 Correct 1257 ms 196580 KB Output is correct
166 Correct 1181 ms 136692 KB Output is correct
167 Correct 176 ms 44056 KB Output is correct
168 Correct 56 ms 28300 KB Output is correct
169 Correct 191 ms 43304 KB Output is correct
170 Correct 485 ms 64748 KB Output is correct
171 Correct 679 ms 89924 KB Output is correct
172 Correct 517 ms 69360 KB Output is correct
173 Correct 642 ms 77464 KB Output is correct
174 Correct 859 ms 85596 KB Output is correct
175 Correct 996 ms 93576 KB Output is correct
176 Correct 1161 ms 107312 KB Output is correct
177 Correct 1247 ms 115628 KB Output is correct