oj.uz

Submission #827141

# Submission time Handle Problem Language Result Execution time Memory
827141 2023-08-16T09:13:00 Z ymm Fountain Parks (IOI21_parks) C++17
70 / 100
 3158 ms 77056 KB 
#include "parks.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
typedef long long ll;
typedef std::pair<int,int> pii;
using namespace std;

const int N = 200'010;

namespace dsu {
	int par[N];
	void init(int n) { memset(par, -1, sizeof(*par)*n); }
	int rt(int v) { return par[v] == -1? v: (par[v] = rt(par[v])); }
	bool unite(int v, int u) {
		v = rt(v);
		u = rt(u);
		if (v == u)
			return 0;
		par[u] = v;
		return 1;
	}
}

map<pii,int> pts;
vector<pii> edge;
vector<int> X, Y;
int n;

int get_pnt(int x, int y)
{
	auto it = pts.find(pii(x, y));
	return it == pts.end()? -1: it->second;
}

tuple<int,int,int,int> get_chair(int p1, int p2)
{
	int x1 = X[p1], y1 = Y[p1], x2 = X[p2], y2 = Y[p2];
	if (x1 == x2)
		return {x1-1, (y1+y2)/2, x1+1, (y1+y2)/2};
	else
		return {(x1+x2)/2, y1-1, (x1+x2)/2, y1+1};
}

namespace matching {
	int match[3*N];
	int par[3*N];
	vector<int> A[3*N];
	vector<pii> chairs;

	bool bfs(int s)
	{
		vector<int> q = {s}, q2;
		par[s] = -2;
		int vv;
		Loop (i,0,q.size()) {
			int v = q[i];
			//cerr << "bfs " << v << '\n';
			for (int u : A[v]) {
				if (par[u] != -1)
					continue;
				par[u] = v;
				q2.push_back(u);
				if (match[u] == -1) {
					vv = u;
					goto found;
				}
				int u2 = match[u];
				par[u2] = u;
				q.push_back(u2);
			}
		}
		return 0;
	found:
		while (vv != -2) {
			match[vv] = par[vv];
			match[par[vv]] = vv;
			vv = par[par[vv]];
		}
		for (int x : q2)
			par[x] = -1;
		return 1;
	}

	vector<pii> get_match(vector<pii> e) {
		int m = e.size();
		chairs.clear();
		Loop (i,0,m) {
			auto [p1, p2] = e[i];
			auto [x1, y1, x2, y2] = get_chair(p1, p2);
			chairs.emplace_back(x1, y1);
			chairs.emplace_back(x2, y2);
		}
		sort(chairs.begin(), chairs.end());
		chairs.resize(unique(chairs.begin(), chairs.end()) - chairs.begin());
		//for (auto [x, y] : chairs)
		//	cerr << x << ' ' << y << '\n';
		Loop (i,0,m+chairs.size()) {
			A[i].clear();
			match[i] = -1;
			par[i] = -1;
		}
		Loop (i,0,m) {
			auto [p1, p2] = e[i];
			auto [x1, y1, x2, y2] = get_chair(p1, p2);
			int c1 = lower_bound(chairs.begin(), chairs.end(), pii(x1, y1)) - chairs.begin();
			int c2 = lower_bound(chairs.begin(), chairs.end(), pii(x2, y2)) - chairs.begin();
			A[i].push_back(m+c1);
			A[i].push_back(m+c2);
			A[m+c1].push_back(i);
			A[m+c2].push_back(i);
		}
		Loop (i,0,m) {
			//cerr << "try " << i << '\n';
			if (!bfs(i))
				return {};
			//Loop (i,0,m+chairs.size())
			//	cerr << match[i] << ' ';
			//cerr << '\n';
		}
		//cerr << "all good!\n";
		vector<pii> ans;
		Loop (i,0,m) {
			int c = match[i]-m;
			ans.emplace_back(chairs[c].first, chairs[c].second);
		}
		return ans;
	}
}

void make_edges()
{
	Loop (i,0,n) {
		int x = X[i];
		int y = Y[i];
		int p1 = get_pnt(x, y+2);
		if (p1 != -1)
			edge.push_back({i, p1});
	}
	Loop (i,0,n) {
		int x = X[i];
		int y = Y[i];
		if ((x+y)%2 == 0)
			continue;
		int p1 = get_pnt(x+2, y);
		if (p1 != -1)
			edge.push_back({i, p1});
	}
	Loop (i,0,n) {
		int x = X[i];
		int y = Y[i];
		if ((x+y)%2 == 1)
			continue;
		int p1 = get_pnt(x+2, y);
		if (p1 != -1)
			edge.push_back({i, p1});
	}
}

int construct_roads(std::vector<int> _X, std::vector<int> _Y) {
	X = _X; Y = _Y;
	n = X.size();
	if (n == 1) {
		build({}, {}, {}, {});
		return 1;
	}
	Loop (i,0,n)
		pts[pii(X[i], Y[i])] = i;
	make_edges();
	//for (auto [x, y] : edge)
	//	cerr << X[x] << ' ' << Y[x] << " - " << X[y] << ' ' << Y[y] << '\n';
	mt19937_64 rd(time(0));
	while (clock() < 3*CLOCKS_PER_SEC) {
		dsu::init(n);
		int cnt = 0;
		vector<pii> e;
		for (auto [x, y] : edge) {
			if (dsu::unite(x, y)) {
				e.emplace_back(x, y);
				++cnt;
			}
		}
		if (cnt != n-1)
			return 0;
		auto chairs = matching::get_match(e);
		//cerr << "found!\n";
		//for (auto [x, y] : chairs)
		//	cerr << x << ' ' << y << '\n';
		if (chairs.empty())
			continue;
		vector<int> ex, ey, cx, cy;
		Loop (i,0,n-1) {
			ex.push_back(e[i].first);
			ey.push_back(e[i].second);
			cx.push_back(chairs[i].first);
			cy.push_back(chairs[i].second);
		}
		build(ex, ey, cx, cy);
		return 1;
	}
	return 0;
}

Compilation message

