oj.uz

답안 #1039705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039705 2024-07-31T07:59:53 Z Alihan_8 분수 공원 (IOI21_parks) C++17
70 / 100
 1486 ms 141260 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;
	}
	
};
 
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;
	
	//~ Dsu ds(n);
	
	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;
			
			G[id[u][v]].pb(i);
			G[i].pb(id[u][v]);
		}
	}
	
	vector <int> vis(n);
	
	auto D = [&](auto D, int u) -> void{
		vis[u] = true;
		
		for ( auto &v: G[u] ){
			if ( vis[v] ) continue;
			
			e.pb({u, v});
				
			mp[{v, u}] = mp[{u, v}] = (int)e.size() - 1;
			
			D(D, v);
		}
	};
	
	D(D, 0);
	
	for ( int i = 0; i < n; i++ ){
		if ( !vis[i] ) return 0;
	}
	
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 288 ms 53012 KB Output is correct
10 Correct 17 ms 5720 KB Output is correct
11 Correct 113 ms 28900 KB Output is correct
12 Correct 21 ms 8280 KB Output is correct
13 Correct 41 ms 11712 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 265 ms 50716 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 288 ms 53012 KB Output is correct
10 Correct 17 ms 5720 KB Output is correct
11 Correct 113 ms 28900 KB Output is correct
12 Correct 21 ms 8280 KB Output is correct
13 Correct 41 ms 11712 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 265 ms 50716 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 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 1343 ms 123776 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 1100 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 5 ms 1012 KB Output is correct
28 Correct 433 ms 50248 KB Output is correct
29 Correct 773 ms 73800 KB Output is correct
30 Correct 1050 ms 99712 KB Output is correct
31 Correct 1403 ms 123000 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 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 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 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 3 ms 704 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 476 ms 59668 KB Output is correct
46 Correct 776 ms 86644 KB Output is correct
47 Correct 734 ms 86448 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 288 ms 53012 KB Output is correct
10 Correct 17 ms 5720 KB Output is correct
11 Correct 113 ms 28900 KB Output is correct
12 Correct 21 ms 8280 KB Output is correct
13 Correct 41 ms 11712 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 265 ms 50716 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 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 1343 ms 123776 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 1100 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 5 ms 1012 KB Output is correct
28 Correct 433 ms 50248 KB Output is correct
29 Correct 773 ms 73800 KB Output is correct
30 Correct 1050 ms 99712 KB Output is correct
31 Correct 1403 ms 123000 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 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 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 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 3 ms 704 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 476 ms 59668 KB Output is correct
46 Correct 776 ms 86644 KB Output is correct
47 Correct 734 ms 86448 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 440 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1446 ms 123212 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 8 ms 1372 KB Output is correct
58 Correct 22 ms 3932 KB Output is correct
59 Correct 16 ms 2176 KB Output is correct
60 Correct 580 ms 62568 KB Output is correct
61 Correct 917 ms 85372 KB Output is correct
62 Correct 1190 ms 102172 KB Output is correct
63 Correct 1424 ms 123168 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 638 ms 103404 KB Output is correct
68 Correct 623 ms 103680 KB Output is correct
69 Correct 622 ms 104260 KB Output is correct
70 Correct 5 ms 1116 KB Output is correct
71 Correct 9 ms 1724 KB Output is correct
72 Correct 436 ms 58752 KB Output is correct
73 Correct 729 ms 89716 KB Output is correct
74 Correct 1016 ms 117368 KB Output is correct
75 Correct 1059 ms 117420 KB Output is correct
76 Correct 652 ms 106556 KB Output is correct
77 Correct 6 ms 1372 KB Output is correct
78 Correct 12 ms 2240 KB Output is correct
79 Correct 448 ms 58932 KB Output is correct
80 Correct 752 ms 89152 KB Output is correct
81 Correct 1022 ms 118336 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 288 ms 53012 KB Output is correct
10 Correct 17 ms 5720 KB Output is correct
11 Correct 113 ms 28900 KB Output is correct
12 Correct 21 ms 8280 KB Output is correct
13 Correct 41 ms 11712 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 265 ms 50716 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 1109 ms 141260 KB Output is correct
21 Correct 1079 ms 134460 KB Output is correct
22 Correct 1068 ms 133260 KB Output is correct
23 Correct 600 ms 92348 KB Output is correct
24 Correct 167 ms 19792 KB Output is correct
25 Correct 363 ms 26192 KB Output is correct
26 Correct 312 ms 26660 KB Output is correct
27 Correct 633 ms 96344 KB Output is correct
28 Correct 619 ms 96324 KB Output is correct
29 Correct 795 ms 96276 KB Output is correct
30 Correct 814 ms 96320 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 47 ms 8764 KB Output is correct
33 Correct 109 ms 19940 KB Output is correct
34 Correct 1093 ms 139580 KB Output is correct
35 Correct 14 ms 2320 KB Output is correct
36 Correct 79 ms 8788 KB Output is correct
37 Correct 172 ms 15792 KB Output is correct
38 Correct 361 ms 47684 KB Output is correct
39 Correct 544 ms 65200 KB Output is correct
40 Correct 722 ms 83764 KB Output is correct
41 Correct 965 ms 100744 KB Output is correct
42 Correct 1067 ms 118068 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 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 436 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 2 ms 856 KB Output is correct
55 Correct 3 ms 856 KB Output is correct
56 Correct 422 ms 59588 KB Output is correct
57 Correct 651 ms 87288 KB Output is correct
58 Correct 690 ms 86896 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 611 ms 103220 KB Output is correct
63 Correct 593 ms 103516 KB Output is correct
64 Correct 618 ms 104208 KB Output is correct
65 Correct 5 ms 1112 KB Output is correct
66 Correct 9 ms 1724 KB Output is correct
67 Correct 432 ms 58692 KB Output is correct
68 Correct 694 ms 89668 KB Output is correct
69 Correct 1004 ms 117056 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 288 ms 53012 KB Output is correct
10 Correct 17 ms 5720 KB Output is correct
11 Correct 113 ms 28900 KB Output is correct
12 Correct 21 ms 8280 KB Output is correct
13 Correct 41 ms 11712 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 265 ms 50716 KB Output is correct
17 Correct 727 ms 111428 KB Output is correct
18 Correct 742 ms 107364 KB Output is correct
19 Correct 1084 ms 136692 KB Output is correct
20 Correct 1251 ms 116544 KB Output is correct
21 Correct 771 ms 92228 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 115 ms 18556 KB Output is correct
24 Correct 32 ms 4688 KB Output is correct
25 Correct 121 ms 12116 KB Output is correct
26 Correct 234 ms 19704 KB Output is correct
27 Correct 521 ms 59968 KB Output is correct
28 Correct 655 ms 74364 KB Output is correct
29 Correct 810 ms 89940 KB Output is correct
30 Correct 1004 ms 104512 KB Output is correct
31 Correct 1176 ms 119356 KB Output is correct
32 Correct 943 ms 117356 KB Output is correct
33 Correct 629 ms 106288 KB Output is correct
34 Correct 6 ms 1372 KB Output is correct
35 Correct 13 ms 2148 KB Output is correct
36 Correct 432 ms 59152 KB Output is correct
37 Correct 772 ms 89152 KB Output is correct
38 Correct 1027 ms 118316 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 288 ms 53012 KB Output is correct
10 Correct 17 ms 5720 KB Output is correct
11 Correct 113 ms 28900 KB Output is correct
12 Correct 21 ms 8280 KB Output is correct
13 Correct 41 ms 11712 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 265 ms 50716 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 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 1343 ms 123776 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 1100 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 5 ms 1012 KB Output is correct
28 Correct 433 ms 50248 KB Output is correct
29 Correct 773 ms 73800 KB Output is correct
30 Correct 1050 ms 99712 KB Output is correct
31 Correct 1403 ms 123000 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 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 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 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 3 ms 704 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 476 ms 59668 KB Output is correct
46 Correct 776 ms 86644 KB Output is correct
47 Correct 734 ms 86448 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 440 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1446 ms 123212 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 8 ms 1372 KB Output is correct
58 Correct 22 ms 3932 KB Output is correct
59 Correct 16 ms 2176 KB Output is correct
60 Correct 580 ms 62568 KB Output is correct
61 Correct 917 ms 85372 KB Output is correct
62 Correct 1190 ms 102172 KB Output is correct
63 Correct 1424 ms 123168 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 638 ms 103404 KB Output is correct
68 Correct 623 ms 103680 KB Output is correct
69 Correct 622 ms 104260 KB Output is correct
70 Correct 5 ms 1116 KB Output is correct
71 Correct 9 ms 1724 KB Output is correct
72 Correct 436 ms 58752 KB Output is correct
73 Correct 729 ms 89716 KB Output is correct
74 Correct 1016 ms 117368 KB Output is correct
75 Correct 1059 ms 117420 KB Output is correct
76 Correct 652 ms 106556 KB Output is correct
77 Correct 6 ms 1372 KB Output is correct
78 Correct 12 ms 2240 KB Output is correct
79 Correct 448 ms 58932 KB Output is correct
80 Correct 752 ms 89152 KB Output is correct
81 Correct 1022 ms 118336 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 1109 ms 141260 KB Output is correct
86 Correct 1079 ms 134460 KB Output is correct
87 Correct 1068 ms 133260 KB Output is correct
88 Correct 600 ms 92348 KB Output is correct
89 Correct 167 ms 19792 KB Output is correct
90 Correct 363 ms 26192 KB Output is correct
91 Correct 312 ms 26660 KB Output is correct
92 Correct 633 ms 96344 KB Output is correct
93 Correct 619 ms 96324 KB Output is correct
94 Correct 795 ms 96276 KB Output is correct
95 Correct 814 ms 96320 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 47 ms 8764 KB Output is correct
98 Correct 109 ms 19940 KB Output is correct
99 Correct 1093 ms 139580 KB Output is correct
100 Correct 14 ms 2320 KB Output is correct
101 Correct 79 ms 8788 KB Output is correct
102 Correct 172 ms 15792 KB Output is correct
103 Correct 361 ms 47684 KB Output is correct
104 Correct 544 ms 65200 KB Output is correct
105 Correct 722 ms 83764 KB Output is correct
106 Correct 965 ms 100744 KB Output is correct
107 Correct 1067 ms 118068 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 344 KB Output is correct
115 Correct 0 ms 348 KB Output is correct
116 Correct 0 ms 436 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 0 ms 348 KB Output is correct
119 Correct 2 ms 856 KB Output is correct
120 Correct 3 ms 856 KB Output is correct
121 Correct 422 ms 59588 KB Output is correct
122 Correct 651 ms 87288 KB Output is correct
123 Correct 690 ms 86896 KB Output is correct
124 Correct 0 ms 348 KB Output is correct
125 Correct 0 ms 348 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 611 ms 103220 KB Output is correct
128 Correct 593 ms 103516 KB Output is correct
129 Correct 618 ms 104208 KB Output is correct
130 Correct 5 ms 1112 KB Output is correct
131 Correct 9 ms 1724 KB Output is correct
132 Correct 432 ms 58692 KB Output is correct
133 Correct 694 ms 89668 KB Output is correct
134 Correct 1004 ms 117056 KB Output is correct
135 Correct 727 ms 111428 KB Output is correct
136 Correct 742 ms 107364 KB Output is correct
137 Correct 1084 ms 136692 KB Output is correct
138 Correct 1251 ms 116544 KB Output is correct
139 Correct 771 ms 92228 KB Output is correct
140 Correct 0 ms 348 KB Output is correct
141 Correct 115 ms 18556 KB Output is correct
142 Correct 32 ms 4688 KB Output is correct
143 Correct 121 ms 12116 KB Output is correct
144 Correct 234 ms 19704 KB Output is correct
145 Correct 521 ms 59968 KB Output is correct
146 Correct 655 ms 74364 KB Output is correct
147 Correct 810 ms 89940 KB Output is correct
148 Correct 1004 ms 104512 KB Output is correct
149 Correct 1176 ms 119356 KB Output is correct
150 Correct 943 ms 117356 KB Output is correct
151 Correct 629 ms 106288 KB Output is correct
152 Correct 6 ms 1372 KB Output is correct
153 Correct 13 ms 2148 KB Output is correct
154 Correct 432 ms 59152 KB Output is correct
155 Correct 772 ms 89152 KB Output is correct
156 Correct 1027 ms 118316 KB Output is correct
157 Correct 0 ms 600 KB Output is correct
158 Correct 1 ms 344 KB Output is correct
159 Correct 0 ms 348 KB Output is correct
160 Correct 0 ms 348 KB Output is correct
161 Incorrect 1486 ms 110204 KB Solution announced impossible, but it is possible.
162 Halted 0 ms 0 KB -