oj.uz

Submission #827193

# Submission time Handle Problem Language Result Execution time Memory
827193 2023-08-16T09:44:43 Z Sohsoh84 Fountain Parks (IOI21_parks) C++17
15 / 100
 1340 ms 45664 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pll;

#define all(x)		(x).begin(), (x).end()
#define X		first
#define Y		second
#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

const int MAXN = 1e6 + 10;
const int DX[4] = {-1, 0, 1, 0};
const int DY[4] = {0, -1, 0, 1};

namespace answer {
	vector<int> u, v, a, b;
}

vector<pair<pll, int>> edges;

int X[MAXN], Y[MAXN], par[MAXN], n;
map<pll, int> mp;

int find(int v) {
	return par[v] == v ? v : par[v] = find(par[v]);
}

inline bool unite(int u_, int v_) {
	int u = find(u_), v = find(v_);
	if (u == v) return false;

	edges.push_back({{u_, v_}, (int)answer::u.size()});

	answer::u.push_back(u_);
	answer::v.push_back(v_);
	par[u] = v;

	return true;
}

int construct_roads(vector<int> x_, vector<int> y_) {
	n = x_.size();
	for (int i = 0; i < n; i++) {
		X[i] = x_[i];
		Y[i] = y_[i];

		mp[pll(X[i], Y[i])] = i;
		par[i] = i;
	}

	int edg = 0;
	for (int i = 0; i < 4; i++) {
		for (int v = 0; v < n; v++) {
			int ux = X[v] + 2 * DX[i], uy = Y[v] + 2 * DY[i];
			auto it = mp.find(pll(ux, uy));
			if (it == mp.end()) continue;

			int u = it -> second;	
			edg += unite(u, v);
		}
	}

	if (edg < n - 1) return 0;

	sort(all(edges), [] (const pair<pll, int>& a, const pair<pll, int>& b) {
		return X[a.X.X] + X[a.X.Y] + Y[a.X.X] + Y[a.X.Y] < X[b.X.X] + X[b.X.Y] + Y[a.X.X] + Y[a.X.Y];
	});

	set<pll> st;
	answer::a.resize(n - 1);
	answer::b.resize(n - 1);

	for (int ti = 0; ti < n - 1; ti++) {
		int i = edges[ti].Y;

		cerr  << answer::u[i] << sep << answer::v[i] << endl;
		if (X[answer::u[i]] == X[answer::v[i]]) {
			int tx = X[answer::u[i]] - 1, ty = (Y[answer::u[i]] + Y[answer::v[i]]) / 2;	
			if (st.find(pll(tx, ty)) == st.end()) {
				st.insert(pll(tx, ty));
				answer::a[i] = tx;	
				answer::b[i] = ty;	
				continue;
			}

			tx += 2;
			if (st.find(pll(tx, ty)) == st.end()) {
				st.insert(pll(tx, ty));
				answer::a[i] = tx;	
				answer::b[i] = ty;	
				continue;
			}

			return 0;
		} else {
			int ty = Y[answer::u[i]] - 1, tx = (X[answer::u[i]] + X[answer::v[i]]) / 2;	
			if (st.find(pll(tx, ty)) == st.end()) {
				st.insert(pll(tx, ty));
				answer::a[i] = tx;	
				answer::b[i] = ty;	
				continue;
			}

			ty += 2;
			if (st.find(pll(tx, ty)) == st.end()) {
				st.insert(pll(tx, ty));
				answer::a[i] = tx;	
				answer::b[i] = ty;	
				continue;
			}

			return 0;
		}
	}

	build(answer::u, answer::v, answer::a, answer::b);
	return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 559 ms 22392 KB Output is correct
10 Correct 48 ms 2608 KB Output is correct
11 Correct 289 ms 12760 KB Output is correct
12 Correct 71 ms 3776 KB Output is correct
13 Correct 26 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 557 ms 22376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 559 ms 22392 KB Output is correct
10 Correct 48 ms 2608 KB Output is correct
11 Correct 289 ms 12760 KB Output is correct
12 Correct 71 ms 3776 KB Output is correct
13 Correct 26 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 557 ms 22376 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1293 ms 44652 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 7 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 4 ms 724 KB Output is correct
28 Correct 441 ms 17996 KB Output is correct
29 Correct 695 ms 26780 KB Output is correct
30 Correct 986 ms 35768 KB Output is correct
31 Correct 1340 ms 44736 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 588 ms 22460 KB Output is correct
46 Correct 932 ms 32372 KB Output is correct
47 Correct 920 ms 32412 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 559 ms 22392 KB Output is correct
10 Correct 48 ms 2608 KB Output is correct
11 Correct 289 ms 12760 KB Output is correct
12 Correct 71 ms 3776 KB Output is correct
13 Correct 26 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 557 ms 22376 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1293 ms 44652 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 7 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 4 ms 724 KB Output is correct
28 Correct 441 ms 17996 KB Output is correct
29 Correct 695 ms 26780 KB Output is correct
30 Correct 986 ms 35768 KB Output is correct
31 Correct 1340 ms 44736 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 588 ms 22460 KB Output is correct
46 Correct 932 ms 32372 KB Output is correct
47 Correct 920 ms 32412 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 308 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 308 KB Output is correct
55 Incorrect 869 ms 30728 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 559 ms 22392 KB Output is correct
10 Correct 48 ms 2608 KB Output is correct
11 Correct 289 ms 12760 KB Output is correct
12 Correct 71 ms 3776 KB Output is correct
13 Correct 26 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 557 ms 22376 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1266 ms 45664 KB Output is correct
21 Correct 1292 ms 45408 KB Output is correct
22 Correct 1271 ms 45404 KB Output is correct
23 Correct 1029 ms 38328 KB Output is correct
24 Correct 288 ms 18460 KB Output is correct
25 Correct 416 ms 23564 KB Output is correct
26 Correct 316 ms 23600 KB Output is correct
27 Correct 1208 ms 44652 KB Output is correct
28 Correct 1268 ms 44780 KB Output is correct
29 Correct 1259 ms 45108 KB Output is correct
30 Correct 1241 ms 45120 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 19 ms 2168 KB Solution announced impossible, but it is possible.
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 559 ms 22392 KB Output is correct
10 Correct 48 ms 2608 KB Output is correct
11 Correct 289 ms 12760 KB Output is correct
12 Correct 71 ms 3776 KB Output is correct
13 Correct 26 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 557 ms 22376 KB Output is correct
17 Correct 1200 ms 45216 KB Output is correct
18 Correct 1271 ms 45292 KB Output is correct
19 Incorrect 1271 ms 35752 KB Solution announced impossible, but it is possible.
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 559 ms 22392 KB Output is correct
10 Correct 48 ms 2608 KB Output is correct
11 Correct 289 ms 12760 KB Output is correct
12 Correct 71 ms 3776 KB Output is correct
13 Correct 26 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 557 ms 22376 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1293 ms 44652 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 7 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 4 ms 724 KB Output is correct
28 Correct 441 ms 17996 KB Output is correct
29 Correct 695 ms 26780 KB Output is correct
30 Correct 986 ms 35768 KB Output is correct
31 Correct 1340 ms 44736 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 588 ms 22460 KB Output is correct
46 Correct 932 ms 32372 KB Output is correct
47 Correct 920 ms 32412 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 308 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 308 KB Output is correct
55 Incorrect 869 ms 30728 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -