oj.uz

답안 #566579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566579 2022-05-22T12:33:58 Z kartel 분수 공원 (IOI21_parks) C++17
100 / 100
 1446 ms 500748 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

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23488 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 22 ms 23548 KB Output is correct
5 Correct 20 ms 23492 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 252 ms 54520 KB Output is correct
10 Correct 30 ms 26312 KB Output is correct
11 Correct 104 ms 39896 KB Output is correct
12 Correct 37 ms 27900 KB Output is correct
13 Correct 33 ms 24316 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 10 ms 19304 KB Output is correct
16 Correct 292 ms 54652 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23488 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 22 ms 23548 KB Output is correct
5 Correct 20 ms 23492 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 252 ms 54520 KB Output is correct
10 Correct 30 ms 26312 KB Output is correct
11 Correct 104 ms 39896 KB Output is correct
12 Correct 37 ms 27900 KB Output is correct
13 Correct 33 ms 24316 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 10 ms 19304 KB Output is correct
16 Correct 292 ms 54652 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 17 ms 23492 KB Output is correct
19 Correct 19 ms 23504 KB Output is correct
20 Correct 18 ms 23564 KB Output is correct
21 Correct 11 ms 19028 KB Output is correct
22 Correct 19 ms 23512 KB Output is correct
23 Correct 1138 ms 97672 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 22 ms 23964 KB Output is correct
26 Correct 14 ms 19704 KB Output is correct
27 Correct 14 ms 19796 KB Output is correct
28 Correct 352 ms 52924 KB Output is correct
29 Correct 588 ms 67012 KB Output is correct
30 Correct 879 ms 82272 KB Output is correct
31 Correct 1140 ms 97568 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 23 ms 23492 KB Output is correct
34 Correct 21 ms 23572 KB Output is correct
35 Correct 13 ms 19076 KB Output is correct
36 Correct 10 ms 19028 KB Output is correct
37 Correct 19 ms 23492 KB Output is correct
38 Correct 18 ms 23492 KB Output is correct
39 Correct 19 ms 23492 KB Output is correct
40 Correct 20 ms 23488 KB Output is correct
41 Correct 10 ms 19052 KB Output is correct
42 Correct 18 ms 23492 KB Output is correct
43 Correct 12 ms 19284 KB Output is correct
44 Correct 15 ms 19432 KB Output is correct
45 Correct 339 ms 56152 KB Output is correct
46 Correct 582 ms 70412 KB Output is correct
47 Correct 600 ms 70696 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23488 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 22 ms 23548 KB Output is correct
5 Correct 20 ms 23492 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 252 ms 54520 KB Output is correct
10 Correct 30 ms 26312 KB Output is correct
11 Correct 104 ms 39896 KB Output is correct
12 Correct 37 ms 27900 KB Output is correct
13 Correct 33 ms 24316 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 10 ms 19304 KB Output is correct
16 Correct 292 ms 54652 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 17 ms 23492 KB Output is correct
19 Correct 19 ms 23504 KB Output is correct
20 Correct 18 ms 23564 KB Output is correct
21 Correct 11 ms 19028 KB Output is correct
22 Correct 19 ms 23512 KB Output is correct
23 Correct 1138 ms 97672 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 22 ms 23964 KB Output is correct
26 Correct 14 ms 19704 KB Output is correct
27 Correct 14 ms 19796 KB Output is correct
28 Correct 352 ms 52924 KB Output is correct
29 Correct 588 ms 67012 KB Output is correct
30 Correct 879 ms 82272 KB Output is correct
31 Correct 1140 ms 97568 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 23 ms 23492 KB Output is correct
34 Correct 21 ms 23572 KB Output is correct
35 Correct 13 ms 19076 KB Output is correct
36 Correct 10 ms 19028 KB Output is correct
37 Correct 19 ms 23492 KB Output is correct
38 Correct 18 ms 23492 KB Output is correct
39 Correct 19 ms 23492 KB Output is correct
40 Correct 20 ms 23488 KB Output is correct
41 Correct 10 ms 19052 KB Output is correct
42 Correct 18 ms 23492 KB Output is correct
43 Correct 12 ms 19284 KB Output is correct
44 Correct 15 ms 19432 KB Output is correct
45 Correct 339 ms 56152 KB Output is correct
46 Correct 582 ms 70412 KB Output is correct
47 Correct 600 ms 70696 KB Output is correct
48 Correct 20 ms 23492 KB Output is correct
49 Correct 18 ms 23456 KB Output is correct
50 Correct 19 ms 23528 KB Output is correct
51 Correct 18 ms 23580 KB Output is correct
52 Correct 19 ms 23576 KB Output is correct
53 Correct 19 ms 23572 KB Output is correct
54 Correct 19 ms 23492 KB Output is correct
55 Correct 1295 ms 114356 KB Output is correct
56 Correct 18 ms 23492 KB Output is correct
57 Correct 22 ms 24292 KB Output is correct
58 Correct 39 ms 26264 KB Output is correct
59 Correct 23 ms 21332 KB Output is correct
60 Correct 447 ms 68592 KB Output is correct
61 Correct 769 ms 87040 KB Output is correct
62 Correct 931 ms 98424 KB Output is correct
63 Correct 1230 ms 113728 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 21 ms 23484 KB Output is correct
66 Correct 11 ms 19028 KB Output is correct
67 Correct 670 ms 86048 KB Output is correct
68 Correct 640 ms 85936 KB Output is correct
69 Correct 647 ms 85868 KB Output is correct
70 Correct 15 ms 19540 KB Output is correct
71 Correct 17 ms 19956 KB Output is correct
72 Correct 337 ms 56452 KB Output is correct
73 Correct 534 ms 71904 KB Output is correct
74 Correct 789 ms 88688 KB Output is correct
75 Correct 809 ms 87460 KB Output is correct
76 Correct 812 ms 85976 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 16 ms 19976 KB Output is correct
79 Correct 350 ms 56288 KB Output is correct
80 Correct 648 ms 72644 KB Output is correct
81 Correct 936 ms 88420 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23488 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 22 ms 23548 KB Output is correct
5 Correct 20 ms 23492 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 252 ms 54520 KB Output is correct
10 Correct 30 ms 26312 KB Output is correct
11 Correct 104 ms 39896 KB Output is correct
12 Correct 37 ms 27900 KB Output is correct
13 Correct 33 ms 24316 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 10 ms 19304 KB Output is correct
16 Correct 292 ms 54652 KB Output is correct
17 Correct 20 ms 23492 KB Output is correct
18 Correct 18 ms 23468 KB Output is correct
19 Correct 11 ms 19028 KB Output is correct
20 Correct 1237 ms 500748 KB Output is correct
21 Correct 923 ms 295292 KB Output is correct
22 Correct 1028 ms 295668 KB Output is correct
23 Correct 761 ms 371728 KB Output is correct
24 Correct 161 ms 43248 KB Output is correct
25 Correct 329 ms 43080 KB Output is correct
26 Correct 229 ms 43200 KB Output is correct
27 Correct 635 ms 89296 KB Output is correct
28 Correct 555 ms 89152 KB Output is correct
29 Correct 538 ms 88080 KB Output is correct
30 Correct 526 ms 88064 KB Output is correct
31 Correct 18 ms 23492 KB Output is correct
32 Correct 62 ms 29476 KB Output is correct
33 Correct 252 ms 432588 KB Output is correct
34 Correct 1033 ms 499736 KB Output is correct
35 Correct 21 ms 20948 KB Output is correct
36 Correct 55 ms 27828 KB Output is correct
37 Correct 118 ms 36416 KB Output is correct
38 Correct 300 ms 51660 KB Output is correct
39 Correct 415 ms 62100 KB Output is correct
40 Correct 536 ms 71036 KB Output is correct
41 Correct 768 ms 81540 KB Output is correct
42 Correct 875 ms 94568 KB Output is correct
43 Correct 18 ms 23492 KB Output is correct
44 Correct 17 ms 23468 KB Output is correct
45 Correct 18 ms 23572 KB Output is correct
46 Correct 10 ms 19028 KB Output is correct
47 Correct 10 ms 19028 KB Output is correct
48 Correct 20 ms 23488 KB Output is correct
49 Correct 17 ms 23500 KB Output is correct
50 Correct 18 ms 23520 KB Output is correct
51 Correct 22 ms 23484 KB Output is correct
52 Correct 10 ms 19080 KB Output is correct
53 Correct 20 ms 23560 KB Output is correct
54 Correct 13 ms 19252 KB Output is correct
55 Correct 12 ms 19428 KB Output is correct
56 Correct 265 ms 56056 KB Output is correct
57 Correct 453 ms 70476 KB Output is correct
58 Correct 539 ms 70800 KB Output is correct
59 Correct 11 ms 19028 KB Output is correct
60 Correct 20 ms 23564 KB Output is correct
61 Correct 11 ms 19028 KB Output is correct
62 Correct 651 ms 86080 KB Output is correct
63 Correct 732 ms 86068 KB Output is correct
64 Correct 651 ms 85832 KB Output is correct
65 Correct 13 ms 19540 KB Output is correct
66 Correct 16 ms 19868 KB Output is correct
67 Correct 291 ms 56380 KB Output is correct
68 Correct 549 ms 71832 KB Output is correct
69 Correct 840 ms 88708 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23488 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 22 ms 23548 KB Output is correct
5 Correct 20 ms 23492 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 252 ms 54520 KB Output is correct
10 Correct 30 ms 26312 KB Output is correct
11 Correct 104 ms 39896 KB Output is correct
12 Correct 37 ms 27900 KB Output is correct
13 Correct 33 ms 24316 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 10 ms 19304 KB Output is correct
16 Correct 292 ms 54652 KB Output is correct
17 Correct 886 ms 486356 KB Output is correct
18 Correct 917 ms 439096 KB Output is correct
19 Correct 1087 ms 433660 KB Output is correct
20 Correct 918 ms 90592 KB Output is correct
21 Correct 681 ms 82132 KB Output is correct
22 Correct 18 ms 23620 KB Output is correct
23 Correct 104 ms 36736 KB Output is correct
24 Correct 31 ms 22228 KB Output is correct
25 Correct 95 ms 29992 KB Output is correct
26 Correct 133 ms 38460 KB Output is correct
27 Correct 430 ms 59060 KB Output is correct
28 Correct 486 ms 66788 KB Output is correct
29 Correct 638 ms 74776 KB Output is correct
30 Correct 745 ms 85776 KB Output is correct
31 Correct 905 ms 93196 KB Output is correct
32 Correct 812 ms 87560 KB Output is correct
33 Correct 648 ms 85912 KB Output is correct
34 Correct 13 ms 19540 KB Output is correct
35 Correct 16 ms 20060 KB Output is correct
36 Correct 309 ms 56244 KB Output is correct
37 Correct 518 ms 72568 KB Output is correct
38 Correct 800 ms 88400 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23488 KB Output is correct
2 Correct 17 ms 23492 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 22 ms 23548 KB Output is correct
5 Correct 20 ms 23492 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 252 ms 54520 KB Output is correct
10 Correct 30 ms 26312 KB Output is correct
11 Correct 104 ms 39896 KB Output is correct
12 Correct 37 ms 27900 KB Output is correct
13 Correct 33 ms 24316 KB Output is correct
14 Correct 10 ms 19156 KB Output is correct
15 Correct 10 ms 19304 KB Output is correct
16 Correct 292 ms 54652 KB Output is correct
17 Correct 17 ms 23492 KB Output is correct
18 Correct 17 ms 23492 KB Output is correct
19 Correct 19 ms 23504 KB Output is correct
20 Correct 18 ms 23564 KB Output is correct
21 Correct 11 ms 19028 KB Output is correct
22 Correct 19 ms 23512 KB Output is correct
23 Correct 1138 ms 97672 KB Output is correct
24 Correct 17 ms 23492 KB Output is correct
25 Correct 22 ms 23964 KB Output is correct
26 Correct 14 ms 19704 KB Output is correct
27 Correct 14 ms 19796 KB Output is correct
28 Correct 352 ms 52924 KB Output is correct
29 Correct 588 ms 67012 KB Output is correct
30 Correct 879 ms 82272 KB Output is correct
31 Correct 1140 ms 97568 KB Output is correct
32 Correct 18 ms 23492 KB Output is correct
33 Correct 23 ms 23492 KB Output is correct
34 Correct 21 ms 23572 KB Output is correct
35 Correct 13 ms 19076 KB Output is correct
36 Correct 10 ms 19028 KB Output is correct
37 Correct 19 ms 23492 KB Output is correct
38 Correct 18 ms 23492 KB Output is correct
39 Correct 19 ms 23492 KB Output is correct
40 Correct 20 ms 23488 KB Output is correct
41 Correct 10 ms 19052 KB Output is correct
42 Correct 18 ms 23492 KB Output is correct
43 Correct 12 ms 19284 KB Output is correct
44 Correct 15 ms 19432 KB Output is correct
45 Correct 339 ms 56152 KB Output is correct
46 Correct 582 ms 70412 KB Output is correct
47 Correct 600 ms 70696 KB Output is correct
48 Correct 20 ms 23492 KB Output is correct
49 Correct 18 ms 23456 KB Output is correct
50 Correct 19 ms 23528 KB Output is correct
51 Correct 18 ms 23580 KB Output is correct
52 Correct 19 ms 23576 KB Output is correct
53 Correct 19 ms 23572 KB Output is correct
54 Correct 19 ms 23492 KB Output is correct
55 Correct 1295 ms 114356 KB Output is correct
56 Correct 18 ms 23492 KB Output is correct
57 Correct 22 ms 24292 KB Output is correct
58 Correct 39 ms 26264 KB Output is correct
59 Correct 23 ms 21332 KB Output is correct
60 Correct 447 ms 68592 KB Output is correct
61 Correct 769 ms 87040 KB Output is correct
62 Correct 931 ms 98424 KB Output is correct
63 Correct 1230 ms 113728 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 21 ms 23484 KB Output is correct
66 Correct 11 ms 19028 KB Output is correct
67 Correct 670 ms 86048 KB Output is correct
68 Correct 640 ms 85936 KB Output is correct
69 Correct 647 ms 85868 KB Output is correct
70 Correct 15 ms 19540 KB Output is correct
71 Correct 17 ms 19956 KB Output is correct
72 Correct 337 ms 56452 KB Output is correct
73 Correct 534 ms 71904 KB Output is correct
74 Correct 789 ms 88688 KB Output is correct
75 Correct 809 ms 87460 KB Output is correct
76 Correct 812 ms 85976 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 16 ms 19976 KB Output is correct
79 Correct 350 ms 56288 KB Output is correct
80 Correct 648 ms 72644 KB Output is correct
81 Correct 936 ms 88420 KB Output is correct
82 Correct 20 ms 23492 KB Output is correct
83 Correct 18 ms 23468 KB Output is correct
84 Correct 11 ms 19028 KB Output is correct
85 Correct 1237 ms 500748 KB Output is correct
86 Correct 923 ms 295292 KB Output is correct
87 Correct 1028 ms 295668 KB Output is correct
88 Correct 761 ms 371728 KB Output is correct
89 Correct 161 ms 43248 KB Output is correct
90 Correct 329 ms 43080 KB Output is correct
91 Correct 229 ms 43200 KB Output is correct
92 Correct 635 ms 89296 KB Output is correct
93 Correct 555 ms 89152 KB Output is correct
94 Correct 538 ms 88080 KB Output is correct
95 Correct 526 ms 88064 KB Output is correct
96 Correct 18 ms 23492 KB Output is correct
97 Correct 62 ms 29476 KB Output is correct
98 Correct 252 ms 432588 KB Output is correct
99 Correct 1033 ms 499736 KB Output is correct
100 Correct 21 ms 20948 KB Output is correct
101 Correct 55 ms 27828 KB Output is correct
102 Correct 118 ms 36416 KB Output is correct
103 Correct 300 ms 51660 KB Output is correct
104 Correct 415 ms 62100 KB Output is correct
105 Correct 536 ms 71036 KB Output is correct
106 Correct 768 ms 81540 KB Output is correct
107 Correct 875 ms 94568 KB Output is correct
108 Correct 18 ms 23492 KB Output is correct
109 Correct 17 ms 23468 KB Output is correct
110 Correct 18 ms 23572 KB Output is correct
111 Correct 10 ms 19028 KB Output is correct
112 Correct 10 ms 19028 KB Output is correct
113 Correct 20 ms 23488 KB Output is correct
114 Correct 17 ms 23500 KB Output is correct
115 Correct 18 ms 23520 KB Output is correct
116 Correct 22 ms 23484 KB Output is correct
117 Correct 10 ms 19080 KB Output is correct
118 Correct 20 ms 23560 KB Output is correct
119 Correct 13 ms 19252 KB Output is correct
120 Correct 12 ms 19428 KB Output is correct
121 Correct 265 ms 56056 KB Output is correct
122 Correct 453 ms 70476 KB Output is correct
123 Correct 539 ms 70800 KB Output is correct
124 Correct 11 ms 19028 KB Output is correct
125 Correct 20 ms 23564 KB Output is correct
126 Correct 11 ms 19028 KB Output is correct
127 Correct 651 ms 86080 KB Output is correct
128 Correct 732 ms 86068 KB Output is correct
129 Correct 651 ms 85832 KB Output is correct
130 Correct 13 ms 19540 KB Output is correct
131 Correct 16 ms 19868 KB Output is correct
132 Correct 291 ms 56380 KB Output is correct
133 Correct 549 ms 71832 KB Output is correct
134 Correct 840 ms 88708 KB Output is correct
135 Correct 886 ms 486356 KB Output is correct
136 Correct 917 ms 439096 KB Output is correct
137 Correct 1087 ms 433660 KB Output is correct
138 Correct 918 ms 90592 KB Output is correct
139 Correct 681 ms 82132 KB Output is correct
140 Correct 18 ms 23620 KB Output is correct
141 Correct 104 ms 36736 KB Output is correct
142 Correct 31 ms 22228 KB Output is correct
143 Correct 95 ms 29992 KB Output is correct
144 Correct 133 ms 38460 KB Output is correct
145 Correct 430 ms 59060 KB Output is correct
146 Correct 486 ms 66788 KB Output is correct
147 Correct 638 ms 74776 KB Output is correct
148 Correct 745 ms 85776 KB Output is correct
149 Correct 905 ms 93196 KB Output is correct
150 Correct 812 ms 87560 KB Output is correct
151 Correct 648 ms 85912 KB Output is correct
152 Correct 13 ms 19540 KB Output is correct
153 Correct 16 ms 20060 KB Output is correct
154 Correct 309 ms 56244 KB Output is correct
155 Correct 518 ms 72568 KB Output is correct
156 Correct 800 ms 88400 KB Output is correct
157 Correct 18 ms 23492 KB Output is correct
158 Correct 11 ms 19028 KB Output is correct
159 Correct 17 ms 23472 KB Output is correct
160 Correct 17 ms 23492 KB Output is correct
161 Correct 1244 ms 129896 KB Output is correct
162 Correct 938 ms 498836 KB Output is correct
163 Correct 1006 ms 366420 KB Output is correct
164 Correct 1129 ms 365396 KB Output is correct
165 Correct 1446 ms 202644 KB Output is correct
166 Correct 1295 ms 143528 KB Output is correct
167 Correct 262 ms 44196 KB Output is correct
168 Correct 79 ms 29112 KB Output is correct
169 Correct 239 ms 43928 KB Output is correct
170 Correct 485 ms 65436 KB Output is correct
171 Correct 633 ms 90104 KB Output is correct
172 Correct 563 ms 73772 KB Output is correct
173 Correct 655 ms 82536 KB Output is correct
174 Correct 786 ms 91892 KB Output is correct
175 Correct 946 ms 100452 KB Output is correct
176 Correct 1110 ms 115524 KB Output is correct
177 Correct 1194 ms 124028 KB Output is correct