oj.uz

Submission #1039761

# Submission time Handle Problem Language Result Execution time Memory
1039761 2024-07-31T08:34:50 Z Alihan_8 Fountain Parks (IOI21_parks) C++17
70 / 100
 1563 ms 133816 KB 
#include "parks.h"
 
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long
 
using i64 = long long;
 
template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}
 
template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}
 
struct Dsu{
	vector <int> fa;
	
	int n;
	
	Dsu(int n) : n(n) {
		fa.resize(n);
		iota(all(fa), 0);
	}
	
	int get(int u){
		return u ^ fa[u] ? fa[u] = get(fa[u]) : u;
	}
	
	bool merge(int u, int v){
		u = get(u), v = get(v);
		
		if ( u == v ) return false;
		
		fa[v] = u;
		
		return true;
	}
	
};

mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)
 
int dx[] = {2, -2, 0, 0};
int dy[] = {0, 0, -2, 2};
 
int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n = x.size();
    
    map <int,map<int,int>> id;
    
    for ( int i = 0; i < n; i++ ){
		id[x[i]][y[i]] = i;
	}
	
	vector <ar<int,2>> e, E;
	
	map <ar<int,2>,int> mp;
	
	vector <vector<int>> G(n);
	
	for ( int i = 0; i < n; i++ ){
		for ( int j = 0; j < 4; j++ ){
			int u = x[i] + dx[j], v = y[i] + dy[j];
			
			if ( !id[u].count(v) ) continue;
			
			E.pb({i, id[u][v]});
		}
	}
	
	auto f = [&](int i, int j){
		return y[i] == y[j];
	};
	
	sort(all(E), [&](auto &u, auto &v){
		auto [i, j] = u;
		auto [x_, y_] = v;
		
		if ( f(i, j) != f(x_, y_) ){
			return f(i, j) < f(x_, y_);
		}
		
		return x[i] < x[x_];
	});
	
	Dsu ds(n);
	
	for ( auto &[u, v]: E ){
		if ( ds.merge(u, v) ){
			e.pb({u, v});
				
			mp[{v, u}] = mp[{u, v}] = (int)e.size() - 1;
		}
	}
	
	if ( (int)e.size() != n - 1 ){
		return 0;
	}
	
	//~ for ( int i = 0; i + 1 < n; i++ ){
		//~ cout << e[i][0] << ' ' << e[i][1] << " " << i << ln;
	//~ } cout << ln;
	
	vector <vector<int>> adj(n * 2), rev(n * 2);
	
	auto add = [&](int u, int v){
		//~ cout << u << " " << v << ln;
		
		adj[u].pb(v);
		rev[v].pb(u);
	};
	
	for ( int i = 0; i < n - 1; i++ ){
		auto [u, v] = e[i];
		
		if ( x[u] == x[v] ){ // vertical
			if ( y[u] > y[v] ) swap(u, v);
			
			{ // 0
				int a = -1, b = -1;
				
				if ( id[x[u] + 2].count(y[u]) ){
					int j = id[x[u] + 2][y[u]]; a = j;
					
					if ( mp.count({u, j}) ){
						int k = mp[{u, j}];
						
						add(i, k);
					}
				}
				
				if ( id[x[u] + 2].count(y[v]) ){
					int j = id[x[u] + 2][y[v]]; b = j;
					
					if ( mp.count({j, v}) ){
						int k = mp[{j, v}];
						
						add(i, k + n);
					}
				}
				
				if ( mp.count({a, b}) ){
					add(i, mp[{a, b}]);
				}
			}
			
			{ // 1
				int a = -1, b = -1;
					
				if ( id[x[u] - 2].count(y[u]) ){
					int j = id[x[u] - 2][y[u]]; a = j;
					
					if ( mp.count({u, j}) ){
						int k = mp[{u, j}];
						
						add(i + n, k);
					}
				}
				
				if ( id[x[u] - 2].count(y[v]) ){
					int j = id[x[u] - 2][y[v]]; b = j;
					
					if ( mp.count({j, v}) ){
						int k = mp[{j, v}];
						
						add(i + n, k + n);
					}
				}
				
				if ( mp.count({a, b}) ){
					add(i + n, mp[{a, b}] + n);
				}
			}
		} else{ // horizontal
			if ( x[u] > x[v] ) swap(u, v);
			
			{ // 0
				int a = -1, b = -1;
					
				if ( id[x[u]].count(y[u] - 2) ){
					int j = id[x[u]][y[u] - 2]; a = j;
					
					if ( mp.count({u, j}) ){
						int k = mp[{u, j}];
						
						add(i, k + n);
					}
				}
				
				if ( id[x[v]].count(y[v] - 2) ){
					int j = id[x[v]][y[v] - 2]; b = j;
					
					if ( mp.count({j, v}) ){
						int k = mp[{j, v}];
						
						add(i, k);
					}
				}
				
				if ( mp.count({a, b}) ){
					add(i, mp[{a, b}]);
				}
			}
			{ // 1
				int a = -1, b = -1;
					
				if ( id[x[u]].count(y[u] + 2) ){
					int j = id[x[u]][y[u] + 2]; a = j;
					
					if ( mp.count({u, j}) ){
						int k = mp[{u, j}];
						
						add(i + n, k + n);
					}
				}
				
				if ( id[x[v]].count(y[v] + 2) ){
					int j = id[x[v]][y[v] + 2]; b = j;
					
					if ( mp.count({j, v}) ){
						int k = mp[{j, v}];
						
						add(i + n, k);
					}
				}
				
				if ( mp.count({a, b}) ){
					add(i + n, mp[{a, b}] + n);
				}
			}
		}
	}
	
	vector <int> ord, us(n * 2);
	
	auto dfs = [&](auto dfs, int u) -> void{
		if ( us[u] ) return;
		
		us[u] = true;
		
		for ( auto &v: adj[u] ){
			dfs(dfs, v);
		}
		
		ord.pb(u);
	};
	
	for ( int i = 0; i < n * 2; i++ ){
		dfs(dfs, i);
	}
	
	reverse(all(ord));
	
	vector <int> c(n * 2, -1);
	
	int ct = 0;
	
	auto trav = [&](auto trav, int u) -> void{
		if ( c[u] != -1 ) return;
		
		c[u] = ct;
		
		for ( auto &v: rev[u] ){
			trav(trav, v);
		}
	};
	
	for ( auto &u: ord ){
		if ( c[u] != -1 ) continue;
		
		trav(trav, u);
		
		ct++;
	}
	
	vector <int> t(n - 1);
	
	for ( int i = 0; i + 1 < n; i++ ){
		if ( c[i] == c[i + n] ){
			return 0;
		}
		
		t[i] = (c[i] < c[i + n]);
	}
	
	vector <int> U, V, A, B;
	
	set <pair<int,int>> st;
	
	for ( int i = 0; i + 1 < n; i++ ){
		auto [u, v] = e[i];
		
		U.pb(u), V.pb(v);
		
		if ( x[u] == x[v] ){
			if ( y[u] > y[v] ) swap(u, v);
			
			A.pb(x[u] + (t[i] ? -1 : 1));
			B.pb(y[u] + 1);
		} else{
			if ( x[u] > x[v] ) swap(u, v);
			
			A.pb(x[u] + 1);
			B.pb(y[u] + (t[i] ? 1 : -1));
		}
		
		assert(!st.count({A.back(), B.back()}));
		
		st.insert({A.back(), B.back()});
	}
	
	build(U, V, A, B);
	
	return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 45768 KB Output is correct
10 Correct 14 ms 4832 KB Output is correct
11 Correct 79 ms 24772 KB Output is correct
12 Correct 20 ms 7136 KB Output is correct
13 Correct 44 ms 10852 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 256 ms 45748 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 45768 KB Output is correct
10 Correct 14 ms 4832 KB Output is correct
11 Correct 79 ms 24772 KB Output is correct
12 Correct 20 ms 7136 KB Output is correct
13 Correct 44 ms 10852 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 256 ms 45748 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 356 KB Output is correct
23 Correct 1214 ms 105548 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 5 ms 1300 KB Output is correct
28 Correct 381 ms 42572 KB Output is correct
29 Correct 707 ms 63428 KB Output is correct
30 Correct 884 ms 84584 KB Output is correct
31 Correct 1456 ms 105908 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 4 ms 1064 KB Output is correct
45 Correct 465 ms 53720 KB Output is correct
46 Correct 847 ms 78276 KB Output is correct
47 Correct 794 ms 79048 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 45768 KB Output is correct
10 Correct 14 ms 4832 KB Output is correct
11 Correct 79 ms 24772 KB Output is correct
12 Correct 20 ms 7136 KB Output is correct
13 Correct 44 ms 10852 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 256 ms 45748 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 356 KB Output is correct
23 Correct 1214 ms 105548 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 5 ms 1300 KB Output is correct
28 Correct 381 ms 42572 KB Output is correct
29 Correct 707 ms 63428 KB Output is correct
30 Correct 884 ms 84584 KB Output is correct
31 Correct 1456 ms 105908 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 4 ms 1064 KB Output is correct
45 Correct 465 ms 53720 KB Output is correct
46 Correct 847 ms 78276 KB Output is correct
47 Correct 794 ms 79048 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1323 ms 111372 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 5 ms 1372 KB Output is correct
58 Correct 20 ms 3808 KB Output is correct
59 Correct 15 ms 2976 KB Output is correct
60 Correct 549 ms 55976 KB Output is correct
61 Correct 954 ms 77052 KB Output is correct
62 Correct 1150 ms 94216 KB Output is correct
63 Correct 1563 ms 112884 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 436 KB Output is correct
67 Correct 640 ms 93436 KB Output is correct
68 Correct 621 ms 93092 KB Output is correct
69 Correct 639 ms 93396 KB Output is correct
70 Correct 5 ms 1372 KB Output is correct
71 Correct 13 ms 2388 KB Output is correct
72 Correct 534 ms 54992 KB Output is correct
73 Correct 944 ms 84100 KB Output is correct
74 Correct 1336 ms 110256 KB Output is correct
75 Correct 1170 ms 103760 KB Output is correct
76 Correct 585 ms 93740 KB Output is correct
77 Correct 8 ms 1624 KB Output is correct
78 Correct 16 ms 2516 KB Output is correct
79 Correct 483 ms 53940 KB Output is correct
80 Correct 989 ms 82068 KB Output is correct
81 Correct 1352 ms 107812 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 45768 KB Output is correct
10 Correct 14 ms 4832 KB Output is correct
11 Correct 79 ms 24772 KB Output is correct
12 Correct 20 ms 7136 KB Output is correct
13 Correct 44 ms 10852 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 256 ms 45748 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1295 ms 133700 KB Output is correct
21 Correct 1207 ms 124864 KB Output is correct
22 Correct 1152 ms 125424 KB Output is correct
23 Correct 603 ms 83360 KB Output is correct
24 Correct 207 ms 18512 KB Output is correct
25 Correct 601 ms 48572 KB Output is correct
26 Correct 524 ms 49432 KB Output is correct
27 Correct 647 ms 93008 KB Output is correct
28 Correct 635 ms 91588 KB Output is correct
29 Correct 777 ms 91460 KB Output is correct
30 Correct 726 ms 91920 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 48 ms 8080 KB Output is correct
33 Correct 112 ms 18684 KB Output is correct
34 Correct 1156 ms 133816 KB Output is correct
35 Correct 15 ms 2780 KB Output is correct
36 Correct 100 ms 12312 KB Output is correct
37 Correct 236 ms 24264 KB Output is correct
38 Correct 371 ms 44996 KB Output is correct
39 Correct 542 ms 61520 KB Output is correct
40 Correct 757 ms 79816 KB Output is correct
41 Correct 1000 ms 95276 KB Output is correct
42 Correct 1169 ms 111784 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 3 ms 860 KB Output is correct
55 Correct 4 ms 1116 KB Output is correct
56 Correct 448 ms 53592 KB Output is correct
57 Correct 788 ms 78488 KB Output is correct
58 Correct 740 ms 78528 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 549 ms 91512 KB Output is correct
63 Correct 562 ms 91876 KB Output is correct
64 Correct 567 ms 91076 KB Output is correct
65 Correct 5 ms 1372 KB Output is correct
66 Correct 11 ms 2156 KB Output is correct
67 Correct 525 ms 54220 KB Output is correct
68 Correct 848 ms 83128 KB Output is correct
69 Correct 1180 ms 108220 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 45768 KB Output is correct
10 Correct 14 ms 4832 KB Output is correct
11 Correct 79 ms 24772 KB Output is correct
12 Correct 20 ms 7136 KB Output is correct
13 Correct 44 ms 10852 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 256 ms 45748 KB Output is correct
17 Correct 728 ms 96212 KB Output is correct
18 Correct 732 ms 96488 KB Output is correct
19 Correct 1262 ms 124956 KB Output is correct
20 Correct 1301 ms 107144 KB Output is correct
21 Correct 837 ms 85444 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 117 ms 17328 KB Output is correct
24 Correct 37 ms 5260 KB Output is correct
25 Correct 171 ms 17352 KB Output is correct
26 Correct 299 ms 30052 KB Output is correct
27 Correct 507 ms 55216 KB Output is correct
28 Correct 659 ms 68672 KB Output is correct
29 Correct 845 ms 83384 KB Output is correct
30 Correct 1035 ms 96392 KB Output is correct
31 Correct 1252 ms 109952 KB Output is correct
32 Correct 1114 ms 102072 KB Output is correct
33 Correct 562 ms 91324 KB Output is correct
34 Correct 7 ms 1628 KB Output is correct
35 Correct 13 ms 2576 KB Output is correct
36 Correct 490 ms 53176 KB Output is correct
37 Correct 858 ms 81592 KB Output is correct
38 Correct 1088 ms 106104 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 45768 KB Output is correct
10 Correct 14 ms 4832 KB Output is correct
11 Correct 79 ms 24772 KB Output is correct
12 Correct 20 ms 7136 KB Output is correct
13 Correct 44 ms 10852 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 256 ms 45748 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 356 KB Output is correct
23 Correct 1214 ms 105548 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 5 ms 1300 KB Output is correct
28 Correct 381 ms 42572 KB Output is correct
29 Correct 707 ms 63428 KB Output is correct
30 Correct 884 ms 84584 KB Output is correct
31 Correct 1456 ms 105908 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 4 ms 1064 KB Output is correct
45 Correct 465 ms 53720 KB Output is correct
46 Correct 847 ms 78276 KB Output is correct
47 Correct 794 ms 79048 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1323 ms 111372 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 5 ms 1372 KB Output is correct
58 Correct 20 ms 3808 KB Output is correct
59 Correct 15 ms 2976 KB Output is correct
60 Correct 549 ms 55976 KB Output is correct
61 Correct 954 ms 77052 KB Output is correct
62 Correct 1150 ms 94216 KB Output is correct
63 Correct 1563 ms 112884 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 436 KB Output is correct
67 Correct 640 ms 93436 KB Output is correct
68 Correct 621 ms 93092 KB Output is correct
69 Correct 639 ms 93396 KB Output is correct
70 Correct 5 ms 1372 KB Output is correct
71 Correct 13 ms 2388 KB Output is correct
72 Correct 534 ms 54992 KB Output is correct
73 Correct 944 ms 84100 KB Output is correct
74 Correct 1336 ms 110256 KB Output is correct
75 Correct 1170 ms 103760 KB Output is correct
76 Correct 585 ms 93740 KB Output is correct
77 Correct 8 ms 1624 KB Output is correct
78 Correct 16 ms 2516 KB Output is correct
79 Correct 483 ms 53940 KB Output is correct
80 Correct 989 ms 82068 KB Output is correct
81 Correct 1352 ms 107812 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 1295 ms 133700 KB Output is correct
86 Correct 1207 ms 124864 KB Output is correct
87 Correct 1152 ms 125424 KB Output is correct
88 Correct 603 ms 83360 KB Output is correct
89 Correct 207 ms 18512 KB Output is correct
90 Correct 601 ms 48572 KB Output is correct
91 Correct 524 ms 49432 KB Output is correct
92 Correct 647 ms 93008 KB Output is correct
93 Correct 635 ms 91588 KB Output is correct
94 Correct 777 ms 91460 KB Output is correct
95 Correct 726 ms 91920 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 48 ms 8080 KB Output is correct
98 Correct 112 ms 18684 KB Output is correct
99 Correct 1156 ms 133816 KB Output is correct
100 Correct 15 ms 2780 KB Output is correct
101 Correct 100 ms 12312 KB Output is correct
102 Correct 236 ms 24264 KB Output is correct
103 Correct 371 ms 44996 KB Output is correct
104 Correct 542 ms 61520 KB Output is correct
105 Correct 757 ms 79816 KB Output is correct
106 Correct 1000 ms 95276 KB Output is correct
107 Correct 1169 ms 111784 KB Output is correct
108 Correct 0 ms 348 KB Output is correct
109 Correct 0 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 1 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 1 ms 348 KB Output is correct
115 Correct 0 ms 348 KB Output is correct
116 Correct 0 ms 348 KB Output is correct
117 Correct 0 ms 348 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 3 ms 860 KB Output is correct
120 Correct 4 ms 1116 KB Output is correct
121 Correct 448 ms 53592 KB Output is correct
122 Correct 788 ms 78488 KB Output is correct
123 Correct 740 ms 78528 KB Output is correct
124 Correct 0 ms 348 KB Output is correct
125 Correct 1 ms 348 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 549 ms 91512 KB Output is correct
128 Correct 562 ms 91876 KB Output is correct
129 Correct 567 ms 91076 KB Output is correct
130 Correct 5 ms 1372 KB Output is correct
131 Correct 11 ms 2156 KB Output is correct
132 Correct 525 ms 54220 KB Output is correct
133 Correct 848 ms 83128 KB Output is correct
134 Correct 1180 ms 108220 KB Output is correct
135 Correct 728 ms 96212 KB Output is correct
136 Correct 732 ms 96488 KB Output is correct
137 Correct 1262 ms 124956 KB Output is correct
138 Correct 1301 ms 107144 KB Output is correct
139 Correct 837 ms 85444 KB Output is correct
140 Correct 1 ms 348 KB Output is correct
141 Correct 117 ms 17328 KB Output is correct
142 Correct 37 ms 5260 KB Output is correct
143 Correct 171 ms 17352 KB Output is correct
144 Correct 299 ms 30052 KB Output is correct
145 Correct 507 ms 55216 KB Output is correct
146 Correct 659 ms 68672 KB Output is correct
147 Correct 845 ms 83384 KB Output is correct
148 Correct 1035 ms 96392 KB Output is correct
149 Correct 1252 ms 109952 KB Output is correct
150 Correct 1114 ms 102072 KB Output is correct
151 Correct 562 ms 91324 KB Output is correct
152 Correct 7 ms 1628 KB Output is correct
153 Correct 13 ms 2576 KB Output is correct
154 Correct 490 ms 53176 KB Output is correct
155 Correct 858 ms 81592 KB Output is correct
156 Correct 1088 ms 106104 KB Output is correct
157 Correct 1 ms 344 KB Output is correct
158 Correct 0 ms 348 KB Output is correct
159 Correct 0 ms 348 KB Output is correct
160 Correct 0 ms 348 KB Output is correct
161 Incorrect 1400 ms 104308 KB Solution announced impossible, but it is possible.
162 Halted 0 ms 0 KB -