oj.uz

답안 #827229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
827229 2023-08-16T10:02:08 Z Sohsoh84 분수 공원 (IOI21_parks) C++17
15 / 100
 688 ms 45172 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 min(X[a.X.X], X[a.X.Y]) - min(Y[a.X.X], Y[a.X.Y]) < min(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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 139 ms 21992 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 60 ms 11908 KB Output is correct
12 Correct 16 ms 3640 KB Output is correct
13 Correct 27 ms 5944 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 146 ms 22100 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 139 ms 21992 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 60 ms 11908 KB Output is correct
12 Correct 16 ms 3640 KB Output is correct
13 Correct 27 ms 5944 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 146 ms 22100 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 399 ms 43784 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 146 ms 17728 KB Output is correct
29 Correct 236 ms 26372 KB Output is correct
30 Correct 359 ms 35084 KB Output is correct
31 Correct 424 ms 43828 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 308 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 1 ms 212 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 166 ms 22096 KB Output is correct
46 Correct 268 ms 31748 KB Output is correct
47 Correct 305 ms 31748 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 139 ms 21992 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 60 ms 11908 KB Output is correct
12 Correct 16 ms 3640 KB Output is correct
13 Correct 27 ms 5944 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 146 ms 22100 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 399 ms 43784 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 146 ms 17728 KB Output is correct
29 Correct 236 ms 26372 KB Output is correct
30 Correct 359 ms 35084 KB Output is correct
31 Correct 424 ms 43828 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 308 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 1 ms 212 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 166 ms 22096 KB Output is correct
46 Correct 268 ms 31748 KB Output is correct
47 Correct 305 ms 31748 KB Output is correct
48 Correct 1 ms 304 KB Output is correct
49 Correct 0 ms 308 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 232 KB Output is correct
53 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
54 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 139 ms 21992 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 60 ms 11908 KB Output is correct
12 Correct 16 ms 3640 KB Output is correct
13 Correct 27 ms 5944 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 146 ms 22100 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 482 ms 45120 KB Output is correct
21 Correct 688 ms 45068 KB Output is correct
22 Correct 515 ms 45168 KB Output is correct
23 Correct 407 ms 38360 KB Output is correct
24 Correct 380 ms 21148 KB Output is correct
25 Correct 474 ms 26016 KB Output is correct
26 Correct 325 ms 25972 KB Output is correct
27 Correct 572 ms 43552 KB Output is correct
28 Incorrect 362 ms 26772 KB Solution announced impossible, but it is possible.
29 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 139 ms 21992 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 60 ms 11908 KB Output is correct
12 Correct 16 ms 3640 KB Output is correct
13 Correct 27 ms 5944 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 146 ms 22100 KB Output is correct
17 Correct 425 ms 45172 KB Output is correct
18 Incorrect 390 ms 32028 KB Solution announced impossible, but it is possible.
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 139 ms 21992 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 60 ms 11908 KB Output is correct
12 Correct 16 ms 3640 KB Output is correct
13 Correct 27 ms 5944 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 146 ms 22100 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 399 ms 43784 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 146 ms 17728 KB Output is correct
29 Correct 236 ms 26372 KB Output is correct
30 Correct 359 ms 35084 KB Output is correct
31 Correct 424 ms 43828 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 308 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 1 ms 212 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 166 ms 22096 KB Output is correct
46 Correct 268 ms 31748 KB Output is correct
47 Correct 305 ms 31748 KB Output is correct
48 Correct 1 ms 304 KB Output is correct
49 Correct 0 ms 308 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 232 KB Output is correct
53 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
54 Halted 0 ms 0 KB -