oj.uz

Submission #1039719

# Submission time Handle Problem Language Result Execution time Memory
1039719 2024-07-31T08:07:26 Z Alihan_8 Fountain Parks (IOI21_parks) C++17
55 / 100
 1991 ms 134212 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]});
		}
	}
	
	Dsu ds(n);
	
	random_shuffle(all(E));
	
	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 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 253 ms 46788 KB Output is correct
10 Correct 15 ms 5084 KB Output is correct
11 Correct 96 ms 25260 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 44 ms 11100 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 276 ms 46580 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 253 ms 46788 KB Output is correct
10 Correct 15 ms 5084 KB Output is correct
11 Correct 96 ms 25260 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 44 ms 11100 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 276 ms 46580 KB Output is correct
17 Correct 0 ms 600 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 1607 ms 110520 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 4 ms 1148 KB Output is correct
27 Correct 5 ms 1372 KB Output is correct
28 Correct 438 ms 44508 KB Output is correct
29 Correct 773 ms 66820 KB Output is correct
30 Correct 1298 ms 88876 KB Output is correct
31 Correct 1725 ms 110608 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 444 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 440 KB Output is correct
37 Correct 1 ms 348 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 440 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 4 ms 1112 KB Output is correct
45 Correct 569 ms 54480 KB Output is correct
46 Correct 918 ms 79552 KB Output is correct
47 Correct 969 ms 79156 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 253 ms 46788 KB Output is correct
10 Correct 15 ms 5084 KB Output is correct
11 Correct 96 ms 25260 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 44 ms 11100 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 276 ms 46580 KB Output is correct
17 Correct 0 ms 600 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 1607 ms 110520 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 4 ms 1148 KB Output is correct
27 Correct 5 ms 1372 KB Output is correct
28 Correct 438 ms 44508 KB Output is correct
29 Correct 773 ms 66820 KB Output is correct
30 Correct 1298 ms 88876 KB Output is correct
31 Correct 1725 ms 110608 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 444 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 440 KB Output is correct
37 Correct 1 ms 348 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 440 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 4 ms 1112 KB Output is correct
45 Correct 569 ms 54480 KB Output is correct
46 Correct 918 ms 79552 KB Output is correct
47 Correct 969 ms 79156 KB Output is correct
48 Correct 0 ms 444 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 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Incorrect 1991 ms 95268 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 253 ms 46788 KB Output is correct
10 Correct 15 ms 5084 KB Output is correct
11 Correct 96 ms 25260 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 44 ms 11100 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 276 ms 46580 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1913 ms 132232 KB Output is correct
21 Correct 1650 ms 125640 KB Output is correct
22 Correct 1552 ms 126468 KB Output is correct
23 Correct 621 ms 84164 KB Output is correct
24 Correct 169 ms 20052 KB Output is correct
25 Correct 530 ms 49680 KB Output is correct
26 Correct 436 ms 49656 KB Output is correct
27 Correct 626 ms 93120 KB Output is correct
28 Correct 628 ms 93120 KB Output is correct
29 Correct 867 ms 93408 KB Output is correct
30 Correct 786 ms 93112 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 50 ms 8148 KB Output is correct
33 Correct 119 ms 20052 KB Output is correct
34 Correct 1623 ms 134212 KB Output is correct
35 Correct 14 ms 2780 KB Output is correct
36 Correct 95 ms 13040 KB Output is correct
37 Correct 209 ms 25524 KB Output is correct
38 Correct 459 ms 46272 KB Output is correct
39 Correct 638 ms 63036 KB Output is correct
40 Correct 880 ms 80824 KB Output is correct
41 Correct 1152 ms 97400 KB Output is correct
42 Correct 1437 ms 113276 KB Output is correct
43 Correct 1 ms 344 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 600 KB Output is correct
47 Correct 0 ms 440 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 600 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 604 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 2 ms 860 KB Output is correct
55 Correct 3 ms 1116 KB Output is correct
56 Correct 480 ms 54520 KB Output is correct
57 Correct 791 ms 79300 KB Output is correct
58 Correct 789 ms 79276 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 558 ms 92300 KB Output is correct
63 Correct 573 ms 92524 KB Output is correct
64 Correct 552 ms 92028 KB Output is correct
65 Correct 5 ms 1372 KB Output is correct
66 Correct 10 ms 2224 KB Output is correct
67 Correct 534 ms 54948 KB Output is correct
68 Correct 915 ms 82360 KB Output is correct
69 Correct 1163 ms 108188 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 253 ms 46788 KB Output is correct
10 Correct 15 ms 5084 KB Output is correct
11 Correct 96 ms 25260 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 44 ms 11100 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 276 ms 46580 KB Output is correct
17 Correct 694 ms 96068 KB Output is correct
18 Correct 678 ms 96192 KB Output is correct
19 Correct 1468 ms 127624 KB Output is correct
20 Correct 1372 ms 108812 KB Output is correct
21 Correct 934 ms 88584 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 138 ms 17352 KB Output is correct
24 Correct 32 ms 5064 KB Output is correct
25 Correct 147 ms 17356 KB Output is correct
26 Correct 297 ms 29716 KB Output is correct
27 Correct 630 ms 55496 KB Output is correct
28 Correct 903 ms 69208 KB Output is correct
29 Correct 1249 ms 83564 KB Output is correct
30 Correct 1471 ms 97232 KB Output is correct
31 Correct 1715 ms 110720 KB Output is correct
32 Correct 1393 ms 105464 KB Output is correct
33 Correct 659 ms 91324 KB Output is correct
34 Correct 9 ms 1488 KB Output is correct
35 Correct 18 ms 2520 KB Output is correct
36 Correct 617 ms 54072 KB Output is correct
37 Correct 1026 ms 81396 KB Output is correct
38 Correct 1450 ms 107824 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 253 ms 46788 KB Output is correct
10 Correct 15 ms 5084 KB Output is correct
11 Correct 96 ms 25260 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 44 ms 11100 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 276 ms 46580 KB Output is correct
17 Correct 0 ms 600 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 1607 ms 110520 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 4 ms 1148 KB Output is correct
27 Correct 5 ms 1372 KB Output is correct
28 Correct 438 ms 44508 KB Output is correct
29 Correct 773 ms 66820 KB Output is correct
30 Correct 1298 ms 88876 KB Output is correct
31 Correct 1725 ms 110608 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 444 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 440 KB Output is correct
37 Correct 1 ms 348 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 440 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 4 ms 1112 KB Output is correct
45 Correct 569 ms 54480 KB Output is correct
46 Correct 918 ms 79552 KB Output is correct
47 Correct 969 ms 79156 KB Output is correct
48 Correct 0 ms 444 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 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Incorrect 1991 ms 95268 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -