답안 #754273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754273 2023-06-07T11:39:15 Z tolbi 분수 공원 (IOI21_parks) C++17
55 / 100
1569 ms 53316 KB
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename T> vector<int32_t> normalize(vector<T> &arr){vector<int> rv;rv.resize(arr.size());for (int i = 0; i < rv.size(); ++i){rv[i]=arr[i];}return rv;}
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "parks.h"
struct DSU{
	vector<int> par;
	DSU(int n){
		par.resize(n);
		iota(par.begin(), par.end(), 0ll);
	}
	int find(int node){
		if (par[node]==node) return node;
		return par[node]=find(par[node]);
	}
	void merge(int a, int b){
		a=find(a);
		b=find(b);
		if (ayahya()%2) swap(a,b);
		par[a]=b;
	}
};
int construct_roads(vector<int> x, vector<int> y) {
	map<pair<int,int>,int> mp;
	int n = x.size();
	for (int i = 0; i < n; ++i)
	{
		mp[{x[i],y[i]}]=i;
	}
	map<pair<int,int>,int> dikey;
	map<pair<int,int>,int> yatay;
	vector<bool> yat;
	vector<int> u;
	vector<int> v;
	vector<int> a;
	vector<int> b;
	DSU dsu(n);
	for (int i = 0; i < n; i++){
		int xv = x[i];
		int yv = y[i];
		if (mp.count({xv+2,yv})){
			if (dsu.find(i)!=dsu.find(mp[{xv+2,yv}])){
				dsu.merge(i,mp[{xv+2,yv}]);
				yatay[{xv,yv}]=u.size();
				u.push_back(i);
				v.push_back(mp[{xv+2,yv}]);
				yat.push_back(true);
				a.push_back(-23);
				b.push_back(-23);
			}
		}
		if (mp.count({xv,yv+2})){
			if (dsu.find(i)!=dsu.find(mp[{xv,yv+2}])){
				dsu.merge(i,mp[{xv,yv+2}]);
				dikey[{xv,yv}]=u.size();
				u.push_back(i);
				v.push_back(mp[{xv,yv+2}]);
				yat.push_back(false);
				a.push_back(-23);
				b.push_back(-23);
			}
		}
	}
	if (u.size()!=n-1) return 0;
	map<pair<int,int>,bool> kap;
	int mini = *min_element(x.begin(), x.end());
	int minj = *min_element(y.begin(), y.end());
	int mani = *max_element(x.begin(), x.end());
	int manj = *max_element(y.begin(), y.end());
	vector<int> sir;
	vector<int> viss(u.size(),false);
	for (int i = 0; i < u.size(); i++){
		if (x[u[i]]==mini && !yat[i]){
			a[i]=x[u[i]]-1;
			b[i]=y[u[i]]+1;
			viss[i]=true;
			continue;
		}
		if (x[u[i]]==mani && !yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]+1;
			viss[i]=true;
			continue;
		}
		if (y[u[i]]==minj & yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]-1;
			viss[i]=true;
			continue;
		}
		if (y[u[i]]==manj && yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]+1;
			viss[i]=true;
			continue;
		}
	}
	for (int i = 0; i < u.size(); ++i)
	{
		if (viss[i]) continue;
		int xv = x[u[i]];
		int yv = y[u[i]];
		if (yatay.count({xv,yv}) && dikey.count({xv,yv}) && yatay.count({xv-2,yv}) && dikey.count({xv,yv-2})){
			sir.push_back(i);
			viss[i]=true;
		}
	}
	for (int i = 0; i < u.size(); ++i){
		if (!yat[i]) continue;
		if (viss[i]) continue;
		sir.push_back(i);
		viss[i]=true;
	}
	for (int i = 0; i < u.size(); ++i)
	{
		if (viss[i]) continue;
		sir.push_back(i);
	}
	for (int i = 0; i < sir.size(); i++){
		queue<int> q;
		q.push(sir[i]);
		while (q.size()){
			int ed = q.front();
			q.pop();
			if (a[ed]!=-23) continue;
			if (yat[ed]){
				if (!kap[{x[u[ed]]+1,y[u[ed]]+1}]){
					kap[{x[u[ed]]+1,y[u[ed]]+1}]=true;
					a[ed]=x[u[ed]]+1;
					b[ed]=y[u[ed]]+1;
				}
				else {
					if (kap[{x[u[ed]]+1,y[u[ed]]-1}]) return 0;
					kap[{x[u[ed]]+1,y[u[ed]]-1}]=true;
					a[ed]=x[u[ed]]+1;
					b[ed]=y[u[ed]]-1;
				}
			}
			else {
				if (!kap[{x[u[ed]]+1,y[u[ed]]+1}]){
					kap[{x[u[ed]]+1,y[u[ed]]+1}]=true;
					a[ed]=x[u[ed]]+1;
					b[ed]=y[u[ed]]+1;
				}
				else {
					if (kap[{x[u[ed]]-1,y[u[ed]]+1}]) return 0;
					kap[{x[u[ed]]-1,y[u[ed]]+1}]=true;
					a[ed]=x[u[ed]]-1;
					b[ed]=y[u[ed]]+1;
				}
			}
			pair<int,int> pr;
			pr={a[ed]-1,b[ed]-1};
			if (yatay.count(pr) && yatay[pr]!=ed && a[yatay[pr]]==-23){
				q.push(yatay[pr]);
			}
			pr={a[ed]-1,b[ed]+1};
			if (yatay.count(pr) && yatay[pr]!=ed && a[yatay[pr]]==-23){
				q.push(yatay[pr]);
			}			
			pr={a[ed]-1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				q.push(dikey[pr]);
			}			
			pr={a[ed]+1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				q.push(dikey[pr]);
			}
		}
	}
	build(u,v,a,b);
	return 1;
}

