oj.uz

Submission #566600

# Submission time Handle Problem Language Result Execution time Memory
566600 2022-05-22T12:51:22 Z kartel Fountain Parks (IOI21_parks) C++17
100 / 100
 1533 ms 500804 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;

inline ll geth(int a, int b) {return ((ll)a << 20) + b;}

void get_erased_2x2(vector <int> &x, vector <int> &y, unordered_map<ll, int> &del) {
    unordered_map <ll, int> cnt, who;

    for (int i = 0; i < sz(x); i++) {
        who[geth(x[i], y[i])] = i;
        if (have[x[i] / 2 + 1][y[i] / 2] && have[x[i] / 2][y[i] / 2 + 1] && have[x[i] / 2 + 1][y[i] / 2 + 1]) {
            pts.pb({x[i] + 1, y[i] + 1});
        }
    }
    sort(all(pts));
    cnt.clear();
    int ptr = 0;
    for (auto &[x, y] : pts) {
        cnt[geth(x, y)] = ptr++;
    }

    ptr = 0;
    for (auto &[x, y] : pts) {
        int par = (x / 2 + y / 2) % 2;
        for (int i = 0; i < 2; i++) {
            int cx = x + steps[i * 2 + par][0];
            int cy = y + steps[i * 2 + par][1];

            if (cnt.find(geth(cx, cy)) == cnt.end()) {
                continue;
            }
            g[cnt[geth(cx, cy)]].pb(ptr);
        }
        ptr++;
    }

    queue <int> q;
    for (int i = 0; i < sz(pts); i++) {
        if (mk[i]) {
            continue;
        }

        int par = (pts[i].F / 2 + pts[i].S / 2) & 1;
        if (par & 1) {
            block[i] = road[-2 + 4][0 + 4];
        } else {
            block[i] = road[0 + 4][-2 + 4];
        }
        q.push(i); mk[i] = 1;
        while (sz(q)) {
            int v = q.front(); q.pop();

            for (auto u : g[v]) {
                if (mk[u]) {
                    continue;
                }
                int dx = pts[v].F - pts[u].F;
                int dy = pts[v].S - pts[u].S;
                block[u] = road[dx + 4][dy + 4];
                q.push(u);
                mk[u] = 1;
            }
        }
    }

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

        auto &[a, b] = block[i];
        int v = who[geth(x + dsteps[a][0], y + dsteps[a][1])];
        int u = who[geth(x + dsteps[b][0], y + dsteps[b][1])];

        del[geth(v, u)] = del[geth(u, v)] = 1;
    }
}

int construct_roads(vector <int> x, vector <int> y) {
    int n = sz(x);

    road[0 + 4][2 + 4]  = {2, 0}; road[2 + 4][0 + 4]  = {0, 1};
    road[0 + 4][-2 + 4] = {1, 3}; road[-2 + 4][0 + 4] = {3, 2};

    unordered_map <ll, int> mp;
    vector <pair <int, int> > r;
    unordered_map <ll, int> del;

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

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

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

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

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

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

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

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

    int C = 0;
    queue <int> q;
    for (auto v : ord) {
        q.push(v);
        cmp[v] = C;
        while (sz(q)) {
            int v = q.front(); q.pop();
            for (auto &u : gr[v]) {
                if (cmp[u] != -1) {
                    continue;
                }
                cmp[u] = C;
                q.push(u);
            }
        }
        C++;
    }

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

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

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

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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23492 KB Output is correct
2 Correct 21 ms 23464 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 19 ms 23468 KB Output is correct
5 Correct 19 ms 23472 KB Output is correct
6 Correct 11 ms 19028 KB Output is correct
7 Correct 10 ms 19104 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 270 ms 54600 KB Output is correct
10 Correct 30 ms 26344 KB Output is correct
11 Correct 77 ms 39808 KB Output is correct
12 Correct 35 ms 27796 KB Output is correct
13 Correct 31 ms 24284 KB Output is correct
14 Correct 12 ms 19148 KB Output is correct
15 Correct 13 ms 19232 KB Output is correct
16 Correct 261 ms 54512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23492 KB Output is correct
2 Correct 21 ms 23464 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 19 ms 23468 KB Output is correct
5 Correct 19 ms 23472 KB Output is correct
6 Correct 11 ms 19028 KB Output is correct
7 Correct 10 ms 19104 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 270 ms 54600 KB Output is correct
10 Correct 30 ms 26344 KB Output is correct
11 Correct 77 ms 39808 KB Output is correct
12 Correct 35 ms 27796 KB Output is correct
13 Correct 31 ms 24284 KB Output is correct
14 Correct 12 ms 19148 KB Output is correct
15 Correct 13 ms 19232 KB Output is correct
16 Correct 261 ms 54512 KB Output is correct
17 Correct 20 ms 23492 KB Output is correct
18 Correct 19 ms 23568 KB Output is correct
19 Correct 19 ms 23528 KB Output is correct
20 Correct 21 ms 23476 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 19 ms 23568 KB Output is correct
23 Correct 981 ms 97660 KB Output is correct
24 Correct 23 ms 23524 KB Output is correct
25 Correct 22 ms 23976 KB Output is correct
26 Correct 14 ms 19640 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 243 ms 53052 KB Output is correct
29 Correct 535 ms 67008 KB Output is correct
30 Correct 895 ms 82152 KB Output is correct
31 Correct 1079 ms 97552 KB Output is correct
32 Correct 21 ms 23484 KB Output is correct
33 Correct 22 ms 23492 KB Output is correct
34 Correct 18 ms 23480 KB Output is correct
35 Correct 13 ms 19068 KB Output is correct
36 Correct 11 ms 19100 KB Output is correct
37 Correct 22 ms 23520 KB Output is correct
38 Correct 21 ms 23492 KB Output is correct
39 Correct 33 ms 23524 KB Output is correct
40 Correct 22 ms 23492 KB Output is correct
41 Correct 11 ms 19028 KB Output is correct
42 Correct 21 ms 23468 KB Output is correct
43 Correct 15 ms 19216 KB Output is correct
44 Correct 21 ms 19392 KB Output is correct
45 Correct 350 ms 56152 KB Output is correct
46 Correct 540 ms 70440 KB Output is correct
47 Correct 496 ms 70748 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23492 KB Output is correct
2 Correct 21 ms 23464 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 19 ms 23468 KB Output is correct
5 Correct 19 ms 23472 KB Output is correct
6 Correct 11 ms 19028 KB Output is correct
7 Correct 10 ms 19104 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 270 ms 54600 KB Output is correct
10 Correct 30 ms 26344 KB Output is correct
11 Correct 77 ms 39808 KB Output is correct
12 Correct 35 ms 27796 KB Output is correct
13 Correct 31 ms 24284 KB Output is correct
14 Correct 12 ms 19148 KB Output is correct
15 Correct 13 ms 19232 KB Output is correct
16 Correct 261 ms 54512 KB Output is correct
17 Correct 20 ms 23492 KB Output is correct
18 Correct 19 ms 23568 KB Output is correct
19 Correct 19 ms 23528 KB Output is correct
20 Correct 21 ms 23476 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 19 ms 23568 KB Output is correct
23 Correct 981 ms 97660 KB Output is correct
24 Correct 23 ms 23524 KB Output is correct
25 Correct 22 ms 23976 KB Output is correct
26 Correct 14 ms 19640 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 243 ms 53052 KB Output is correct
29 Correct 535 ms 67008 KB Output is correct
30 Correct 895 ms 82152 KB Output is correct
31 Correct 1079 ms 97552 KB Output is correct
32 Correct 21 ms 23484 KB Output is correct
33 Correct 22 ms 23492 KB Output is correct
34 Correct 18 ms 23480 KB Output is correct
35 Correct 13 ms 19068 KB Output is correct
36 Correct 11 ms 19100 KB Output is correct
37 Correct 22 ms 23520 KB Output is correct
38 Correct 21 ms 23492 KB Output is correct
39 Correct 33 ms 23524 KB Output is correct
40 Correct 22 ms 23492 KB Output is correct
41 Correct 11 ms 19028 KB Output is correct
42 Correct 21 ms 23468 KB Output is correct
43 Correct 15 ms 19216 KB Output is correct
44 Correct 21 ms 19392 KB Output is correct
45 Correct 350 ms 56152 KB Output is correct
46 Correct 540 ms 70440 KB Output is correct
47 Correct 496 ms 70748 KB Output is correct
48 Correct 25 ms 23560 KB Output is correct
49 Correct 24 ms 23492 KB Output is correct
50 Correct 22 ms 23492 KB Output is correct
51 Correct 21 ms 23576 KB Output is correct
52 Correct 21 ms 23540 KB Output is correct
53 Correct 24 ms 23528 KB Output is correct
54 Correct 20 ms 23492 KB Output is correct
55 Correct 1219 ms 103896 KB Output is correct
56 Correct 21 ms 23568 KB Output is correct
57 Correct 24 ms 24184 KB Output is correct
58 Correct 42 ms 25840 KB Output is correct
59 Correct 29 ms 21332 KB Output is correct
60 Correct 514 ms 63368 KB Output is correct
61 Correct 762 ms 79840 KB Output is correct
62 Correct 893 ms 89900 KB Output is correct
63 Correct 1134 ms 103136 KB Output is correct
64 Correct 10 ms 19080 KB Output is correct
65 Correct 24 ms 23472 KB Output is correct
66 Correct 10 ms 19108 KB Output is correct
67 Correct 696 ms 85920 KB Output is correct
68 Correct 631 ms 85948 KB Output is correct
69 Correct 648 ms 85788 KB Output is correct
70 Correct 12 ms 19540 KB Output is correct
71 Correct 15 ms 19944 KB Output is correct
72 Correct 292 ms 56388 KB Output is correct
73 Correct 591 ms 71908 KB Output is correct
74 Correct 741 ms 88672 KB Output is correct
75 Correct 838 ms 87536 KB Output is correct
76 Correct 647 ms 86080 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 16 ms 20052 KB Output is correct
79 Correct 279 ms 56272 KB Output is correct
80 Correct 639 ms 72548 KB Output is correct
81 Correct 775 ms 88492 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23492 KB Output is correct
2 Correct 21 ms 23464 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 19 ms 23468 KB Output is correct
5 Correct 19 ms 23472 KB Output is correct
6 Correct 11 ms 19028 KB Output is correct
7 Correct 10 ms 19104 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 270 ms 54600 KB Output is correct
10 Correct 30 ms 26344 KB Output is correct
11 Correct 77 ms 39808 KB Output is correct
12 Correct 35 ms 27796 KB Output is correct
13 Correct 31 ms 24284 KB Output is correct
14 Correct 12 ms 19148 KB Output is correct
15 Correct 13 ms 19232 KB Output is correct
16 Correct 261 ms 54512 KB Output is correct
17 Correct 20 ms 23492 KB Output is correct
18 Correct 20 ms 23556 KB Output is correct
19 Correct 11 ms 19028 KB Output is correct
20 Correct 1006 ms 500804 KB Output is correct
21 Correct 1076 ms 295208 KB Output is correct
22 Correct 1041 ms 295504 KB Output is correct
23 Correct 608 ms 371620 KB Output is correct
24 Correct 160 ms 43184 KB Output is correct
25 Correct 343 ms 43196 KB Output is correct
26 Correct 227 ms 43100 KB Output is correct
27 Correct 607 ms 89144 KB Output is correct
28 Correct 603 ms 89244 KB Output is correct
29 Correct 511 ms 88120 KB Output is correct
30 Correct 589 ms 88032 KB Output is correct
31 Correct 20 ms 23472 KB Output is correct
32 Correct 45 ms 29380 KB Output is correct
33 Correct 301 ms 432628 KB Output is correct
34 Correct 963 ms 499848 KB Output is correct
35 Correct 16 ms 20948 KB Output is correct
36 Correct 56 ms 27800 KB Output is correct
37 Correct 131 ms 36528 KB Output is correct
38 Correct 296 ms 51636 KB Output is correct
39 Correct 428 ms 62156 KB Output is correct
40 Correct 508 ms 71056 KB Output is correct
41 Correct 710 ms 81692 KB Output is correct
42 Correct 880 ms 94528 KB Output is correct
43 Correct 19 ms 23492 KB Output is correct
44 Correct 19 ms 23528 KB Output is correct
45 Correct 19 ms 23488 KB Output is correct
46 Correct 10 ms 19028 KB Output is correct
47 Correct 12 ms 19052 KB Output is correct
48 Correct 21 ms 23532 KB Output is correct
49 Correct 21 ms 23492 KB Output is correct
50 Correct 20 ms 23564 KB Output is correct
51 Correct 20 ms 23532 KB Output is correct
52 Correct 11 ms 19084 KB Output is correct
53 Correct 22 ms 23500 KB Output is correct
54 Correct 12 ms 19216 KB Output is correct
55 Correct 12 ms 19412 KB Output is correct
56 Correct 265 ms 56240 KB Output is correct
57 Correct 441 ms 70352 KB Output is correct
58 Correct 450 ms 70672 KB Output is correct
59 Correct 13 ms 19028 KB Output is correct
60 Correct 21 ms 23564 KB Output is correct
61 Correct 13 ms 19112 KB Output is correct
62 Correct 594 ms 86004 KB Output is correct
63 Correct 716 ms 85920 KB Output is correct
64 Correct 626 ms 85752 KB Output is correct
65 Correct 12 ms 19540 KB Output is correct
66 Correct 16 ms 19860 KB Output is correct
67 Correct 329 ms 56308 KB Output is correct
68 Correct 547 ms 72016 KB Output is correct
69 Correct 824 ms 88648 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23492 KB Output is correct
2 Correct 21 ms 23464 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 19 ms 23468 KB Output is correct
5 Correct 19 ms 23472 KB Output is correct
6 Correct 11 ms 19028 KB Output is correct
7 Correct 10 ms 19104 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 270 ms 54600 KB Output is correct
10 Correct 30 ms 26344 KB Output is correct
11 Correct 77 ms 39808 KB Output is correct
12 Correct 35 ms 27796 KB Output is correct
13 Correct 31 ms 24284 KB Output is correct
14 Correct 12 ms 19148 KB Output is correct
15 Correct 13 ms 19232 KB Output is correct
16 Correct 261 ms 54512 KB Output is correct
17 Correct 851 ms 486372 KB Output is correct
18 Correct 801 ms 438876 KB Output is correct
19 Correct 1063 ms 433656 KB Output is correct
20 Correct 902 ms 90800 KB Output is correct
21 Correct 642 ms 82004 KB Output is correct
22 Correct 20 ms 23480 KB Output is correct
23 Correct 101 ms 36708 KB Output is correct
24 Correct 26 ms 22228 KB Output is correct
25 Correct 79 ms 30036 KB Output is correct
26 Correct 134 ms 38452 KB Output is correct
27 Correct 402 ms 59068 KB Output is correct
28 Correct 517 ms 66772 KB Output is correct
29 Correct 677 ms 74824 KB Output is correct
30 Correct 773 ms 85716 KB Output is correct
31 Correct 868 ms 93352 KB Output is correct
32 Correct 848 ms 87512 KB Output is correct
33 Correct 738 ms 85948 KB Output is correct
34 Correct 13 ms 19540 KB Output is correct
35 Correct 16 ms 20052 KB Output is correct
36 Correct 367 ms 56176 KB Output is correct
37 Correct 645 ms 72632 KB Output is correct
38 Correct 885 ms 88408 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23492 KB Output is correct
2 Correct 21 ms 23464 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 19 ms 23468 KB Output is correct
5 Correct 19 ms 23472 KB Output is correct
6 Correct 11 ms 19028 KB Output is correct
7 Correct 10 ms 19104 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 270 ms 54600 KB Output is correct
10 Correct 30 ms 26344 KB Output is correct
11 Correct 77 ms 39808 KB Output is correct
12 Correct 35 ms 27796 KB Output is correct
13 Correct 31 ms 24284 KB Output is correct
14 Correct 12 ms 19148 KB Output is correct
15 Correct 13 ms 19232 KB Output is correct
16 Correct 261 ms 54512 KB Output is correct
17 Correct 20 ms 23492 KB Output is correct
18 Correct 19 ms 23568 KB Output is correct
19 Correct 19 ms 23528 KB Output is correct
20 Correct 21 ms 23476 KB Output is correct
21 Correct 10 ms 19028 KB Output is correct
22 Correct 19 ms 23568 KB Output is correct
23 Correct 981 ms 97660 KB Output is correct
24 Correct 23 ms 23524 KB Output is correct
25 Correct 22 ms 23976 KB Output is correct
26 Correct 14 ms 19640 KB Output is correct
27 Correct 13 ms 19796 KB Output is correct
28 Correct 243 ms 53052 KB Output is correct
29 Correct 535 ms 67008 KB Output is correct
30 Correct 895 ms 82152 KB Output is correct
31 Correct 1079 ms 97552 KB Output is correct
32 Correct 21 ms 23484 KB Output is correct
33 Correct 22 ms 23492 KB Output is correct
34 Correct 18 ms 23480 KB Output is correct
35 Correct 13 ms 19068 KB Output is correct
36 Correct 11 ms 19100 KB Output is correct
37 Correct 22 ms 23520 KB Output is correct
38 Correct 21 ms 23492 KB Output is correct
39 Correct 33 ms 23524 KB Output is correct
40 Correct 22 ms 23492 KB Output is correct
41 Correct 11 ms 19028 KB Output is correct
42 Correct 21 ms 23468 KB Output is correct
43 Correct 15 ms 19216 KB Output is correct
44 Correct 21 ms 19392 KB Output is correct
45 Correct 350 ms 56152 KB Output is correct
46 Correct 540 ms 70440 KB Output is correct
47 Correct 496 ms 70748 KB Output is correct
48 Correct 25 ms 23560 KB Output is correct
49 Correct 24 ms 23492 KB Output is correct
50 Correct 22 ms 23492 KB Output is correct
51 Correct 21 ms 23576 KB Output is correct
52 Correct 21 ms 23540 KB Output is correct
53 Correct 24 ms 23528 KB Output is correct
54 Correct 20 ms 23492 KB Output is correct
55 Correct 1219 ms 103896 KB Output is correct
56 Correct 21 ms 23568 KB Output is correct
57 Correct 24 ms 24184 KB Output is correct
58 Correct 42 ms 25840 KB Output is correct
59 Correct 29 ms 21332 KB Output is correct
60 Correct 514 ms 63368 KB Output is correct
61 Correct 762 ms 79840 KB Output is correct
62 Correct 893 ms 89900 KB Output is correct
63 Correct 1134 ms 103136 KB Output is correct
64 Correct 10 ms 19080 KB Output is correct
65 Correct 24 ms 23472 KB Output is correct
66 Correct 10 ms 19108 KB Output is correct
67 Correct 696 ms 85920 KB Output is correct
68 Correct 631 ms 85948 KB Output is correct
69 Correct 648 ms 85788 KB Output is correct
70 Correct 12 ms 19540 KB Output is correct
71 Correct 15 ms 19944 KB Output is correct
72 Correct 292 ms 56388 KB Output is correct
73 Correct 591 ms 71908 KB Output is correct
74 Correct 741 ms 88672 KB Output is correct
75 Correct 838 ms 87536 KB Output is correct
76 Correct 647 ms 86080 KB Output is correct
77 Correct 13 ms 19540 KB Output is correct
78 Correct 16 ms 20052 KB Output is correct
79 Correct 279 ms 56272 KB Output is correct
80 Correct 639 ms 72548 KB Output is correct
81 Correct 775 ms 88492 KB Output is correct
82 Correct 20 ms 23492 KB Output is correct
83 Correct 20 ms 23556 KB Output is correct
84 Correct 11 ms 19028 KB Output is correct
85 Correct 1006 ms 500804 KB Output is correct
86 Correct 1076 ms 295208 KB Output is correct
87 Correct 1041 ms 295504 KB Output is correct
88 Correct 608 ms 371620 KB Output is correct
89 Correct 160 ms 43184 KB Output is correct
90 Correct 343 ms 43196 KB Output is correct
91 Correct 227 ms 43100 KB Output is correct
92 Correct 607 ms 89144 KB Output is correct
93 Correct 603 ms 89244 KB Output is correct
94 Correct 511 ms 88120 KB Output is correct
95 Correct 589 ms 88032 KB Output is correct
96 Correct 20 ms 23472 KB Output is correct
97 Correct 45 ms 29380 KB Output is correct
98 Correct 301 ms 432628 KB Output is correct
99 Correct 963 ms 499848 KB Output is correct
100 Correct 16 ms 20948 KB Output is correct
101 Correct 56 ms 27800 KB Output is correct
102 Correct 131 ms 36528 KB Output is correct
103 Correct 296 ms 51636 KB Output is correct
104 Correct 428 ms 62156 KB Output is correct
105 Correct 508 ms 71056 KB Output is correct
106 Correct 710 ms 81692 KB Output is correct
107 Correct 880 ms 94528 KB Output is correct
108 Correct 19 ms 23492 KB Output is correct
109 Correct 19 ms 23528 KB Output is correct
110 Correct 19 ms 23488 KB Output is correct
111 Correct 10 ms 19028 KB Output is correct
112 Correct 12 ms 19052 KB Output is correct
113 Correct 21 ms 23532 KB Output is correct
114 Correct 21 ms 23492 KB Output is correct
115 Correct 20 ms 23564 KB Output is correct
116 Correct 20 ms 23532 KB Output is correct
117 Correct 11 ms 19084 KB Output is correct
118 Correct 22 ms 23500 KB Output is correct
119 Correct 12 ms 19216 KB Output is correct
120 Correct 12 ms 19412 KB Output is correct
121 Correct 265 ms 56240 KB Output is correct
122 Correct 441 ms 70352 KB Output is correct
123 Correct 450 ms 70672 KB Output is correct
124 Correct 13 ms 19028 KB Output is correct
125 Correct 21 ms 23564 KB Output is correct
126 Correct 13 ms 19112 KB Output is correct
127 Correct 594 ms 86004 KB Output is correct
128 Correct 716 ms 85920 KB Output is correct
129 Correct 626 ms 85752 KB Output is correct
130 Correct 12 ms 19540 KB Output is correct
131 Correct 16 ms 19860 KB Output is correct
132 Correct 329 ms 56308 KB Output is correct
133 Correct 547 ms 72016 KB Output is correct
134 Correct 824 ms 88648 KB Output is correct
135 Correct 851 ms 486372 KB Output is correct
136 Correct 801 ms 438876 KB Output is correct
137 Correct 1063 ms 433656 KB Output is correct
138 Correct 902 ms 90800 KB Output is correct
139 Correct 642 ms 82004 KB Output is correct
140 Correct 20 ms 23480 KB Output is correct
141 Correct 101 ms 36708 KB Output is correct
142 Correct 26 ms 22228 KB Output is correct
143 Correct 79 ms 30036 KB Output is correct
144 Correct 134 ms 38452 KB Output is correct
145 Correct 402 ms 59068 KB Output is correct
146 Correct 517 ms 66772 KB Output is correct
147 Correct 677 ms 74824 KB Output is correct
148 Correct 773 ms 85716 KB Output is correct
149 Correct 868 ms 93352 KB Output is correct
150 Correct 848 ms 87512 KB Output is correct
151 Correct 738 ms 85948 KB Output is correct
152 Correct 13 ms 19540 KB Output is correct
153 Correct 16 ms 20052 KB Output is correct
154 Correct 367 ms 56176 KB Output is correct
155 Correct 645 ms 72632 KB Output is correct
156 Correct 885 ms 88408 KB Output is correct
157 Correct 22 ms 23492 KB Output is correct
158 Correct 10 ms 19028 KB Output is correct
159 Correct 21 ms 23492 KB Output is correct
160 Correct 20 ms 23548 KB Output is correct
161 Correct 1533 ms 114440 KB Output is correct
162 Correct 1079 ms 498888 KB Output is correct
163 Correct 1180 ms 366332 KB Output is correct
164 Correct 1169 ms 365408 KB Output is correct
165 Correct 1500 ms 196564 KB Output is correct
166 Correct 1369 ms 136604 KB Output is correct
167 Correct 204 ms 44052 KB Output is correct
168 Correct 85 ms 28344 KB Output is correct
169 Correct 276 ms 43264 KB Output is correct
170 Correct 566 ms 64748 KB Output is correct
171 Correct 782 ms 89724 KB Output is correct
172 Correct 648 ms 69384 KB Output is correct
173 Correct 881 ms 77276 KB Output is correct
174 Correct 992 ms 85644 KB Output is correct
175 Correct 1218 ms 93528 KB Output is correct
176 Correct 1325 ms 107224 KB Output is correct
177 Correct 1487 ms 115452 KB Output is correct