oj.uz

Submission #754264

# Submission time Handle Problem Language Result Execution time Memory
754264 2023-06-07T11:26:39 Z tolbi Fountain Parks (IOI21_parks) C++17
55 / 100
 1459 ms 53784 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());
	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;
			continue;
		}
		if (x[u[i]]==mani && !yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]+1;
			continue;
		}
		if (y[u[i]]==minj & yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]-1;
			continue;
		}
		if (y[u[i]]==manj && yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]+1;
			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})){
			//do nothing
		}
		else continue;
		int ed = i;
		while (true){
			if (a[ed]!=-23) break;
			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 {
					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 {
					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){
				ed=yatay[pr];
				continue;
			}
			pr={a[ed]-1,b[ed]+1};
			if (yatay.count(pr) && yatay[pr]!=ed && a[yatay[pr]]==-23){
				ed=yatay[pr];
				continue;
			}			
			pr={a[ed]-1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				ed=dikey[pr];
				continue;
			}			
			pr={a[ed]+1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				ed=dikey[pr];
				continue;
			}
		}
	}
	for (int i = 0; i < u.size(); i++){
		int ed = i;
		while (true){
			if (a[ed]!=-23) break;
			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 {
					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 {
					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){
				ed=yatay[pr];
				continue;
			}
			pr={a[ed]-1,b[ed]+1};
			if (yatay.count(pr) && yatay[pr]!=ed && a[yatay[pr]]==-23){
				ed=yatay[pr];
				continue;
			}			
			pr={a[ed]-1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				ed=dikey[pr];
				continue;
			}			
			pr={a[ed]+1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				ed=dikey[pr];
				continue;
			}
		}
	}
	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:101:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |  for (int i = 0; i < u.size(); i++){
      |                  ~~^~~~~~~~~~
parks.cpp:112:14: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
  112 |   if (y[u[i]]==minj & yat[i]){
parks.cpp:178:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  178 |  for (int i = 0; i < u.size(); i++){
      |                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 254 ms 20248 KB Output is correct
10 Correct 13 ms 2480 KB Output is correct
11 Correct 78 ms 11052 KB Output is correct
12 Correct 22 ms 3464 KB Output is correct
13 Correct 48 ms 7744 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 255 ms 20252 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 254 ms 20248 KB Output is correct
10 Correct 13 ms 2480 KB Output is correct
11 Correct 78 ms 11052 KB Output is correct
12 Correct 22 ms 3464 KB Output is correct
13 Correct 48 ms 7744 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 255 ms 20252 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 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 980 ms 44580 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 832 KB Output is correct
27 Correct 5 ms 980 KB Output is correct
28 Correct 274 ms 18020 KB Output is correct
29 Correct 498 ms 26908 KB Output is correct
30 Correct 739 ms 35688 KB Output is correct
31 Correct 988 ms 44580 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 252 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 300 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 296 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 824 KB Output is correct
45 Correct 372 ms 22264 KB Output is correct
46 Correct 680 ms 32156 KB Output is correct
47 Correct 682 ms 32252 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 254 ms 20248 KB Output is correct
10 Correct 13 ms 2480 KB Output is correct
11 Correct 78 ms 11052 KB Output is correct
12 Correct 22 ms 3464 KB Output is correct
13 Correct 48 ms 7744 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 255 ms 20252 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 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 980 ms 44580 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 832 KB Output is correct
27 Correct 5 ms 980 KB Output is correct
28 Correct 274 ms 18020 KB Output is correct
29 Correct 498 ms 26908 KB Output is correct
30 Correct 739 ms 35688 KB Output is correct
31 Correct 988 ms 44580 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 252 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 300 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 296 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 824 KB Output is correct
45 Correct 372 ms 22264 KB Output is correct
46 Correct 680 ms 32156 KB Output is correct
47 Correct 682 ms 32252 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 300 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 1083 ms 47480 KB Tree @(3, 121991) appears more than once: for edges on positions 1669 and 1899
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 254 ms 20248 KB Output is correct
10 Correct 13 ms 2480 KB Output is correct
11 Correct 78 ms 11052 KB Output is correct
12 Correct 22 ms 3464 KB Output is correct
13 Correct 48 ms 7744 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 255 ms 20252 KB Output is correct
17 Correct 1 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 950 ms 53688 KB Output is correct
21 Correct 1047 ms 53572 KB Output is correct
22 Correct 1044 ms 53584 KB Output is correct
23 Correct 619 ms 37304 KB Output is correct
24 Correct 304 ms 18372 KB Output is correct
25 Correct 768 ms 34040 KB Output is correct
26 Correct 717 ms 33976 KB Output is correct
27 Correct 1369 ms 52724 KB Output is correct
28 Correct 1296 ms 52708 KB Output is correct
29 Correct 1352 ms 52668 KB Output is correct
30 Correct 1246 ms 52820 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 45 ms 4296 KB Output is correct
33 Correct 100 ms 9772 KB Output is correct
34 Correct 977 ms 53716 KB Output is correct
35 Correct 16 ms 2004 KB Output is correct
36 Correct 103 ms 8932 KB Output is correct
37 Correct 241 ms 17576 KB Output is correct
38 Correct 455 ms 21876 KB Output is correct
39 Correct 686 ms 29692 KB Output is correct
40 Correct 969 ms 37716 KB Output is correct
41 Correct 1181 ms 45816 KB Output is correct
42 Correct 1459 ms 53784 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 300 KB Output is correct
45 Correct 1 ms 352 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 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 0 ms 304 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 3 ms 724 KB Output is correct
56 Correct 355 ms 22240 KB Output is correct
57 Correct 620 ms 32244 KB Output is correct
58 Correct 556 ms 32160 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 300 KB Output is correct
61 Correct 1 ms 304 KB Output is correct
62 Correct 708 ms 40300 KB Output is correct
63 Correct 663 ms 40388 KB Output is correct
64 Correct 672 ms 40280 KB Output is correct
65 Correct 6 ms 980 KB Output is correct
66 Correct 12 ms 1636 KB Output is correct
67 Correct 416 ms 23452 KB Output is correct
68 Correct 741 ms 35236 KB Output is correct
69 Correct 1100 ms 46728 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 254 ms 20248 KB Output is correct
10 Correct 13 ms 2480 KB Output is correct
11 Correct 78 ms 11052 KB Output is correct
12 Correct 22 ms 3464 KB Output is correct
13 Correct 48 ms 7744 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 255 ms 20252 KB Output is correct
17 Correct 636 ms 40664 KB Output is correct
18 Correct 876 ms 47300 KB Output is correct
19 Correct 1050 ms 53440 KB Output is correct
20 Correct 1364 ms 51628 KB Output is correct
21 Correct 1156 ms 46268 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 124 ms 8888 KB Output is correct
24 Correct 32 ms 3808 KB Output is correct
25 Correct 191 ms 12460 KB Output is correct
26 Correct 406 ms 21040 KB Output is correct
27 Correct 574 ms 27016 KB Output is correct
28 Correct 721 ms 33844 KB Output is correct
29 Correct 985 ms 40476 KB Output is correct
30 Correct 1125 ms 46932 KB Output is correct
31 Correct 1337 ms 53768 KB Output is correct
32 Correct 858 ms 44428 KB Output is correct
33 Correct 592 ms 40352 KB Output is correct
34 Correct 7 ms 1108 KB Output is correct
35 Correct 12 ms 1820 KB Output is correct
36 Correct 396 ms 23440 KB Output is correct
37 Correct 698 ms 35096 KB Output is correct
38 Correct 1033 ms 46732 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 254 ms 20248 KB Output is correct
10 Correct 13 ms 2480 KB Output is correct
11 Correct 78 ms 11052 KB Output is correct
12 Correct 22 ms 3464 KB Output is correct
13 Correct 48 ms 7744 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 255 ms 20252 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 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 980 ms 44580 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 832 KB Output is correct
27 Correct 5 ms 980 KB Output is correct
28 Correct 274 ms 18020 KB Output is correct
29 Correct 498 ms 26908 KB Output is correct
30 Correct 739 ms 35688 KB Output is correct
31 Correct 988 ms 44580 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 252 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 300 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 296 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 824 KB Output is correct
45 Correct 372 ms 22264 KB Output is correct
46 Correct 680 ms 32156 KB Output is correct
47 Correct 682 ms 32252 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 300 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 1083 ms 47480 KB Tree @(3, 121991) appears more than once: for edges on positions 1669 and 1899
56 Halted 0 ms 0 KB -