oj.uz

Submission #831640

# Submission time Handle Problem Language Result Execution time Memory
831640 2023-08-20T11:45:44 Z andrey27_sm Fountain Parks (IOI21_parks) C++17
30 / 100
 276 ms 48932 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 ;
		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){
			if(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){
			if(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 << "   --\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})) top = 1;
			else 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-2}) and lines.count({E[i].x+2,E[i].y})) or lines.count({E[i].x,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:73:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |  for (int i = 0; i < E.size(); ++i)
      |                  ~~^~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from parks.cpp:2:
parks.cpp:77:18: warning: comparison of integer expressions of different signedness: 'std::vector<edge>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   77 |  assert(E.size() <= n-1);
      |         ~~~~~~~~~^~~~~~
parks.cpp:78:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |  for (int i = 0; i < E.size(); ++i)
      |                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 101 ms 25568 KB Output is correct
10 Correct 10 ms 7096 KB Output is correct
11 Correct 52 ms 15948 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 108 ms 25452 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 101 ms 25568 KB Output is correct
10 Correct 10 ms 7096 KB Output is correct
11 Correct 52 ms 15948 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 108 ms 25452 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 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 222 ms 47236 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5204 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 85 ms 21968 KB Output is correct
29 Correct 127 ms 30284 KB Output is correct
30 Correct 194 ms 39076 KB Output is correct
31 Correct 222 ms 47276 KB Output is correct
32 Correct 2 ms 4956 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 3 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 3 ms 5204 KB Output is correct
45 Correct 110 ms 23940 KB Output is correct
46 Correct 159 ms 33280 KB Output is correct
47 Correct 163 ms 33244 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 101 ms 25568 KB Output is correct
10 Correct 10 ms 7096 KB Output is correct
11 Correct 52 ms 15948 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 108 ms 25452 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 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 222 ms 47236 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5204 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 85 ms 21968 KB Output is correct
29 Correct 127 ms 30284 KB Output is correct
30 Correct 194 ms 39076 KB Output is correct
31 Correct 222 ms 47276 KB Output is correct
32 Correct 2 ms 4956 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 3 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 3 ms 5204 KB Output is correct
45 Correct 110 ms 23940 KB Output is correct
46 Correct 159 ms 33280 KB Output is correct
47 Correct 163 ms 33244 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Correct 2 ms 4948 KB Output is correct
54 Correct 3 ms 4944 KB Output is correct
55 Correct 241 ms 46812 KB Output is correct
56 Correct 2 ms 4948 KB Output is correct
57 Correct 5 ms 5332 KB Output is correct
58 Correct 8 ms 6272 KB Output is correct
59 Correct 6 ms 5812 KB Output is correct
60 Correct 104 ms 25928 KB Output is correct
61 Correct 166 ms 34340 KB Output is correct
62 Correct 201 ms 39668 KB Output is correct
63 Correct 229 ms 46832 KB Output is correct
64 Correct 3 ms 4948 KB Output is correct
65 Correct 3 ms 4948 KB Output is correct
66 Correct 3 ms 4948 KB Output is correct
67 Correct 212 ms 45960 KB Output is correct
68 Correct 232 ms 47180 KB Output is correct
69 Correct 217 ms 46412 KB Output is correct
70 Correct 3 ms 5332 KB Output is correct
71 Correct 7 ms 5588 KB Output is correct
72 Correct 105 ms 23828 KB Output is correct
73 Correct 168 ms 34852 KB Output is correct
74 Correct 222 ms 44236 KB Output is correct
75 Correct 221 ms 46728 KB Output is correct
76 Correct 222 ms 48932 KB Output is correct
77 Correct 5 ms 5588 KB Output is correct
78 Correct 8 ms 5880 KB Output is correct
79 Correct 108 ms 24828 KB Output is correct
80 Correct 166 ms 35408 KB Output is correct
81 Correct 216 ms 44992 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 101 ms 25568 KB Output is correct
10 Correct 10 ms 7096 KB Output is correct
11 Correct 52 ms 15948 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 108 ms 25452 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 5004 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 221 ms 41220 KB Output is correct
21 Correct 276 ms 41284 KB Output is correct
22 Correct 232 ms 41260 KB Output is correct
23 Correct 177 ms 35100 KB Output is correct
24 Correct 71 ms 13708 KB Output is correct
25 Correct 88 ms 21300 KB Output is correct
26 Correct 88 ms 21300 KB Output is correct
27 Correct 217 ms 45932 KB Output is correct
28 Correct 218 ms 45888 KB Output is correct
29 Correct 212 ms 36624 KB Output is correct
30 Correct 236 ms 36576 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Incorrect 16 ms 7548 KB Tree @(185805, 20903) appears more than once: for edges on positions 2885 and 2930
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 101 ms 25568 KB Output is correct
10 Correct 10 ms 7096 KB Output is correct
11 Correct 52 ms 15948 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 108 ms 25452 KB Output is correct
17 Correct 245 ms 41872 KB Output is correct
18 Correct 227 ms 41844 KB Output is correct
19 Incorrect 226 ms 41296 KB Tree @(100001, 50003) appears more than once: for edges on positions 199993 and 199994
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 101 ms 25568 KB Output is correct
10 Correct 10 ms 7096 KB Output is correct
11 Correct 52 ms 15948 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 12 ms 8800 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 108 ms 25452 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 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 222 ms 47236 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5204 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 85 ms 21968 KB Output is correct
29 Correct 127 ms 30284 KB Output is correct
30 Correct 194 ms 39076 KB Output is correct
31 Correct 222 ms 47276 KB Output is correct
32 Correct 2 ms 4956 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 3 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 3 ms 5204 KB Output is correct
45 Correct 110 ms 23940 KB Output is correct
46 Correct 159 ms 33280 KB Output is correct
47 Correct 163 ms 33244 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Correct 2 ms 4948 KB Output is correct
54 Correct 3 ms 4944 KB Output is correct
55 Correct 241 ms 46812 KB Output is correct
56 Correct 2 ms 4948 KB Output is correct
57 Correct 5 ms 5332 KB Output is correct
58 Correct 8 ms 6272 KB Output is correct
59 Correct 6 ms 5812 KB Output is correct
60 Correct 104 ms 25928 KB Output is correct
61 Correct 166 ms 34340 KB Output is correct
62 Correct 201 ms 39668 KB Output is correct
63 Correct 229 ms 46832 KB Output is correct
64 Correct 3 ms 4948 KB Output is correct
65 Correct 3 ms 4948 KB Output is correct
66 Correct 3 ms 4948 KB Output is correct
67 Correct 212 ms 45960 KB Output is correct
68 Correct 232 ms 47180 KB Output is correct
69 Correct 217 ms 46412 KB Output is correct
70 Correct 3 ms 5332 KB Output is correct
71 Correct 7 ms 5588 KB Output is correct
72 Correct 105 ms 23828 KB Output is correct
73 Correct 168 ms 34852 KB Output is correct
74 Correct 222 ms 44236 KB Output is correct
75 Correct 221 ms 46728 KB Output is correct
76 Correct 222 ms 48932 KB Output is correct
77 Correct 5 ms 5588 KB Output is correct
78 Correct 8 ms 5880 KB Output is correct
79 Correct 108 ms 24828 KB Output is correct
80 Correct 166 ms 35408 KB Output is correct
81 Correct 216 ms 44992 KB Output is correct
82 Correct 2 ms 4948 KB Output is correct
83 Correct 3 ms 5004 KB Output is correct
84 Correct 2 ms 4948 KB Output is correct
85 Correct 221 ms 41220 KB Output is correct
86 Correct 276 ms 41284 KB Output is correct
87 Correct 232 ms 41260 KB Output is correct
88 Correct 177 ms 35100 KB Output is correct
89 Correct 71 ms 13708 KB Output is correct
90 Correct 88 ms 21300 KB Output is correct
91 Correct 88 ms 21300 KB Output is correct
92 Correct 217 ms 45932 KB Output is correct
93 Correct 218 ms 45888 KB Output is correct
94 Correct 212 ms 36624 KB Output is correct
95 Correct 236 ms 36576 KB Output is correct
96 Correct 3 ms 4948 KB Output is correct
97 Incorrect 16 ms 7548 KB Tree @(185805, 20903) appears more than once: for edges on positions 2885 and 2930
98 Halted 0 ms 0 KB -