oj.uz

Submission #1068792

# Submission time Handle Problem Language Result Execution time Memory
1068792 2024-08-21T12:10:47 Z Boas Fountain Parks (IOI21_parks) C++17
70 / 100
 3500 ms 67784 KB 
#include "parks.h"

// #pragma GCC optimize("trapv")

#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
typedef vector<signed> vi32;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef unordered_set<ll> si;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<ii> vii;
typedef set<iii> siii;
// typedef unordered_set<ii> sii;
typedef vector<vii> vvii;
#define pb push_back
#define loop(x, i) for (int i = 0; i < x; i++)
#define ALL(x) begin(x), end(x)
#define sz(x) (int)x.size()

vii adj = {{-2, 0}, {2, 0}, {0, 2}, {0, -2}};

vector<si> benchPoints(4); // neighbour count

ll MX = 200'004;

ll toInt(ii p)
{
    auto [b, c] = p;
    return MX * b + c;
}

void addNeighbour(ll x, ll y, int dif = 1)
{
    if (benchPoints[1].count(toInt({x, y})))
    {
        benchPoints[1].erase(toInt({x, y}));
        if (dif == 1)
        {
            benchPoints[2].insert(toInt({x, y}));
        }
    }
    else if (benchPoints[2].count(toInt({x, y})))
    {
        benchPoints[2].erase(toInt({x, y}));
        benchPoints[2 + dif].insert(toInt({x, y}));
    }
    else if (benchPoints[3].count(toInt({x, y})))
    {
        benchPoints[3].erase(toInt({x, y}));
        if (dif == 1)
            throw;
        benchPoints[2].insert(toInt({x, y}));
    }
    else if (dif == 1)
    {
        benchPoints[1].insert(toInt({x, y}));
    }
}

