oj.uz

답안 #566504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566504 2022-05-22T11:14:31 Z kartel 분수 공원 (IOI21_parks) C++17
100 / 100
 1490 ms 151368 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 = 5e5 + 500;

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}};

map <pair <int, int>, pair <int, int> > road;

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];

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, dy}];
        dfsd(u);
    }
}

inline ll geth(int a, int b) {return ((ll)a << 32) + 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;
        for (int j = 0; j < 4; j++) {
            int cx = x[i] + dsteps[j][0];
            int cy = y[i] + dsteps[j][1];

            cnt[geth(cx, cy)]++;
            if (cnt[geth(cx, cy)] == 4) {
                pts.pb({cx, cy});
            }
        }
    }
    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++;
    }

    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, 0}];
        } else {
            block[i] = road[{0, -2}];
        }
        queue <int> q;
        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, dy}];
                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, 2}]  = {2, 0}; road[{2, 0}]  = {0, 1};
    road[{0, -2}] = {1, 3}; road[{-2, 0}] = {3, 2};

    unordered_map <ll, int> mp;
    vector <pair <int, int> > r;
    unordered_map <ll, int> del;
    vector <int> pm(n);
    iota(all(pm), 0);
    shuffle(all(pm), rnd);

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

    get_erased_2x2(x, y, del);
    for (auto i : pm) {
        for (int j = 0; j < 4; j++) {
            int cx = x[i] + steps[j][0];
            int cy = y[i] + steps[j][1];

            if (mp.find(geth(cx, cy)) != mp.end() && f(i) != f(mp[geth(cx, cy)])) {
                int to = mp[geth(cx, cy)];
                if (del.find(geth(i, to)) != del.end()) {
                    continue;
                }
                link(i, to);
                r.pb({i, to});
            }
        }
    }
    sort(all(r));
    r.resize(unique(all(r)) - r.begin());

    for (int i = 0; i < n; i++) {
        if (f(i) != f(0)) {
            return 0;
        }
    }
    vector <int> u, v, A, B;
    unordered_map <ll, vector <int> > e;

    for (int i = 0; i < sz(r); i++) {
        int a = r[i].F, b = r[i].S;
        u.pb(a); v.pb(b);
        if (abs(x[a] - x[b]) == 0) {
            int lx = x[a];
            int ly = min(y[a], y[b]);

            e[geth(lx - 1, ly + 1)].pb(i);
            e[geth(lx + 1, ly + 1)].pb(nt(i));
        } else {
            int lx = min(x[a], x[b]);
            int ly = y[a];

            e[geth(lx + 1, ly + 1)].pb(i);
            e[geth(lx + 1, ly - 1)].pb(nt(i));
        }
    }
    for (int i = 0; i < 2 * N; i++) {
        mk[i] = 0;
        g[i].clear();
    }
    for (auto [p, v] : e) {
        if (sz(v) == 1) {
            continue;
        }
        for (auto a : v) {
            for (auto b : v) {
                if (a == b) {
                    continue;
                }
                add_impl(a, b);
            }
        }
    }

    for (int i = 0; i < 2 * N; i++) {
        cmp[i] = -1;
        if (mk[i]) {
            continue;
        }
        dfs(i);
    }
    reverse(all(ord));

    int C = 0;
    for (auto v : ord) {
        function <void(int)> dfsr = [&](int v) {
            if (cmp[v] != -1) {
                return;
            }
            cmp[v] = C;
            for (auto u : gr[v]) {
                dfsr(u);
            }
        };

        dfsr(v);
        C++;
    }

    for (int i = 0; i < N; i++) {
        if (cmp[i] == cmp[nt(i)]) {
            return 0;
        }
        to[i] = (cmp[i] > cmp[nt(i)]);
    }

    for (int i = 0; i < sz(r); i++) {
        int a = r[i].F, b = r[i].S;
        if (abs(x[a] - x[b]) == 0) {
            int lx = x[a];
            int ly = min(y[a], y[b]);

            if (to[i]) {
                A.pb(lx + 1);
            } else {
                A.pb(lx - 1);
            }
            B.pb(ly + 1);
        } else {
            int lx = min(x[a], x[b]);
            int ly = y[a];

            if (to[i]) {
                B.pb(ly - 1);
            } else {
                B.pb(ly + 1);
            }
            A.pb(lx + 1);
        }
    }

    build(u, v, A, B);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 58168 KB Output is correct
