oj.uz

Submission #1039766

# Submission time Handle Problem Language Result Execution time Memory
1039766 2024-07-31T08:37:49 Z Alihan_8 Fountain Parks (IOI21_parks) C++17
70 / 100
 1628 ms 136124 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 y[i] < y[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 1 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 0 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 236 ms 45920 KB Output is correct
10 Correct 12 ms 4832 KB Output is correct
11 Correct 78 ms 24772 KB Output is correct
12 Correct 20 ms 7132 KB Output is correct
13 Correct 43 ms 10860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 239 ms 45948 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 236 ms 45920 KB Output is correct
10 Correct 12 ms 4832 KB Output is correct
11 Correct 78 ms 24772 KB Output is correct
12 Correct 20 ms 7132 KB Output is correct
13 Correct 43 ms 10860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 239 ms 45948 KB Output is correct
17 Correct 0 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 894 ms 106932 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 856 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 6 ms 1372 KB Output is correct
28 Correct 303 ms 42612 KB Output is correct
29 Correct 522 ms 63680 KB Output is correct
30 Correct 678 ms 85440 KB Output is correct
31 Correct 892 ms 105884 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 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 1116 KB Output is correct
45 Correct 404 ms 53632 KB Output is correct
46 Correct 615 ms 79872 KB Output is correct
47 Correct 589 ms 79044 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 236 ms 45920 KB Output is correct
10 Correct 12 ms 4832 KB Output is correct
11 Correct 78 ms 24772 KB Output is correct
12 Correct 20 ms 7132 KB Output is correct
13 Correct 43 ms 10860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 239 ms 45948 KB Output is correct
17 Correct 0 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 894 ms 106932 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 856 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 6 ms 1372 KB Output is correct
28 Correct 303 ms 42612 KB Output is correct
29 Correct 522 ms 63680 KB Output is correct
30 Correct 678 ms 85440 KB Output is correct
31 Correct 892 ms 105884 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 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 1116 KB Output is correct
45 Correct 404 ms 53632 KB Output is correct
46 Correct 615 ms 79872 KB Output is correct
47 Correct 589 ms 79044 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 0 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 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 990 ms 110448 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 5 ms 1372 KB Output is correct
58 Correct 18 ms 3612 KB Output is correct
59 Correct 17 ms 2720 KB Output is correct
60 Correct 460 ms 55884 KB Output is correct
61 Correct 649 ms 75608 KB Output is correct
62 Correct 809 ms 91536 KB Output is correct
63 Correct 982 ms 110256 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 529 ms 91288 KB Output is correct
68 Correct 606 ms 92012 KB Output is correct
69 Correct 563 ms 91072 KB Output is correct
70 Correct 5 ms 1372 KB Output is correct
71 Correct 11 ms 2268 KB Output is correct
72 Correct 403 ms 54244 KB Output is correct
73 Correct 672 ms 84248 KB Output is correct
74 Correct 902 ms 108988 KB Output is correct
75 Correct 840 ms 102060 KB Output is correct
76 Correct 573 ms 91324 KB Output is correct
77 Correct 7 ms 1492 KB Output is correct
78 Correct 13 ms 2604 KB Output is correct
79 Correct 388 ms 53228 KB Output is correct
80 Correct 648 ms 80684 KB Output is correct
81 Correct 887 ms 106688 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 236 ms 45920 KB Output is correct
10 Correct 12 ms 4832 KB Output is correct
11 Correct 78 ms 24772 KB Output is correct
12 Correct 20 ms 7132 KB Output is correct
13 Correct 43 ms 10860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 239 ms 45948 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1063 ms 133396 KB Output is correct
21 Correct 1087 ms 124864 KB Output is correct
22 Correct 1022 ms 124772 KB Output is correct
23 Correct 581 ms 84756 KB Output is correct
24 Correct 183 ms 18516 KB Output is correct
25 Correct 482 ms 48832 KB Output is correct
26 Correct 467 ms 48692 KB Output is correct
27 Correct 644 ms 91580 KB Output is correct
28 Correct 615 ms 92392 KB Output is correct
29 Correct 803 ms 91500 KB Output is correct
30 Correct 763 ms 91832 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 49 ms 8092 KB Output is correct
33 Correct 123 ms 18772 KB Output is correct
34 Correct 1080 ms 133968 KB Output is correct
35 Correct 17 ms 2780 KB Output is correct
36 Correct 103 ms 12488 KB Output is correct
37 Correct 219 ms 24264 KB Output is correct
38 Correct 430 ms 45136 KB Output is correct
39 Correct 593 ms 61632 KB Output is correct
40 Correct 828 ms 79552 KB Output is correct
41 Correct 1075 ms 95936 KB Output is correct
42 Correct 1238 ms 111808 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 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 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 348 KB Output is correct
54 Correct 3 ms 860 KB Output is correct
55 Correct 4 ms 1072 KB Output is correct
56 Correct 411 ms 53712 KB Output is correct
57 Correct 628 ms 79812 KB Output is correct
58 Correct 620 ms 78272 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 537 ms 91812 KB Output is correct
63 Correct 559 ms 91488 KB Output is correct
64 Correct 560 ms 90948 KB Output is correct
65 Correct 5 ms 1368 KB Output is correct
66 Correct 11 ms 2140 KB Output is correct
67 Correct 401 ms 54164 KB Output is correct
68 Correct 644 ms 81852 KB Output is correct
69 Correct 888 ms 108220 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 236 ms 45920 KB Output is correct
10 Correct 12 ms 4832 KB Output is correct
11 Correct 78 ms 24772 KB Output is correct
12 Correct 20 ms 7132 KB Output is correct
13 Correct 43 ms 10860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 239 ms 45948 KB Output is correct
17 Correct 688 ms 97248 KB Output is correct
18 Correct 650 ms 96384 KB Output is correct
19 Correct 1093 ms 125372 KB Output is correct
20 Correct 1252 ms 106992 KB Output is correct
21 Correct 848 ms 89028 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 121 ms 17340 KB Output is correct
24 Correct 35 ms 5064 KB Output is correct
25 Correct 159 ms 17372 KB Output is correct
26 Correct 301 ms 31172 KB Output is correct
27 Correct 564 ms 55356 KB Output is correct
28 Correct 741 ms 70396 KB Output is correct
29 Correct 991 ms 83640 KB Output is correct
30 Correct 1139 ms 96784 KB Output is correct
31 Correct 1297 ms 110268 KB Output is correct
32 Correct 846 ms 102148 KB Output is correct
33 Correct 510 ms 91624 KB Output is correct
34 Correct 6 ms 1624 KB Output is correct
35 Correct 13 ms 2516 KB Output is correct
36 Correct 366 ms 53196 KB Output is correct
37 Correct 652 ms 80312 KB Output is correct
38 Correct 877 ms 106096 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 236 ms 45920 KB Output is correct
10 Correct 12 ms 4832 KB Output is correct
11 Correct 78 ms 24772 KB Output is correct
12 Correct 20 ms 7132 KB Output is correct
13 Correct 43 ms 10860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 239 ms 45948 KB Output is correct
17 Correct 0 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 894 ms 106932 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 856 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 6 ms 1372 KB Output is correct
28 Correct 303 ms 42612 KB Output is correct
29 Correct 522 ms 63680 KB Output is correct
30 Correct 678 ms 85440 KB Output is correct
31 Correct 892 ms 105884 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 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 1116 KB Output is correct
45 Correct 404 ms 53632 KB Output is correct
46 Correct 615 ms 79872 KB Output is correct
47 Correct 589 ms 79044 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 0 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 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 990 ms 110448 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 5 ms 1372 KB Output is correct
58 Correct 18 ms 3612 KB Output is correct
59 Correct 17 ms 2720 KB Output is correct
60 Correct 460 ms 55884 KB Output is correct
61 Correct 649 ms 75608 KB Output is correct
62 Correct 809 ms 91536 KB Output is correct
63 Correct 982 ms 110256 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 529 ms 91288 KB Output is correct
68 Correct 606 ms 92012 KB Output is correct
69 Correct 563 ms 91072 KB Output is correct
70 Correct 5 ms 1372 KB Output is correct
71 Correct 11 ms 2268 KB Output is correct
72 Correct 403 ms 54244 KB Output is correct
73 Correct 672 ms 84248 KB Output is correct
74 Correct 902 ms 108988 KB Output is correct
75 Correct 840 ms 102060 KB Output is correct
76 Correct 573 ms 91324 KB Output is correct
77 Correct 7 ms 1492 KB Output is correct
78 Correct 13 ms 2604 KB Output is correct
79 Correct 388 ms 53228 KB Output is correct
80 Correct 648 ms 80684 KB Output is correct
81 Correct 887 ms 106688 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 1063 ms 133396 KB Output is correct
86 Correct 1087 ms 124864 KB Output is correct
87 Correct 1022 ms 124772 KB Output is correct
88 Correct 581 ms 84756 KB Output is correct
89 Correct 183 ms 18516 KB Output is correct
90 Correct 482 ms 48832 KB Output is correct
91 Correct 467 ms 48692 KB Output is correct
92 Correct 644 ms 91580 KB Output is correct
93 Correct 615 ms 92392 KB Output is correct
94 Correct 803 ms 91500 KB Output is correct
95 Correct 763 ms 91832 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 49 ms 8092 KB Output is correct
98 Correct 123 ms 18772 KB Output is correct
99 Correct 1080 ms 133968 KB Output is correct
100 Correct 17 ms 2780 KB Output is correct
101 Correct 103 ms 12488 KB Output is correct
102 Correct 219 ms 24264 KB Output is correct
103 Correct 430 ms 45136 KB Output is correct
104 Correct 593 ms 61632 KB Output is correct
105 Correct 828 ms 79552 KB Output is correct
106 Correct 1075 ms 95936 KB Output is correct
107 Correct 1238 ms 111808 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 0 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 0 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 348 KB Output is correct
119 Correct 3 ms 860 KB Output is correct
120 Correct 4 ms 1072 KB Output is correct
121 Correct 411 ms 53712 KB Output is correct
122 Correct 628 ms 79812 KB Output is correct
123 Correct 620 ms 78272 KB Output is correct
124 Correct 0 ms 344 KB Output is correct
125 Correct 0 ms 344 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 537 ms 91812 KB Output is correct
128 Correct 559 ms 91488 KB Output is correct
129 Correct 560 ms 90948 KB Output is correct
130 Correct 5 ms 1368 KB Output is correct
131 Correct 11 ms 2140 KB Output is correct
132 Correct 401 ms 54164 KB Output is correct
133 Correct 644 ms 81852 KB Output is correct
134 Correct 888 ms 108220 KB Output is correct
135 Correct 688 ms 97248 KB Output is correct
136 Correct 650 ms 96384 KB Output is correct
137 Correct 1093 ms 125372 KB Output is correct
138 Correct 1252 ms 106992 KB Output is correct
139 Correct 848 ms 89028 KB Output is correct
140 Correct 0 ms 348 KB Output is correct
141 Correct 121 ms 17340 KB Output is correct
142 Correct 35 ms 5064 KB Output is correct
143 Correct 159 ms 17372 KB Output is correct
144 Correct 301 ms 31172 KB Output is correct
145 Correct 564 ms 55356 KB Output is correct
146 Correct 741 ms 70396 KB Output is correct
147 Correct 991 ms 83640 KB Output is correct
148 Correct 1139 ms 96784 KB Output is correct
149 Correct 1297 ms 110268 KB Output is correct
150 Correct 846 ms 102148 KB Output is correct
151 Correct 510 ms 91624 KB Output is correct
152 Correct 6 ms 1624 KB Output is correct
153 Correct 13 ms 2516 KB Output is correct
154 Correct 366 ms 53196 KB Output is correct
155 Correct 652 ms 80312 KB Output is correct
156 Correct 877 ms 106096 KB Output is correct
157 Correct 0 ms 348 KB Output is correct
158 Correct 1 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 Correct 1628 ms 120032 KB Output is correct
162 Correct 1092 ms 136124 KB Output is correct
163 Correct 1214 ms 127240 KB Output is correct
164 Correct 1181 ms 128952 KB Output is correct
165 Correct 1200 ms 124460 KB Output is correct
166 Correct 1326 ms 122544 KB Output is correct
167 Incorrect 242 ms 23412 KB Solution announced impossible, but it is possible.
168 Halted 0 ms 0 KB -