oj.uz

Submission #436866

# Submission time Handle Problem Language Result Execution time Memory
436866 2021-06-25T07:00:55 Z 114514191 Fountain Parks (IOI21_parks) C++17
70 / 100
 1072 ms 152964 KB 
#include <bits/stdc++.h>
#include "parks.h"
struct Flow {
    static constexpr int INF = 1e9;
    int n;
    struct Edge {
        int to, cap;
        Edge(int to, int cap) : to(to), cap(cap) {}
    };
    std::vector<Edge> e;
    std::vector<std::vector<int>> g;
    std::vector<int> cur, h;
    Flow(int n) : n(n), g(n) {}
    bool bfs(int s, int t) {
        h.assign(n, -1);
        std::queue<int> que;
        h[s] = 0;
        que.push(s);
        while (!que.empty()) {
            int u = que.front();
            que.pop();
            for (int i : g[u]) {
                auto [v, c] = e[i];
                if (c > 0 && h[v] == -1) {
                    h[v] = h[u] + 1;
                    if (v == t)
                        return true;
                    que.push(v);
                }
            }
        }
        return false;
    }
    int dfs(int u, int t, int f) {
        if (u == t)
            return f;
        int r = f;
        for (int &i = cur[u]; i < int(g[u].size()); ++i) {
            int j = g[u][i];
            auto [v, c] = e[j];
            if (c > 0 && h[v] == h[u] + 1) {
                int a = dfs(v, t, std::min(r, c));
                e[j].cap -= a;
                e[j ^ 1].cap += a;
                r -= a;
                if (r == 0)
                    return f;
            }
        }
        return f - r;
    }
    void addEdge(int u, int v, int c) {
        g[u].push_back(e.size());
        e.emplace_back(v, c);
        g[v].push_back(e.size());
        e.emplace_back(u, 0);
    }
    int maxFlow(int s, int t) {
        int ans = 0;
        while (bfs(s, t)) {
            cur.assign(n, 0);
            ans += dfs(s, t, INF);
        }
        return ans;
    }
};
int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n = x.size();
    std::map<std::pair<int, int>, int> id;
    for (int i = 0; i < n; i++) {
        id[{x[i], y[i]}] = i;
    }
    std::vector<bool> vis(n);
    vis[0] = true;
    std::stack<int> stk;
    stk.push(0);
    std::vector<std::pair<int, int>> edges;
    while (!stk.empty()) {
        int u = stk.top();
        stk.pop();
        for (auto move : {std::make_pair(0, -2), {-2, 0}, {0, 2}, {2, 0}}) {
            int x0 = x[u] + move.first;
            int y0 = y[u] + move.second;
            if (!id.count({x0, y0})) {
                continue;
            }
            int v = id[{x0, y0}];
            if (!vis[v]) {
                edges.emplace_back(u, v);
                vis[v] = true;
                stk.push(v);
            }
        }
    }
    if (int(edges.size()) < n - 1) {
        return 0;
    }
    std::map<std::pair<int, int>, int> id2;
    std::vector<std::pair<int, int>> matches;
    std::vector<std::pair<int, int>> pts;
    auto add = [&](int u, int x, int y) {
        if (!id2.count({x, y})) {
            id2[{x, y}] = pts.size();
            pts.emplace_back(x, y);
        }
        matches.emplace_back(u, id2[{x, y}]);
    };
    for (int i = 0; i < n - 1; i++) {
        auto [u, v] = edges[i];
        if (x[u] == x[v]) {
            add(i, x[u] - 1, (y[u] + y[v]) / 2);
            add(i, x[u] + 1, (y[u] + y[v]) / 2);
        } else {
            add(i, (x[u] + x[v]) / 2, y[u] - 1);
            add(i, (x[u] + x[v]) / 2, y[u] + 1);
        }
    }
    Flow g(n + 1 + pts.size());
    int S = n - 1, T = n + pts.size();
    for (auto [u, v] : matches) {
        g.addEdge(u, n + v, 1);
    }
    for (int i = 0; i < n - 1; i++) {
        g.addEdge(S, i, 1);
    }
    for (int i = 0; i < int(pts.size()); i++) {
        g.addEdge(n + i, T, 1);
    }
    assert(g.maxFlow(S, T) == n - 1);
    std::vector<int> U, V, A, B;
    for (int i = 0; i < int(matches.size()); i++) {
        if (!g.e[2 * i].cap) {
            auto [j, k] = matches[i];
            U.push_back(edges[j].first);
            V.push_back(edges[j].second);
            A.push_back(pts[k].first);
            B.push_back(pts[k].second);
        }
    }
    build(U, V, A, B);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 404 ms 57628 KB Output is correct
