oj.uz

답안 #827164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
827164 2023-08-16T09:30:23 Z ymm 분수 공원 (IOI21_parks) C++17
70 / 100
 3079 ms 105584 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];
		int p1 = get_pnt(x+2, y);
		if (p1 != -1)
			edge.push_back({i, p1});
	}
}

namespace dfs {
	vector<int> A[N];
	bool vis[N];
	vector<pii> ans;
	void dfs(int v) {
		vis[v] = 1;
		for (int u : A[v]) {
			if (vis[u])
				continue;
			ans.emplace_back(v, u);
			dfs(u);
		}
	}
	vector<pii> Do(int n, int s, vector<pii> e) {
		Loop (i,0,n) {
			A[i].clear();
			vis[i] = 0;
		}
		ans.clear();
		for (auto [x, y] : e) {
			A[x].push_back(y);
			A[y].push_back(x);
		}
		dfs(0);
		return ans;
	}
}

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);
		vector<pii> e = dfs::Do(n, rd()%n, edge);
		if (e.size() != 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()) {
			shuffle(edge.begin(), edge.end(), rd);
			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()) {
      |   ^~~~
parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:192:16: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  192 |   if (e.size() != n-1)
      |       ~~~~~~~~~^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 8 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 8 ms 19024 KB Output is correct
5 Correct 7 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 9 ms 18984 KB Output is correct
9 Correct 154 ms 60760 KB Output is correct
10 Correct 20 ms 23552 KB Output is correct
11 Correct 71 ms 41808 KB Output is correct
12 Correct 26 ms 25548 KB Output is correct
13 Correct 33 ms 28012 KB Output is correct
14 Correct 10 ms 19332 KB Output is correct
15 Correct 10 ms 19412 KB Output is correct
16 Correct 156 ms 57520 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 8 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 8 ms 19024 KB Output is correct
5 Correct 7 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 9 ms 18984 KB Output is correct
9 Correct 154 ms 60760 KB Output is correct
10 Correct 20 ms 23552 KB Output is correct
11 Correct 71 ms 41808 KB Output is correct
12 Correct 26 ms 25548 KB Output is correct
13 Correct 33 ms 28012 KB Output is correct
14 Correct 10 ms 19332 KB Output is correct
15 Correct 10 ms 19412 KB Output is correct
16 Correct 156 ms 57520 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 9 ms 19004 KB Output is correct
19 Correct 8 ms 19004 KB Output is correct
20 Correct 10 ms 19032 KB Output is correct
21 Correct 9 ms 19012 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 463 ms 102340 KB Output is correct
24 Correct 8 ms 19028 KB Output is correct
25 Correct 11 ms 19540 KB Output is correct
26 Correct 10 ms 19608 KB Output is correct
27 Correct 10 ms 19668 KB Output is correct
28 Correct 145 ms 52060 KB Output is correct
29 Correct 219 ms 68792 KB Output is correct
30 Correct 313 ms 85288 KB Output is correct
31 Correct 381 ms 102380 KB Output is correct
32 Correct 10 ms 19028 KB Output is correct
33 Correct 11 ms 19028 KB Output is correct
34 Correct 9 ms 19028 KB Output is correct
35 Correct 12 ms 19028 KB Output is correct
36 Correct 9 ms 19028 KB Output is correct
37 Correct 9 ms 19044 KB Output is correct
38 Correct 9 ms 19088 KB Output is correct
39 Correct 10 ms 19048 KB Output is correct
40 Correct 9 ms 19060 KB Output is correct
41 Correct 9 ms 19028 KB Output is correct
42 Correct 9 ms 18992 KB Output is correct
43 Correct 10 ms 19352 KB Output is correct
44 Correct 10 ms 19540 KB Output is correct
45 Correct 171 ms 56048 KB Output is correct
46 Correct 308 ms 74216 KB Output is correct
47 Correct 294 ms 73724 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 8 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 8 ms 19024 KB Output is correct
5 Correct 7 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 9 ms 18984 KB Output is correct
9 Correct 154 ms 60760 KB Output is correct
10 Correct 20 ms 23552 KB Output is correct
11 Correct 71 ms 41808 KB Output is correct
12 Correct 26 ms 25548 KB Output is correct
13 Correct 33 ms 28012 KB Output is correct
14 Correct 10 ms 19332 KB Output is correct
15 Correct 10 ms 19412 KB Output is correct
16 Correct 156 ms 57520 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 9 ms 19004 KB Output is correct
19 Correct 8 ms 19004 KB Output is correct
20 Correct 10 ms 19032 KB Output is correct
21 Correct 9 ms 19012 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 463 ms 102340 KB Output is correct
24 Correct 8 ms 19028 KB Output is correct
25 Correct 11 ms 19540 KB Output is correct
26 Correct 10 ms 19608 KB Output is correct
27 Correct 10 ms 19668 KB Output is correct
28 Correct 145 ms 52060 KB Output is correct
29 Correct 219 ms 68792 KB Output is correct
30 Correct 313 ms 85288 KB Output is correct
31 Correct 381 ms 102380 KB Output is correct
32 Correct 10 ms 19028 KB Output is correct
33 Correct 11 ms 19028 KB Output is correct
34 Correct 9 ms 19028 KB Output is correct
35 Correct 12 ms 19028 KB Output is correct
36 Correct 9 ms 19028 KB Output is correct
37 Correct 9 ms 19044 KB Output is correct
38 Correct 9 ms 19088 KB Output is correct
39 Correct 10 ms 19048 KB Output is correct
40 Correct 9 ms 19060 KB Output is correct
41 Correct 9 ms 19028 KB Output is correct
42 Correct 9 ms 18992 KB Output is correct
43 Correct 10 ms 19352 KB Output is correct
44 Correct 10 ms 19540 KB Output is correct
45 Correct 171 ms 56048 KB Output is correct
46 Correct 308 ms 74216 KB Output is correct
47 Correct 294 ms 73724 KB Output is correct
48 Correct 10 ms 19104 KB Output is correct
49 Correct 10 ms 19036 KB Output is correct
50 Correct 10 ms 19028 KB Output is correct
51 Correct 11 ms 19028 KB Output is correct
52 Correct 10 ms 19028 KB Output is correct
53 Correct 10 ms 19028 KB Output is correct
54 Correct 12 ms 19028 KB Output is correct
55 Correct 468 ms 99072 KB Output is correct
56 Correct 10 ms 19028 KB Output is correct
57 Correct 12 ms 19768 KB Output is correct
58 Correct 18 ms 21624 KB Output is correct
59 Correct 17 ms 20840 KB Output is correct
60 Correct 191 ms 60624 KB Output is correct
61 Correct 264 ms 75224 KB Output is correct
62 Correct 355 ms 85564 KB Output is correct
63 Correct 463 ms 101076 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 11 ms 19100 KB Output is correct
66 Correct 11 ms 19028 KB Output is correct
67 Correct 383 ms 100888 KB Output is correct
68 Correct 393 ms 101248 KB Output is correct
69 Correct 448 ms 102536 KB Output is correct
70 Correct 13 ms 19796 KB Output is correct
71 Correct 16 ms 20344 KB Output is correct
72 Correct 184 ms 54252 KB Output is correct
73 Correct 327 ms 75160 KB Output is correct
74 Correct 465 ms 89968 KB Output is correct
75 Correct 476 ms 99488 KB Output is correct
76 Correct 403 ms 105424 KB Output is correct
77 Correct 14 ms 19916 KB Output is correct
78 Correct 16 ms 20528 KB Output is correct
79 Correct 186 ms 55176 KB Output is correct
80 Correct 310 ms 75104 KB Output is correct
81 Correct 443 ms 92368 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 8 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 8 ms 19024 KB Output is correct
5 Correct 7 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 9 ms 18984 KB Output is correct
9 Correct 154 ms 60760 KB Output is correct
10 Correct 20 ms 23552 KB Output is correct
11 Correct 71 ms 41808 KB Output is correct
12 Correct 26 ms 25548 KB Output is correct
13 Correct 33 ms 28012 KB Output is correct
14 Correct 10 ms 19332 KB Output is correct
15 Correct 10 ms 19412 KB Output is correct
16 Correct 156 ms 57520 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 10 ms 19028 KB Output is correct
19 Correct 10 ms 19028 KB Output is correct
20 Correct 439 ms 96616 KB Output is correct
21 Correct 493 ms 93352 KB Output is correct
22 Correct 455 ms 91660 KB Output is correct
23 Correct 366 ms 86948 KB Output is correct
24 Correct 230 ms 37220 KB Output is correct
25 Correct 284 ms 46632 KB Output is correct
26 Correct 301 ms 46620 KB Output is correct
27 Correct 411 ms 88296 KB Output is correct
28 Correct 439 ms 88216 KB Output is correct
29 Correct 515 ms 89704 KB Output is correct
30 Correct 520 ms 89796 KB Output is correct
31 Correct 10 ms 19028 KB Output is correct
32 Correct 34 ms 24488 KB Output is correct
33 Correct 96 ms 29404 KB Output is correct
34 Correct 423 ms 95588 KB Output is correct
35 Correct 18 ms 20684 KB Output is correct
36 Correct 58 ms 26800 KB Output is correct
37 Correct 125 ms 34332 KB Output is correct
38 Correct 159 ms 46112 KB Output is correct
39 Correct 222 ms 55404 KB Output is correct
40 Correct 315 ms 66392 KB Output is correct
41 Correct 452 ms 75176 KB Output is correct
42 Correct 492 ms 84416 KB Output is correct
43 Correct 11 ms 19028 KB Output is correct
44 Correct 10 ms 19028 KB Output is correct
45 Correct 9 ms 19032 KB Output is correct
46 Correct 9 ms 19100 KB Output is correct
47 Correct 9 ms 19104 KB Output is correct
48 Correct 9 ms 19028 KB Output is correct
49 Correct 13 ms 19028 KB Output is correct
50 Correct 11 ms 19076 KB Output is correct
51 Correct 10 ms 19028 KB Output is correct
52 Correct 9 ms 19060 KB Output is correct
53 Correct 9 ms 19108 KB Output is correct
54 Correct 13 ms 19368 KB Output is correct
55 Correct 10 ms 19500 KB Output is correct
56 Correct 166 ms 56776 KB Output is correct
57 Correct 280 ms 75364 KB Output is correct
58 Correct 271 ms 74860 KB Output is correct
59 Correct 9 ms 19028 KB Output is correct
60 Correct 10 ms 19028 KB Output is correct
61 Correct 9 ms 19028 KB Output is correct
62 Correct 380 ms 100876 KB Output is correct
63 Correct 414 ms 101072 KB Output is correct
64 Correct 394 ms 102456 KB Output is correct
65 Correct 12 ms 19752 KB Output is correct
66 Correct 15 ms 20292 KB Output is correct
67 Correct 188 ms 54188 KB Output is correct
68 Correct 306 ms 75124 KB Output is correct
69 Correct 465 ms 89960 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 8 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 8 ms 19024 KB Output is correct
5 Correct 7 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 9 ms 18984 KB Output is correct
9 Correct 154 ms 60760 KB Output is correct
10 Correct 20 ms 23552 KB Output is correct
11 Correct 71 ms 41808 KB Output is correct
12 Correct 26 ms 25548 KB Output is correct
13 Correct 33 ms 28012 KB Output is correct
14 Correct 10 ms 19332 KB Output is correct
15 Correct 10 ms 19412 KB Output is correct
16 Correct 156 ms 57520 KB Output is correct
17 Correct 407 ms 104196 KB Output is correct
18 Correct 413 ms 98068 KB Output is correct
19 Correct 457 ms 98952 KB Output is correct
20 Correct 433 ms 91396 KB Output is correct
21 Correct 400 ms 85632 KB Output is correct
22 Correct 11 ms 19028 KB Output is correct
23 Correct 66 ms 30360 KB Output is correct
24 Correct 27 ms 22412 KB Output is correct
25 Correct 78 ms 30272 KB Output is correct
26 Correct 143 ms 37944 KB Output is correct
27 Correct 197 ms 54364 KB Output is correct
28 Correct 253 ms 64328 KB Output is correct
29 Correct 323 ms 72976 KB Output is correct
30 Correct 393 ms 80168 KB Output is correct
31 Correct 511 ms 88456 KB Output is correct
32 Correct 410 ms 99504 KB Output is correct
33 Correct 369 ms 105584 KB Output is correct
34 Correct 13 ms 19924 KB Output is correct
35 Correct 18 ms 20524 KB Output is correct
36 Correct 179 ms 55192 KB Output is correct
37 Correct 318 ms 75072 KB Output is correct
38 Correct 458 ms 92416 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 8 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 8 ms 19024 KB Output is correct
5 Correct 7 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 9 ms 18984 KB Output is correct
9 Correct 154 ms 60760 KB Output is correct
10 Correct 20 ms 23552 KB Output is correct
11 Correct 71 ms 41808 KB Output is correct
12 Correct 26 ms 25548 KB Output is correct
13 Correct 33 ms 28012 KB Output is correct
14 Correct 10 ms 19332 KB Output is correct
15 Correct 10 ms 19412 KB Output is correct
16 Correct 156 ms 57520 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 9 ms 19004 KB Output is correct
19 Correct 8 ms 19004 KB Output is correct
20 Correct 10 ms 19032 KB Output is correct
21 Correct 9 ms 19012 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 463 ms 102340 KB Output is correct
24 Correct 8 ms 19028 KB Output is correct
25 Correct 11 ms 19540 KB Output is correct
26 Correct 10 ms 19608 KB Output is correct
27 Correct 10 ms 19668 KB Output is correct
28 Correct 145 ms 52060 KB Output is correct
29 Correct 219 ms 68792 KB Output is correct
30 Correct 313 ms 85288 KB Output is correct
31 Correct 381 ms 102380 KB Output is correct
32 Correct 10 ms 19028 KB Output is correct
33 Correct 11 ms 19028 KB Output is correct
34 Correct 9 ms 19028 KB Output is correct
35 Correct 12 ms 19028 KB Output is correct
36 Correct 9 ms 19028 KB Output is correct
37 Correct 9 ms 19044 KB Output is correct
38 Correct 9 ms 19088 KB Output is correct
39 Correct 10 ms 19048 KB Output is correct
40 Correct 9 ms 19060 KB Output is correct
41 Correct 9 ms 19028 KB Output is correct
42 Correct 9 ms 18992 KB Output is correct
43 Correct 10 ms 19352 KB Output is correct
44 Correct 10 ms 19540 KB Output is correct
45 Correct 171 ms 56048 KB Output is correct
46 Correct 308 ms 74216 KB Output is correct
47 Correct 294 ms 73724 KB Output is correct
48 Correct 10 ms 19104 KB Output is correct
49 Correct 10 ms 19036 KB Output is correct
50 Correct 10 ms 19028 KB Output is correct
51 Correct 11 ms 19028 KB Output is correct
52 Correct 10 ms 19028 KB Output is correct
53 Correct 10 ms 19028 KB Output is correct
54 Correct 12 ms 19028 KB Output is correct
55 Correct 468 ms 99072 KB Output is correct
56 Correct 10 ms 19028 KB Output is correct
57 Correct 12 ms 19768 KB Output is correct
58 Correct 18 ms 21624 KB Output is correct
59 Correct 17 ms 20840 KB Output is correct
60 Correct 191 ms 60624 KB Output is correct
61 Correct 264 ms 75224 KB Output is correct
62 Correct 355 ms 85564 KB Output is correct
63 Correct 463 ms 101076 KB Output is correct
64 Correct 11 ms 19028 KB Output is correct
65 Correct 11 ms 19100 KB Output is correct
66 Correct 11 ms 19028 KB Output is correct
67 Correct 383 ms 100888 KB Output is correct
68 Correct 393 ms 101248 KB Output is correct
69 Correct 448 ms 102536 KB Output is correct
70 Correct 13 ms 19796 KB Output is correct
71 Correct 16 ms 20344 KB Output is correct
72 Correct 184 ms 54252 KB Output is correct
73 Correct 327 ms 75160 KB Output is correct
74 Correct 465 ms 89968 KB Output is correct
75 Correct 476 ms 99488 KB Output is correct
76 Correct 403 ms 105424 KB Output is correct
77 Correct 14 ms 19916 KB Output is correct
78 Correct 16 ms 20528 KB Output is correct
79 Correct 186 ms 55176 KB Output is correct
80 Correct 310 ms 75104 KB Output is correct
81 Correct 443 ms 92368 KB Output is correct
82 Correct 9 ms 19028 KB Output is correct
83 Correct 10 ms 19028 KB Output is correct
84 Correct 10 ms 19028 KB Output is correct
85 Correct 439 ms 96616 KB Output is correct
86 Correct 493 ms 93352 KB Output is correct
87 Correct 455 ms 91660 KB Output is correct
88 Correct 366 ms 86948 KB Output is correct
89 Correct 230 ms 37220 KB Output is correct
90 Correct 284 ms 46632 KB Output is correct
91 Correct 301 ms 46620 KB Output is correct
92 Correct 411 ms 88296 KB Output is correct
93 Correct 439 ms 88216 KB Output is correct
94 Correct 515 ms 89704 KB Output is correct
95 Correct 520 ms 89796 KB Output is correct
96 Correct 10 ms 19028 KB Output is correct
97 Correct 34 ms 24488 KB Output is correct
98 Correct 96 ms 29404 KB Output is correct
99 Correct 423 ms 95588 KB Output is correct
100 Correct 18 ms 20684 KB Output is correct
101 Correct 58 ms 26800 KB Output is correct
102 Correct 125 ms 34332 KB Output is correct
103 Correct 159 ms 46112 KB Output is correct
104 Correct 222 ms 55404 KB Output is correct
105 Correct 315 ms 66392 KB Output is correct
106 Correct 452 ms 75176 KB Output is correct
107 Correct 492 ms 84416 KB Output is correct
108 Correct 11 ms 19028 KB Output is correct
109 Correct 10 ms 19028 KB Output is correct
110 Correct 9 ms 19032 KB Output is correct
111 Correct 9 ms 19100 KB Output is correct
112 Correct 9 ms 19104 KB Output is correct
113 Correct 9 ms 19028 KB Output is correct
114 Correct 13 ms 19028 KB Output is correct
115 Correct 11 ms 19076 KB Output is correct
116 Correct 10 ms 19028 KB Output is correct
117 Correct 9 ms 19060 KB Output is correct
118 Correct 9 ms 19108 KB Output is correct
119 Correct 13 ms 19368 KB Output is correct
120 Correct 10 ms 19500 KB Output is correct
121 Correct 166 ms 56776 KB Output is correct
122 Correct 280 ms 75364 KB Output is correct
123 Correct 271 ms 74860 KB Output is correct
124 Correct 9 ms 19028 KB Output is correct
125 Correct 10 ms 19028 KB Output is correct
126 Correct 9 ms 19028 KB Output is correct
127 Correct 380 ms 100876 KB Output is correct
128 Correct 414 ms 101072 KB Output is correct
129 Correct 394 ms 102456 KB Output is correct
130 Correct 12 ms 19752 KB Output is correct
131 Correct 15 ms 20292 KB Output is correct
132 Correct 188 ms 54188 KB Output is correct
133 Correct 306 ms 75124 KB Output is correct
134 Correct 465 ms 89960 KB Output is correct
135 Correct 407 ms 104196 KB Output is correct
136 Correct 413 ms 98068 KB Output is correct
137 Correct 457 ms 98952 KB Output is correct
138 Correct 433 ms 91396 KB Output is correct
139 Correct 400 ms 85632 KB Output is correct
140 Correct 11 ms 19028 KB Output is correct
141 Correct 66 ms 30360 KB Output is correct
142 Correct 27 ms 22412 KB Output is correct
143 Correct 78 ms 30272 KB Output is correct
144 Correct 143 ms 37944 KB Output is correct
145 Correct 197 ms 54364 KB Output is correct
146 Correct 253 ms 64328 KB Output is correct
147 Correct 323 ms 72976 KB Output is correct
148 Correct 393 ms 80168 KB Output is correct
149 Correct 511 ms 88456 KB Output is correct
150 Correct 410 ms 99504 KB Output is correct
151 Correct 369 ms 105584 KB Output is correct
152 Correct 13 ms 19924 KB Output is correct
153 Correct 18 ms 20524 KB Output is correct
154 Correct 179 ms 55192 KB Output is correct
155 Correct 318 ms 75072 KB Output is correct
156 Correct 458 ms 92416 KB Output is correct
157 Correct 9 ms 19028 KB Output is correct
158 Correct 9 ms 19080 KB Output is correct
159 Correct 8 ms 19028 KB Output is correct
160 Correct 8 ms 19100 KB Output is correct
161 Correct 507 ms 101256 KB Output is correct
162 Correct 437 ms 93188 KB Output is correct
163 Correct 416 ms 91380 KB Output is correct
164 Correct 450 ms 90780 KB Output is correct
165 Incorrect 3079 ms 84408 KB Solution announced impossible, but it is possible.
166 Halted 0 ms 0 KB -