int construct_roads(vi xs, vi ys)
{
    unordered_map<ll, int> fountains;
    unordered_map<ll, int> roads;
    // unordered_set<ii> gotBench;
    int n = sz(xs);
    loop(n, i)
    {
        fountains[toInt({xs[i], ys[i]})] = i;
    }
    vb vis(n);
    vi u, v, a, b;
    a = b = vi(n - 1);
    int visCnt = 1;
    auto dfs = [&](auto &&self, int i) -> void
    {
        int x = xs[i], y = ys[i];
        for (const auto &[dx, dy] : adj)
        {
            ii pos = {x + dx, y + dy};
            if (fountains.count(toInt(pos)))
            {
                int j = fountains[toInt(pos)];
                if (vis[j])
                    continue;
                if (dx != 0)
                {
                    roads[toInt({x + dx / 2, y})] = sz(u);
                    addNeighbour(x + dx / 2, y + 1);
                    addNeighbour(x + dx / 2, y - 1);
                }
                else
                {
                    roads[toInt({x, y + dy / 2})] = sz(u);
                    addNeighbour(x + 1, y + dy / 2);
                    addNeighbour(x - 1, y + dy / 2);
                }
                u.pb(i);
                v.pb(j);
                vis[j] = 1;
                visCnt++;
                self(self, j);
            }
        }
    };
    vis[0] = 1;
    dfs(dfs, 0);
    if (visCnt != n)
        return 0;
    assert(sz(u) == n - 1);
    for (int benchesBuilt = 0; benchesBuilt < sz(u); benchesBuilt++)
    {
        ll x = -1, y = -1;
        for (int i = 1; i <= 3; i++)
        {
            if (!benchPoints[i].empty())
            {
                ll pr = *benchPoints[i].begin();
                x = pr / MX, y = pr % MX;
                benchPoints[i].erase(benchPoints[i].begin());
                break;
            }
        }
        while (x < 0 || y < 0)
        {
            x--;
        }
        ii loc;
        if (roads.count(toInt({x + 1, y})))
        {
            loc = {x + 1, y};
            addNeighbour(x + 2, y, -1);
        }
        else if (roads.count(toInt({x - 1, y})))
        {
            loc = {x - 1, y};
            addNeighbour(x - 2, y, -1);
        }
        else if (roads.count(toInt({x, y + 1})))
        {
            loc = {x, y + 1};
            addNeighbour(x, y + 2, -1);
        }
        else
        {
            loc = {x, y - 1};
            addNeighbour(x, y - 2, -1);
        }
        int ix = roads[toInt(loc)];
        roads.erase(toInt(loc));
        a[ix] = x;
        b[ix] = y;
    }
    build(u, v, a, b);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 90 ms 32896 KB Output is correct
10 Correct 9 ms 3672 KB Output is correct
11 Correct 47 ms 18132 KB Output is correct
12 Correct 12 ms 5300 KB Output is correct
13 Correct 17 ms 11392 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 87 ms 28100 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 90 ms 32896 KB Output is correct
10 Correct 9 ms 3672 KB Output is correct
11 Correct 47 ms 18132 KB Output is correct
12 Correct 12 ms 5300 KB Output is correct
13 Correct 17 ms 11392 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 87 ms 28100 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 236 ms 57340 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 72 ms 22744 KB Output is correct
29 Correct 107 ms 32196 KB Output is correct
30 Correct 166 ms 44232 KB Output is correct
31 Correct 218 ms 55164 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 113 ms 25952 KB Output is correct
46 Correct 156 ms 38340 KB Output is correct
47 Correct 146 ms 37532 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 90 ms 32896 KB Output is correct
10 Correct 9 ms 3672 KB Output is correct
11 Correct 47 ms 18132 KB Output is correct
12 Correct 12 ms 5300 KB Output is correct
13 Correct 17 ms 11392 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 87 ms 28100 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 236 ms 57340 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 72 ms 22744 KB Output is correct
29 Correct 107 ms 32196 KB Output is correct
30 Correct 166 ms 44232 KB Output is correct
31 Correct 218 ms 55164 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 113 ms 25952 KB Output is correct
46 Correct 156 ms 38340 KB Output is correct
47 Correct 146 ms 37532 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 257 ms 52420 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 3 ms 860 KB Output is correct
58 Correct 6 ms 2140 KB Output is correct
59 Correct 3 ms 1372 KB Output is correct
60 Correct 88 ms 29180 KB Output is correct
61 Correct 141 ms 37956 KB Output is correct
62 Correct 183 ms 42944 KB Output is correct
63 Correct 232 ms 51584 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 184 ms 61960 KB Output is correct
68 Correct 212 ms 60864 KB Output is correct
69 Correct 211 ms 63412 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 3 ms 1112 KB Output is correct
72 Correct 104 ms 22132 KB Output is correct
73 Correct 181 ms 35824 KB Output is correct
74 Correct 257 ms 44544 KB Output is correct
75 Correct 260 ms 55564 KB Output is correct
76 Correct 199 ms 67784 KB Output is correct
77 Correct 2 ms 1112 KB Output is correct
78 Correct 4 ms 1628 KB Output is correct
79 Correct 98 ms 24756 KB Output is correct
80 Correct 174 ms 37320 KB Output is correct
81 Correct 286 ms 50164 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 90 ms 32896 KB Output is correct
10 Correct 9 ms 3672 KB Output is correct
11 Correct 47 ms 18132 KB Output is correct
12 Correct 12 ms 5300 KB Output is correct
13 Correct 17 ms 11392 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 87 ms 28100 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 240 ms 58988 KB Output is correct
21 Correct 204 ms 54280 KB Output is correct
22 Correct 196 ms 51584 KB Output is correct
23 Correct 199 ms 45996 KB Output is correct
24 Correct 56 ms 14092 KB Output is correct
25 Correct 49 ms 14204 KB Output is correct
26 Correct 50 ms 14044 KB Output is correct
27 Correct 213 ms 44348 KB Output is correct
28 Correct 182 ms 44160 KB Output is correct
29 Correct 213 ms 44152 KB Output is correct
30 Correct 208 ms 44160 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 16 ms 3560 KB Output is correct
33 Correct 23 ms 7120 KB Output is correct
34 Correct 192 ms 55140 KB Output is correct
35 Correct 4 ms 1372 KB Output is correct
36 Correct 19 ms 4812 KB Output is correct
37 Correct 32 ms 8400 KB Output is correct
38 Correct 98 ms 13184 KB Output is correct
39 Correct 129 ms 19656 KB Output is correct
40 Correct 173 ms 23956 KB Output is correct
41 Correct 191 ms 27396 KB Output is correct
42 Correct 256 ms 34096 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 100 ms 25800 KB Output is correct
57 Correct 156 ms 38132 KB Output is correct
58 Correct 156 ms 37536 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 188 ms 61984 KB Output is correct
63 Correct 179 ms 60868 KB Output is correct
64 Correct 183 ms 63552 KB Output is correct
65 Correct 2 ms 856 KB Output is correct
66 Correct 3 ms 1116 KB Output is correct
67 Correct 99 ms 22352 KB Output is correct
68 Correct 174 ms 35844 KB Output is correct
69 Correct 291 ms 44408 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 90 ms 32896 KB Output is correct
10 Correct 9 ms 3672 KB Output is correct
11 Correct 47 ms 18132 KB Output is correct
12 Correct 12 ms 5300 KB Output is correct
13 Correct 17 ms 11392 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 87 ms 28100 KB Output is correct
17 Correct 279 ms 67784 KB Output is correct
18 Correct 274 ms 65220 KB Output is correct
19 Correct 243 ms 59604 KB Output is correct
20 Correct 225 ms 52004 KB Output is correct
21 Correct 199 ms 45436 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 40 ms 6912 KB Output is correct
24 Correct 10 ms 3160 KB Output is correct
25 Correct 25 ms 6644 KB Output is correct
26 Correct 37 ms 9988 KB Output is correct
27 Correct 108 ms 22980 KB Output is correct
28 Correct 156 ms 29128 KB Output is correct
29 Correct 194 ms 34500 KB Output is correct
30 Correct 241 ms 42800 KB Output is correct
31 Correct 248 ms 46460 KB Output is correct
32 Correct 252 ms 55680 KB Output is correct
33 Correct 197 ms 67660 KB Output is correct
34 Correct 2 ms 1116 KB Output is correct
35 Correct 3 ms 1628 KB Output is correct
36 Correct 107 ms 24684 KB Output is correct
37 Correct 191 ms 37576 KB Output is correct
38 Correct 253 ms 50304 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 90 ms 32896 KB Output is correct
10 Correct 9 ms 3672 KB Output is correct
11 Correct 47 ms 18132 KB Output is correct
12 Correct 12 ms 5300 KB Output is correct
13 Correct 17 ms 11392 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 87 ms 28100 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 236 ms 57340 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 72 ms 22744 KB Output is correct
29 Correct 107 ms 32196 KB Output is correct
30 Correct 166 ms 44232 KB Output is correct
31 Correct 218 ms 55164 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 113 ms 25952 KB Output is correct
46 Correct 156 ms 38340 KB Output is correct
47 Correct 146 ms 37532 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 257 ms 52420 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 3 ms 860 KB Output is correct
58 Correct 6 ms 2140 KB Output is correct
59 Correct 3 ms 1372 KB Output is correct
60 Correct 88 ms 29180 KB Output is correct
61 Correct 141 ms 37956 KB Output is correct
62 Correct 183 ms 42944 KB Output is correct
63 Correct 232 ms 51584 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 184 ms 61960 KB Output is correct
68 Correct 212 ms 60864 KB Output is correct
69 Correct 211 ms 63412 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 3 ms 1112 KB Output is correct
72 Correct 104 ms 22132 KB Output is correct
73 Correct 181 ms 35824 KB Output is correct
74 Correct 257 ms 44544 KB Output is correct
75 Correct 260 ms 55564 KB Output is correct
76 Correct 199 ms 67784 KB Output is correct
77 Correct 2 ms 1112 KB Output is correct
78 Correct 4 ms 1628 KB Output is correct
79 Correct 98 ms 24756 KB Output is correct
80 Correct 174 ms 37320 KB Output is correct
81 Correct 286 ms 50164 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 240 ms 58988 KB Output is correct
86 Correct 204 ms 54280 KB Output is correct
87 Correct 196 ms 51584 KB Output is correct
88 Correct 199 ms 45996 KB Output is correct
89 Correct 56 ms 14092 KB Output is correct
90 Correct 49 ms 14204 KB Output is correct
91 Correct 50 ms 14044 KB Output is correct
92 Correct 213 ms 44348 KB Output is correct
93 Correct 182 ms 44160 KB Output is correct
94 Correct 213 ms 44152 KB Output is correct
95 Correct 208 ms 44160 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 16 ms 3560 KB Output is correct
98 Correct 23 ms 7120 KB Output is correct
99 Correct 192 ms 55140 KB Output is correct
100 Correct 4 ms 1372 KB Output is correct
101 Correct 19 ms 4812 KB Output is correct
102 Correct 32 ms 8400 KB Output is correct
103 Correct 98 ms 13184 KB Output is correct
104 Correct 129 ms 19656 KB Output is correct
105 Correct 173 ms 23956 KB Output is correct
106 Correct 191 ms 27396 KB Output is correct
107 Correct 256 ms 34096 KB Output is correct
108 Correct 0 ms 348 KB Output is correct
109 Correct 0 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 0 ms 348 KB Output is correct
115 Correct 0 ms 348 KB Output is correct
116 Correct 1 ms 348 KB Output is correct
117 Correct 0 ms 348 KB Output is correct
118 Correct 1 ms 348 KB Output is correct
119 Correct 1 ms 600 KB Output is correct
120 Correct 1 ms 604 KB Output is correct
121 Correct 100 ms 25800 KB Output is correct
122 Correct 156 ms 38132 KB Output is correct
123 Correct 156 ms 37536 KB Output is correct
124 Correct 0 ms 348 KB Output is correct
125 Correct 1 ms 348 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 188 ms 61984 KB Output is correct
128 Correct 179 ms 60868 KB Output is correct
129 Correct 183 ms 63552 KB Output is correct
130 Correct 2 ms 856 KB Output is correct
131 Correct 3 ms 1116 KB Output is correct
132 Correct 99 ms 22352 KB Output is correct
133 Correct 174 ms 35844 KB Output is correct
134 Correct 291 ms 44408 KB Output is correct
135 Correct 279 ms 67784 KB Output is correct
136 Correct 274 ms 65220 KB Output is correct
137 Correct 243 ms 59604 KB Output is correct
138 Correct 225 ms 52004 KB Output is correct
139 Correct 199 ms 45436 KB Output is correct
140 Correct 0 ms 348 KB Output is correct
141 Correct 40 ms 6912 KB Output is correct
142 Correct 10 ms 3160 KB Output is correct
143 Correct 25 ms 6644 KB Output is correct
144 Correct 37 ms 9988 KB Output is correct
145 Correct 108 ms 22980 KB Output is correct
146 Correct 156 ms 29128 KB Output is correct
147 Correct 194 ms 34500 KB Output is correct
148 Correct 241 ms 42800 KB Output is correct
149 Correct 248 ms 46460 KB Output is correct
150 Correct 252 ms 55680 KB Output is correct
151 Correct 197 ms 67660 KB Output is correct
152 Correct 2 ms 1116 KB Output is correct
153 Correct 3 ms 1628 KB Output is correct
154 Correct 107 ms 24684 KB Output is correct
155 Correct 191 ms 37576 KB Output is correct
156 Correct 253 ms 50304 KB Output is correct
157 Correct 0 ms 344 KB Output is correct
158 Correct 0 ms 348 KB Output is correct
159 Correct 0 ms 348 KB Output is correct
160 Correct 0 ms 348 KB Output is correct
161 Correct 229 ms 50080 KB Output is correct
162 Correct 199 ms 51336 KB Output is correct
163 Correct 184 ms 44152 KB Output is correct
164 Correct 228 ms 43784 KB Output is correct
165 Correct 273 ms 58232 KB Output is correct
166 Correct 245 ms 59260 KB Output is correct
167 Execution timed out 3541 ms 9320 KB Time limit exceeded
168 Halted 0 ms 0 KB -