oj.uz

Submission #831618

# Submission time Handle Problem Language Result Execution time Memory
831618 2023-08-20T11:22:57 Z andrey27_sm Fountain Parks (IOI21_parks) C++17
15 / 100
 302 ms 61192 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]);
	}
	void un(int u,int v){
		u = p(u);
		v = p(v);
		if(u == v) return;
		pr[u] = v;
		sz++;
	}
} 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){
			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});
			D.un(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){
			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});
			D.un(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});
	}
	for (int i = 0; i < E.size(); ++i)
	{
		//cout << E[i].x << " " << E[i].y << "   --\n";
		if(E[i].type == 0){
			if(points.count({E[i].x-1,E[i].y+1})){
				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});
			}
		}
		else{
			int top = 0;
			if(points.count({E[i].x+1,E[i].y-1})) top = 1;
			if(points.count({E[i].x+1,E[i].y+1})) top = 2;
			if(top == 0 and 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){
				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:71:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |  for (int i = 0; i < E.size(); ++i)
      |                  ~~^~~~~~~~~~
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)
      |                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 5004 KB Output is correct
7 Correct 2 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 102 ms 25988 KB Output is correct
10 Correct 9 ms 7056 KB Output is correct
11 Correct 47 ms 16280 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 9052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 97 ms 25976 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 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 5004 KB Output is correct
7 Correct 2 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 102 ms 25988 KB Output is correct
10 Correct 9 ms 7056 KB Output is correct
11 Correct 47 ms 16280 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 9052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 97 ms 25976 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5004 KB Output is correct
21 Correct 2 ms 5004 KB Output is correct
22 Correct 3 ms 5004 KB Output is correct
23 Correct 295 ms 61156 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5268 KB Output is correct
26 Correct 3 ms 5400 KB Output is correct
27 Correct 4 ms 5404 KB Output is correct
28 Correct 110 ms 26948 KB Output is correct
29 Correct 161 ms 38312 KB Output is correct
30 Correct 227 ms 49080 KB Output is correct
31 Correct 294 ms 61192 KB Output is correct
32 Correct 3 ms 4912 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 5000 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 5000 KB Output is correct
38 Correct 3 ms 4996 KB Output is correct
39 Correct 3 ms 5000 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 2 ms 5004 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5204 KB Output is correct
45 Correct 102 ms 24896 KB Output is correct
46 Correct 158 ms 34448 KB Output is correct
47 Correct 154 ms 34412 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 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 5004 KB Output is correct
7 Correct 2 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 102 ms 25988 KB Output is correct
10 Correct 9 ms 7056 KB Output is correct
11 Correct 47 ms 16280 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 9052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 97 ms 25976 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5004 KB Output is correct
21 Correct 2 ms 5004 KB Output is correct
22 Correct 3 ms 5004 KB Output is correct
23 Correct 295 ms 61156 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5268 KB Output is correct
26 Correct 3 ms 5400 KB Output is correct
27 Correct 4 ms 5404 KB Output is correct
28 Correct 110 ms 26948 KB Output is correct
29 Correct 161 ms 38312 KB Output is correct
30 Correct 227 ms 49080 KB Output is correct
31 Correct 294 ms 61192 KB Output is correct
32 Correct 3 ms 4912 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 5000 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 5000 KB Output is correct
38 Correct 3 ms 4996 KB Output is correct
39 Correct 3 ms 5000 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 2 ms 5004 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5204 KB Output is correct
45 Correct 102 ms 24896 KB Output is correct
46 Correct 158 ms 34448 KB Output is correct
47 Correct 154 ms 34412 KB Output is correct
48 Correct 2 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 2 ms 5008 KB Output is correct
54 Correct 2 ms 4948 KB Output is correct
55 Incorrect 302 ms 60896 KB Tree @(5, 3) appears more than once: for edges on positions 133331 and 199997
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 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 5004 KB Output is correct
7 Correct 2 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 102 ms 25988 KB Output is correct
10 Correct 9 ms 7056 KB Output is correct
11 Correct 47 ms 16280 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 9052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 97 ms 25976 KB Output is correct
17 Correct 2 ms 5000 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 230 ms 41864 KB Output is correct
21 Correct 219 ms 41744 KB Output is correct
22 Correct 229 ms 41776 KB Output is correct
23 Correct 182 ms 35596 KB Output is correct
24 Correct 70 ms 13996 KB Output is correct
25 Correct 77 ms 21564 KB Output is correct
26 Correct 77 ms 21560 KB Output is correct
27 Correct 232 ms 46460 KB Output is correct
28 Correct 216 ms 46372 KB Output is correct
29 Correct 206 ms 37048 KB Output is correct
30 Correct 215 ms 37092 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 16 ms 7656 KB Output is correct
33 Correct 32 ms 9668 KB Output is correct
34 Correct 219 ms 41732 KB Output is correct
35 Correct 6 ms 5940 KB Output is correct
36 Correct 22 ms 9208 KB Output is correct
37 Correct 41 ms 13364 KB Output is correct
38 Incorrect 87 ms 19792 KB Tree @(110191, 196749) appears more than once: for edges on positions 20620 and 20736
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 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 5004 KB Output is correct
7 Correct 2 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 102 ms 25988 KB Output is correct
10 Correct 9 ms 7056 KB Output is correct
11 Correct 47 ms 16280 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 9052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 97 ms 25976 KB Output is correct
17 Correct 218 ms 42396 KB Output is correct
18 Correct 220 ms 44024 KB Output is correct
19 Correct 221 ms 43612 KB Output is correct
20 Correct 240 ms 50728 KB Output is correct
21 Correct 189 ms 40864 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Incorrect 36 ms 11744 KB Tree @(185213, 20875) appears more than once: for edges on positions 1617 and 1631
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 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 5004 KB Output is correct
7 Correct 2 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 102 ms 25988 KB Output is correct
10 Correct 9 ms 7056 KB Output is correct
11 Correct 47 ms 16280 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 9052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 97 ms 25976 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5004 KB Output is correct
21 Correct 2 ms 5004 KB Output is correct
22 Correct 3 ms 5004 KB Output is correct
23 Correct 295 ms 61156 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5268 KB Output is correct
26 Correct 3 ms 5400 KB Output is correct
27 Correct 4 ms 5404 KB Output is correct
28 Correct 110 ms 26948 KB Output is correct
29 Correct 161 ms 38312 KB Output is correct
30 Correct 227 ms 49080 KB Output is correct
31 Correct 294 ms 61192 KB Output is correct
32 Correct 3 ms 4912 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 5000 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 5000 KB Output is correct
38 Correct 3 ms 4996 KB Output is correct
39 Correct 3 ms 5000 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 2 ms 5004 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5204 KB Output is correct
45 Correct 102 ms 24896 KB Output is correct
46 Correct 158 ms 34448 KB Output is correct
47 Correct 154 ms 34412 KB Output is correct
48 Correct 2 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 2 ms 5008 KB Output is correct
54 Correct 2 ms 4948 KB Output is correct
55 Incorrect 302 ms 60896 KB Tree @(5, 3) appears more than once: for edges on positions 133331 and 199997
56 Halted 0 ms 0 KB -