oj.uz

Submission #827235

# Submission time Handle Problem Language Result Execution time Memory
827235 2023-08-16T10:02:51 Z Sohsoh84 Fountain Parks (IOI21_parks) C++17
5 / 100
 597 ms 45168 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 X[i] - Y[i] < X[j] - 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 max(X[a.X.X], X[a.X.Y]) + min(Y[a.X.X], Y[a.X.Y]) < max(X[b.X.X], X[b.X.Y]) + min(Y[b.X.X], Y[b.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 304 KB Output is correct
2 Correct 1 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 308 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 133 ms 22052 KB Output is correct
10 Correct 10 ms 2516 KB Output is correct
11 Correct 83 ms 11900 KB Output is correct
12 Correct 15 ms 3620 KB Output is correct
13 Correct 27 ms 5964 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 480 KB Output is correct
16 Correct 138 ms 21988 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 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 308 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 133 ms 22052 KB Output is correct
10 Correct 10 ms 2516 KB Output is correct
11 Correct 83 ms 11900 KB Output is correct
12 Correct 15 ms 3620 KB Output is correct
13 Correct 27 ms 5964 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 480 KB Output is correct
16 Correct 138 ms 21988 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 340 KB Output is correct
23 Correct 413 ms 43784 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 724 KB Output is correct
27 Correct 3 ms 836 KB Output is correct
28 Correct 132 ms 17812 KB Output is correct
29 Correct 225 ms 26448 KB Output is correct
30 Correct 295 ms 35168 KB Output is correct
31 Correct 405 ms 43784 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 608 KB Output is correct
45 Incorrect 103 ms 13648 KB Solution announced impossible, but it is possible.
46 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 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 308 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 133 ms 22052 KB Output is correct
10 Correct 10 ms 2516 KB Output is correct
11 Correct 83 ms 11900 KB Output is correct
12 Correct 15 ms 3620 KB Output is correct
13 Correct 27 ms 5964 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 480 KB Output is correct
16 Correct 138 ms 21988 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 340 KB Output is correct
23 Correct 413 ms 43784 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 724 KB Output is correct
27 Correct 3 ms 836 KB Output is correct
28 Correct 132 ms 17812 KB Output is correct
29 Correct 225 ms 26448 KB Output is correct
30 Correct 295 ms 35168 KB Output is correct
31 Correct 405 ms 43784 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 608 KB Output is correct
45 Incorrect 103 ms 13648 KB Solution announced impossible, but it is possible.
46 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 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 308 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 133 ms 22052 KB Output is correct
10 Correct 10 ms 2516 KB Output is correct
11 Correct 83 ms 11900 KB Output is correct
12 Correct 15 ms 3620 KB Output is correct
13 Correct 27 ms 5964 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 480 KB Output is correct
16 Correct 138 ms 21988 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 372 ms 45168 KB Output is correct
21 Correct 522 ms 44792 KB Output is correct
22 Correct 371 ms 44152 KB Output is correct
23 Correct 313 ms 38024 KB Output is correct
24 Correct 336 ms 20768 KB Output is correct
25 Correct 416 ms 25580 KB Output is correct
26 Correct 342 ms 25716 KB Output is correct
27 Correct 506 ms 43324 KB Output is correct
28 Correct 500 ms 43400 KB Output is correct
29 Correct 597 ms 43432 KB Output is correct
30 Incorrect 477 ms 29212 KB Solution announced impossible, but it is possible.
31 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 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 308 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 133 ms 22052 KB Output is correct
10 Correct 10 ms 2516 KB Output is correct
11 Correct 83 ms 11900 KB Output is correct
12 Correct 15 ms 3620 KB Output is correct
13 Correct 27 ms 5964 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 480 KB Output is correct
16 Correct 138 ms 21988 KB Output is correct
17 Correct 398 ms 44784 KB Output is correct
18 Incorrect 309 ms 31452 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 304 KB Output is correct
2 Correct 1 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 308 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 133 ms 22052 KB Output is correct
10 Correct 10 ms 2516 KB Output is correct
11 Correct 83 ms 11900 KB Output is correct
12 Correct 15 ms 3620 KB Output is correct
13 Correct 27 ms 5964 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 480 KB Output is correct
16 Correct 138 ms 21988 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 340 KB Output is correct
23 Correct 413 ms 43784 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 724 KB Output is correct
27 Correct 3 ms 836 KB Output is correct
28 Correct 132 ms 17812 KB Output is correct
29 Correct 225 ms 26448 KB Output is correct
30 Correct 295 ms 35168 KB Output is correct
31 Correct 405 ms 43784 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 608 KB Output is correct
45 Incorrect 103 ms 13648 KB Solution announced impossible, but it is possible.
46 Halted 0 ms 0 KB -