10 Correct 30 ms 6068 KB Output is correct
11 Correct 213 ms 31680 KB Output is correct
12 Correct 48 ms 8932 KB Output is correct
13 Correct 37 ms 4104 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 359 ms 57636 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 404 ms 57628 KB Output is correct
10 Correct 30 ms 6068 KB Output is correct
11 Correct 213 ms 31680 KB Output is correct
12 Correct 48 ms 8932 KB Output is correct
13 Correct 37 ms 4104 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 359 ms 57636 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 831 ms 91372 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 5 ms 844 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 346 ms 37140 KB Output is correct
29 Correct 524 ms 51568 KB Output is correct
30 Correct 676 ms 69052 KB Output is correct
31 Correct 908 ms 90732 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 272 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 330 ms 48188 KB Output is correct
46 Correct 608 ms 70552 KB Output is correct
47 Correct 529 ms 70584 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 404 ms 57628 KB Output is correct
10 Correct 30 ms 6068 KB Output is correct
11 Correct 213 ms 31680 KB Output is correct
12 Correct 48 ms 8932 KB Output is correct
13 Correct 37 ms 4104 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 359 ms 57636 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 831 ms 91372 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 5 ms 844 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 346 ms 37140 KB Output is correct
29 Correct 524 ms 51568 KB Output is correct
30 Correct 676 ms 69052 KB Output is correct
31 Correct 908 ms 90732 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 272 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 330 ms 48188 KB Output is correct
46 Correct 608 ms 70552 KB Output is correct
47 Correct 529 ms 70584 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 831 ms 90692 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 7 ms 1100 KB Output is correct
58 Correct 17 ms 3012 KB Output is correct
59 Correct 8 ms 1100 KB Output is correct
60 Correct 348 ms 47464 KB Output is correct
61 Correct 536 ms 61840 KB Output is correct
62 Correct 651 ms 74892 KB Output is correct
63 Correct 874 ms 92504 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 799 ms 115128 KB Output is correct
68 Correct 808 ms 115184 KB Output is correct
69 Correct 913 ms 114512 KB Output is correct
70 Correct 3 ms 588 KB Output is correct
71 Correct 6 ms 844 KB Output is correct
72 Correct 367 ms 47380 KB Output is correct
73 Correct 548 ms 71104 KB Output is correct
74 Correct 780 ms 94808 KB Output is correct
75 Correct 820 ms 102768 KB Output is correct
76 Correct 798 ms 115068 KB Output is correct
77 Correct 4 ms 716 KB Output is correct
78 Correct 7 ms 1000 KB Output is correct
79 Correct 325 ms 47128 KB Output is correct
80 Correct 551 ms 71008 KB Output is correct
81 Correct 848 ms 96308 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 404 ms 57628 KB Output is correct
10 Correct 30 ms 6068 KB Output is correct
11 Correct 213 ms 31680 KB Output is correct
12 Correct 48 ms 8932 KB Output is correct
13 Correct 37 ms 4104 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 359 ms 57636 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 838 ms 85900 KB Output is correct
21 Correct 718 ms 83968 KB Output is correct
22 Correct 759 ms 85840 KB Output is correct
23 Correct 717 ms 98568 KB Output is correct
24 Correct 260 ms 15964 KB Output is correct
25 Correct 250 ms 15956 KB Output is correct
26 Correct 231 ms 15912 KB Output is correct
27 Correct 763 ms 115024 KB Output is correct
28 Correct 791 ms 114936 KB Output is correct
29 Correct 947 ms 114980 KB Output is correct
30 Correct 1072 ms 114968 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 42 ms 6864 KB Output is correct
33 Correct 79 ms 8104 KB Output is correct
34 Correct 795 ms 84012 KB Output is correct
35 Correct 10 ms 1100 KB Output is correct
36 Correct 42 ms 4324 KB Output is correct
37 Correct 115 ms 8212 KB Output is correct
38 Correct 339 ms 36432 KB Output is correct
39 Correct 413 ms 49740 KB Output is correct
40 Correct 586 ms 63824 KB Output is correct
41 Correct 711 ms 77016 KB Output is correct
42 Correct 879 ms 89748 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 2 ms 460 KB Output is correct
55 Correct 3 ms 432 KB Output is correct
56 Correct 407 ms 48212 KB Output is correct
57 Correct 576 ms 70464 KB Output is correct
58 Correct 570 ms 70540 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 224 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 901 ms 114988 KB Output is correct
63 Correct 882 ms 115100 KB Output is correct
64 Correct 941 ms 114560 KB Output is correct
65 Correct 5 ms 588 KB Output is correct
66 Correct 8 ms 848 KB Output is correct
67 Correct 334 ms 47392 KB Output is correct
68 Correct 632 ms 71196 KB Output is correct
69 Correct 863 ms 94580 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 404 ms 57628 KB Output is correct
10 Correct 30 ms 6068 KB Output is correct
11 Correct 213 ms 31680 KB Output is correct
12 Correct 48 ms 8932 KB Output is correct
13 Correct 37 ms 4104 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 359 ms 57636 KB Output is correct
17 Correct 814 ms 114992 KB Output is correct
18 Correct 838 ms 115084 KB Output is correct
19 Correct 738 ms 84024 KB Output is correct
20 Correct 863 ms 94096 KB Output is correct
21 Correct 738 ms 89660 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 101 ms 14768 KB Output is correct
24 Correct 19 ms 1996 KB Output is correct
25 Correct 57 ms 5960 KB Output is correct
26 Correct 115 ms 9796 KB Output is correct
27 Correct 370 ms 46176 KB Output is correct
28 Correct 534 ms 57700 KB Output is correct
29 Correct 653 ms 68620 KB Output is correct
30 Correct 762 ms 79820 KB Output is correct
31 Correct 911 ms 91164 KB Output is correct
32 Correct 852 ms 102788 KB Output is correct
33 Correct 808 ms 114988 KB Output is correct
34 Correct 4 ms 716 KB Output is correct
35 Correct 7 ms 972 KB Output is correct
36 Correct 335 ms 47132 KB Output is correct
37 Correct 561 ms 71004 KB Output is correct
38 Correct 812 ms 96208 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 404 ms 57628 KB Output is correct
10 Correct 30 ms 6068 KB Output is correct
11 Correct 213 ms 31680 KB Output is correct
12 Correct 48 ms 8932 KB Output is correct
13 Correct 37 ms 4104 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 359 ms 57636 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 831 ms 91372 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 5 ms 844 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 346 ms 37140 KB Output is correct
29 Correct 524 ms 51568 KB Output is correct
30 Correct 676 ms 69052 KB Output is correct
31 Correct 908 ms 90732 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 272 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 330 ms 48188 KB Output is correct
46 Correct 608 ms 70552 KB Output is correct
47 Correct 529 ms 70584 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 831 ms 90692 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 7 ms 1100 KB Output is correct
58 Correct 17 ms 3012 KB Output is correct
59 Correct 8 ms 1100 KB Output is correct
60 Correct 348 ms 47464 KB Output is correct
61 Correct 536 ms 61840 KB Output is correct
62 Correct 651 ms 74892 KB Output is correct
63 Correct 874 ms 92504 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 799 ms 115128 KB Output is correct
68 Correct 808 ms 115184 KB Output is correct
69 Correct 913 ms 114512 KB Output is correct
70 Correct 3 ms 588 KB Output is correct
71 Correct 6 ms 844 KB Output is correct
72 Correct 367 ms 47380 KB Output is correct
73 Correct 548 ms 71104 KB Output is correct
74 Correct 780 ms 94808 KB Output is correct
75 Correct 820 ms 102768 KB Output is correct
76 Correct 798 ms 115068 KB Output is correct
77 Correct 4 ms 716 KB Output is correct
78 Correct 7 ms 1000 KB Output is correct
79 Correct 325 ms 47128 KB Output is correct
80 Correct 551 ms 71008 KB Output is correct
81 Correct 848 ms 96308 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 838 ms 85900 KB Output is correct
86 Correct 718 ms 83968 KB Output is correct
87 Correct 759 ms 85840 KB Output is correct
88 Correct 717 ms 98568 KB Output is correct
89 Correct 260 ms 15964 KB Output is correct
90 Correct 250 ms 15956 KB Output is correct
91 Correct 231 ms 15912 KB Output is correct
92 Correct 763 ms 115024 KB Output is correct
93 Correct 791 ms 114936 KB Output is correct
94 Correct 947 ms 114980 KB Output is correct
95 Correct 1072 ms 114968 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 42 ms 6864 KB Output is correct
98 Correct 79 ms 8104 KB Output is correct
99 Correct 795 ms 84012 KB Output is correct
100 Correct 10 ms 1100 KB Output is correct
101 Correct 42 ms 4324 KB Output is correct
102 Correct 115 ms 8212 KB Output is correct
103 Correct 339 ms 36432 KB Output is correct
104 Correct 413 ms 49740 KB Output is correct
105 Correct 586 ms 63824 KB Output is correct
106 Correct 711 ms 77016 KB Output is correct
107 Correct 879 ms 89748 KB Output is correct
108 Correct 1 ms 204 KB Output is correct
109 Correct 1 ms 204 KB Output is correct
110 Correct 1 ms 204 KB Output is correct
111 Correct 1 ms 204 KB Output is correct
112 Correct 1 ms 204 KB Output is correct
113 Correct 1 ms 204 KB Output is correct
114 Correct 1 ms 204 KB Output is correct
115 Correct 1 ms 204 KB Output is correct
116 Correct 1 ms 204 KB Output is correct
117 Correct 1 ms 204 KB Output is correct
118 Correct 1 ms 204 KB Output is correct
119 Correct 2 ms 460 KB Output is correct
120 Correct 3 ms 432 KB Output is correct
121 Correct 407 ms 48212 KB Output is correct
122 Correct 576 ms 70464 KB Output is correct
123 Correct 570 ms 70540 KB Output is correct
124 Correct 1 ms 204 KB Output is correct
125 Correct 1 ms 224 KB Output is correct
126 Correct 1 ms 204 KB Output is correct
127 Correct 901 ms 114988 KB Output is correct
128 Correct 882 ms 115100 KB Output is correct
129 Correct 941 ms 114560 KB Output is correct
130 Correct 5 ms 588 KB Output is correct
131 Correct 8 ms 848 KB Output is correct
132 Correct 334 ms 47392 KB Output is correct
133 Correct 632 ms 71196 KB Output is correct
134 Correct 863 ms 94580 KB Output is correct
135 Correct 814 ms 114992 KB Output is correct
136 Correct 838 ms 115084 KB Output is correct
137 Correct 738 ms 84024 KB Output is correct
138 Correct 863 ms 94096 KB Output is correct
139 Correct 738 ms 89660 KB Output is correct
140 Correct 1 ms 204 KB Output is correct
141 Correct 101 ms 14768 KB Output is correct
142 Correct 19 ms 1996 KB Output is correct
143 Correct 57 ms 5960 KB Output is correct
144 Correct 115 ms 9796 KB Output is correct
145 Correct 370 ms 46176 KB Output is correct
146 Correct 534 ms 57700 KB Output is correct
147 Correct 653 ms 68620 KB Output is correct
148 Correct 762 ms 79820 KB Output is correct
149 Correct 911 ms 91164 KB Output is correct
150 Correct 852 ms 102788 KB Output is correct
151 Correct 808 ms 114988 KB Output is correct
152 Correct 4 ms 716 KB Output is correct
153 Correct 7 ms 972 KB Output is correct
154 Correct 335 ms 47132 KB Output is correct
155 Correct 561 ms 71004 KB Output is correct
156 Correct 812 ms 96208 KB Output is correct
157 Correct 1 ms 204 KB Output is correct
158 Correct 1 ms 332 KB Output is correct
159 Correct 1 ms 204 KB Output is correct
160 Correct 1 ms 204 KB Output is correct
161 Runtime error 828 ms 152964 KB Execution killed with signal 6
162 Halted 0 ms 0 KB -