2 Correct 40 ms 58176 KB Output is correct
3 Correct 25 ms 47328 KB Output is correct
4 Correct 45 ms 58216 KB Output is correct
5 Correct 46 ms 58204 KB Output is correct
6 Correct 24 ms 47324 KB Output is correct
7 Correct 25 ms 47320 KB Output is correct
8 Correct 23 ms 47284 KB Output is correct
9 Correct 373 ms 89672 KB Output is correct
10 Correct 54 ms 61168 KB Output is correct
11 Correct 115 ms 74768 KB Output is correct
12 Correct 62 ms 62852 KB Output is correct
13 Correct 59 ms 57316 KB Output is correct
14 Correct 24 ms 47412 KB Output is correct
15 Correct 24 ms 47588 KB Output is correct
16 Correct 347 ms 89628 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 58168 KB Output is correct
2 Correct 40 ms 58176 KB Output is correct
3 Correct 25 ms 47328 KB Output is correct
4 Correct 45 ms 58216 KB Output is correct
5 Correct 46 ms 58204 KB Output is correct
6 Correct 24 ms 47324 KB Output is correct
7 Correct 25 ms 47320 KB Output is correct
8 Correct 23 ms 47284 KB Output is correct
9 Correct 373 ms 89672 KB Output is correct
10 Correct 54 ms 61168 KB Output is correct
11 Correct 115 ms 74768 KB Output is correct
12 Correct 62 ms 62852 KB Output is correct
13 Correct 59 ms 57316 KB Output is correct
14 Correct 24 ms 47412 KB Output is correct
15 Correct 24 ms 47588 KB Output is correct
16 Correct 347 ms 89628 KB Output is correct
17 Correct 39 ms 58148 KB Output is correct
18 Correct 40 ms 58220 KB Output is correct
19 Correct 42 ms 58268 KB Output is correct
20 Correct 43 ms 58216 KB Output is correct
21 Correct 28 ms 47260 KB Output is correct
22 Correct 48 ms 58168 KB Output is correct
23 Correct 1191 ms 133912 KB Output is correct
24 Correct 42 ms 58212 KB Output is correct
25 Correct 44 ms 58636 KB Output is correct
26 Correct 29 ms 47956 KB Output is correct
27 Correct 32 ms 48084 KB Output is correct
28 Correct 387 ms 88588 KB Output is correct
29 Correct 686 ms 103304 KB Output is correct
30 Correct 937 ms 119372 KB Output is correct
31 Correct 1161 ms 135548 KB Output is correct
32 Correct 41 ms 58176 KB Output is correct
33 Correct 44 ms 58216 KB Output is correct
34 Correct 43 ms 58220 KB Output is correct
35 Correct 25 ms 47332 KB Output is correct
36 Correct 24 ms 47224 KB Output is correct
37 Correct 42 ms 58260 KB Output is correct
38 Correct 40 ms 58168 KB Output is correct
39 Correct 41 ms 58244 KB Output is correct
40 Correct 41 ms 58184 KB Output is correct
41 Correct 23 ms 47444 KB Output is correct
42 Correct 42 ms 58180 KB Output is correct
43 Correct 26 ms 47692 KB Output is correct
44 Correct 29 ms 47864 KB Output is correct
45 Correct 426 ms 92044 KB Output is correct
46 Correct 677 ms 108428 KB Output is correct
47 Correct 646 ms 108352 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 58168 KB Output is correct
2 Correct 40 ms 58176 KB Output is correct
3 Correct 25 ms 47328 KB Output is correct
4 Correct 45 ms 58216 KB Output is correct
5 Correct 46 ms 58204 KB Output is correct
6 Correct 24 ms 47324 KB Output is correct
7 Correct 25 ms 47320 KB Output is correct
8 Correct 23 ms 47284 KB Output is correct
9 Correct 373 ms 89672 KB Output is correct
10 Correct 54 ms 61168 KB Output is correct
11 Correct 115 ms 74768 KB Output is correct
12 Correct 62 ms 62852 KB Output is correct
13 Correct 59 ms 57316 KB Output is correct
14 Correct 24 ms 47412 KB Output is correct
15 Correct 24 ms 47588 KB Output is correct
16 Correct 347 ms 89628 KB Output is correct
17 Correct 39 ms 58148 KB Output is correct
18 Correct 40 ms 58220 KB Output is correct
19 Correct 42 ms 58268 KB Output is correct
20 Correct 43 ms 58216 KB Output is correct
21 Correct 28 ms 47260 KB Output is correct
22 Correct 48 ms 58168 KB Output is correct
23 Correct 1191 ms 133912 KB Output is correct
24 Correct 42 ms 58212 KB Output is correct
25 Correct 44 ms 58636 KB Output is correct
26 Correct 29 ms 47956 KB Output is correct
27 Correct 32 ms 48084 KB Output is correct
28 Correct 387 ms 88588 KB Output is correct
29 Correct 686 ms 103304 KB Output is correct
30 Correct 937 ms 119372 KB Output is correct
31 Correct 1161 ms 135548 KB Output is correct
32 Correct 41 ms 58176 KB Output is correct
33 Correct 44 ms 58216 KB Output is correct
34 Correct 43 ms 58220 KB Output is correct
35 Correct 25 ms 47332 KB Output is correct
36 Correct 24 ms 47224 KB Output is correct
37 Correct 42 ms 58260 KB Output is correct
38 Correct 40 ms 58168 KB Output is correct
39 Correct 41 ms 58244 KB Output is correct
40 Correct 41 ms 58184 KB Output is correct
41 Correct 23 ms 47444 KB Output is correct
42 Correct 42 ms 58180 KB Output is correct
43 Correct 26 ms 47692 KB Output is correct
44 Correct 29 ms 47864 KB Output is correct
45 Correct 426 ms 92044 KB Output is correct
46 Correct 677 ms 108428 KB Output is correct
47 Correct 646 ms 108352 KB Output is correct
48 Correct 41 ms 58168 KB Output is correct
49 Correct 41 ms 58168 KB Output is correct
50 Correct 41 ms 58216 KB Output is correct
51 Correct 48 ms 58248 KB Output is correct
52 Correct 44 ms 58228 KB Output is correct
53 Correct 51 ms 58228 KB Output is correct
54 Correct 44 ms 58168 KB Output is correct
55 Correct 1435 ms 140744 KB Output is correct
56 Correct 42 ms 58172 KB Output is correct
57 Correct 48 ms 58828 KB Output is correct
58 Correct 66 ms 60692 KB Output is correct
59 Correct 44 ms 49644 KB Output is correct
60 Correct 799 ms 99088 KB Output is correct
61 Correct 1094 ms 116108 KB Output is correct
62 Correct 1182 ms 126320 KB Output is correct
63 Correct 1490 ms 140224 KB Output is correct
64 Correct 30 ms 47324 KB Output is correct
65 Correct 53 ms 58236 KB Output is correct
66 Correct 25 ms 47304 KB Output is correct
67 Correct 935 ms 123580 KB Output is correct
68 Correct 973 ms 123460 KB Output is correct
69 Correct 1069 ms 123256 KB Output is correct
70 Correct 33 ms 48036 KB Output is correct
71 Correct 37 ms 48816 KB Output is correct
72 Correct 549 ms 91996 KB Output is correct
73 Correct 736 ms 110148 KB Output is correct
74 Correct 932 ms 126960 KB Output is correct
75 Correct 877 ms 125324 KB Output is correct
76 Correct 786 ms 123616 KB Output is correct
77 Correct 31 ms 48216 KB Output is correct
78 Correct 34 ms 49008 KB Output is correct
79 Correct 576 ms 92004 KB Output is correct
80 Correct 806 ms 110028 KB Output is correct
81 Correct 1102 ms 126008 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 58168 KB Output is correct
2 Correct 40 ms 58176 KB Output is correct
3 Correct 25 ms 47328 KB Output is correct
4 Correct 45 ms 58216 KB Output is correct
5 Correct 46 ms 58204 KB Output is correct
6 Correct 24 ms 47324 KB Output is correct
7 Correct 25 ms 47320 KB Output is correct
8 Correct 23 ms 47284 KB Output is correct
9 Correct 373 ms 89672 KB Output is correct
10 Correct 54 ms 61168 KB Output is correct
11 Correct 115 ms 74768 KB Output is correct
12 Correct 62 ms 62852 KB Output is correct
13 Correct 59 ms 57316 KB Output is correct
14 Correct 24 ms 47412 KB Output is correct
15 Correct 24 ms 47588 KB Output is correct
16 Correct 347 ms 89628 KB Output is correct
17 Correct 40 ms 58168 KB Output is correct
18 Correct 45 ms 58144 KB Output is correct
19 Correct 25 ms 47316 KB Output is correct
20 Correct 1177 ms 134016 KB Output is correct
21 Correct 1101 ms 132896 KB Output is correct
22 Correct 1179 ms 133264 KB Output is correct
23 Correct 823 ms 111444 KB Output is correct
24 Correct 498 ms 110808 KB Output is correct
25 Correct 492 ms 89968 KB Output is correct
26 Correct 504 ms 89956 KB Output is correct
27 Correct 817 ms 123524 KB Output is correct
28 Correct 743 ms 123640 KB Output is correct
29 Correct 806 ms 123512 KB Output is correct
30 Correct 727 ms 123712 KB Output is correct
31 Correct 40 ms 58176 KB Output is correct
32 Correct 81 ms 63152 KB Output is correct
33 Correct 231 ms 71972 KB Output is correct
34 Correct 1132 ms 136348 KB Output is correct
35 Correct 36 ms 49108 KB Output is correct
36 Correct 89 ms 56924 KB Output is correct
37 Correct 199 ms 66656 KB Output is correct
38 Correct 374 ms 86996 KB Output is correct
39 Correct 447 ms 96560 KB Output is correct
40 Correct 611 ms 108172 KB Output is correct
41 Correct 788 ms 119060 KB Output is correct
42 Correct 928 ms 128428 KB Output is correct
43 Correct 44 ms 58184 KB Output is correct
44 Correct 39 ms 58168 KB Output is correct
45 Correct 42 ms 58176 KB Output is correct
46 Correct 23 ms 47212 KB Output is correct
47 Correct 24 ms 47344 KB Output is correct
48 Correct 44 ms 58188 KB Output is correct
49 Correct 40 ms 58172 KB Output is correct
50 Correct 41 ms 58168 KB Output is correct
51 Correct 41 ms 58124 KB Output is correct
52 Correct 24 ms 47220 KB Output is correct
53 Correct 43 ms 58296 KB Output is correct
54 Correct 26 ms 47700 KB Output is correct
55 Correct 28 ms 47956 KB Output is correct
56 Correct 405 ms 91980 KB Output is correct
57 Correct 646 ms 108492 KB Output is correct
58 Correct 634 ms 108124 KB Output is correct
59 Correct 24 ms 47288 KB Output is correct
60 Correct 41 ms 58244 KB Output is correct
61 Correct 24 ms 47344 KB Output is correct
62 Correct 780 ms 123612 KB Output is correct
63 Correct 754 ms 123576 KB Output is correct
64 Correct 832 ms 123508 KB Output is correct
65 Correct 34 ms 48084 KB Output is correct
66 Correct 36 ms 48820 KB Output is correct
67 Correct 451 ms 91848 KB Output is correct
68 Correct 702 ms 110240 KB Output is correct
69 Correct 939 ms 126960 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 58168 KB Output is correct
2 Correct 40 ms 58176 KB Output is correct
3 Correct 25 ms 47328 KB Output is correct
4 Correct 45 ms 58216 KB Output is correct
5 Correct 46 ms 58204 KB Output is correct
6 Correct 24 ms 47324 KB Output is correct
7 Correct 25 ms 47320 KB Output is correct
8 Correct 23 ms 47284 KB Output is correct
9 Correct 373 ms 89672 KB Output is correct
10 Correct 54 ms 61168 KB Output is correct
11 Correct 115 ms 74768 KB Output is correct
12 Correct 62 ms 62852 KB Output is correct
13 Correct 59 ms 57316 KB Output is correct
14 Correct 24 ms 47412 KB Output is correct
15 Correct 24 ms 47588 KB Output is correct
16 Correct 347 ms 89628 KB Output is correct
17 Correct 948 ms 121276 KB Output is correct
18 Correct 938 ms 124040 KB Output is correct
19 Correct 1110 ms 136500 KB Output is correct
20 Correct 861 ms 125732 KB Output is correct
21 Correct 704 ms 116104 KB Output is correct
22 Correct 40 ms 58168 KB Output is correct
23 Correct 128 ms 69032 KB Output is correct
24 Correct 52 ms 50856 KB Output is correct
25 Correct 123 ms 60172 KB Output is correct
26 Correct 249 ms 70936 KB Output is correct
27 Correct 385 ms 92992 KB Output is correct
28 Correct 536 ms 101288 KB Output is correct
29 Correct 600 ms 112636 KB Output is correct
30 Correct 759 ms 120528 KB Output is correct
31 Correct 889 ms 128264 KB Output is correct
32 Correct 867 ms 125440 KB Output is correct
33 Correct 725 ms 123688 KB Output is correct
34 Correct 33 ms 48192 KB Output is correct
35 Correct 34 ms 48936 KB Output is correct
36 Correct 468 ms 91888 KB Output is correct
37 Correct 699 ms 110344 KB Output is correct
38 Correct 898 ms 126756 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 58168 KB Output is correct
2 Correct 40 ms 58176 KB Output is correct
3 Correct 25 ms 47328 KB Output is correct
4 Correct 45 ms 58216 KB Output is correct
5 Correct 46 ms 58204 KB Output is correct
6 Correct 24 ms 47324 KB Output is correct
7 Correct 25 ms 47320 KB Output is correct
8 Correct 23 ms 47284 KB Output is correct
9 Correct 373 ms 89672 KB Output is correct
10 Correct 54 ms 61168 KB Output is correct
11 Correct 115 ms 74768 KB Output is correct
12 Correct 62 ms 62852 KB Output is correct
13 Correct 59 ms 57316 KB Output is correct
14 Correct 24 ms 47412 KB Output is correct
15 Correct 24 ms 47588 KB Output is correct
16 Correct 347 ms 89628 KB Output is correct
17 Correct 39 ms 58148 KB Output is correct
18 Correct 40 ms 58220 KB Output is correct
19 Correct 42 ms 58268 KB Output is correct
20 Correct 43 ms 58216 KB Output is correct
21 Correct 28 ms 47260 KB Output is correct
22 Correct 48 ms 58168 KB Output is correct
23 Correct 1191 ms 133912 KB Output is correct
24 Correct 42 ms 58212 KB Output is correct
25 Correct 44 ms 58636 KB Output is correct
26 Correct 29 ms 47956 KB Output is correct
27 Correct 32 ms 48084 KB Output is correct
28 Correct 387 ms 88588 KB Output is correct
29 Correct 686 ms 103304 KB Output is correct
30 Correct 937 ms 119372 KB Output is correct
31 Correct 1161 ms 135548 KB Output is correct
32 Correct 41 ms 58176 KB Output is correct
33 Correct 44 ms 58216 KB Output is correct
34 Correct 43 ms 58220 KB Output is correct
35 Correct 25 ms 47332 KB Output is correct
36 Correct 24 ms 47224 KB Output is correct
37 Correct 42 ms 58260 KB Output is correct
38 Correct 40 ms 58168 KB Output is correct
39 Correct 41 ms 58244 KB Output is correct
40 Correct 41 ms 58184 KB Output is correct
41 Correct 23 ms 47444 KB Output is correct
42 Correct 42 ms 58180 KB Output is correct
43 Correct 26 ms 47692 KB Output is correct
44 Correct 29 ms 47864 KB Output is correct
45 Correct 426 ms 92044 KB Output is correct
46 Correct 677 ms 108428 KB Output is correct
47 Correct 646 ms 108352 KB Output is correct
48 Correct 41 ms 58168 KB Output is correct
49 Correct 41 ms 58168 KB Output is correct
50 Correct 41 ms 58216 KB Output is correct
51 Correct 48 ms 58248 KB Output is correct
52 Correct 44 ms 58228 KB Output is correct
53 Correct 51 ms 58228 KB Output is correct
54 Correct 44 ms 58168 KB Output is correct
55 Correct 1435 ms 140744 KB Output is correct
56 Correct 42 ms 58172 KB Output is correct
57 Correct 48 ms 58828 KB Output is correct
58 Correct 66 ms 60692 KB Output is correct
59 Correct 44 ms 49644 KB Output is correct
60 Correct 799 ms 99088 KB Output is correct
61 Correct 1094 ms 116108 KB Output is correct
62 Correct 1182 ms 126320 KB Output is correct
63 Correct 1490 ms 140224 KB Output is correct
64 Correct 30 ms 47324 KB Output is correct
65 Correct 53 ms 58236 KB Output is correct
66 Correct 25 ms 47304 KB Output is correct
67 Correct 935 ms 123580 KB Output is correct
68 Correct 973 ms 123460 KB Output is correct
69 Correct 1069 ms 123256 KB Output is correct
70 Correct 33 ms 48036 KB Output is correct
71 Correct 37 ms 48816 KB Output is correct
72 Correct 549 ms 91996 KB Output is correct
73 Correct 736 ms 110148 KB Output is correct
74 Correct 932 ms 126960 KB Output is correct
75 Correct 877 ms 125324 KB Output is correct
76 Correct 786 ms 123616 KB Output is correct
77 Correct 31 ms 48216 KB Output is correct
78 Correct 34 ms 49008 KB Output is correct
79 Correct 576 ms 92004 KB Output is correct
80 Correct 806 ms 110028 KB Output is correct
81 Correct 1102 ms 126008 KB Output is correct
82 Correct 40 ms 58168 KB Output is correct
83 Correct 45 ms 58144 KB Output is correct
84 Correct 25 ms 47316 KB Output is correct
85 Correct 1177 ms 134016 KB Output is correct
86 Correct 1101 ms 132896 KB Output is correct
87 Correct 1179 ms 133264 KB Output is correct
88 Correct 823 ms 111444 KB Output is correct
89 Correct 498 ms 110808 KB Output is correct
90 Correct 492 ms 89968 KB Output is correct
91 Correct 504 ms 89956 KB Output is correct
92 Correct 817 ms 123524 KB Output is correct
93 Correct 743 ms 123640 KB Output is correct
94 Correct 806 ms 123512 KB Output is correct
95 Correct 727 ms 123712 KB Output is correct
96 Correct 40 ms 58176 KB Output is correct
97 Correct 81 ms 63152 KB Output is correct
98 Correct 231 ms 71972 KB Output is correct
99 Correct 1132 ms 136348 KB Output is correct
100 Correct 36 ms 49108 KB Output is correct
101 Correct 89 ms 56924 KB Output is correct
102 Correct 199 ms 66656 KB Output is correct
103 Correct 374 ms 86996 KB Output is correct
104 Correct 447 ms 96560 KB Output is correct
105 Correct 611 ms 108172 KB Output is correct
106 Correct 788 ms 119060 KB Output is correct
107 Correct 928 ms 128428 KB Output is correct
108 Correct 44 ms 58184 KB Output is correct
109 Correct 39 ms 58168 KB Output is correct
110 Correct 42 ms 58176 KB Output is correct
111 Correct 23 ms 47212 KB Output is correct
112 Correct 24 ms 47344 KB Output is correct
113 Correct 44 ms 58188 KB Output is correct
114 Correct 40 ms 58172 KB Output is correct
115 Correct 41 ms 58168 KB Output is correct
116 Correct 41 ms 58124 KB Output is correct
117 Correct 24 ms 47220 KB Output is correct
118 Correct 43 ms 58296 KB Output is correct
119 Correct 26 ms 47700 KB Output is correct
120 Correct 28 ms 47956 KB Output is correct
121 Correct 405 ms 91980 KB Output is correct
122 Correct 646 ms 108492 KB Output is correct
123 Correct 634 ms 108124 KB Output is correct
124 Correct 24 ms 47288 KB Output is correct
125 Correct 41 ms 58244 KB Output is correct
126 Correct 24 ms 47344 KB Output is correct
127 Correct 780 ms 123612 KB Output is correct
128 Correct 754 ms 123576 KB Output is correct
129 Correct 832 ms 123508 KB Output is correct
130 Correct 34 ms 48084 KB Output is correct
131 Correct 36 ms 48820 KB Output is correct
132 Correct 451 ms 91848 KB Output is correct
133 Correct 702 ms 110240 KB Output is correct
134 Correct 939 ms 126960 KB Output is correct
135 Correct 948 ms 121276 KB Output is correct
136 Correct 938 ms 124040 KB Output is correct
137 Correct 1110 ms 136500 KB Output is correct
138 Correct 861 ms 125732 KB Output is correct
139 Correct 704 ms 116104 KB Output is correct
140 Correct 40 ms 58168 KB Output is correct
141 Correct 128 ms 69032 KB Output is correct
142 Correct 52 ms 50856 KB Output is correct
143 Correct 123 ms 60172 KB Output is correct
144 Correct 249 ms 70936 KB Output is correct
145 Correct 385 ms 92992 KB Output is correct
146 Correct 536 ms 101288 KB Output is correct
147 Correct 600 ms 112636 KB Output is correct
148 Correct 759 ms 120528 KB Output is correct
149 Correct 889 ms 128264 KB Output is correct
150 Correct 867 ms 125440 KB Output is correct
151 Correct 725 ms 123688 KB Output is correct
152 Correct 33 ms 48192 KB Output is correct
153 Correct 34 ms 48936 KB Output is correct
154 Correct 468 ms 91888 KB Output is correct
155 Correct 699 ms 110344 KB Output is correct
156 Correct 898 ms 126756 KB Output is correct
157 Correct 44 ms 58184 KB Output is correct
158 Correct 25 ms 47316 KB Output is correct
159 Correct 43 ms 58184 KB Output is correct
160 Correct 42 ms 58156 KB Output is correct
161 Correct 1300 ms 150488 KB Output is correct
162 Correct 1131 ms 135436 KB Output is correct
163 Correct 1218 ms 135548 KB Output is correct
164 Correct 1323 ms 134544 KB Output is correct
165 Correct 1324 ms 145396 KB Output is correct
166 Correct 1352 ms 149932 KB Output is correct
167 Correct 213 ms 77696 KB Output is correct
168 Correct 98 ms 55928 KB Output is correct
169 Correct 265 ms 69000 KB Output is correct
170 Correct 630 ms 88640 KB Output is correct
171 Correct 871 ms 108916 KB Output is correct
172 Correct 539 ms 104388 KB Output is correct
173 Correct 706 ms 112064 KB Output is correct
174 Correct 810 ms 120108 KB Output is correct
175 Correct 953 ms 128468 KB Output is correct
176 Correct 1107 ms 142560 KB Output is correct
177 Correct 1287 ms 151368 KB Output is correct