oj.uz

답안 #1068769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068769 2024-08-21T11:57:55 Z Boas 분수 공원 (IOI21_parks) C++17
70 / 100
 310 ms 69692 KB 
#include "parks.h"

#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'002;

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;
    for (int benchesBuilt = 0; benchesBuilt < n - 1; benchesBuilt++)
    {
        ll x, y;
        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;
            }
        }
        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;
}

Compilation message

parks.cpp: In function 'int construct_roads(vi, vi)':
parks.cpp:147:15: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
  147 |         a[ix] = x;

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33944 KB Output is correct
10 Correct 8 ms 3672 KB Output is correct
11 Correct 37 ms 18636 KB Output is correct
12 Correct 12 ms 5304 KB Output is correct
13 Correct 16 ms 11628 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 78 ms 28916 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33944 KB Output is correct
10 Correct 8 ms 3672 KB Output is correct
11 Correct 37 ms 18636 KB Output is correct
12 Correct 12 ms 5304 KB Output is correct
13 Correct 16 ms 11628 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 78 ms 28916 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 432 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 205 ms 59004 KB Output is correct
24 Correct 0 ms 344 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 23368 KB Output is correct
29 Correct 109 ms 33392 KB Output is correct
30 Correct 159 ms 45508 KB Output is correct
31 Correct 209 ms 56700 KB Output is correct
32 Correct 0 ms 348 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 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 100 ms 26568 KB Output is correct
46 Correct 156 ms 39464 KB Output is correct
47 Correct 154 ms 38596 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33944 KB Output is correct
10 Correct 8 ms 3672 KB Output is correct
11 Correct 37 ms 18636 KB Output is correct
12 Correct 12 ms 5304 KB Output is correct
13 Correct 16 ms 11628 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 78 ms 28916 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 432 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 205 ms 59004 KB Output is correct
24 Correct 0 ms 344 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 23368 KB Output is correct
29 Correct 109 ms 33392 KB Output is correct
30 Correct 159 ms 45508 KB Output is correct
31 Correct 209 ms 56700 KB Output is correct
32 Correct 0 ms 348 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 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 100 ms 26568 KB Output is correct
46 Correct 156 ms 39464 KB Output is correct
47 Correct 154 ms 38596 KB Output is correct
48 Correct 0 ms 348 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 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 202 ms 53888 KB Output is correct
56 Correct 0 ms 348 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 1372 KB Output is correct
60 Correct 89 ms 29896 KB Output is correct
61 Correct 126 ms 38860 KB Output is correct
62 Correct 169 ms 44508 KB Output is correct
63 Correct 204 ms 53112 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 0 ms 436 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 213 ms 63588 KB Output is correct
68 Correct 187 ms 62664 KB Output is correct
69 Correct 212 ms 65216 KB Output is correct
70 Correct 2 ms 856 KB Output is correct
71 Correct 3 ms 1372 KB Output is correct
72 Correct 99 ms 23012 KB Output is correct
73 Correct 176 ms 37132 KB Output is correct
74 Correct 258 ms 46064 KB Output is correct
75 Correct 256 ms 57248 KB Output is correct
76 Correct 192 ms 69576 KB Output is correct
77 Correct 3 ms 1116 KB Output is correct
78 Correct 4 ms 1604 KB Output is correct
79 Correct 102 ms 25360 KB Output is correct
80 Correct 167 ms 38596 KB Output is correct
81 Correct 277 ms 51936 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33944 KB Output is correct
10 Correct 8 ms 3672 KB Output is correct
11 Correct 37 ms 18636 KB Output is correct
12 Correct 12 ms 5304 KB Output is correct
13 Correct 16 ms 11628 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 78 ms 28916 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 220 ms 61560 KB Output is correct
21 Correct 228 ms 56504 KB Output is correct
22 Correct 206 ms 53712 KB Output is correct
23 Correct 207 ms 47788 KB Output is correct
24 Correct 57 ms 15748 KB Output is correct
25 Correct 53 ms 15856 KB Output is correct
26 Correct 58 ms 15684 KB Output is correct
27 Correct 224 ms 45876 KB Output is correct
28 Correct 222 ms 45964 KB Output is correct
29 Correct 243 ms 45780 KB Output is correct
30 Correct 228 ms 45900 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 17 ms 3676 KB Output is correct
33 Correct 27 ms 8388 KB Output is correct
34 Correct 223 ms 57488 KB Output is correct
35 Correct 6 ms 1628 KB Output is correct
36 Correct 19 ms 5564 KB Output is correct
37 Correct 39 ms 9672 KB Output is correct
38 Correct 95 ms 14220 KB Output is correct
39 Correct 146 ms 20932 KB Output is correct
40 Correct 183 ms 25732 KB Output is correct
41 Correct 226 ms 29648 KB Output is correct
42 Correct 310 ms 36724 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 1 ms 344 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 0 ms 432 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 604 KB Output is correct
56 Correct 106 ms 26668 KB Output is correct
57 Correct 156 ms 39372 KB Output is correct
58 Correct 170 ms 38744 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 204 ms 63616 KB Output is correct
63 Correct 194 ms 62660 KB Output is correct
64 Correct 216 ms 65464 KB Output is correct
65 Correct 2 ms 860 KB Output is correct
66 Correct 3 ms 1116 KB Output is correct
67 Correct 99 ms 22976 KB Output is correct
68 Correct 176 ms 37064 KB Output is correct
69 Correct 239 ms 46204 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33944 KB Output is correct
10 Correct 8 ms 3672 KB Output is correct
11 Correct 37 ms 18636 KB Output is correct
12 Correct 12 ms 5304 KB Output is correct
13 Correct 16 ms 11628 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 78 ms 28916 KB Output is correct
17 Correct 253 ms 69692 KB Output is correct
18 Correct 285 ms 67528 KB Output is correct
19 Correct 233 ms 62080 KB Output is correct
20 Correct 230 ms 53376 KB Output is correct
21 Correct 204 ms 46964 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 37 ms 6936 KB Output is correct
24 Correct 11 ms 3420 KB Output is correct
25 Correct 25 ms 7548 KB Output is correct
26 Correct 40 ms 11460 KB Output is correct
27 Correct 132 ms 24516 KB Output is correct
28 Correct 169 ms 30816 KB Output is correct
29 Correct 217 ms 36564 KB Output is correct
30 Correct 229 ms 44924 KB Output is correct
31 Correct 281 ms 48764 KB Output is correct
32 Correct 241 ms 57216 KB Output is correct
33 Correct 203 ms 69312 KB Output is correct
34 Correct 2 ms 1112 KB Output is correct
35 Correct 4 ms 1628 KB Output is correct
36 Correct 104 ms 25472 KB Output is correct
37 Correct 172 ms 38652 KB Output is correct
38 Correct 250 ms 52196 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 83 ms 33944 KB Output is correct
10 Correct 8 ms 3672 KB Output is correct
11 Correct 37 ms 18636 KB Output is correct
12 Correct 12 ms 5304 KB Output is correct
13 Correct 16 ms 11628 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 78 ms 28916 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 432 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 205 ms 59004 KB Output is correct
24 Correct 0 ms 344 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 23368 KB Output is correct
29 Correct 109 ms 33392 KB Output is correct
30 Correct 159 ms 45508 KB Output is correct
31 Correct 209 ms 56700 KB Output is correct
32 Correct 0 ms 348 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 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 100 ms 26568 KB Output is correct
46 Correct 156 ms 39464 KB Output is correct
47 Correct 154 ms 38596 KB Output is correct
48 Correct 0 ms 348 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 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 202 ms 53888 KB Output is correct
56 Correct 0 ms 348 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 1372 KB Output is correct
60 Correct 89 ms 29896 KB Output is correct
61 Correct 126 ms 38860 KB Output is correct
62 Correct 169 ms 44508 KB Output is correct
63 Correct 204 ms 53112 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 0 ms 436 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 213 ms 63588 KB Output is correct
68 Correct 187 ms 62664 KB Output is correct
69 Correct 212 ms 65216 KB Output is correct
70 Correct 2 ms 856 KB Output is correct
71 Correct 3 ms 1372 KB Output is correct
72 Correct 99 ms 23012 KB Output is correct
73 Correct 176 ms 37132 KB Output is correct
74 Correct 258 ms 46064 KB Output is correct
75 Correct 256 ms 57248 KB Output is correct
76 Correct 192 ms 69576 KB Output is correct
77 Correct 3 ms 1116 KB Output is correct
78 Correct 4 ms 1604 KB Output is correct
79 Correct 102 ms 25360 KB Output is correct
80 Correct 167 ms 38596 KB Output is correct
81 Correct 277 ms 51936 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 220 ms 61560 KB Output is correct
86 Correct 228 ms 56504 KB Output is correct
87 Correct 206 ms 53712 KB Output is correct
88 Correct 207 ms 47788 KB Output is correct
89 Correct 57 ms 15748 KB Output is correct
90 Correct 53 ms 15856 KB Output is correct
91 Correct 58 ms 15684 KB Output is correct
92 Correct 224 ms 45876 KB Output is correct
93 Correct 222 ms 45964 KB Output is correct
94 Correct 243 ms 45780 KB Output is correct
95 Correct 228 ms 45900 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 17 ms 3676 KB Output is correct
98 Correct 27 ms 8388 KB Output is correct
99 Correct 223 ms 57488 KB Output is correct
100 Correct 6 ms 1628 KB Output is correct
101 Correct 19 ms 5564 KB Output is correct
102 Correct 39 ms 9672 KB Output is correct
103 Correct 95 ms 14220 KB Output is correct
104 Correct 146 ms 20932 KB Output is correct
105 Correct 183 ms 25732 KB Output is correct
106 Correct 226 ms 29648 KB Output is correct
107 Correct 310 ms 36724 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 1 ms 344 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 0 ms 432 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 604 KB Output is correct
121 Correct 106 ms 26668 KB Output is correct
122 Correct 156 ms 39372 KB Output is correct
123 Correct 170 ms 38744 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 204 ms 63616 KB Output is correct
128 Correct 194 ms 62660 KB Output is correct
129 Correct 216 ms 65464 KB Output is correct
130 Correct 2 ms 860 KB Output is correct
131 Correct 3 ms 1116 KB Output is correct
132 Correct 99 ms 22976 KB Output is correct
133 Correct 176 ms 37064 KB Output is correct
134 Correct 239 ms 46204 KB Output is correct
135 Correct 253 ms 69692 KB Output is correct
136 Correct 285 ms 67528 KB Output is correct
137 Correct 233 ms 62080 KB Output is correct
138 Correct 230 ms 53376 KB Output is correct
139 Correct 204 ms 46964 KB Output is correct
140 Correct 0 ms 344 KB Output is correct
141 Correct 37 ms 6936 KB Output is correct
142 Correct 11 ms 3420 KB Output is correct
143 Correct 25 ms 7548 KB Output is correct
144 Correct 40 ms 11460 KB Output is correct
145 Correct 132 ms 24516 KB Output is correct
146 Correct 169 ms 30816 KB Output is correct
147 Correct 217 ms 36564 KB Output is correct
148 Correct 229 ms 44924 KB Output is correct
149 Correct 281 ms 48764 KB Output is correct
150 Correct 241 ms 57216 KB Output is correct
151 Correct 203 ms 69312 KB Output is correct
152 Correct 2 ms 1112 KB Output is correct
153 Correct 4 ms 1628 KB Output is correct
154 Correct 104 ms 25472 KB Output is correct
155 Correct 172 ms 38652 KB Output is correct
156 Correct 250 ms 52196 KB Output is correct
157 Correct 0 ms 344 KB Output is correct
158 Correct 0 ms 344 KB Output is correct
159 Correct 0 ms 348 KB Output is correct
160 Correct 1 ms 348 KB Output is correct
161 Correct 235 ms 52092 KB Output is correct
162 Correct 195 ms 53884 KB Output is correct
163 Correct 215 ms 46712 KB Output is correct
164 Correct 199 ms 46204 KB Output is correct
165 Correct 232 ms 57844 KB Output is correct
166 Correct 246 ms 61308 KB Output is correct
167 Incorrect 54 ms 9960 KB Tree (a[0], b[0]) = (185669, 21655) is not adjacent to edge between u[0]=0 @(185612, 20720) and v[0]=20200 @(185610, 20720)
168 Halted 0 ms 0 KB -