Compilation message

parks.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:95:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |  if (u.size()!=n-1) return 0;
      |      ~~~~~~~~^~~~~
parks.cpp:103:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |  for (int i = 0; i < u.size(); i++){
      |                  ~~^~~~~~~~~~
parks.cpp:116:14: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
  116 |   if (y[u[i]]==minj & yat[i]){
parks.cpp:129:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:139:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |  for (int i = 0; i < u.size(); ++i){
      |                  ~~^~~~~~~~~~
parks.cpp:145:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:150:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |  for (int i = 0; i < sir.size(); i++){
      |                  ~~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 237 ms 19808 KB Output is correct
10 Correct 12 ms 2472 KB Output is correct
11 Correct 79 ms 10844 KB Output is correct
12 Correct 20 ms 3480 KB Output is correct
13 Correct 49 ms 7408 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 247 ms 19912 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 237 ms 19808 KB Output is correct
10 Correct 12 ms 2472 KB Output is correct
11 Correct 79 ms 10844 KB Output is correct
12 Correct 20 ms 3480 KB Output is correct
13 Correct 49 ms 7408 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 247 ms 19912 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 982 ms 44336 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 4 ms 724 KB Output is correct
27 Correct 5 ms 952 KB Output is correct
28 Correct 270 ms 18124 KB Output is correct
29 Correct 512 ms 26828 KB Output is correct
30 Correct 701 ms 35708 KB Output is correct
31 Correct 973 ms 44352 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 427 ms 22352 KB Output is correct
46 Correct 677 ms 32144 KB Output is correct
47 Correct 560 ms 32060 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 237 ms 19808 KB Output is correct
10 Correct 12 ms 2472 KB Output is correct
11 Correct 79 ms 10844 KB Output is correct
12 Correct 20 ms 3480 KB Output is correct
13 Correct 49 ms 7408 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 247 ms 19912 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 982 ms 44336 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 4 ms 724 KB Output is correct
27 Correct 5 ms 952 KB Output is correct
28 Correct 270 ms 18124 KB Output is correct
29 Correct 512 ms 26828 KB Output is correct
30 Correct 701 ms 35708 KB Output is correct
31 Correct 973 ms 44352 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 427 ms 22352 KB Output is correct
46 Correct 677 ms 32144 KB Output is correct
47 Correct 560 ms 32060 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Incorrect 801 ms 34572 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 237 ms 19808 KB Output is correct
10 Correct 12 ms 2472 KB Output is correct
11 Correct 79 ms 10844 KB Output is correct
12 Correct 20 ms 3480 KB Output is correct
13 Correct 49 ms 7408 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 247 ms 19912 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 897 ms 52808 KB Output is correct
21 Correct 1182 ms 52792 KB Output is correct
22 Correct 1052 ms 52832 KB Output is correct
23 Correct 631 ms 36224 KB Output is correct
24 Correct 292 ms 17096 KB Output is correct
25 Correct 787 ms 32724 KB Output is correct
26 Correct 705 ms 32828 KB Output is correct
27 Correct 1187 ms 53072 KB Output is correct
28 Correct 1222 ms 53044 KB Output is correct
29 Correct 1358 ms 53028 KB Output is correct
30 Correct 1302 ms 53040 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 53 ms 4436 KB Output is correct
33 Correct 95 ms 9020 KB Output is correct
34 Correct 1036 ms 53260 KB Output is correct
35 Correct 15 ms 2004 KB Output is correct
36 Correct 99 ms 8736 KB Output is correct
37 Correct 245 ms 16748 KB Output is correct
38 Correct 400 ms 21736 KB Output is correct
39 Correct 652 ms 29576 KB Output is correct
40 Correct 907 ms 37376 KB Output is correct
41 Correct 1186 ms 45344 KB Output is correct
42 Correct 1569 ms 53200 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 224 KB Output is correct
47 Correct 1 ms 304 KB Output is correct
48 Correct 1 ms 300 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 4 ms 724 KB Output is correct
56 Correct 391 ms 22256 KB Output is correct
57 Correct 587 ms 32108 KB Output is correct
58 Correct 588 ms 32160 KB Output is correct
59 Correct 1 ms 304 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 300 KB Output is correct
62 Correct 654 ms 39896 KB Output is correct
63 Correct 692 ms 39836 KB Output is correct
64 Correct 614 ms 39712 KB Output is correct
65 Correct 5 ms 980 KB Output is correct
66 Correct 11 ms 1620 KB Output is correct
67 Correct 390 ms 23668 KB Output is correct
68 Correct 788 ms 35344 KB Output is correct
69 Correct 1129 ms 46964 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 237 ms 19808 KB Output is correct
10 Correct 12 ms 2472 KB Output is correct
11 Correct 79 ms 10844 KB Output is correct
12 Correct 20 ms 3480 KB Output is correct
13 Correct 49 ms 7408 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 247 ms 19912 KB Output is correct
17 Correct 640 ms 39596 KB Output is correct
18 Correct 878 ms 46144 KB Output is correct
19 Correct 1102 ms 53316 KB Output is correct
20 Correct 1461 ms 52256 KB Output is correct
21 Correct 1129 ms 46464 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 130 ms 9064 KB Output is correct
24 Correct 32 ms 3800 KB Output is correct
25 Correct 167 ms 11912 KB Output is correct
26 Correct 380 ms 20008 KB Output is correct
27 Correct 576 ms 26976 KB Output is correct
28 Correct 777 ms 33584 KB Output is correct
29 Correct 1016 ms 40060 KB Output is correct
30 Correct 1280 ms 46744 KB Output is correct
31 Correct 1509 ms 53276 KB Output is correct
32 Correct 904 ms 44320 KB Output is correct
33 Correct 603 ms 39804 KB Output is correct
34 Correct 7 ms 1108 KB Output is correct
35 Correct 12 ms 1828 KB Output is correct
36 Correct 450 ms 23716 KB Output is correct
37 Correct 685 ms 35112 KB Output is correct
38 Correct 1080 ms 46616 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 237 ms 19808 KB Output is correct
10 Correct 12 ms 2472 KB Output is correct
11 Correct 79 ms 10844 KB Output is correct
12 Correct 20 ms 3480 KB Output is correct
13 Correct 49 ms 7408 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 247 ms 19912 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 982 ms 44336 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 4 ms 724 KB Output is correct
27 Correct 5 ms 952 KB Output is correct
28 Correct 270 ms 18124 KB Output is correct
29 Correct 512 ms 26828 KB Output is correct
30 Correct 701 ms 35708 KB Output is correct
31 Correct 973 ms 44352 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 427 ms 22352 KB Output is correct
46 Correct 677 ms 32144 KB Output is correct
47 Correct 560 ms 32060 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Incorrect 801 ms 34572 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -