oj.uz

Submission #1039758

# Submission time Handle Problem Language Result Execution time Memory
1039758 2024-07-31T08:33:22 Z Alihan_8 Fountain Parks (IOI21_parks) C++17
55 / 100
 1566 ms 135492 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];
	};
	
	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;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:90:7: warning: variable 'f' set but not used [-Wunused-but-set-variable]
   90 |  auto f = [&](int i, int j){
      |       ^

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 1 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 241 ms 45884 KB Output is correct
10 Correct 14 ms 5084 KB Output is correct
11 Correct 99 ms 25252 KB Output is correct
12 Correct 23 ms 7388 KB Output is correct
13 Correct 40 ms 11164 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 253 ms 46732 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 1 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 241 ms 45884 KB Output is correct
10 Correct 14 ms 5084 KB Output is correct
11 Correct 99 ms 25252 KB Output is correct
12 Correct 23 ms 7388 KB Output is correct
13 Correct 40 ms 11164 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 253 ms 46732 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 440 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1545 ms 111684 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 3 ms 1116 KB Output is correct
27 Correct 5 ms 1372 KB Output is correct
28 Correct 451 ms 44840 KB Output is correct
29 Correct 703 ms 68096 KB Output is correct
30 Correct 997 ms 89472 KB Output is correct
31 Correct 1455 ms 112760 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 0 ms 344 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 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 4 ms 1076 KB Output is correct
45 Correct 470 ms 54500 KB Output is correct
46 Correct 794 ms 79552 KB Output is correct
47 Correct 780 ms 79044 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 1 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 241 ms 45884 KB Output is correct
10 Correct 14 ms 5084 KB Output is correct
11 Correct 99 ms 25252 KB Output is correct
12 Correct 23 ms 7388 KB Output is correct
13 Correct 40 ms 11164 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 253 ms 46732 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 440 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1545 ms 111684 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 3 ms 1116 KB Output is correct
27 Correct 5 ms 1372 KB Output is correct
28 Correct 451 ms 44840 KB Output is correct
29 Correct 703 ms 68096 KB Output is correct
30 Correct 997 ms 89472 KB Output is correct
31 Correct 1455 ms 112760 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 0 ms 344 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 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 4 ms 1076 KB Output is correct
45 Correct 470 ms 54500 KB Output is correct
46 Correct 794 ms 79552 KB Output is correct
47 Correct 780 ms 79044 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 0 ms 348 KB Output is correct
55 Incorrect 1531 ms 96552 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 1 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 241 ms 45884 KB Output is correct
10 Correct 14 ms 5084 KB Output is correct
11 Correct 99 ms 25252 KB Output is correct
12 Correct 23 ms 7388 KB Output is correct
13 Correct 40 ms 11164 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 253 ms 46732 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 344 KB Output is correct
20 Correct 1524 ms 135492 KB Output is correct
21 Correct 1468 ms 126712 KB Output is correct
22 Correct 1566 ms 127056 KB Output is correct
23 Correct 600 ms 84888 KB Output is correct
24 Correct 185 ms 20012 KB Output is correct
25 Correct 494 ms 50224 KB Output is correct
26 Correct 391 ms 49876 KB Output is correct
27 Correct 617 ms 93840 KB Output is correct
28 Correct 613 ms 94132 KB Output is correct
29 Correct 795 ms 93092 KB Output is correct
30 Correct 777 ms 93108 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 58 ms 8316 KB Output is correct
33 Correct 125 ms 20004 KB Output is correct
34 Correct 1538 ms 134328 KB Output is correct
35 Correct 17 ms 2804 KB Output is correct
36 Correct 83 ms 12964 KB Output is correct
37 Correct 234 ms 25544 KB Output is correct
38 Correct 443 ms 46144 KB Output is correct
39 Correct 626 ms 62912 KB Output is correct
40 Correct 756 ms 82052 KB Output is correct
41 Correct 982 ms 97728 KB Output is correct
42 Correct 1319 ms 114368 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 360 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 444 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 2 ms 928 KB Output is correct
55 Correct 3 ms 1112 KB Output is correct
56 Correct 451 ms 54732 KB Output is correct
57 Correct 665 ms 80068 KB Output is correct
58 Correct 717 ms 81092 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 498 ms 93076 KB Output is correct
63 Correct 531 ms 93880 KB Output is correct
64 Correct 507 ms 93228 KB Output is correct
65 Correct 4 ms 1372 KB Output is correct
66 Correct 10 ms 2396 KB Output is correct
67 Correct 462 ms 54988 KB Output is correct
68 Correct 739 ms 83060 KB Output is correct
69 Correct 1096 ms 110776 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 1 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 241 ms 45884 KB Output is correct
10 Correct 14 ms 5084 KB Output is correct
11 Correct 99 ms 25252 KB Output is correct
12 Correct 23 ms 7388 KB Output is correct
13 Correct 40 ms 11164 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 253 ms 46732 KB Output is correct
17 Correct 673 ms 98528 KB Output is correct
18 Correct 688 ms 98236 KB Output is correct
19 Correct 1367 ms 129468 KB Output is correct
20 Correct 1236 ms 111548 KB Output is correct
21 Correct 844 ms 90048 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 122 ms 17816 KB Output is correct
24 Correct 30 ms 5332 KB Output is correct
25 Correct 138 ms 18324 KB Output is correct
26 Correct 261 ms 32664 KB Output is correct
27 Correct 565 ms 57156 KB Output is correct
28 Correct 735 ms 71484 KB Output is correct
29 Correct 871 ms 86728 KB Output is correct
30 Correct 1084 ms 99600 KB Output is correct
31 Correct 1345 ms 113660 KB Output is correct
32 Correct 1064 ms 107604 KB Output is correct
33 Correct 533 ms 93112 KB Output is correct
34 Correct 7 ms 1624 KB Output is correct
35 Correct 12 ms 2644 KB Output is correct
36 Correct 478 ms 55056 KB Output is correct
37 Correct 790 ms 83776 KB Output is correct
38 Correct 1155 ms 109756 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 1 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 241 ms 45884 KB Output is correct
10 Correct 14 ms 5084 KB Output is correct
11 Correct 99 ms 25252 KB Output is correct
12 Correct 23 ms 7388 KB Output is correct
13 Correct 40 ms 11164 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 253 ms 46732 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 440 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1545 ms 111684 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 3 ms 1116 KB Output is correct
27 Correct 5 ms 1372 KB Output is correct
28 Correct 451 ms 44840 KB Output is correct
29 Correct 703 ms 68096 KB Output is correct
30 Correct 997 ms 89472 KB Output is correct
31 Correct 1455 ms 112760 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 0 ms 344 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 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 4 ms 1076 KB Output is correct
45 Correct 470 ms 54500 KB Output is correct
46 Correct 794 ms 79552 KB Output is correct
47 Correct 780 ms 79044 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 0 ms 348 KB Output is correct
55 Incorrect 1531 ms 96552 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -