oj.uz

답안 #565375

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565375 2022-05-20T19:27:55 Z kartel 분수 공원 (IOI21_parks) C++17
100 / 100
 2846 ms 196596 KB 
#include <bits/stdc++.h>
//#include "grader.cpp"
#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;
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);
}

void get_erased_2x2(vector <int> &x, vector <int> &y, map<pair <int, int>, int> &del) {
    map <pair <int, int>, int> cnt, who;
    vector <pair <int, int> > pts;

    for (int i = 0; i < sz(x); i++) {
        who[{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[{cx, cy}]++;
            if (cnt[{cx, cy}] == 4) {
                pts.pb({cx, cy});
            }
        }
    }
    sort(all(pts));
    cnt.clear();
    int ptr = 0;
    for (auto &[x, y] : pts) {
        cnt[{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.count({cx, cy})) {
                continue;
            }
            g[cnt[{cx, cy}]].pb(ptr);
        }
        ptr++;
    }

    for (int i = 0; i < sz(pts); i++) {
        if (mk[i]) {
            continue;
        }
        function <void(int)> dfs = [&](int v) {
            mk[v] = 1;
            for (auto u : g[v]) {
                if (mk[u]) {
                    continue;
                }
                dfs(u);
                int dx = pts[v].F - pts[u].F;
                int dy = pts[v].S - pts[u].S;
                block[u] = road[{dx, dy}];
            }
        };

        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}];
        }
        dfs(i);
    }

    for (int i = 0; i < sz(pts); i++) {
        auto [x, y] = pts[i];

        auto [a, b] = block[i];
        int v = who[{x + dsteps[a][0], y + dsteps[a][1]}];
        int u = who[{x + dsteps[b][0], y + dsteps[b][1]}];

        del[{v, u}] = del[{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};

    map <pair <int, int>, int> mp;
    vector <pair <int, int> > r;
    map <pair <int, int>, 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[{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.count({cx, cy}) && f(i) != f(mp[{cx, cy}])) {
                int to = mp[{cx, cy}];
                if (del[{i, to}]) {
                    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;
    map <pair <int, int>, 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[{lx - 1, ly + 1}].pb(i);
            e[{lx + 1, ly + 1}].pb(nt(i));
        } else {
            int lx = min(x[a], x[b]);
            int ly = y[a];

            e[{lx + 1, ly + 1}].pb(i);
            e[{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) {
        int x = p.F, y = p.S;
        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;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:206:13: warning: unused variable 'x' [-Wunused-variable]
  206 |         int x = p.F, y = p.S;
      |             ^
parks.cpp:206:22: warning: unused variable 'y' [-Wunused-variable]
  206 |         int x = p.F, y = p.S;
      |                      ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 58212 KB Output is correct
2 Correct 40 ms 58180 KB Output is correct
3 Correct 22 ms 47224 KB Output is correct
4 Correct 41 ms 58248 KB Output is correct
5 Correct 40 ms 58216 KB Output is correct
6 Correct 27 ms 47316 KB Output is correct
7 Correct 24 ms 47316 KB Output is correct
8 Correct 24 ms 47316 KB Output is correct
9 Correct 728 ms 101280 KB Output is correct
10 Correct 81 ms 62604 KB Output is correct
11 Correct 304 ms 81112 KB Output is correct
12 Correct 105 ms 64724 KB Output is correct
13 Correct 181 ms 59448 KB Output is correct
14 Correct 25 ms 47540 KB Output is correct
15 Correct 27 ms 47868 KB Output is correct
16 Correct 744 ms 101128 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 58212 KB Output is correct
2 Correct 40 ms 58180 KB Output is correct
3 Correct 22 ms 47224 KB Output is correct
4 Correct 41 ms 58248 KB Output is correct
5 Correct 40 ms 58216 KB Output is correct
6 Correct 27 ms 47316 KB Output is correct
7 Correct 24 ms 47316 KB Output is correct
8 Correct 24 ms 47316 KB Output is correct
9 Correct 728 ms 101280 KB Output is correct
10 Correct 81 ms 62604 KB Output is correct
11 Correct 304 ms 81112 KB Output is correct
12 Correct 105 ms 64724 KB Output is correct
13 Correct 181 ms 59448 KB Output is correct
14 Correct 25 ms 47540 KB Output is correct
15 Correct 27 ms 47868 KB Output is correct
16 Correct 744 ms 101128 KB Output is correct
17 Correct 40 ms 58168 KB Output is correct
18 Correct 42 ms 58192 KB Output is correct
19 Correct 42 ms 58180 KB Output is correct
20 Correct 44 ms 58216 KB Output is correct
21 Correct 23 ms 47316 KB Output is correct
22 Correct 42 ms 58208 KB Output is correct
23 Correct 2537 ms 157472 KB Output is correct
24 Correct 41 ms 58240 KB Output is correct
25 Correct 47 ms 58680 KB Output is correct
26 Correct 37 ms 48084 KB Output is correct
27 Correct 38 ms 48340 KB Output is correct
28 Correct 773 ms 97408 KB Output is correct
29 Correct 1318 ms 117492 KB Output is correct
30 Correct 1938 ms 136796 KB Output is correct
31 Correct 2458 ms 157232 KB Output is correct
32 Correct 41 ms 58168 KB Output is correct
33 Correct 42 ms 58176 KB Output is correct
34 Correct 40 ms 58228 KB Output is correct
35 Correct 23 ms 47300 KB Output is correct
36 Correct 24 ms 47256 KB Output is correct
37 Correct 42 ms 58144 KB Output is correct
38 Correct 44 ms 58200 KB Output is correct
39 Correct 41 ms 58168 KB Output is correct
40 Correct 43 ms 58212 KB Output is correct
41 Correct 25 ms 47316 KB Output is correct
42 Correct 49 ms 58132 KB Output is correct
43 Correct 27 ms 47820 KB Output is correct
44 Correct 30 ms 48080 KB Output is correct
45 Correct 827 ms 101748 KB Output is correct
46 Correct 1347 ms 121344 KB Output is correct
47 Correct 1247 ms 121036 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 58212 KB Output is correct
2 Correct 40 ms 58180 KB Output is correct
3 Correct 22 ms 47224 KB Output is correct
4 Correct 41 ms 58248 KB Output is correct
5 Correct 40 ms 58216 KB Output is correct
6 Correct 27 ms 47316 KB Output is correct
7 Correct 24 ms 47316 KB Output is correct
8 Correct 24 ms 47316 KB Output is correct
9 Correct 728 ms 101280 KB Output is correct
10 Correct 81 ms 62604 KB Output is correct
11 Correct 304 ms 81112 KB Output is correct
12 Correct 105 ms 64724 KB Output is correct
13 Correct 181 ms 59448 KB Output is correct
14 Correct 25 ms 47540 KB Output is correct
15 Correct 27 ms 47868 KB Output is correct
16 Correct 744 ms 101128 KB Output is correct
17 Correct 40 ms 58168 KB Output is correct
18 Correct 42 ms 58192 KB Output is correct
19 Correct 42 ms 58180 KB Output is correct
20 Correct 44 ms 58216 KB Output is correct
21 Correct 23 ms 47316 KB Output is correct
22 Correct 42 ms 58208 KB Output is correct
23 Correct 2537 ms 157472 KB Output is correct
24 Correct 41 ms 58240 KB Output is correct
25 Correct 47 ms 58680 KB Output is correct
26 Correct 37 ms 48084 KB Output is correct
27 Correct 38 ms 48340 KB Output is correct
28 Correct 773 ms 97408 KB Output is correct
29 Correct 1318 ms 117492 KB Output is correct
30 Correct 1938 ms 136796 KB Output is correct
31 Correct 2458 ms 157232 KB Output is correct
32 Correct 41 ms 58168 KB Output is correct
33 Correct 42 ms 58176 KB Output is correct
34 Correct 40 ms 58228 KB Output is correct
35 Correct 23 ms 47300 KB Output is correct
36 Correct 24 ms 47256 KB Output is correct
37 Correct 42 ms 58144 KB Output is correct
38 Correct 44 ms 58200 KB Output is correct
39 Correct 41 ms 58168 KB Output is correct
40 Correct 43 ms 58212 KB Output is correct
41 Correct 25 ms 47316 KB Output is correct
42 Correct 49 ms 58132 KB Output is correct
43 Correct 27 ms 47820 KB Output is correct
44 Correct 30 ms 48080 KB Output is correct
45 Correct 827 ms 101748 KB Output is correct
46 Correct 1347 ms 121344 KB Output is correct
47 Correct 1247 ms 121036 KB Output is correct
48 Correct 40 ms 58168 KB Output is correct
49 Correct 41 ms 58128 KB Output is correct
50 Correct 46 ms 58192 KB Output is correct
51 Correct 40 ms 58200 KB Output is correct
52 Correct 42 ms 58380 KB Output is correct
53 Correct 40 ms 58168 KB Output is correct
54 Correct 40 ms 58152 KB Output is correct
55 Correct 2651 ms 181184 KB Output is correct
56 Correct 44 ms 58192 KB Output is correct
57 Correct 49 ms 59248 KB Output is correct
58 Correct 76 ms 61836 KB Output is correct
59 Correct 66 ms 50572 KB Output is correct
60 Correct 1103 ms 119292 KB Output is correct
61 Correct 1669 ms 139792 KB Output is correct
62 Correct 1974 ms 158356 KB Output is correct
63 Correct 2595 ms 180844 KB Output is correct
64 Correct 22 ms 47316 KB Output is correct
65 Correct 41 ms 58188 KB Output is correct
66 Correct 22 ms 47316 KB Output is correct
67 Correct 1606 ms 144040 KB Output is correct
68 Correct 1620 ms 144048 KB Output is correct
69 Correct 1570 ms 143700 KB Output is correct
70 Correct 31 ms 48396 KB Output is correct
71 Correct 45 ms 49424 KB Output is correct
72 Correct 842 ms 102124 KB Output is correct
73 Correct 1330 ms 124620 KB Output is correct
74 Correct 1926 ms 146716 KB Output is correct
75 Correct 1834 ms 145960 KB Output is correct
76 Correct 1668 ms 144172 KB Output is correct
77 Correct 37 ms 48588 KB Output is correct
78 Correct 49 ms 49664 KB Output is correct
79 Correct 784 ms 102128 KB Output is correct
80 Correct 1317 ms 124484 KB Output is correct
81 Correct 1902 ms 146656 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 58212 KB Output is correct
2 Correct 40 ms 58180 KB Output is correct
3 Correct 22 ms 47224 KB Output is correct
4 Correct 41 ms 58248 KB Output is correct
5 Correct 40 ms 58216 KB Output is correct
6 Correct 27 ms 47316 KB Output is correct
7 Correct 24 ms 47316 KB Output is correct
8 Correct 24 ms 47316 KB Output is correct
9 Correct 728 ms 101280 KB Output is correct
10 Correct 81 ms 62604 KB Output is correct
11 Correct 304 ms 81112 KB Output is correct
12 Correct 105 ms 64724 KB Output is correct
13 Correct 181 ms 59448 KB Output is correct
14 Correct 25 ms 47540 KB Output is correct
15 Correct 27 ms 47868 KB Output is correct
16 Correct 744 ms 101128 KB Output is correct
17 Correct 39 ms 58304 KB Output is correct
18 Correct 41 ms 58196 KB Output is correct
19 Correct 24 ms 47284 KB Output is correct
20 Correct 1832 ms 157012 KB Output is correct
21 Correct 1866 ms 154032 KB Output is correct
22 Correct 1801 ms 153396 KB Output is correct
23 Correct 1351 ms 131952 KB Output is correct
24 Correct 1064 ms 127284 KB Output is correct
25 Correct 1464 ms 102208 KB Output is correct
26 Correct 1266 ms 102332 KB Output is correct
27 Correct 1687 ms 143396 KB Output is correct
28 Correct 1658 ms 144016 KB Output is correct
29 Correct 1842 ms 144244 KB Output is correct
30 Correct 1863 ms 144080 KB Output is correct
31 Correct 41 ms 58184 KB Output is correct
32 Correct 111 ms 64608 KB Output is correct
33 Correct 379 ms 80892 KB Output is correct
34 Correct 1732 ms 156948 KB Output is correct
35 Correct 58 ms 49996 KB Output is correct
36 Correct 238 ms 60416 KB Output is correct
37 Correct 573 ms 72848 KB Output is correct
38 Correct 636 ms 93876 KB Output is correct
39 Correct 947 ms 107252 KB Output is correct
40 Correct 1296 ms 119440 KB Output is correct
41 Correct 1646 ms 134060 KB Output is correct
42 Correct 2045 ms 147352 KB Output is correct
43 Correct 40 ms 58176 KB Output is correct
44 Correct 39 ms 58212 KB Output is correct
45 Correct 41 ms 58176 KB Output is correct
46 Correct 23 ms 47316 KB Output is correct
47 Correct 24 ms 47224 KB Output is correct
48 Correct 40 ms 58168 KB Output is correct
49 Correct 40 ms 58164 KB Output is correct
50 Correct 41 ms 58144 KB Output is correct
51 Correct 42 ms 58148 KB Output is correct
52 Correct 23 ms 47252 KB Output is correct
53 Correct 40 ms 58148 KB Output is correct
54 Correct 27 ms 47828 KB Output is correct
55 Correct 30 ms 48064 KB Output is correct
56 Correct 853 ms 101820 KB Output is correct
57 Correct 1258 ms 121108 KB Output is correct
58 Correct 1268 ms 121216 KB Output is correct
59 Correct 22 ms 47316 KB Output is correct
60 Correct 40 ms 58196 KB Output is correct
61 Correct 22 ms 47280 KB Output is correct
62 Correct 1621 ms 144076 KB Output is correct
63 Correct 1588 ms 144128 KB Output is correct
64 Correct 1591 ms 143760 KB Output is correct
65 Correct 32 ms 48304 KB Output is correct
66 Correct 45 ms 49420 KB Output is correct
67 Correct 824 ms 102148 KB Output is correct
68 Correct 1336 ms 124408 KB Output is correct
69 Correct 1913 ms 146148 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 58212 KB Output is correct
2 Correct 40 ms 58180 KB Output is correct
3 Correct 22 ms 47224 KB Output is correct
4 Correct 41 ms 58248 KB Output is correct
5 Correct 40 ms 58216 KB Output is correct
6 Correct 27 ms 47316 KB Output is correct
7 Correct 24 ms 47316 KB Output is correct
8 Correct 24 ms 47316 KB Output is correct
9 Correct 728 ms 101280 KB Output is correct
10 Correct 81 ms 62604 KB Output is correct
11 Correct 304 ms 81112 KB Output is correct
12 Correct 105 ms 64724 KB Output is correct
13 Correct 181 ms 59448 KB Output is correct
14 Correct 25 ms 47540 KB Output is correct
15 Correct 27 ms 47868 KB Output is correct
16 Correct 744 ms 101128 KB Output is correct
17 Correct 1624 ms 144784 KB Output is correct
18 Correct 1645 ms 144896 KB Output is correct
19 Correct 1888 ms 156344 KB Output is correct
20 Correct 1854 ms 145100 KB Output is correct
21 Correct 1593 ms 134192 KB Output is correct
22 Correct 41 ms 58216 KB Output is correct
23 Correct 219 ms 72352 KB Output is correct
24 Correct 91 ms 52292 KB Output is correct
25 Correct 358 ms 64360 KB Output is correct
26 Correct 714 ms 76560 KB Output is correct
27 Correct 837 ms 102888 KB Output is correct
28 Correct 1086 ms 113488 KB Output is correct
29 Correct 1370 ms 125952 KB Output is correct
30 Correct 1675 ms 134952 KB Output is correct
31 Correct 1945 ms 147796 KB Output is correct
32 Correct 1774 ms 145736 KB Output is correct
33 Correct 1628 ms 144004 KB Output is correct
34 Correct 36 ms 48588 KB Output is correct
35 Correct 48 ms 49684 KB Output is correct
36 Correct 790 ms 101696 KB Output is correct
37 Correct 1339 ms 124984 KB Output is correct
38 Correct 1914 ms 146280 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 58212 KB Output is correct
2 Correct 40 ms 58180 KB Output is correct
3 Correct 22 ms 47224 KB Output is correct
4 Correct 41 ms 58248 KB Output is correct
5 Correct 40 ms 58216 KB Output is correct
6 Correct 27 ms 47316 KB Output is correct
7 Correct 24 ms 47316 KB Output is correct
8 Correct 24 ms 47316 KB Output is correct
9 Correct 728 ms 101280 KB Output is correct
10 Correct 81 ms 62604 KB Output is correct
11 Correct 304 ms 81112 KB Output is correct
12 Correct 105 ms 64724 KB Output is correct
13 Correct 181 ms 59448 KB Output is correct
14 Correct 25 ms 47540 KB Output is correct
15 Correct 27 ms 47868 KB Output is correct
16 Correct 744 ms 101128 KB Output is correct
17 Correct 40 ms 58168 KB Output is correct
18 Correct 42 ms 58192 KB Output is correct
19 Correct 42 ms 58180 KB Output is correct
20 Correct 44 ms 58216 KB Output is correct
21 Correct 23 ms 47316 KB Output is correct
22 Correct 42 ms 58208 KB Output is correct
23 Correct 2537 ms 157472 KB Output is correct
24 Correct 41 ms 58240 KB Output is correct
25 Correct 47 ms 58680 KB Output is correct
26 Correct 37 ms 48084 KB Output is correct
27 Correct 38 ms 48340 KB Output is correct
28 Correct 773 ms 97408 KB Output is correct
29 Correct 1318 ms 117492 KB Output is correct
30 Correct 1938 ms 136796 KB Output is correct
31 Correct 2458 ms 157232 KB Output is correct
32 Correct 41 ms 58168 KB Output is correct
33 Correct 42 ms 58176 KB Output is correct
34 Correct 40 ms 58228 KB Output is correct
35 Correct 23 ms 47300 KB Output is correct
36 Correct 24 ms 47256 KB Output is correct
37 Correct 42 ms 58144 KB Output is correct
38 Correct 44 ms 58200 KB Output is correct
39 Correct 41 ms 58168 KB Output is correct
40 Correct 43 ms 58212 KB Output is correct
41 Correct 25 ms 47316 KB Output is correct
42 Correct 49 ms 58132 KB Output is correct
43 Correct 27 ms 47820 KB Output is correct
44 Correct 30 ms 48080 KB Output is correct
45 Correct 827 ms 101748 KB Output is correct
46 Correct 1347 ms 121344 KB Output is correct
47 Correct 1247 ms 121036 KB Output is correct
48 Correct 40 ms 58168 KB Output is correct
49 Correct 41 ms 58128 KB Output is correct
50 Correct 46 ms 58192 KB Output is correct
51 Correct 40 ms 58200 KB Output is correct
52 Correct 42 ms 58380 KB Output is correct
53 Correct 40 ms 58168 KB Output is correct
54 Correct 40 ms 58152 KB Output is correct
55 Correct 2651 ms 181184 KB Output is correct
56 Correct 44 ms 58192 KB Output is correct
57 Correct 49 ms 59248 KB Output is correct
58 Correct 76 ms 61836 KB Output is correct
59 Correct 66 ms 50572 KB Output is correct
60 Correct 1103 ms 119292 KB Output is correct
61 Correct 1669 ms 139792 KB Output is correct
62 Correct 1974 ms 158356 KB Output is correct
63 Correct 2595 ms 180844 KB Output is correct
64 Correct 22 ms 47316 KB Output is correct
65 Correct 41 ms 58188 KB Output is correct
66 Correct 22 ms 47316 KB Output is correct
67 Correct 1606 ms 144040 KB Output is correct
68 Correct 1620 ms 144048 KB Output is correct
69 Correct 1570 ms 143700 KB Output is correct
70 Correct 31 ms 48396 KB Output is correct
71 Correct 45 ms 49424 KB Output is correct
72 Correct 842 ms 102124 KB Output is correct
73 Correct 1330 ms 124620 KB Output is correct
74 Correct 1926 ms 146716 KB Output is correct
75 Correct 1834 ms 145960 KB Output is correct
76 Correct 1668 ms 144172 KB Output is correct
77 Correct 37 ms 48588 KB Output is correct
78 Correct 49 ms 49664 KB Output is correct
79 Correct 784 ms 102128 KB Output is correct
80 Correct 1317 ms 124484 KB Output is correct
81 Correct 1902 ms 146656 KB Output is correct
82 Correct 39 ms 58304 KB Output is correct
83 Correct 41 ms 58196 KB Output is correct
84 Correct 24 ms 47284 KB Output is correct
85 Correct 1832 ms 157012 KB Output is correct
86 Correct 1866 ms 154032 KB Output is correct
87 Correct 1801 ms 153396 KB Output is correct
88 Correct 1351 ms 131952 KB Output is correct
89 Correct 1064 ms 127284 KB Output is correct
90 Correct 1464 ms 102208 KB Output is correct
91 Correct 1266 ms 102332 KB Output is correct
92 Correct 1687 ms 143396 KB Output is correct
93 Correct 1658 ms 144016 KB Output is correct
94 Correct 1842 ms 144244 KB Output is correct
95 Correct 1863 ms 144080 KB Output is correct
96 Correct 41 ms 58184 KB Output is correct
97 Correct 111 ms 64608 KB Output is correct
98 Correct 379 ms 80892 KB Output is correct
99 Correct 1732 ms 156948 KB Output is correct
100 Correct 58 ms 49996 KB Output is correct
101 Correct 238 ms 60416 KB Output is correct
102 Correct 573 ms 72848 KB Output is correct
103 Correct 636 ms 93876 KB Output is correct
104 Correct 947 ms 107252 KB Output is correct
105 Correct 1296 ms 119440 KB Output is correct
106 Correct 1646 ms 134060 KB Output is correct
107 Correct 2045 ms 147352 KB Output is correct
108 Correct 40 ms 58176 KB Output is correct
109 Correct 39 ms 58212 KB Output is correct
110 Correct 41 ms 58176 KB Output is correct
111 Correct 23 ms 47316 KB Output is correct
112 Correct 24 ms 47224 KB Output is correct
113 Correct 40 ms 58168 KB Output is correct
114 Correct 40 ms 58164 KB Output is correct
115 Correct 41 ms 58144 KB Output is correct
116 Correct 42 ms 58148 KB Output is correct
117 Correct 23 ms 47252 KB Output is correct
118 Correct 40 ms 58148 KB Output is correct
119 Correct 27 ms 47828 KB Output is correct
120 Correct 30 ms 48064 KB Output is correct
121 Correct 853 ms 101820 KB Output is correct
122 Correct 1258 ms 121108 KB Output is correct
123 Correct 1268 ms 121216 KB Output is correct
124 Correct 22 ms 47316 KB Output is correct
125 Correct 40 ms 58196 KB Output is correct
126 Correct 22 ms 47280 KB Output is correct
127 Correct 1621 ms 144076 KB Output is correct
128 Correct 1588 ms 144128 KB Output is correct
129 Correct 1591 ms 143760 KB Output is correct
130 Correct 32 ms 48304 KB Output is correct
131 Correct 45 ms 49420 KB Output is correct
132 Correct 824 ms 102148 KB Output is correct
133 Correct 1336 ms 124408 KB Output is correct
134 Correct 1913 ms 146148 KB Output is correct
135 Correct 1624 ms 144784 KB Output is correct
136 Correct 1645 ms 144896 KB Output is correct
137 Correct 1888 ms 156344 KB Output is correct
138 Correct 1854 ms 145100 KB Output is correct
139 Correct 1593 ms 134192 KB Output is correct
140 Correct 41 ms 58216 KB Output is correct
141 Correct 219 ms 72352 KB Output is correct
142 Correct 91 ms 52292 KB Output is correct
143 Correct 358 ms 64360 KB Output is correct
144 Correct 714 ms 76560 KB Output is correct
145 Correct 837 ms 102888 KB Output is correct
146 Correct 1086 ms 113488 KB Output is correct
147 Correct 1370 ms 125952 KB Output is correct
148 Correct 1675 ms 134952 KB Output is correct
149 Correct 1945 ms 147796 KB Output is correct
150 Correct 1774 ms 145736 KB Output is correct
151 Correct 1628 ms 144004 KB Output is correct
152 Correct 36 ms 48588 KB Output is correct
153 Correct 48 ms 49684 KB Output is correct
154 Correct 790 ms 101696 KB Output is correct
155 Correct 1339 ms 124984 KB Output is correct
156 Correct 1914 ms 146280 KB Output is correct
157 Correct 42 ms 58168 KB Output is correct
158 Correct 22 ms 47260 KB Output is correct
159 Correct 41 ms 58204 KB Output is correct
160 Correct 42 ms 58200 KB Output is correct
161 Correct 2846 ms 196596 KB Output is correct
162 Correct 1786 ms 159308 KB Output is correct
163 Correct 2029 ms 156700 KB Output is correct
164 Correct 2075 ms 155944 KB Output is correct
165 Correct 2518 ms 179800 KB Output is correct
166 Correct 2694 ms 185132 KB Output is correct
167 Correct 431 ms 83756 KB Output is correct
168 Correct 197 ms 59712 KB Output is correct
169 Correct 652 ms 78456 KB Output is correct
170 Correct 1476 ms 105600 KB Output is correct
171 Correct 2043 ms 122428 KB Output is correct
172 Correct 1165 ms 123104 KB Output is correct
173 Correct 1434 ms 136108 KB Output is correct
174 Correct 1786 ms 149336 KB Output is correct
175 Correct 2111 ms 161544 KB Output is correct
176 Correct 2413 ms 176036 KB Output is correct
177 Correct 2704 ms 189080 KB Output is correct