oj.uz

답안 #1068826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068826 2024-08-21T12:24:16 Z Boas 분수 공원 (IOI21_parks) C++17
70 / 100
 334 ms 67920 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;
            }
        }
        if (x == -1)
            break;
        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 if (roads.count(toInt({x, y - 1})))
        {
            loc = {x, y - 1};
            addNeighbour(x, y - 2, -1);
        }
        else
            throw;
        int ix = roads[toInt(loc)];
        roads.erase(toInt(loc));
        a[ix] = x;
        b[ix] = y;
    }
    loop(n - 1, ix)
    {
        if (a[ix] == 0)
        {
            int i = u[ix], j = v[ix];
            if (abs(xs[i] - xs[j]) > 0)
            {
                a[ix] = min(xs[i], xs[j]) + 1;
                b[ix] = ys[i] + 1;
            }
            else
            {
                b[ix] = min(ys[i], ys[j]) + 1;
                a[ix] = xs[i] + 1;
            }
        }
    }
    build(u, v, a, b);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33100 KB Output is correct
10 Correct 9 ms 3676 KB Output is correct
11 Correct 36 ms 18288 KB Output is correct
12 Correct 10 ms 5304 KB Output is correct
13 Correct 26 ms 11308 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 82 ms 28100 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33100 KB Output is correct
10 Correct 9 ms 3676 KB Output is correct
11 Correct 36 ms 18288 KB Output is correct
12 Correct 10 ms 5304 KB Output is correct
13 Correct 26 ms 11308 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 82 ms 28100 KB Output is correct
17 Correct 1 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 250 ms 57348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 67 ms 22652 KB Output is correct
29 Correct 107 ms 32332 KB Output is correct
30 Correct 163 ms 44224 KB Output is correct
31 Correct 202 ms 55140 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct
41 Correct 1 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 1 ms 604 KB Output is correct
45 Correct 104 ms 25848 KB Output is correct
46 Correct 156 ms 38340 KB Output is correct
47 Correct 162 ms 37456 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33100 KB Output is correct
10 Correct 9 ms 3676 KB Output is correct
11 Correct 36 ms 18288 KB Output is correct
12 Correct 10 ms 5304 KB Output is correct
13 Correct 26 ms 11308 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 82 ms 28100 KB Output is correct
17 Correct 1 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 250 ms 57348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 67 ms 22652 KB Output is correct
29 Correct 107 ms 32332 KB Output is correct
30 Correct 163 ms 44224 KB Output is correct
31 Correct 202 ms 55140 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct
41 Correct 1 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 1 ms 604 KB Output is correct
45 Correct 104 ms 25848 KB Output is correct
46 Correct 156 ms 38340 KB Output is correct
47 Correct 162 ms 37456 KB Output is correct
48 Correct 1 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 0 ms 348 KB Output is correct
55 Correct 233 ms 52412 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 2 ms 860 KB Output is correct
58 Correct 5 ms 2140 KB Output is correct
59 Correct 3 ms 1368 KB Output is correct
60 Correct 97 ms 28996 KB Output is correct
61 Correct 144 ms 37832 KB Output is correct
62 Correct 175 ms 43116 KB Output is correct
63 Correct 256 ms 51324 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 189 ms 61852 KB Output is correct
68 Correct 191 ms 60868 KB Output is correct
69 Correct 194 ms 63428 KB Output is correct
70 Correct 2 ms 856 KB Output is correct
71 Correct 3 ms 1116 KB Output is correct
72 Correct 103 ms 22280 KB Output is correct
73 Correct 181 ms 35780 KB Output is correct
74 Correct 242 ms 44412 KB Output is correct
75 Correct 259 ms 55680 KB Output is correct
76 Correct 194 ms 67780 KB Output is correct
77 Correct 3 ms 1112 KB Output is correct
78 Correct 4 ms 1628 KB Output is correct
79 Correct 108 ms 24644 KB Output is correct
80 Correct 171 ms 37316 KB Output is correct
81 Correct 273 ms 50164 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33100 KB Output is correct
10 Correct 9 ms 3676 KB Output is correct
11 Correct 36 ms 18288 KB Output is correct
12 Correct 10 ms 5304 KB Output is correct
13 Correct 26 ms 11308 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 82 ms 28100 KB Output is correct
17 Correct 1 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 211 ms 59212 KB Output is correct
21 Correct 198 ms 54300 KB Output is correct
22 Correct 203 ms 51580 KB Output is correct
23 Correct 248 ms 46000 KB Output is correct
24 Correct 50 ms 13916 KB Output is correct
25 Correct 54 ms 14204 KB Output is correct
26 Correct 53 ms 14208 KB Output is correct
27 Correct 209 ms 44416 KB Output is correct
28 Correct 202 ms 44160 KB Output is correct
29 Correct 208 ms 44156 KB Output is correct
30 Correct 250 ms 44156 KB Output is correct
31 Correct 0 ms 600 KB Output is correct
32 Correct 15 ms 3604 KB Output is correct
33 Correct 25 ms 7232 KB Output is correct
34 Correct 196 ms 54960 KB Output is correct
35 Correct 5 ms 1368 KB Output is correct
36 Correct 19 ms 5036 KB Output is correct
37 Correct 37 ms 8256 KB Output is correct
38 Correct 100 ms 13220 KB Output is correct
39 Correct 139 ms 19912 KB Output is correct
40 Correct 166 ms 23868 KB Output is correct
41 Correct 202 ms 27336 KB Output is correct
42 Correct 255 ms 34172 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 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 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 604 KB Output is correct
55 Correct 1 ms 600 KB Output is correct
56 Correct 112 ms 25960 KB Output is correct
57 Correct 165 ms 38192 KB Output is correct
58 Correct 155 ms 37568 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 193 ms 61792 KB Output is correct
63 Correct 204 ms 60868 KB Output is correct
64 Correct 196 ms 63428 KB Output is correct
65 Correct 3 ms 860 KB Output is correct
66 Correct 3 ms 1116 KB Output is correct
67 Correct 104 ms 22344 KB Output is correct
68 Correct 179 ms 35784 KB Output is correct
69 Correct 243 ms 44668 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33100 KB Output is correct
10 Correct 9 ms 3676 KB Output is correct
11 Correct 36 ms 18288 KB Output is correct
12 Correct 10 ms 5304 KB Output is correct
13 Correct 26 ms 11308 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 82 ms 28100 KB Output is correct
17 Correct 301 ms 67920 KB Output is correct
18 Correct 272 ms 65612 KB Output is correct
19 Correct 237 ms 59776 KB Output is correct
20 Correct 224 ms 51860 KB Output is correct
21 Correct 206 ms 45436 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 37 ms 6676 KB Output is correct
24 Correct 11 ms 3160 KB Output is correct
25 Correct 26 ms 6764 KB Output is correct
26 Correct 39 ms 10180 KB Output is correct
27 Correct 115 ms 23064 KB Output is correct
28 Correct 142 ms 29060 KB Output is correct
29 Correct 183 ms 34500 KB Output is correct
30 Correct 239 ms 42940 KB Output is correct
31 Correct 304 ms 46460 KB Output is correct
32 Correct 254 ms 55680 KB Output is correct
33 Correct 209 ms 67780 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 3 ms 1628 KB Output is correct
36 Correct 98 ms 24676 KB Output is correct
37 Correct 170 ms 37164 KB Output is correct
38 Correct 241 ms 50300 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33100 KB Output is correct
10 Correct 9 ms 3676 KB Output is correct
11 Correct 36 ms 18288 KB Output is correct
12 Correct 10 ms 5304 KB Output is correct
13 Correct 26 ms 11308 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 82 ms 28100 KB Output is correct
17 Correct 1 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 250 ms 57348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 67 ms 22652 KB Output is correct
29 Correct 107 ms 32332 KB Output is correct
30 Correct 163 ms 44224 KB Output is correct
31 Correct 202 ms 55140 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct
41 Correct 1 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 1 ms 604 KB Output is correct
45 Correct 104 ms 25848 KB Output is correct
46 Correct 156 ms 38340 KB Output is correct
47 Correct 162 ms 37456 KB Output is correct
48 Correct 1 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 0 ms 348 KB Output is correct
55 Correct 233 ms 52412 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 2 ms 860 KB Output is correct
58 Correct 5 ms 2140 KB Output is correct
59 Correct 3 ms 1368 KB Output is correct
60 Correct 97 ms 28996 KB Output is correct
61 Correct 144 ms 37832 KB Output is correct
62 Correct 175 ms 43116 KB Output is correct
63 Correct 256 ms 51324 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 189 ms 61852 KB Output is correct
68 Correct 191 ms 60868 KB Output is correct
69 Correct 194 ms 63428 KB Output is correct
70 Correct 2 ms 856 KB Output is correct
71 Correct 3 ms 1116 KB Output is correct
72 Correct 103 ms 22280 KB Output is correct
73 Correct 181 ms 35780 KB Output is correct
74 Correct 242 ms 44412 KB Output is correct
75 Correct 259 ms 55680 KB Output is correct
76 Correct 194 ms 67780 KB Output is correct
77 Correct 3 ms 1112 KB Output is correct
78 Correct 4 ms 1628 KB Output is correct
79 Correct 108 ms 24644 KB Output is correct
80 Correct 171 ms 37316 KB Output is correct
81 Correct 273 ms 50164 KB Output is correct
82 Correct 1 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 211 ms 59212 KB Output is correct
86 Correct 198 ms 54300 KB Output is correct
87 Correct 203 ms 51580 KB Output is correct
88 Correct 248 ms 46000 KB Output is correct
89 Correct 50 ms 13916 KB Output is correct
90 Correct 54 ms 14204 KB Output is correct
91 Correct 53 ms 14208 KB Output is correct
92 Correct 209 ms 44416 KB Output is correct
93 Correct 202 ms 44160 KB Output is correct
94 Correct 208 ms 44156 KB Output is correct
95 Correct 250 ms 44156 KB Output is correct
96 Correct 0 ms 600 KB Output is correct
97 Correct 15 ms 3604 KB Output is correct
98 Correct 25 ms 7232 KB Output is correct
99 Correct 196 ms 54960 KB Output is correct
100 Correct 5 ms 1368 KB Output is correct
101 Correct 19 ms 5036 KB Output is correct
102 Correct 37 ms 8256 KB Output is correct
103 Correct 100 ms 13220 KB Output is correct
104 Correct 139 ms 19912 KB Output is correct
105 Correct 166 ms 23868 KB Output is correct
106 Correct 202 ms 27336 KB Output is correct
107 Correct 255 ms 34172 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 348 KB Output is correct
114 Correct 0 ms 348 KB Output is correct
115 Correct 1 ms 348 KB Output is correct
116 Correct 0 ms 348 KB Output is correct
117 Correct 0 ms 348 KB Output is correct
118 Correct 0 ms 348 KB Output is correct
119 Correct 1 ms 604 KB Output is correct
120 Correct 1 ms 600 KB Output is correct
121 Correct 112 ms 25960 KB Output is correct
122 Correct 165 ms 38192 KB Output is correct
123 Correct 155 ms 37568 KB Output is correct
124 Correct 1 ms 348 KB Output is correct
125 Correct 0 ms 348 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 193 ms 61792 KB Output is correct
128 Correct 204 ms 60868 KB Output is correct
129 Correct 196 ms 63428 KB Output is correct
130 Correct 3 ms 860 KB Output is correct
131 Correct 3 ms 1116 KB Output is correct
132 Correct 104 ms 22344 KB Output is correct
133 Correct 179 ms 35784 KB Output is correct
134 Correct 243 ms 44668 KB Output is correct
135 Correct 301 ms 67920 KB Output is correct
136 Correct 272 ms 65612 KB Output is correct
137 Correct 237 ms 59776 KB Output is correct
138 Correct 224 ms 51860 KB Output is correct
139 Correct 206 ms 45436 KB Output is correct
140 Correct 1 ms 344 KB Output is correct
141 Correct 37 ms 6676 KB Output is correct
142 Correct 11 ms 3160 KB Output is correct
143 Correct 26 ms 6764 KB Output is correct
144 Correct 39 ms 10180 KB Output is correct
145 Correct 115 ms 23064 KB Output is correct
146 Correct 142 ms 29060 KB Output is correct
147 Correct 183 ms 34500 KB Output is correct
148 Correct 239 ms 42940 KB Output is correct
149 Correct 304 ms 46460 KB Output is correct
150 Correct 254 ms 55680 KB Output is correct
151 Correct 209 ms 67780 KB Output is correct
152 Correct 3 ms 1116 KB Output is correct
153 Correct 3 ms 1628 KB Output is correct
154 Correct 98 ms 24676 KB Output is correct
155 Correct 170 ms 37164 KB Output is correct
156 Correct 241 ms 50300 KB Output is correct
157 Correct 1 ms 348 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 216 ms 50048 KB Output is correct
162 Correct 203 ms 51232 KB Output is correct
163 Correct 214 ms 44156 KB Output is correct
164 Correct 231 ms 43712 KB Output is correct
165 Correct 334 ms 58168 KB Output is correct
166 Correct 266 ms 59264 KB Output is correct
167 Incorrect 51 ms 9324 KB Tree @(185805, 20889) appears more than once: for edges on positions 4179 and 4194
168 Halted 0 ms 0 KB -