oj.uz

Submission #827206

# Submission time Handle Problem Language Result Execution time Memory
827206 2023-08-16T09:55:10 Z Sohsoh84 Fountain Parks (IOI21_parks) C++17
15 / 100
 527 ms 44968 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;
	vector<int> vert_vec;
	for (int i = 0; i < n; i++) vert_vec.push_back(i);
	sort(all(vert_vec), [] (int i, int j) {
		return Y[i] < Y[j];
	});

	for (int i = 0; i < 4; i++) {
		for (int tv = 0; tv < n; tv++) {
			int v = vert_vec[tv];

			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 min(X[a.X.X]X[a.X.Y] + Y[a.X.Y]) < min(X[b.X.X] + Y[b.X.X], X[a.X.Y] + 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 125 ms 23188 KB Output is correct
10 Correct 9 ms 2644 KB Output is correct
11 Correct 59 ms 12464 KB Output is correct
12 Correct 15 ms 3788 KB Output is correct
13 Correct 27 ms 6280 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 126 ms 23204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 125 ms 23188 KB Output is correct
10 Correct 9 ms 2644 KB Output is correct
11 Correct 59 ms 12464 KB Output is correct
12 Correct 15 ms 3788 KB Output is correct
13 Correct 27 ms 6280 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 126 ms 23204 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 308 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 334 ms 44968 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 572 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 120 ms 18176 KB Output is correct
29 Correct 172 ms 27152 KB Output is correct
30 Correct 259 ms 36016 KB Output is correct
31 Correct 357 ms 44968 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 304 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 308 KB Output is correct
40 Correct 1 ms 304 KB Output is correct
41 Correct 0 ms 304 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 580 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 141 ms 22952 KB Output is correct
46 Correct 227 ms 32748 KB Output is correct
47 Correct 219 ms 32788 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 125 ms 23188 KB Output is correct
10 Correct 9 ms 2644 KB Output is correct
11 Correct 59 ms 12464 KB Output is correct
12 Correct 15 ms 3788 KB Output is correct
13 Correct 27 ms 6280 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 126 ms 23204 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 308 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 334 ms 44968 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 572 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 120 ms 18176 KB Output is correct
29 Correct 172 ms 27152 KB Output is correct
30 Correct 259 ms 36016 KB Output is correct
31 Correct 357 ms 44968 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 304 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 308 KB Output is correct
40 Correct 1 ms 304 KB Output is correct
41 Correct 0 ms 304 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 580 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 141 ms 22952 KB Output is correct
46 Correct 227 ms 32748 KB Output is correct
47 Correct 219 ms 32788 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 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
52 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 125 ms 23188 KB Output is correct
10 Correct 9 ms 2644 KB Output is correct
11 Correct 59 ms 12464 KB Output is correct
12 Correct 15 ms 3788 KB Output is correct
13 Correct 27 ms 6280 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 126 ms 23204 KB Output is correct
17 Correct 1 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 356 ms 44244 KB Output is correct
21 Correct 345 ms 43660 KB Output is correct
22 Correct 353 ms 43668 KB Output is correct
23 Correct 361 ms 38108 KB Output is correct
24 Correct 343 ms 21092 KB Output is correct
25 Correct 393 ms 25964 KB Output is correct
26 Correct 380 ms 25968 KB Output is correct
27 Correct 527 ms 43740 KB Output is correct
28 Incorrect 489 ms 35512 KB Solution announced impossible, but it is possible.
29 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 125 ms 23188 KB Output is correct
10 Correct 9 ms 2644 KB Output is correct
11 Correct 59 ms 12464 KB Output is correct
12 Correct 15 ms 3788 KB Output is correct
13 Correct 27 ms 6280 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 126 ms 23204 KB Output is correct
17 Correct 406 ms 43392 KB Output is correct
18 Incorrect 344 ms 32532 KB Solution announced impossible, but it is possible.
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 125 ms 23188 KB Output is correct
10 Correct 9 ms 2644 KB Output is correct
11 Correct 59 ms 12464 KB Output is correct
12 Correct 15 ms 3788 KB Output is correct
13 Correct 27 ms 6280 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 126 ms 23204 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 308 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 334 ms 44968 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 572 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 120 ms 18176 KB Output is correct
29 Correct 172 ms 27152 KB Output is correct
30 Correct 259 ms 36016 KB Output is correct
31 Correct 357 ms 44968 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 304 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 308 KB Output is correct
40 Correct 1 ms 304 KB Output is correct
41 Correct 0 ms 304 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 580 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 141 ms 22952 KB Output is correct
46 Correct 227 ms 32748 KB Output is correct
47 Correct 219 ms 32788 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 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
52 Halted 0 ms 0 KB -