parks.cpp: In function 'bool matching::bfs(int)':
parks.cpp:3:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
parks.cpp:55:3: note: in expansion of macro 'Loop'
   55 |   Loop (i,0,q.size()) {
      |   ^~~~
parks.cpp: In function 'std::vector<std::pair<int, int> > matching::get_match(std::vector<std::pair<int, int> >)':
parks.cpp:3:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
parks.cpp:97:3: note: in expansion of macro 'Loop'
   97 |   Loop (i,0,m+chairs.size()) {
      |   ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14400 KB Output is correct
6 Correct 9 ms 14308 KB Output is correct
7 Correct 8 ms 14292 KB Output is correct
8 Correct 11 ms 14416 KB Output is correct
9 Correct 214 ms 45332 KB Output is correct
10 Correct 18 ms 17536 KB Output is correct
11 Correct 68 ms 31128 KB Output is correct
12 Correct 24 ms 19136 KB Output is correct
13 Correct 30 ms 19856 KB Output is correct
14 Correct 7 ms 14508 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 176 ms 45268 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14400 KB Output is correct
6 Correct 9 ms 14308 KB Output is correct
7 Correct 8 ms 14292 KB Output is correct
8 Correct 11 ms 14416 KB Output is correct
9 Correct 214 ms 45332 KB Output is correct
10 Correct 18 ms 17536 KB Output is correct
11 Correct 68 ms 31128 KB Output is correct
12 Correct 24 ms 19136 KB Output is correct
13 Correct 30 ms 19856 KB Output is correct
14 Correct 7 ms 14508 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 176 ms 45268 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 7 ms 14336 KB Output is correct
19 Correct 10 ms 14400 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 10 ms 14308 KB Output is correct
22 Correct 8 ms 14292 KB Output is correct
23 Correct 546 ms 74392 KB Output is correct
24 Correct 7 ms 14292 KB Output is correct
25 Correct 10 ms 14792 KB Output is correct
26 Correct 9 ms 14676 KB Output is correct
27 Correct 10 ms 14796 KB Output is correct
28 Correct 212 ms 38288 KB Output is correct
29 Correct 242 ms 50408 KB Output is correct
30 Correct 391 ms 61916 KB Output is correct
31 Correct 440 ms 74392 KB Output is correct
32 Correct 7 ms 14292 KB Output is correct
33 Correct 8 ms 14292 KB Output is correct
34 Correct 8 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 6 ms 14292 KB Output is correct
37 Correct 6 ms 14420 KB Output is correct
38 Correct 7 ms 14292 KB Output is correct
39 Correct 7 ms 14292 KB Output is correct
40 Correct 7 ms 14308 KB Output is correct
41 Correct 7 ms 14292 KB Output is correct
42 Correct 6 ms 14292 KB Output is correct
43 Correct 7 ms 14548 KB Output is correct
44 Correct 8 ms 14676 KB Output is correct
45 Correct 202 ms 42864 KB Output is correct
46 Correct 297 ms 56628 KB Output is correct
47 Correct 288 ms 56580 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14400 KB Output is correct
6 Correct 9 ms 14308 KB Output is correct
7 Correct 8 ms 14292 KB Output is correct
8 Correct 11 ms 14416 KB Output is correct
9 Correct 214 ms 45332 KB Output is correct
10 Correct 18 ms 17536 KB Output is correct
11 Correct 68 ms 31128 KB Output is correct
12 Correct 24 ms 19136 KB Output is correct
13 Correct 30 ms 19856 KB Output is correct
14 Correct 7 ms 14508 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 176 ms 45268 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 7 ms 14336 KB Output is correct
19 Correct 10 ms 14400 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 10 ms 14308 KB Output is correct
22 Correct 8 ms 14292 KB Output is correct
23 Correct 546 ms 74392 KB Output is correct
24 Correct 7 ms 14292 KB Output is correct
25 Correct 10 ms 14792 KB Output is correct
26 Correct 9 ms 14676 KB Output is correct
27 Correct 10 ms 14796 KB Output is correct
28 Correct 212 ms 38288 KB Output is correct
29 Correct 242 ms 50408 KB Output is correct
30 Correct 391 ms 61916 KB Output is correct
31 Correct 440 ms 74392 KB Output is correct
32 Correct 7 ms 14292 KB Output is correct
33 Correct 8 ms 14292 KB Output is correct
34 Correct 8 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 6 ms 14292 KB Output is correct
37 Correct 6 ms 14420 KB Output is correct
38 Correct 7 ms 14292 KB Output is correct
39 Correct 7 ms 14292 KB Output is correct
40 Correct 7 ms 14308 KB Output is correct
41 Correct 7 ms 14292 KB Output is correct
42 Correct 6 ms 14292 KB Output is correct
43 Correct 7 ms 14548 KB Output is correct
44 Correct 8 ms 14676 KB Output is correct
45 Correct 202 ms 42864 KB Output is correct
46 Correct 297 ms 56628 KB Output is correct
47 Correct 288 ms 56580 KB Output is correct
48 Correct 8 ms 14292 KB Output is correct
49 Correct 7 ms 14292 KB Output is correct
50 Correct 7 ms 14292 KB Output is correct
51 Correct 7 ms 14404 KB Output is correct
52 Correct 7 ms 14292 KB Output is correct
53 Correct 7 ms 14320 KB Output is correct
54 Correct 10 ms 14292 KB Output is correct
55 Correct 500 ms 73436 KB Output is correct
56 Correct 7 ms 14292 KB Output is correct
57 Correct 8 ms 14912 KB Output is correct
58 Correct 15 ms 16208 KB Output is correct
59 Correct 12 ms 15716 KB Output is correct
60 Correct 193 ms 43912 KB Output is correct
61 Correct 294 ms 54304 KB Output is correct
62 Correct 340 ms 63588 KB Output is correct
63 Correct 449 ms 73520 KB Output is correct
64 Correct 7 ms 14292 KB Output is correct
65 Correct 9 ms 14292 KB Output is correct
66 Correct 7 ms 14404 KB Output is correct
67 Correct 452 ms 75940 KB Output is correct
68 Correct 404 ms 76008 KB Output is correct
69 Correct 397 ms 75704 KB Output is correct
70 Correct 9 ms 14804 KB Output is correct
71 Correct 11 ms 15312 KB Output is correct
72 Correct 189 ms 42644 KB Output is correct
73 Correct 332 ms 57668 KB Output is correct
74 Correct 451 ms 70800 KB Output is correct
75 Correct 471 ms 73176 KB Output is correct
76 Correct 466 ms 76000 KB Output is correct
77 Correct 11 ms 14932 KB Output is correct
78 Correct 12 ms 15500 KB Output is correct
79 Correct 188 ms 43048 KB Output is correct
80 Correct 299 ms 58436 KB Output is correct
81 Correct 459 ms 71764 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14400 KB Output is correct
6 Correct 9 ms 14308 KB Output is correct
7 Correct 8 ms 14292 KB Output is correct
8 Correct 11 ms 14416 KB Output is correct
9 Correct 214 ms 45332 KB Output is correct
10 Correct 18 ms 17536 KB Output is correct
11 Correct 68 ms 31128 KB Output is correct
12 Correct 24 ms 19136 KB Output is correct
13 Correct 30 ms 19856 KB Output is correct
14 Correct 7 ms 14508 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 176 ms 45268 KB Output is correct
17 Correct 7 ms 14348 KB Output is correct
18 Correct 7 ms 14316 KB Output is correct
19 Correct 7 ms 14400 KB Output is correct
20 Correct 508 ms 69040 KB Output is correct
21 Correct 441 ms 68904 KB Output is correct
22 Correct 461 ms 68888 KB Output is correct
23 Correct 364 ms 67688 KB Output is correct
24 Correct 274 ms 32888 KB Output is correct
25 Correct 299 ms 37464 KB Output is correct
26 Correct 230 ms 37552 KB Output is correct
27 Correct 518 ms 75884 KB Output is correct
28 Correct 496 ms 75928 KB Output is correct
29 Correct 561 ms 75904 KB Output is correct
30 Correct 571 ms 75952 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 30 ms 18552 KB Output is correct
33 Correct 104 ms 23900 KB Output is correct
34 Correct 488 ms 69020 KB Output is correct
35 Correct 17 ms 15696 KB Output is correct
36 Correct 48 ms 20548 KB Output is correct
37 Correct 97 ms 26220 KB Output is correct
38 Correct 155 ms 37544 KB Output is correct
39 Correct 217 ms 45196 KB Output is correct
40 Correct 312 ms 54920 KB Output is correct
41 Correct 434 ms 62720 KB Output is correct
42 Correct 448 ms 70564 KB Output is correct
43 Correct 7 ms 14420 KB Output is correct
44 Correct 8 ms 14400 KB Output is correct
45 Correct 7 ms 14400 KB Output is correct
46 Correct 7 ms 14336 KB Output is correct
47 Correct 7 ms 14316 KB Output is correct
48 Correct 8 ms 14292 KB Output is correct
49 Correct 8 ms 14292 KB Output is correct
50 Correct 7 ms 14404 KB Output is correct
51 Correct 7 ms 14292 KB Output is correct
52 Correct 7 ms 14292 KB Output is correct
53 Correct 7 ms 14400 KB Output is correct
54 Correct 8 ms 14548 KB Output is correct
55 Correct 11 ms 14664 KB Output is correct
56 Correct 183 ms 42896 KB Output is correct
57 Correct 291 ms 56620 KB Output is correct
58 Correct 298 ms 56576 KB Output is correct
59 Correct 7 ms 14292 KB Output is correct
60 Correct 7 ms 14400 KB Output is correct
61 Correct 9 ms 14292 KB Output is correct
62 Correct 427 ms 76024 KB Output is correct
63 Correct 394 ms 76108 KB Output is correct
64 Correct 448 ms 75740 KB Output is correct
65 Correct 9 ms 14804 KB Output is correct
66 Correct 14 ms 15308 KB Output is correct
67 Correct 187 ms 42644 KB Output is correct
68 Correct 376 ms 57604 KB Output is correct
69 Correct 453 ms 70808 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14400 KB Output is correct
6 Correct 9 ms 14308 KB Output is correct
7 Correct 8 ms 14292 KB Output is correct
8 Correct 11 ms 14416 KB Output is correct
9 Correct 214 ms 45332 KB Output is correct
10 Correct 18 ms 17536 KB Output is correct
11 Correct 68 ms 31128 KB Output is correct
12 Correct 24 ms 19136 KB Output is correct
13 Correct 30 ms 19856 KB Output is correct
14 Correct 7 ms 14508 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 176 ms 45268 KB Output is correct
17 Correct 572 ms 76752 KB Output is correct
18 Correct 449 ms 77056 KB Output is correct
19 Correct 471 ms 69520 KB Output is correct
20 Correct 502 ms 70196 KB Output is correct
21 Correct 421 ms 66632 KB Output is correct
22 Correct 7 ms 14292 KB Output is correct
23 Correct 60 ms 23852 KB Output is correct
24 Correct 21 ms 16984 KB Output is correct
25 Correct 68 ms 23332 KB Output is correct
26 Correct 137 ms 28904 KB Output is correct
27 Correct 203 ms 43044 KB Output is correct
28 Correct 263 ms 51476 KB Output is correct
29 Correct 359 ms 58816 KB Output is correct
30 Correct 416 ms 65208 KB Output is correct
31 Correct 501 ms 72020 KB Output is correct
32 Correct 512 ms 73584 KB Output is correct
33 Correct 408 ms 76532 KB Output is correct
34 Correct 10 ms 14932 KB Output is correct
35 Correct 13 ms 15588 KB Output is correct
36 Correct 191 ms 43144 KB Output is correct
37 Correct 312 ms 58536 KB Output is correct
38 Correct 601 ms 72268 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14400 KB Output is correct
6 Correct 9 ms 14308 KB Output is correct
7 Correct 8 ms 14292 KB Output is correct
8 Correct 11 ms 14416 KB Output is correct
9 Correct 214 ms 45332 KB Output is correct
10 Correct 18 ms 17536 KB Output is correct
11 Correct 68 ms 31128 KB Output is correct
12 Correct 24 ms 19136 KB Output is correct
13 Correct 30 ms 19856 KB Output is correct
14 Correct 7 ms 14508 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 176 ms 45268 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 7 ms 14336 KB Output is correct
19 Correct 10 ms 14400 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 10 ms 14308 KB Output is correct
22 Correct 8 ms 14292 KB Output is correct
23 Correct 546 ms 74392 KB Output is correct
24 Correct 7 ms 14292 KB Output is correct
25 Correct 10 ms 14792 KB Output is correct
26 Correct 9 ms 14676 KB Output is correct
27 Correct 10 ms 14796 KB Output is correct
28 Correct 212 ms 38288 KB Output is correct
29 Correct 242 ms 50408 KB Output is correct
30 Correct 391 ms 61916 KB Output is correct
31 Correct 440 ms 74392 KB Output is correct
32 Correct 7 ms 14292 KB Output is correct
33 Correct 8 ms 14292 KB Output is correct
34 Correct 8 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 6 ms 14292 KB Output is correct
37 Correct 6 ms 14420 KB Output is correct
38 Correct 7 ms 14292 KB Output is correct
39 Correct 7 ms 14292 KB Output is correct
40 Correct 7 ms 14308 KB Output is correct
41 Correct 7 ms 14292 KB Output is correct
42 Correct 6 ms 14292 KB Output is correct
43 Correct 7 ms 14548 KB Output is correct
44 Correct 8 ms 14676 KB Output is correct
45 Correct 202 ms 42864 KB Output is correct
46 Correct 297 ms 56628 KB Output is correct
47 Correct 288 ms 56580 KB Output is correct
48 Correct 8 ms 14292 KB Output is correct
49 Correct 7 ms 14292 KB Output is correct
50 Correct 7 ms 14292 KB Output is correct
51 Correct 7 ms 14404 KB Output is correct
52 Correct 7 ms 14292 KB Output is correct
53 Correct 7 ms 14320 KB Output is correct
54 Correct 10 ms 14292 KB Output is correct
55 Correct 500 ms 73436 KB Output is correct
56 Correct 7 ms 14292 KB Output is correct
57 Correct 8 ms 14912 KB Output is correct
58 Correct 15 ms 16208 KB Output is correct
59 Correct 12 ms 15716 KB Output is correct
60 Correct 193 ms 43912 KB Output is correct
61 Correct 294 ms 54304 KB Output is correct
62 Correct 340 ms 63588 KB Output is correct
63 Correct 449 ms 73520 KB Output is correct
64 Correct 7 ms 14292 KB Output is correct
65 Correct 9 ms 14292 KB Output is correct
66 Correct 7 ms 14404 KB Output is correct
67 Correct 452 ms 75940 KB Output is correct
68 Correct 404 ms 76008 KB Output is correct
69 Correct 397 ms 75704 KB Output is correct
70 Correct 9 ms 14804 KB Output is correct
71 Correct 11 ms 15312 KB Output is correct
72 Correct 189 ms 42644 KB Output is correct
73 Correct 332 ms 57668 KB Output is correct
74 Correct 451 ms 70800 KB Output is correct
75 Correct 471 ms 73176 KB Output is correct
76 Correct 466 ms 76000 KB Output is correct
77 Correct 11 ms 14932 KB Output is correct
78 Correct 12 ms 15500 KB Output is correct
79 Correct 188 ms 43048 KB Output is correct
80 Correct 299 ms 58436 KB Output is correct
81 Correct 459 ms 71764 KB Output is correct
82 Correct 7 ms 14348 KB Output is correct
83 Correct 7 ms 14316 KB Output is correct
84 Correct 7 ms 14400 KB Output is correct
85 Correct 508 ms 69040 KB Output is correct
86 Correct 441 ms 68904 KB Output is correct
87 Correct 461 ms 68888 KB Output is correct
88 Correct 364 ms 67688 KB Output is correct
89 Correct 274 ms 32888 KB Output is correct
90 Correct 299 ms 37464 KB Output is correct
91 Correct 230 ms 37552 KB Output is correct
92 Correct 518 ms 75884 KB Output is correct
93 Correct 496 ms 75928 KB Output is correct
94 Correct 561 ms 75904 KB Output is correct
95 Correct 571 ms 75952 KB Output is correct
96 Correct 7 ms 14420 KB Output is correct
97 Correct 30 ms 18552 KB Output is correct
98 Correct 104 ms 23900 KB Output is correct
99 Correct 488 ms 69020 KB Output is correct
100 Correct 17 ms 15696 KB Output is correct
101 Correct 48 ms 20548 KB Output is correct
102 Correct 97 ms 26220 KB Output is correct
103 Correct 155 ms 37544 KB Output is correct
104 Correct 217 ms 45196 KB Output is correct
105 Correct 312 ms 54920 KB Output is correct
106 Correct 434 ms 62720 KB Output is correct
107 Correct 448 ms 70564 KB Output is correct
108 Correct 7 ms 14420 KB Output is correct
109 Correct 8 ms 14400 KB Output is correct
110 Correct 7 ms 14400 KB Output is correct
111 Correct 7 ms 14336 KB Output is correct
112 Correct 7 ms 14316 KB Output is correct
113 Correct 8 ms 14292 KB Output is correct
114 Correct 8 ms 14292 KB Output is correct
115 Correct 7 ms 14404 KB Output is correct
116 Correct 7 ms 14292 KB Output is correct
117 Correct 7 ms 14292 KB Output is correct
118 Correct 7 ms 14400 KB Output is correct
119 Correct 8 ms 14548 KB Output is correct
120 Correct 11 ms 14664 KB Output is correct
121 Correct 183 ms 42896 KB Output is correct
122 Correct 291 ms 56620 KB Output is correct
123 Correct 298 ms 56576 KB Output is correct
124 Correct 7 ms 14292 KB Output is correct
125 Correct 7 ms 14400 KB Output is correct
126 Correct 9 ms 14292 KB Output is correct
127 Correct 427 ms 76024 KB Output is correct
128 Correct 394 ms 76108 KB Output is correct
129 Correct 448 ms 75740 KB Output is correct
130 Correct 9 ms 14804 KB Output is correct
131 Correct 14 ms 15308 KB Output is correct
132 Correct 187 ms 42644 KB Output is correct
133 Correct 376 ms 57604 KB Output is correct
134 Correct 453 ms 70808 KB Output is correct
135 Correct 572 ms 76752 KB Output is correct
136 Correct 449 ms 77056 KB Output is correct
137 Correct 471 ms 69520 KB Output is correct
138 Correct 502 ms 70196 KB Output is correct
139 Correct 421 ms 66632 KB Output is correct
140 Correct 7 ms 14292 KB Output is correct
141 Correct 60 ms 23852 KB Output is correct
142 Correct 21 ms 16984 KB Output is correct
143 Correct 68 ms 23332 KB Output is correct
144 Correct 137 ms 28904 KB Output is correct
145 Correct 203 ms 43044 KB Output is correct
146 Correct 263 ms 51476 KB Output is correct
147 Correct 359 ms 58816 KB Output is correct
148 Correct 416 ms 65208 KB Output is correct
149 Correct 501 ms 72020 KB Output is correct
150 Correct 512 ms 73584 KB Output is correct
151 Correct 408 ms 76532 KB Output is correct
152 Correct 10 ms 14932 KB Output is correct
153 Correct 13 ms 15588 KB Output is correct
154 Correct 191 ms 43144 KB Output is correct
155 Correct 312 ms 58536 KB Output is correct
156 Correct 601 ms 72268 KB Output is correct
157 Correct 7 ms 14292 KB Output is correct
158 Correct 9 ms 14388 KB Output is correct
159 Correct 7 ms 14292 KB Output is correct
160 Correct 8 ms 14404 KB Output is correct
161 Incorrect 3158 ms 60060 KB Solution announced impossible, but it is possible.
162 Halted 0 ms 0 KB -