oj.uz

Submission #827113

# Submission time Handle Problem Language Result Execution time Memory
827113 2023-08-16T08:51:44 Z ymm Fountain Parks (IOI21_parks) C++17
70 / 100
 3101 ms 79292 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()
{
	set<pii> black;
	Loop (i,0,n) {
		int x = X[i];
		int y = Y[i];
		if (get_pnt(x, y+2) != -1 && get_pnt(x+2, y) != -1 && get_pnt(x+2, y+2) != -1)
			black.insert({x+1, y+1});
	}
	vector<pii> e1, e2;
	Loop (i,0,n) {
		int x = X[i];
		int y = Y[i];
		int p1 = get_pnt(x, y+2);
		if (p1 == -1)
			continue;
		auto [c1x, c1y, c2x, c2y] = get_chair(i, p1);
		if (black.count(pii(c1x, c1y)) + black.count(pii(c2x, c2y)) == 1)
			e1.push_back({i, p1});
		else
			e2.push_back({i, p1});
	}
	Loop (i,0,n) {
		int x = X[i];
		int y = Y[i];
		int p1 = get_pnt(x+2, y);
		if (p1 == -1)
			continue;
		auto [c1x, c1y, c2x, c2y] = get_chair(i, p1);
		if (black.count(pii(c1x, c1y)) + black.count(pii(c2x, c2y)) == 1)
			e1.push_back({i, p1});
		else
			e2.push_back({i, p1});
	}
	edge = e1;
	edge.insert(edge.end(), e2.begin(), e2.end());
}

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 10 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14396 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 7 ms 14292 KB Output is correct
9 Correct 221 ms 46428 KB Output is correct
10 Correct 20 ms 17744 KB Output is correct
11 Correct 75 ms 31564 KB Output is correct
12 Correct 26 ms 19236 KB Output is correct
13 Correct 41 ms 19952 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14540 KB Output is correct
16 Correct 203 ms 46364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14396 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 7 ms 14292 KB Output is correct
9 Correct 221 ms 46428 KB Output is correct
10 Correct 20 ms 17744 KB Output is correct
11 Correct 75 ms 31564 KB Output is correct
12 Correct 26 ms 19236 KB Output is correct
13 Correct 41 ms 19952 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14540 KB Output is correct
16 Correct 203 ms 46364 KB Output is correct
17 Correct 9 ms 14292 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 7 ms 14400 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 7 ms 14308 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 777 ms 75772 KB Output is correct
24 Correct 8 ms 14292 KB Output is correct
25 Correct 11 ms 14804 KB Output is correct
26 Correct 11 ms 14836 KB Output is correct
27 Correct 12 ms 14932 KB Output is correct
28 Correct 222 ms 39308 KB Output is correct
29 Correct 381 ms 50904 KB Output is correct
30 Correct 570 ms 64656 KB Output is correct
31 Correct 828 ms 75784 KB Output is correct
32 Correct 7 ms 14292 KB Output is correct
33 Correct 7 ms 14292 KB Output is correct
34 Correct 7 ms 14404 KB Output is correct
35 Correct 7 ms 14312 KB Output is correct
36 Correct 8 ms 14360 KB Output is correct
37 Correct 7 ms 14292 KB Output is correct
38 Correct 10 ms 14292 KB Output is correct
39 Correct 7 ms 14292 KB Output is correct
40 Correct 7 ms 14408 KB Output is correct
41 Correct 10 ms 14292 KB Output is correct
42 Correct 7 ms 14292 KB Output is correct
43 Correct 9 ms 14540 KB Output is correct
44 Correct 9 ms 14668 KB Output is correct
45 Correct 264 ms 43992 KB Output is correct
46 Correct 345 ms 58556 KB Output is correct
47 Correct 335 ms 58476 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14396 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 7 ms 14292 KB Output is correct
9 Correct 221 ms 46428 KB Output is correct
10 Correct 20 ms 17744 KB Output is correct
11 Correct 75 ms 31564 KB Output is correct
12 Correct 26 ms 19236 KB Output is correct
13 Correct 41 ms 19952 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14540 KB Output is correct
16 Correct 203 ms 46364 KB Output is correct
17 Correct 9 ms 14292 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 7 ms 14400 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 7 ms 14308 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 777 ms 75772 KB Output is correct
24 Correct 8 ms 14292 KB Output is correct
25 Correct 11 ms 14804 KB Output is correct
26 Correct 11 ms 14836 KB Output is correct
27 Correct 12 ms 14932 KB Output is correct
28 Correct 222 ms 39308 KB Output is correct
29 Correct 381 ms 50904 KB Output is correct
30 Correct 570 ms 64656 KB Output is correct
31 Correct 828 ms 75784 KB Output is correct
32 Correct 7 ms 14292 KB Output is correct
33 Correct 7 ms 14292 KB Output is correct
34 Correct 7 ms 14404 KB Output is correct
35 Correct 7 ms 14312 KB Output is correct
36 Correct 8 ms 14360 KB Output is correct
37 Correct 7 ms 14292 KB Output is correct
38 Correct 10 ms 14292 KB Output is correct
39 Correct 7 ms 14292 KB Output is correct
40 Correct 7 ms 14408 KB Output is correct
41 Correct 10 ms 14292 KB Output is correct
42 Correct 7 ms 14292 KB Output is correct
43 Correct 9 ms 14540 KB Output is correct
44 Correct 9 ms 14668 KB Output is correct
45 Correct 264 ms 43992 KB Output is correct
46 Correct 345 ms 58556 KB Output is correct
47 Correct 335 ms 58476 KB Output is correct
48 Correct 8 ms 14408 KB Output is correct
49 Correct 7 ms 14372 KB Output is correct
50 Correct 7 ms 14292 KB Output is correct
51 Correct 8 ms 14404 KB Output is correct
52 Correct 8 ms 14368 KB Output is correct
53 Correct 7 ms 14404 KB Output is correct
54 Correct 8 ms 14312 KB Output is correct
55 Correct 934 ms 74956 KB Output is correct
56 Correct 9 ms 14292 KB Output is correct
57 Correct 10 ms 14924 KB Output is correct
58 Correct 19 ms 16236 KB Output is correct
59 Correct 19 ms 15952 KB Output is correct
60 Correct 356 ms 44300 KB Output is correct
61 Correct 513 ms 55984 KB Output is correct
62 Correct 610 ms 64484 KB Output is correct
63 Correct 869 ms 74728 KB Output is correct
64 Correct 7 ms 14292 KB Output is correct
65 Correct 7 ms 14292 KB Output is correct
66 Correct 7 ms 14400 KB Output is correct
67 Correct 514 ms 78708 KB Output is correct
68 Correct 504 ms 78900 KB Output is correct
69 Correct 491 ms 78416 KB Output is correct
70 Correct 9 ms 14804 KB Output is correct
71 Correct 13 ms 15288 KB Output is correct
72 Correct 218 ms 43732 KB Output is correct
73 Correct 369 ms 59780 KB Output is correct
74 Correct 611 ms 73588 KB Output is correct
75 Correct 594 ms 75852 KB Output is correct
76 Correct 497 ms 78800 KB Output is correct
77 Correct 11 ms 14932 KB Output is correct
78 Correct 14 ms 15568 KB Output is correct
79 Correct 247 ms 44252 KB Output is correct
80 Correct 382 ms 60412 KB Output is correct
81 Correct 576 ms 74380 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14396 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 7 ms 14292 KB Output is correct
9 Correct 221 ms 46428 KB Output is correct
10 Correct 20 ms 17744 KB Output is correct
11 Correct 75 ms 31564 KB Output is correct
12 Correct 26 ms 19236 KB Output is correct
13 Correct 41 ms 19952 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14540 KB Output is correct
16 Correct 203 ms 46364 KB Output is correct
17 Correct 7 ms 14400 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 7 ms 14292 KB Output is correct
20 Correct 559 ms 72308 KB Output is correct
21 Correct 523 ms 72140 KB Output is correct
22 Correct 571 ms 72172 KB Output is correct
23 Correct 467 ms 69952 KB Output is correct
24 Correct 313 ms 34112 KB Output is correct
25 Correct 335 ms 39152 KB Output is correct
26 Correct 407 ms 39080 KB Output is correct
27 Correct 544 ms 78648 KB Output is correct
28 Correct 549 ms 78632 KB Output is correct
29 Correct 633 ms 78348 KB Output is correct
30 Correct 513 ms 78528 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 36 ms 18620 KB Output is correct
33 Correct 108 ms 24648 KB Output is correct
34 Correct 537 ms 72748 KB Output is correct
35 Correct 18 ms 15668 KB Output is correct
36 Correct 62 ms 20784 KB Output is correct
37 Correct 132 ms 27148 KB Output is correct
38 Correct 186 ms 38844 KB Output is correct
39 Correct 264 ms 47168 KB Output is correct
40 Correct 405 ms 57208 KB Output is correct
41 Correct 487 ms 65468 KB Output is correct
42 Correct 523 ms 74100 KB Output is correct
43 Correct 7 ms 14292 KB Output is correct
44 Correct 6 ms 14404 KB Output is correct
45 Correct 6 ms 14400 KB Output is correct
46 Correct 6 ms 14292 KB Output is correct
47 Correct 8 ms 14408 KB Output is correct
48 Correct 7 ms 14292 KB Output is correct
49 Correct 7 ms 14420 KB Output is correct
50 Correct 7 ms 14292 KB Output is correct
51 Correct 7 ms 14292 KB Output is correct
52 Correct 7 ms 14400 KB Output is correct
53 Correct 6 ms 14292 KB Output is correct
54 Correct 8 ms 14548 KB Output is correct
55 Correct 8 ms 14676 KB Output is correct
56 Correct 212 ms 44060 KB Output is correct
57 Correct 341 ms 58568 KB Output is correct
58 Correct 344 ms 58468 KB Output is correct
59 Correct 7 ms 14292 KB Output is correct
60 Correct 6 ms 14400 KB Output is correct
61 Correct 7 ms 14396 KB Output is correct
62 Correct 490 ms 78728 KB Output is correct
63 Correct 478 ms 78764 KB Output is correct
64 Correct 501 ms 78504 KB Output is correct
65 Correct 9 ms 14868 KB Output is correct
66 Correct 12 ms 15316 KB Output is correct
67 Correct 205 ms 43728 KB Output is correct
68 Correct 355 ms 59668 KB Output is correct
69 Correct 532 ms 73516 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14396 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 7 ms 14292 KB Output is correct
9 Correct 221 ms 46428 KB Output is correct
10 Correct 20 ms 17744 KB Output is correct
11 Correct 75 ms 31564 KB Output is correct
12 Correct 26 ms 19236 KB Output is correct
13 Correct 41 ms 19952 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14540 KB Output is correct
16 Correct 203 ms 46364 KB Output is correct
17 Correct 512 ms 79096 KB Output is correct
18 Correct 507 ms 79292 KB Output is correct
19 Correct 607 ms 71644 KB Output is correct
20 Correct 568 ms 72652 KB Output is correct
21 Correct 498 ms 68768 KB Output is correct
22 Correct 7 ms 14292 KB Output is correct
23 Correct 72 ms 23948 KB Output is correct
24 Correct 27 ms 16924 KB Output is correct
25 Correct 92 ms 23740 KB Output is correct
26 Correct 167 ms 29504 KB Output is correct
27 Correct 245 ms 44660 KB Output is correct
28 Correct 331 ms 51820 KB Output is correct
29 Correct 457 ms 60456 KB Output is correct
30 Correct 583 ms 66628 KB Output is correct
31 Correct 600 ms 73936 KB Output is correct
32 Correct 591 ms 75376 KB Output is correct
33 Correct 516 ms 78148 KB Output is correct
34 Correct 13 ms 14932 KB Output is correct
35 Correct 13 ms 15564 KB Output is correct
36 Correct 221 ms 44124 KB Output is correct
37 Correct 373 ms 60352 KB Output is correct
38 Correct 539 ms 73884 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14292 KB Output is correct
2 Correct 7 ms 14292 KB Output is correct
3 Correct 7 ms 14396 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 7 ms 14292 KB Output is correct
9 Correct 221 ms 46428 KB Output is correct
10 Correct 20 ms 17744 KB Output is correct
11 Correct 75 ms 31564 KB Output is correct
12 Correct 26 ms 19236 KB Output is correct
13 Correct 41 ms 19952 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14540 KB Output is correct
16 Correct 203 ms 46364 KB Output is correct
17 Correct 9 ms 14292 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 7 ms 14400 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 7 ms 14308 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 777 ms 75772 KB Output is correct
24 Correct 8 ms 14292 KB Output is correct
25 Correct 11 ms 14804 KB Output is correct
26 Correct 11 ms 14836 KB Output is correct
27 Correct 12 ms 14932 KB Output is correct
28 Correct 222 ms 39308 KB Output is correct
29 Correct 381 ms 50904 KB Output is correct
30 Correct 570 ms 64656 KB Output is correct
31 Correct 828 ms 75784 KB Output is correct
32 Correct 7 ms 14292 KB Output is correct
33 Correct 7 ms 14292 KB Output is correct
34 Correct 7 ms 14404 KB Output is correct
35 Correct 7 ms 14312 KB Output is correct
36 Correct 8 ms 14360 KB Output is correct
37 Correct 7 ms 14292 KB Output is correct
38 Correct 10 ms 14292 KB Output is correct
39 Correct 7 ms 14292 KB Output is correct
40 Correct 7 ms 14408 KB Output is correct
41 Correct 10 ms 14292 KB Output is correct
42 Correct 7 ms 14292 KB Output is correct
43 Correct 9 ms 14540 KB Output is correct
44 Correct 9 ms 14668 KB Output is correct
45 Correct 264 ms 43992 KB Output is correct
46 Correct 345 ms 58556 KB Output is correct
47 Correct 335 ms 58476 KB Output is correct
48 Correct 8 ms 14408 KB Output is correct
49 Correct 7 ms 14372 KB Output is correct
50 Correct 7 ms 14292 KB Output is correct
51 Correct 8 ms 14404 KB Output is correct
52 Correct 8 ms 14368 KB Output is correct
53 Correct 7 ms 14404 KB Output is correct
54 Correct 8 ms 14312 KB Output is correct
55 Correct 934 ms 74956 KB Output is correct
56 Correct 9 ms 14292 KB Output is correct
57 Correct 10 ms 14924 KB Output is correct
58 Correct 19 ms 16236 KB Output is correct
59 Correct 19 ms 15952 KB Output is correct
60 Correct 356 ms 44300 KB Output is correct
61 Correct 513 ms 55984 KB Output is correct
62 Correct 610 ms 64484 KB Output is correct
63 Correct 869 ms 74728 KB Output is correct
64 Correct 7 ms 14292 KB Output is correct
65 Correct 7 ms 14292 KB Output is correct
66 Correct 7 ms 14400 KB Output is correct
67 Correct 514 ms 78708 KB Output is correct
68 Correct 504 ms 78900 KB Output is correct
69 Correct 491 ms 78416 KB Output is correct
70 Correct 9 ms 14804 KB Output is correct
71 Correct 13 ms 15288 KB Output is correct
72 Correct 218 ms 43732 KB Output is correct
73 Correct 369 ms 59780 KB Output is correct
74 Correct 611 ms 73588 KB Output is correct
75 Correct 594 ms 75852 KB Output is correct
76 Correct 497 ms 78800 KB Output is correct
77 Correct 11 ms 14932 KB Output is correct
78 Correct 14 ms 15568 KB Output is correct
79 Correct 247 ms 44252 KB Output is correct
80 Correct 382 ms 60412 KB Output is correct
81 Correct 576 ms 74380 KB Output is correct
82 Correct 7 ms 14400 KB Output is correct
83 Correct 7 ms 14292 KB Output is correct
84 Correct 7 ms 14292 KB Output is correct
85 Correct 559 ms 72308 KB Output is correct
86 Correct 523 ms 72140 KB Output is correct
87 Correct 571 ms 72172 KB Output is correct
88 Correct 467 ms 69952 KB Output is correct
89 Correct 313 ms 34112 KB Output is correct
90 Correct 335 ms 39152 KB Output is correct
91 Correct 407 ms 39080 KB Output is correct
92 Correct 544 ms 78648 KB Output is correct
93 Correct 549 ms 78632 KB Output is correct
94 Correct 633 ms 78348 KB Output is correct
95 Correct 513 ms 78528 KB Output is correct
96 Correct 7 ms 14420 KB Output is correct
97 Correct 36 ms 18620 KB Output is correct
98 Correct 108 ms 24648 KB Output is correct
99 Correct 537 ms 72748 KB Output is correct
100 Correct 18 ms 15668 KB Output is correct
101 Correct 62 ms 20784 KB Output is correct
102 Correct 132 ms 27148 KB Output is correct
103 Correct 186 ms 38844 KB Output is correct
104 Correct 264 ms 47168 KB Output is correct
105 Correct 405 ms 57208 KB Output is correct
106 Correct 487 ms 65468 KB Output is correct
107 Correct 523 ms 74100 KB Output is correct
108 Correct 7 ms 14292 KB Output is correct
109 Correct 6 ms 14404 KB Output is correct
110 Correct 6 ms 14400 KB Output is correct
111 Correct 6 ms 14292 KB Output is correct
112 Correct 8 ms 14408 KB Output is correct
113 Correct 7 ms 14292 KB Output is correct
114 Correct 7 ms 14420 KB Output is correct
115 Correct 7 ms 14292 KB Output is correct
116 Correct 7 ms 14292 KB Output is correct
117 Correct 7 ms 14400 KB Output is correct
118 Correct 6 ms 14292 KB Output is correct
119 Correct 8 ms 14548 KB Output is correct
120 Correct 8 ms 14676 KB Output is correct
121 Correct 212 ms 44060 KB Output is correct
122 Correct 341 ms 58568 KB Output is correct
123 Correct 344 ms 58468 KB Output is correct
124 Correct 7 ms 14292 KB Output is correct
125 Correct 6 ms 14400 KB Output is correct
126 Correct 7 ms 14396 KB Output is correct
127 Correct 490 ms 78728 KB Output is correct
128 Correct 478 ms 78764 KB Output is correct
129 Correct 501 ms 78504 KB Output is correct
130 Correct 9 ms 14868 KB Output is correct
131 Correct 12 ms 15316 KB Output is correct
132 Correct 205 ms 43728 KB Output is correct
133 Correct 355 ms 59668 KB Output is correct
134 Correct 532 ms 73516 KB Output is correct
135 Correct 512 ms 79096 KB Output is correct
136 Correct 507 ms 79292 KB Output is correct
137 Correct 607 ms 71644 KB Output is correct
138 Correct 568 ms 72652 KB Output is correct
139 Correct 498 ms 68768 KB Output is correct
140 Correct 7 ms 14292 KB Output is correct
141 Correct 72 ms 23948 KB Output is correct
142 Correct 27 ms 16924 KB Output is correct
143 Correct 92 ms 23740 KB Output is correct
144 Correct 167 ms 29504 KB Output is correct
145 Correct 245 ms 44660 KB Output is correct
146 Correct 331 ms 51820 KB Output is correct
147 Correct 457 ms 60456 KB Output is correct
148 Correct 583 ms 66628 KB Output is correct
149 Correct 600 ms 73936 KB Output is correct
150 Correct 591 ms 75376 KB Output is correct
151 Correct 516 ms 78148 KB Output is correct
152 Correct 13 ms 14932 KB Output is correct
153 Correct 13 ms 15564 KB Output is correct
154 Correct 221 ms 44124 KB Output is correct
155 Correct 373 ms 60352 KB Output is correct
156 Correct 539 ms 73884 KB Output is correct
157 Correct 7 ms 14400 KB Output is correct
158 Correct 7 ms 14332 KB Output is correct
159 Correct 6 ms 14292 KB Output is correct
160 Correct 7 ms 14400 KB Output is correct
161 Correct 1326 ms 72804 KB Output is correct
162 Correct 536 ms 72672 KB Output is correct
163 Correct 697 ms 72728 KB Output is correct
164 Correct 753 ms 72988 KB Output is correct
165 Incorrect 3101 ms 61152 KB Solution announced impossible, but it is possible.
166 Halted 0 ms 0 KB -