oj.uz

Submission #831705

# Submission time Handle Problem Language Result Execution time Memory
831705 2023-08-20T12:32:21 Z andrey27_sm Fountain Parks (IOI21_parks) C++17
15 / 100
 352 ms 59564 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> cons[200001];
int mask_l[200001];
vector<int> u;
vector<int> v;
vector<int> a;
vector<int> b;
struct dsu{
	int sz = 0;
	vector<int> pr;
	int p(int v){
		if(pr[v] == v) return v;
		return pr[v] = p(pr[v]);
	}
	bool un(int u,int v){
		u = p(u);
		v = p(v);
		if(u == v){
			return 0;
			exit(1);
		}
		pr[u] = v;
		sz++;
		return 1;
	}
} D;
struct edge{
	int x;
	int y;
	int type; // 0 - vert, 1 - hor;
	int a;
	int b;
};
int construct_roads(vector<int> x, vector<int> y) {
	int n = x.size();
	D.pr.resize(n);
	for (int i = 0; i < n; ++i)
	{
		D.pr[i] = i;
	}
	vector<edge> E;
	vector<pair<int,pair<int,int>>> x_d;
	vector<pair<int,pair<int,int>>> y_d;
	for (int i = 0; i < n; ++i)
	{
		x_d.push_back({x[i],{y[i],i}});
		y_d.push_back({y[i],{x[i],i}});
	} 
	sort(x_d.begin(), x_d.end());
	sort(y_d.begin(), y_d.end());
	for (int i = 1; i < n; ++i)
	{
		if(x_d[i].first == x_d[i-1].first and x_d[i].second.first-2 == x_d[i-1].second.first){
			D.un(x_d[i-1].second.second,x_d[i].second.second);
			E.push_back({x_d[i-1].first,x_d[i-1].second.first,0,x_d[i-1].second.second,x_d[i].second.second});
		}
	}
	for (int i = 1; i < n; ++i)
	{
		if(y_d[i].first == y_d[i-1].first and y_d[i].second.first-2 == y_d[i-1].second.first){
			D.un(y_d[i-1].second.second,y_d[i].second.second);
			E.push_back({y_d[i-1].second.first,y_d[i-1].first,1,y_d[i-1].second.second,y_d[i].second.second});
		}
	}
	if(D.sz != n-1) return 0;
	set<pair<int,int>> lines;
	set<pair<int,int>> points;
	sort(E.begin(),E.end(),[](auto a,auto b){
		if(a.x != b.x) return a.x < b.x;
		if(a.type != b.type) return a.type < b.type;
		return a.y < b.y;
	});
	for (int i = 0; i < E.size(); ++i)
	{
		if(E[i].type == 0) lines.insert({E[i].x,E[i].y});
	}
	//assert(E.size() == n-1);
	for (int i = 0; i < E.size(); ++i)
	{
		//cout << E[i].x << " " << E[i].y << " " << E[i].type << " " << E[i].a << " " << E[i].b << "   --\n";
		if(E[i].type == 0){
			if(points.count({E[i].x-1,E[i].y+1}) == 0){
				u.push_back(E[i].a);
				v.push_back(E[i].b);
				a.push_back(E[i].x-1);
				b.push_back(E[i].y+1);
				points.insert({E[i].x-1,E[i].y+1});
			}
			else if(points.count({E[i].x+1,E[i].y+1}) == 0){				
				u.push_back(E[i].a);
				v.push_back(E[i].b);
				a.push_back(E[i].x+1);
				b.push_back(E[i].y+1);
				points.insert({E[i].x+1,E[i].y+1});
			}
			else return 0;
		}
		else{
			int top = 0;
			if(points.count({E[i].x+1,E[i].y-1}) and points.count({E[i].x+1,E[i].y+1})) return 0;
			if(top == 0 and ((lines.count({E[i].x+2,E[i].y-2}) and lines.count({E[i].x+2,E[i].y})) or lines.count({E[i].x+2,E[i].y}))) top = 2;
			if(top == 0 and lines.count({E[i].x+2,E[i].y-2})) top = 1;
			if(top%2 == 0 and points.count({E[i].x+1,E[i].y-1}) == 0){
				u.push_back(E[i].a);
				v.push_back(E[i].b);
				a.push_back(E[i].x+1);
				b.push_back(E[i].y-1);
				points.insert({E[i].x+1,E[i].y-1});
			}
			else if(points.count({E[i].x+1,E[i].y+1}) == 0){
				u.push_back(E[i].a);
				v.push_back(E[i].b);
				a.push_back(E[i].x+1);
				b.push_back(E[i].y+1);
				points.insert({E[i].x+1,E[i].y+1});
			}
			else{
				u.push_back(E[i].a);
				v.push_back(E[i].b);
				a.push_back(E[i].x+1);
				b.push_back(E[i].y-1);
				points.insert({E[i].x+1,E[i].y-1});
			}
		}
	}
	//if(points.size() != n-1) return 0;
	build(u,v,a,b);
	return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:75:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |  for (int i = 0; i < E.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:80:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for (int i = 0; i < E.size(); ++i)
      |                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 103 ms 25436 KB Output is correct
10 Correct 11 ms 7056 KB Output is correct
11 Correct 46 ms 16024 KB Output is correct
12 Correct 13 ms 7952 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 25492 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 103 ms 25436 KB Output is correct
10 Correct 11 ms 7056 KB Output is correct
11 Correct 46 ms 16024 KB Output is correct
12 Correct 13 ms 7952 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 25492 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 352 ms 59484 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 3 ms 5332 KB Output is correct
27 Correct 4 ms 5460 KB Output is correct
28 Correct 120 ms 26348 KB Output is correct
29 Correct 186 ms 37376 KB Output is correct
30 Correct 248 ms 47744 KB Output is correct
31 Correct 323 ms 59564 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 4 ms 5248 KB Output is correct
45 Correct 110 ms 23944 KB Output is correct
46 Correct 188 ms 33296 KB Output is correct
47 Correct 179 ms 33276 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 103 ms 25436 KB Output is correct
10 Correct 11 ms 7056 KB Output is correct
11 Correct 46 ms 16024 KB Output is correct
12 Correct 13 ms 7952 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 25492 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 352 ms 59484 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 3 ms 5332 KB Output is correct
27 Correct 4 ms 5460 KB Output is correct
28 Correct 120 ms 26348 KB Output is correct
29 Correct 186 ms 37376 KB Output is correct
30 Correct 248 ms 47744 KB Output is correct
31 Correct 323 ms 59564 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 4 ms 5248 KB Output is correct
45 Correct 110 ms 23944 KB Output is correct
46 Correct 188 ms 33296 KB Output is correct
47 Correct 179 ms 33276 KB Output is correct
48 Correct 2 ms 4932 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 3 ms 4948 KB Output is correct
54 Correct 3 ms 4948 KB Output is correct
55 Incorrect 220 ms 43176 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 2 ms 4948 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 103 ms 25436 KB Output is correct
10 Correct 11 ms 7056 KB Output is correct
11 Correct 46 ms 16024 KB Output is correct
12 Correct 13 ms 7952 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 25492 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4992 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 273 ms 41484 KB Output is correct
21 Correct 242 ms 41220 KB Output is correct
22 Correct 254 ms 41224 KB Output is correct
23 Correct 203 ms 35092 KB Output is correct
24 Correct 88 ms 13712 KB Output is correct
25 Correct 79 ms 21256 KB Output is correct
26 Correct 77 ms 21252 KB Output is correct
27 Correct 220 ms 46012 KB Output is correct
28 Correct 221 ms 45844 KB Output is correct
29 Correct 218 ms 36528 KB Output is correct
30 Correct 225 ms 36532 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 17 ms 7568 KB Output is correct
33 Correct 34 ms 9412 KB Output is correct
34 Correct 235 ms 41236 KB Output is correct
35 Correct 6 ms 5812 KB Output is correct
36 Correct 21 ms 9084 KB Output is correct
37 Correct 43 ms 13148 KB Output is correct
38 Incorrect 52 ms 13252 KB Solution announced impossible, but it is possible.
39 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 103 ms 25436 KB Output is correct
10 Correct 11 ms 7056 KB Output is correct
11 Correct 46 ms 16024 KB Output is correct
12 Correct 13 ms 7952 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 25492 KB Output is correct
17 Correct 225 ms 41908 KB Output is correct
18 Correct 228 ms 41896 KB Output is correct
19 Correct 244 ms 41272 KB Output is correct
20 Correct 269 ms 49208 KB Output is correct
21 Correct 204 ms 39440 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Incorrect 19 ms 7892 KB Solution announced impossible, but it is possible.
24 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 103 ms 25436 KB Output is correct
10 Correct 11 ms 7056 KB Output is correct
11 Correct 46 ms 16024 KB Output is correct
12 Correct 13 ms 7952 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 25492 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 352 ms 59484 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 3 ms 5332 KB Output is correct
27 Correct 4 ms 5460 KB Output is correct
28 Correct 120 ms 26348 KB Output is correct
29 Correct 186 ms 37376 KB Output is correct
30 Correct 248 ms 47744 KB Output is correct
31 Correct 323 ms 59564 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 4 ms 5248 KB Output is correct
45 Correct 110 ms 23944 KB Output is correct
46 Correct 188 ms 33296 KB Output is correct
47 Correct 179 ms 33276 KB Output is correct
48 Correct 2 ms 4932 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 3 ms 4948 KB Output is correct
54 Correct 3 ms 4948 KB Output is correct
55 Incorrect 220 ms 43176 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -