oj.uz

답안 #566533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566533 2022-05-22T11:34:52 Z kartel 분수 공원 (IOI21_parks) C++17
100 / 100
 1673 ms 148996 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}};

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

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

    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;
    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 40 ms 58200 KB Output is correct
2 Correct 40 ms 58196 KB Output is correct
3 Correct 24 ms 47284 KB Output is correct
4 Correct 42 ms 58232 KB Output is correct
5 Correct 49 ms 58152 KB Output is correct
6 Correct 23 ms 47244 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 24 ms 47264 KB Output is correct
9 Correct 363 ms 89660 KB Output is correct
10 Correct 50 ms 61228 KB Output is correct
11 Correct 117 ms 74712 KB Output is correct
12 Correct 65 ms 62708 KB Output is correct
13 Correct 65 ms 57384 KB Output is correct
14 Correct 26 ms 47480 KB Output is correct
15 Correct 29 ms 47684 KB Output is correct
16 Correct 378 ms 89720 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 58200 KB Output is correct
2 Correct 40 ms 58196 KB Output is correct
3 Correct 24 ms 47284 KB Output is correct
4 Correct 42 ms 58232 KB Output is correct
5 Correct 49 ms 58152 KB Output is correct
6 Correct 23 ms 47244 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 24 ms 47264 KB Output is correct
9 Correct 363 ms 89660 KB Output is correct
10 Correct 50 ms 61228 KB Output is correct
11 Correct 117 ms 74712 KB Output is correct
12 Correct 65 ms 62708 KB Output is correct
13 Correct 65 ms 57384 KB Output is correct
14 Correct 26 ms 47480 KB Output is correct
15 Correct 29 ms 47684 KB Output is correct
16 Correct 378 ms 89720 KB Output is correct
17 Correct 40 ms 58168 KB Output is correct
18 Correct 41 ms 58192 KB Output is correct
19 Correct 48 ms 58144 KB Output is correct
20 Correct 45 ms 58136 KB Output is correct
21 Correct 25 ms 47316 KB Output is correct
22 Correct 41 ms 58152 KB Output is correct
23 Correct 1400 ms 133996 KB Output is correct
24 Correct 42 ms 58180 KB Output is correct
25 Correct 44 ms 58656 KB Output is correct
26 Correct 32 ms 47884 KB Output is correct
27 Correct 28 ms 48084 KB Output is correct
28 Correct 359 ms 88080 KB Output is correct
29 Correct 699 ms 102248 KB Output is correct
30 Correct 1049 ms 118324 KB Output is correct
31 Correct 1345 ms 133964 KB Output is correct
32 Correct 41 ms 58204 KB Output is correct
33 Correct 41 ms 58224 KB Output is correct
34 Correct 40 ms 58212 KB Output is correct
35 Correct 24 ms 47316 KB Output is correct
36 Correct 23 ms 47316 KB Output is correct
37 Correct 44 ms 58192 KB Output is correct
38 Correct 40 ms 58228 KB Output is correct
39 Correct 41 ms 58164 KB Output is correct
40 Correct 42 ms 58200 KB Output is correct
41 Correct 24 ms 47344 KB Output is correct
42 Correct 46 ms 58244 KB Output is correct
43 Correct 28 ms 47700 KB Output is correct
44 Correct 27 ms 47876 KB Output is correct
45 Correct 405 ms 91108 KB Output is correct
46 Correct 701 ms 107100 KB Output is correct
47 Correct 725 ms 107152 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 58200 KB Output is correct
2 Correct 40 ms 58196 KB Output is correct
3 Correct 24 ms 47284 KB Output is correct
4 Correct 42 ms 58232 KB Output is correct
5 Correct 49 ms 58152 KB Output is correct
6 Correct 23 ms 47244 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 24 ms 47264 KB Output is correct
9 Correct 363 ms 89660 KB Output is correct
10 Correct 50 ms 61228 KB Output is correct
11 Correct 117 ms 74712 KB Output is correct
12 Correct 65 ms 62708 KB Output is correct
13 Correct 65 ms 57384 KB Output is correct
14 Correct 26 ms 47480 KB Output is correct
15 Correct 29 ms 47684 KB Output is correct
16 Correct 378 ms 89720 KB Output is correct
17 Correct 40 ms 58168 KB Output is correct
18 Correct 41 ms 58192 KB Output is correct
19 Correct 48 ms 58144 KB Output is correct
20 Correct 45 ms 58136 KB Output is correct
21 Correct 25 ms 47316 KB Output is correct
22 Correct 41 ms 58152 KB Output is correct
23 Correct 1400 ms 133996 KB Output is correct
24 Correct 42 ms 58180 KB Output is correct
25 Correct 44 ms 58656 KB Output is correct
26 Correct 32 ms 47884 KB Output is correct
27 Correct 28 ms 48084 KB Output is correct
28 Correct 359 ms 88080 KB Output is correct
29 Correct 699 ms 102248 KB Output is correct
30 Correct 1049 ms 118324 KB Output is correct
31 Correct 1345 ms 133964 KB Output is correct
32 Correct 41 ms 58204 KB Output is correct
33 Correct 41 ms 58224 KB Output is correct
34 Correct 40 ms 58212 KB Output is correct
35 Correct 24 ms 47316 KB Output is correct
36 Correct 23 ms 47316 KB Output is correct
37 Correct 44 ms 58192 KB Output is correct
38 Correct 40 ms 58228 KB Output is correct
39 Correct 41 ms 58164 KB Output is correct
40 Correct 42 ms 58200 KB Output is correct
41 Correct 24 ms 47344 KB Output is correct
42 Correct 46 ms 58244 KB Output is correct
43 Correct 28 ms 47700 KB Output is correct
44 Correct 27 ms 47876 KB Output is correct
45 Correct 405 ms 91108 KB Output is correct
46 Correct 701 ms 107100 KB Output is correct
47 Correct 725 ms 107152 KB Output is correct
48 Correct 42 ms 58168 KB Output is correct
49 Correct 42 ms 58220 KB Output is correct
50 Correct 42 ms 58152 KB Output is correct
51 Correct 41 ms 58148 KB Output is correct
52 Correct 48 ms 58240 KB Output is correct
53 Correct 42 ms 58168 KB Output is correct
54 Correct 43 ms 58224 KB Output is correct
55 Correct 1555 ms 139340 KB Output is correct
56 Correct 44 ms 58260 KB Output is correct
57 Correct 57 ms 58900 KB Output is correct
58 Correct 58 ms 60624 KB Output is correct
59 Correct 41 ms 49576 KB Output is correct
60 Correct 582 ms 98684 KB Output is correct
61 Correct 911 ms 115408 KB Output is correct
62 Correct 1146 ms 124988 KB Output is correct
63 Correct 1532 ms 139212 KB Output is correct
64 Correct 28 ms 47308 KB Output is correct
65 Correct 42 ms 58200 KB Output is correct
66 Correct 24 ms 47328 KB Output is correct
67 Correct 1037 ms 122000 KB Output is correct
68 Correct 1008 ms 122028 KB Output is correct
69 Correct 992 ms 121600 KB Output is correct
70 Correct 27 ms 47956 KB Output is correct
71 Correct 32 ms 48724 KB Output is correct
72 Correct 447 ms 91264 KB Output is correct
73 Correct 726 ms 109176 KB Output is correct
74 Correct 1081 ms 125488 KB Output is correct
75 Correct 1029 ms 123552 KB Output is correct
76 Correct 968 ms 121992 KB Output is correct
77 Correct 29 ms 48152 KB Output is correct
78 Correct 34 ms 48936 KB Output is correct
79 Correct 407 ms 91128 KB Output is correct
80 Correct 719 ms 108828 KB Output is correct
81 Correct 1083 ms 124436 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 58200 KB Output is correct
2 Correct 40 ms 58196 KB Output is correct
3 Correct 24 ms 47284 KB Output is correct
4 Correct 42 ms 58232 KB Output is correct
5 Correct 49 ms 58152 KB Output is correct
6 Correct 23 ms 47244 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 24 ms 47264 KB Output is correct
9 Correct 363 ms 89660 KB Output is correct
10 Correct 50 ms 61228 KB Output is correct
11 Correct 117 ms 74712 KB Output is correct
12 Correct 65 ms 62708 KB Output is correct
13 Correct 65 ms 57384 KB Output is correct
14 Correct 26 ms 47480 KB Output is correct
15 Correct 29 ms 47684 KB Output is correct
16 Correct 378 ms 89720 KB Output is correct
17 Correct 40 ms 58136 KB Output is correct
18 Correct 45 ms 58176 KB Output is correct
19 Correct 23 ms 47280 KB Output is correct
20 Correct 1051 ms 133944 KB Output is correct
21 Correct 1036 ms 131492 KB Output is correct
22 Correct 1110 ms 131248 KB Output is correct
23 Correct 636 ms 110052 KB Output is correct
24 Correct 505 ms 109188 KB Output is correct
25 Correct 506 ms 88376 KB Output is correct
26 Correct 512 ms 88584 KB Output is correct
27 Correct 865 ms 121932 KB Output is correct
28 Correct 876 ms 121892 KB Output is correct
29 Correct 856 ms 122028 KB Output is correct
30 Correct 794 ms 121996 KB Output is correct
31 Correct 40 ms 58168 KB Output is correct
32 Correct 76 ms 62880 KB Output is correct
33 Correct 152 ms 70688 KB Output is correct
34 Correct 931 ms 133836 KB Output is correct
35 Correct 34 ms 48980 KB Output is correct
36 Correct 95 ms 56304 KB Output is correct
37 Correct 214 ms 65260 KB Output is correct
38 Correct 360 ms 85916 KB Output is correct
39 Correct 554 ms 95104 KB Output is correct
40 Correct 713 ms 106156 KB Output is correct
41 Correct 907 ms 116728 KB Output is correct
42 Correct 1199 ms 125756 KB Output is correct
43 Correct 41 ms 58212 KB Output is correct
44 Correct 42 ms 58168 KB Output is correct
45 Correct 49 ms 58124 KB Output is correct
46 Correct 23 ms 47308 KB Output is correct
47 Correct 23 ms 47316 KB Output is correct
48 Correct 52 ms 58140 KB Output is correct
49 Correct 43 ms 58148 KB Output is correct
50 Correct 43 ms 58120 KB Output is correct
51 Correct 44 ms 58144 KB Output is correct
52 Correct 23 ms 47316 KB Output is correct
53 Correct 43 ms 58260 KB Output is correct
54 Correct 28 ms 47600 KB Output is correct
55 Correct 31 ms 47828 KB Output is correct
56 Correct 551 ms 90896 KB Output is correct
57 Correct 857 ms 107228 KB Output is correct
58 Correct 762 ms 107060 KB Output is correct
59 Correct 29 ms 47316 KB Output is correct
60 Correct 50 ms 58200 KB Output is correct
61 Correct 26 ms 47252 KB Output is correct
62 Correct 1103 ms 121868 KB Output is correct
63 Correct 1092 ms 121980 KB Output is correct
64 Correct 1091 ms 121648 KB Output is correct
65 Correct 28 ms 48084 KB Output is correct
66 Correct 32 ms 48820 KB Output is correct
67 Correct 489 ms 91356 KB Output is correct
68 Correct 826 ms 109036 KB Output is correct
69 Correct 1237 ms 125376 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 58200 KB Output is correct
2 Correct 40 ms 58196 KB Output is correct
3 Correct 24 ms 47284 KB Output is correct
4 Correct 42 ms 58232 KB Output is correct
5 Correct 49 ms 58152 KB Output is correct
6 Correct 23 ms 47244 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 24 ms 47264 KB Output is correct
9 Correct 363 ms 89660 KB Output is correct
10 Correct 50 ms 61228 KB Output is correct
11 Correct 117 ms 74712 KB Output is correct
12 Correct 65 ms 62708 KB Output is correct
13 Correct 65 ms 57384 KB Output is correct
14 Correct 26 ms 47480 KB Output is correct
15 Correct 29 ms 47684 KB Output is correct
16 Correct 378 ms 89720 KB Output is correct
17 Correct 989 ms 121924 KB Output is correct
18 Correct 1073 ms 121952 KB Output is correct
19 Correct 1239 ms 131344 KB Output is correct
20 Correct 1269 ms 124236 KB Output is correct
21 Correct 971 ms 114680 KB Output is correct
22 Correct 41 ms 58168 KB Output is correct
23 Correct 126 ms 68508 KB Output is correct
24 Correct 52 ms 50672 KB Output is correct
25 Correct 163 ms 59276 KB Output is correct
26 Correct 288 ms 69424 KB Output is correct
27 Correct 571 ms 91628 KB Output is correct
28 Correct 745 ms 99368 KB Output is correct
29 Correct 873 ms 110432 KB Output is correct
30 Correct 1080 ms 118832 KB Output is correct
31 Correct 1051 ms 125396 KB Output is correct
32 Correct 1054 ms 123168 KB Output is correct
33 Correct 968 ms 121812 KB Output is correct
34 Correct 31 ms 48176 KB Output is correct
35 Correct 33 ms 48944 KB Output is correct
36 Correct 408 ms 91384 KB Output is correct
37 Correct 812 ms 108720 KB Output is correct
38 Correct 1090 ms 125100 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 58200 KB Output is correct
2 Correct 40 ms 58196 KB Output is correct
3 Correct 24 ms 47284 KB Output is correct
4 Correct 42 ms 58232 KB Output is correct
5 Correct 49 ms 58152 KB Output is correct
6 Correct 23 ms 47244 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 24 ms 47264 KB Output is correct
9 Correct 363 ms 89660 KB Output is correct
10 Correct 50 ms 61228 KB Output is correct
11 Correct 117 ms 74712 KB Output is correct
12 Correct 65 ms 62708 KB Output is correct
13 Correct 65 ms 57384 KB Output is correct
14 Correct 26 ms 47480 KB Output is correct
15 Correct 29 ms 47684 KB Output is correct
16 Correct 378 ms 89720 KB Output is correct
17 Correct 40 ms 58168 KB Output is correct
18 Correct 41 ms 58192 KB Output is correct
19 Correct 48 ms 58144 KB Output is correct
20 Correct 45 ms 58136 KB Output is correct
21 Correct 25 ms 47316 KB Output is correct
22 Correct 41 ms 58152 KB Output is correct
23 Correct 1400 ms 133996 KB Output is correct
24 Correct 42 ms 58180 KB Output is correct
25 Correct 44 ms 58656 KB Output is correct
26 Correct 32 ms 47884 KB Output is correct
27 Correct 28 ms 48084 KB Output is correct
28 Correct 359 ms 88080 KB Output is correct
29 Correct 699 ms 102248 KB Output is correct
30 Correct 1049 ms 118324 KB Output is correct
31 Correct 1345 ms 133964 KB Output is correct
32 Correct 41 ms 58204 KB Output is correct
33 Correct 41 ms 58224 KB Output is correct
34 Correct 40 ms 58212 KB Output is correct
35 Correct 24 ms 47316 KB Output is correct
36 Correct 23 ms 47316 KB Output is correct
37 Correct 44 ms 58192 KB Output is correct
38 Correct 40 ms 58228 KB Output is correct
39 Correct 41 ms 58164 KB Output is correct
40 Correct 42 ms 58200 KB Output is correct
41 Correct 24 ms 47344 KB Output is correct
42 Correct 46 ms 58244 KB Output is correct
43 Correct 28 ms 47700 KB Output is correct
44 Correct 27 ms 47876 KB Output is correct
45 Correct 405 ms 91108 KB Output is correct
46 Correct 701 ms 107100 KB Output is correct
47 Correct 725 ms 107152 KB Output is correct
48 Correct 42 ms 58168 KB Output is correct
49 Correct 42 ms 58220 KB Output is correct
50 Correct 42 ms 58152 KB Output is correct
51 Correct 41 ms 58148 KB Output is correct
52 Correct 48 ms 58240 KB Output is correct
53 Correct 42 ms 58168 KB Output is correct
54 Correct 43 ms 58224 KB Output is correct
55 Correct 1555 ms 139340 KB Output is correct
56 Correct 44 ms 58260 KB Output is correct
57 Correct 57 ms 58900 KB Output is correct
58 Correct 58 ms 60624 KB Output is correct
59 Correct 41 ms 49576 KB Output is correct
60 Correct 582 ms 98684 KB Output is correct
61 Correct 911 ms 115408 KB Output is correct
62 Correct 1146 ms 124988 KB Output is correct
63 Correct 1532 ms 139212 KB Output is correct
64 Correct 28 ms 47308 KB Output is correct
65 Correct 42 ms 58200 KB Output is correct
66 Correct 24 ms 47328 KB Output is correct
67 Correct 1037 ms 122000 KB Output is correct
68 Correct 1008 ms 122028 KB Output is correct
69 Correct 992 ms 121600 KB Output is correct
70 Correct 27 ms 47956 KB Output is correct
71 Correct 32 ms 48724 KB Output is correct
72 Correct 447 ms 91264 KB Output is correct
73 Correct 726 ms 109176 KB Output is correct
74 Correct 1081 ms 125488 KB Output is correct
75 Correct 1029 ms 123552 KB Output is correct
76 Correct 968 ms 121992 KB Output is correct
77 Correct 29 ms 48152 KB Output is correct
78 Correct 34 ms 48936 KB Output is correct
79 Correct 407 ms 91128 KB Output is correct
80 Correct 719 ms 108828 KB Output is correct
81 Correct 1083 ms 124436 KB Output is correct
82 Correct 40 ms 58136 KB Output is correct
83 Correct 45 ms 58176 KB Output is correct
84 Correct 23 ms 47280 KB Output is correct
85 Correct 1051 ms 133944 KB Output is correct
86 Correct 1036 ms 131492 KB Output is correct
87 Correct 1110 ms 131248 KB Output is correct
88 Correct 636 ms 110052 KB Output is correct
89 Correct 505 ms 109188 KB Output is correct
90 Correct 506 ms 88376 KB Output is correct
91 Correct 512 ms 88584 KB Output is correct
92 Correct 865 ms 121932 KB Output is correct
93 Correct 876 ms 121892 KB Output is correct
94 Correct 856 ms 122028 KB Output is correct
95 Correct 794 ms 121996 KB Output is correct
96 Correct 40 ms 58168 KB Output is correct
97 Correct 76 ms 62880 KB Output is correct
98 Correct 152 ms 70688 KB Output is correct
99 Correct 931 ms 133836 KB Output is correct
100 Correct 34 ms 48980 KB Output is correct
101 Correct 95 ms 56304 KB Output is correct
102 Correct 214 ms 65260 KB Output is correct
103 Correct 360 ms 85916 KB Output is correct
104 Correct 554 ms 95104 KB Output is correct
105 Correct 713 ms 106156 KB Output is correct
106 Correct 907 ms 116728 KB Output is correct
107 Correct 1199 ms 125756 KB Output is correct
108 Correct 41 ms 58212 KB Output is correct
109 Correct 42 ms 58168 KB Output is correct
110 Correct 49 ms 58124 KB Output is correct
111 Correct 23 ms 47308 KB Output is correct
112 Correct 23 ms 47316 KB Output is correct
113 Correct 52 ms 58140 KB Output is correct
114 Correct 43 ms 58148 KB Output is correct
115 Correct 43 ms 58120 KB Output is correct
116 Correct 44 ms 58144 KB Output is correct
117 Correct 23 ms 47316 KB Output is correct
118 Correct 43 ms 58260 KB Output is correct
119 Correct 28 ms 47600 KB Output is correct
120 Correct 31 ms 47828 KB Output is correct
121 Correct 551 ms 90896 KB Output is correct
122 Correct 857 ms 107228 KB Output is correct
123 Correct 762 ms 107060 KB Output is correct
124 Correct 29 ms 47316 KB Output is correct
125 Correct 50 ms 58200 KB Output is correct
126 Correct 26 ms 47252 KB Output is correct
127 Correct 1103 ms 121868 KB Output is correct
128 Correct 1092 ms 121980 KB Output is correct
129 Correct 1091 ms 121648 KB Output is correct
130 Correct 28 ms 48084 KB Output is correct
131 Correct 32 ms 48820 KB Output is correct
132 Correct 489 ms 91356 KB Output is correct
133 Correct 826 ms 109036 KB Output is correct
134 Correct 1237 ms 125376 KB Output is correct
135 Correct 989 ms 121924 KB Output is correct
136 Correct 1073 ms 121952 KB Output is correct
137 Correct 1239 ms 131344 KB Output is correct
138 Correct 1269 ms 124236 KB Output is correct
139 Correct 971 ms 114680 KB Output is correct
140 Correct 41 ms 58168 KB Output is correct
141 Correct 126 ms 68508 KB Output is correct
142 Correct 52 ms 50672 KB Output is correct
143 Correct 163 ms 59276 KB Output is correct
144 Correct 288 ms 69424 KB Output is correct
145 Correct 571 ms 91628 KB Output is correct
146 Correct 745 ms 99368 KB Output is correct
147 Correct 873 ms 110432 KB Output is correct
148 Correct 1080 ms 118832 KB Output is correct
149 Correct 1051 ms 125396 KB Output is correct
150 Correct 1054 ms 123168 KB Output is correct
151 Correct 968 ms 121812 KB Output is correct
152 Correct 31 ms 48176 KB Output is correct
153 Correct 33 ms 48944 KB Output is correct
154 Correct 408 ms 91384 KB Output is correct
155 Correct 812 ms 108720 KB Output is correct
156 Correct 1090 ms 125100 KB Output is correct
157 Correct 41 ms 58168 KB Output is correct
158 Correct 25 ms 47332 KB Output is correct
159 Correct 42 ms 58264 KB Output is correct
160 Correct 41 ms 58212 KB Output is correct
161 Correct 1451 ms 148996 KB Output is correct
162 Correct 916 ms 133792 KB Output is correct
163 Correct 1179 ms 132152 KB Output is correct
164 Correct 1154 ms 133732 KB Output is correct
165 Correct 1530 ms 143148 KB Output is correct
166 Correct 1408 ms 147368 KB Output is correct
167 Correct 229 ms 77124 KB Output is correct
168 Correct 83 ms 55452 KB Output is correct
169 Correct 335 ms 68228 KB Output is correct
170 Correct 662 ms 86796 KB Output is correct
171 Correct 1008 ms 106420 KB Output is correct
172 Correct 735 ms 103144 KB Output is correct
173 Correct 1133 ms 110768 KB Output is correct
174 Correct 1170 ms 118952 KB Output is correct
175 Correct 1438 ms 126004 KB Output is correct
176 Correct 1636 ms 140684 KB Output is correct
177 Correct 1673 ms 148260 KB Output is correct