답안 #831642

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831642	2023-08-20T11:46:31 Z	andrey27_sm	분수 공원 (IOI21_parks)	C++17	30 / 100	251 ms	47348 KB

parks

#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+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: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

#	결과	실행 시간	메모리	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	3 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	99 ms	25428 KB	Output is correct
10	Correct	11 ms	7056 KB	Output is correct
11	Correct	46 ms	15924 KB	Output is correct
12	Correct	14 ms	8080 KB	Output is correct
13	Correct	11 ms	8772 KB	Output is correct
14	Correct	2 ms	5076 KB	Output is correct
15	Correct	3 ms	5076 KB	Output is correct
16	Correct	100 ms	25440 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	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	3 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	99 ms	25428 KB	Output is correct
10	Correct	11 ms	7056 KB	Output is correct
11	Correct	46 ms	15924 KB	Output is correct
12	Correct	14 ms	8080 KB	Output is correct
13	Correct	11 ms	8772 KB	Output is correct
14	Correct	2 ms	5076 KB	Output is correct
15	Correct	3 ms	5076 KB	Output is correct
16	Correct	100 ms	25440 KB	Output is correct
17	Correct	3 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	3 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	219 ms	47272 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	90 ms	22036 KB	Output is correct
29	Correct	139 ms	30188 KB	Output is correct
30	Correct	173 ms	39052 KB	Output is correct
31	Correct	216 ms	47176 KB	Output is correct
32	Correct	2 ms	5000 KB	Output is correct
33	Correct	2 ms	4960 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	3 ms	4948 KB	Output is correct
38	Correct	2 ms	4952 KB	Output is correct
39	Correct	2 ms	4948 KB	Output is correct
40	Correct	3 ms	4948 KB	Output is correct
41	Correct	2 ms	4936 KB	Output is correct
42	Correct	2 ms	4948 KB	Output is correct
43	Correct	4 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	162 ms	33284 KB	Output is correct
47	Correct	165 ms	33180 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	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	3 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	99 ms	25428 KB	Output is correct
10	Correct	11 ms	7056 KB	Output is correct
11	Correct	46 ms	15924 KB	Output is correct
12	Correct	14 ms	8080 KB	Output is correct
13	Correct	11 ms	8772 KB	Output is correct
14	Correct	2 ms	5076 KB	Output is correct
15	Correct	3 ms	5076 KB	Output is correct
16	Correct	100 ms	25440 KB	Output is correct
17	Correct	3 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	3 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	219 ms	47272 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	90 ms	22036 KB	Output is correct
29	Correct	139 ms	30188 KB	Output is correct
30	Correct	173 ms	39052 KB	Output is correct
31	Correct	216 ms	47176 KB	Output is correct
32	Correct	2 ms	5000 KB	Output is correct
33	Correct	2 ms	4960 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	3 ms	4948 KB	Output is correct
38	Correct	2 ms	4952 KB	Output is correct
39	Correct	2 ms	4948 KB	Output is correct
40	Correct	3 ms	4948 KB	Output is correct
41	Correct	2 ms	4936 KB	Output is correct
42	Correct	2 ms	4948 KB	Output is correct
43	Correct	4 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	162 ms	33284 KB	Output is correct
47	Correct	165 ms	33180 KB	Output is correct
48	Correct	3 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	4948 KB	Output is correct
54	Correct	2 ms	4948 KB	Output is correct
55	Correct	222 ms	46952 KB	Output is correct
56	Correct	3 ms	4948 KB	Output is correct
57	Correct	5 ms	5332 KB	Output is correct
58	Correct	7 ms	6236 KB	Output is correct
59	Correct	5 ms	5804 KB	Output is correct
60	Correct	103 ms	25828 KB	Output is correct
61	Correct	156 ms	34640 KB	Output is correct
62	Correct	191 ms	39616 KB	Output is correct
63	Correct	231 ms	46756 KB	Output is correct
64	Correct	2 ms	4948 KB	Output is correct
65	Correct	2 ms	4948 KB	Output is correct
66	Correct	2 ms	4948 KB	Output is correct
67	Correct	213 ms	45876 KB	Output is correct
68	Correct	220 ms	47348 KB	Output is correct
69	Correct	216 ms	46412 KB	Output is correct
70	Correct	3 ms	5332 KB	Output is correct
71	Correct	5 ms	5588 KB	Output is correct
72	Correct	105 ms	23836 KB	Output is correct
73	Correct	164 ms	33584 KB	Output is correct
74	Correct	222 ms	42572 KB	Output is correct
75	Correct	219 ms	45188 KB	Output is correct
76	Correct	223 ms	47264 KB	Output is correct
77	Correct	4 ms	5460 KB	Output is correct
78	Correct	5 ms	5812 KB	Output is correct
79	Correct	102 ms	24112 KB	Output is correct
80	Correct	162 ms	34084 KB	Output is correct
81	Correct	219 ms	43320 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	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	3 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	99 ms	25428 KB	Output is correct
10	Correct	11 ms	7056 KB	Output is correct
11	Correct	46 ms	15924 KB	Output is correct
12	Correct	14 ms	8080 KB	Output is correct
13	Correct	11 ms	8772 KB	Output is correct
14	Correct	2 ms	5076 KB	Output is correct
15	Correct	3 ms	5076 KB	Output is correct
16	Correct	100 ms	25440 KB	Output is correct
17	Correct	3 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	247 ms	41364 KB	Output is correct
21	Correct	227 ms	41252 KB	Output is correct
22	Correct	251 ms	41268 KB	Output is correct
23	Correct	176 ms	35068 KB	Output is correct
24	Correct	71 ms	13712 KB	Output is correct
25	Correct	75 ms	21304 KB	Output is correct
26	Correct	75 ms	21300 KB	Output is correct
27	Correct	216 ms	45940 KB	Output is correct
28	Correct	214 ms	45824 KB	Output is correct
29	Correct	217 ms	36516 KB	Output is correct
30	Correct	209 ms	36512 KB	Output is correct
31	Correct	2 ms	4948 KB	Output is correct
32	Correct	17 ms	7476 KB	Output is correct
33	Correct	34 ms	9888 KB	Output is correct
34	Correct	239 ms	41932 KB	Output is correct
35	Correct	6 ms	5940 KB	Output is correct
36	Correct	24 ms	9608 KB	Output is correct
37	Correct	42 ms	13680 KB	Output is correct
38	Incorrect	98 ms	20108 KB	Tree @(110191, 196751) appears more than once: for edges on positions 20621 and 20736
39	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	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	3 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	99 ms	25428 KB	Output is correct
10	Correct	11 ms	7056 KB	Output is correct
11	Correct	46 ms	15924 KB	Output is correct
12	Correct	14 ms	8080 KB	Output is correct
13	Correct	11 ms	8772 KB	Output is correct
14	Correct	2 ms	5076 KB	Output is correct
15	Correct	3 ms	5076 KB	Output is correct
16	Correct	100 ms	25440 KB	Output is correct
17	Correct	226 ms	41868 KB	Output is correct
18	Correct	223 ms	41888 KB	Output is correct
19	Correct	221 ms	41216 KB	Output is correct
20	Correct	245 ms	42488 KB	Output is correct
21	Correct	200 ms	37648 KB	Output is correct
22	Correct	3 ms	5004 KB	Output is correct
23	Correct	35 ms	10988 KB	Output is correct
24	Correct	10 ms	6800 KB	Output is correct
25	Correct	31 ms	12796 KB	Output is correct
26	Correct	49 ms	15500 KB	Output is correct
27	Incorrect	120 ms	24836 KB	Tree @(21123, 185591) appears more than once: for edges on positions 52149 and 52312
28	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	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	3 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	99 ms	25428 KB	Output is correct
10	Correct	11 ms	7056 KB	Output is correct
11	Correct	46 ms	15924 KB	Output is correct
12	Correct	14 ms	8080 KB	Output is correct
13	Correct	11 ms	8772 KB	Output is correct
14	Correct	2 ms	5076 KB	Output is correct
15	Correct	3 ms	5076 KB	Output is correct
16	Correct	100 ms	25440 KB	Output is correct
17	Correct	3 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	3 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	219 ms	47272 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	90 ms	22036 KB	Output is correct
29	Correct	139 ms	30188 KB	Output is correct
30	Correct	173 ms	39052 KB	Output is correct
31	Correct	216 ms	47176 KB	Output is correct
32	Correct	2 ms	5000 KB	Output is correct
33	Correct	2 ms	4960 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	3 ms	4948 KB	Output is correct
38	Correct	2 ms	4952 KB	Output is correct
39	Correct	2 ms	4948 KB	Output is correct
40	Correct	3 ms	4948 KB	Output is correct
41	Correct	2 ms	4936 KB	Output is correct
42	Correct	2 ms	4948 KB	Output is correct
43	Correct	4 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	162 ms	33284 KB	Output is correct
47	Correct	165 ms	33180 KB	Output is correct
48	Correct	3 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	4948 KB	Output is correct
54	Correct	2 ms	4948 KB	Output is correct
55	Correct	222 ms	46952 KB	Output is correct
56	Correct	3 ms	4948 KB	Output is correct
57	Correct	5 ms	5332 KB	Output is correct
58	Correct	7 ms	6236 KB	Output is correct
59	Correct	5 ms	5804 KB	Output is correct
60	Correct	103 ms	25828 KB	Output is correct
61	Correct	156 ms	34640 KB	Output is correct
62	Correct	191 ms	39616 KB	Output is correct
63	Correct	231 ms	46756 KB	Output is correct
64	Correct	2 ms	4948 KB	Output is correct
65	Correct	2 ms	4948 KB	Output is correct
66	Correct	2 ms	4948 KB	Output is correct
67	Correct	213 ms	45876 KB	Output is correct
68	Correct	220 ms	47348 KB	Output is correct
69	Correct	216 ms	46412 KB	Output is correct
70	Correct	3 ms	5332 KB	Output is correct
71	Correct	5 ms	5588 KB	Output is correct
72	Correct	105 ms	23836 KB	Output is correct
73	Correct	164 ms	33584 KB	Output is correct
74	Correct	222 ms	42572 KB	Output is correct
75	Correct	219 ms	45188 KB	Output is correct
76	Correct	223 ms	47264 KB	Output is correct
77	Correct	4 ms	5460 KB	Output is correct
78	Correct	5 ms	5812 KB	Output is correct
79	Correct	102 ms	24112 KB	Output is correct
80	Correct	162 ms	34084 KB	Output is correct
81	Correct	219 ms	43320 KB	Output is correct
82	Correct	3 ms	4948 KB	Output is correct
83	Correct	2 ms	4948 KB	Output is correct
84	Correct	2 ms	4948 KB	Output is correct
85	Correct	247 ms	41364 KB	Output is correct
86	Correct	227 ms	41252 KB	Output is correct
87	Correct	251 ms	41268 KB	Output is correct
88	Correct	176 ms	35068 KB	Output is correct
89	Correct	71 ms	13712 KB	Output is correct
90	Correct	75 ms	21304 KB	Output is correct
91	Correct	75 ms	21300 KB	Output is correct
92	Correct	216 ms	45940 KB	Output is correct
93	Correct	214 ms	45824 KB	Output is correct
94	Correct	217 ms	36516 KB	Output is correct
95	Correct	209 ms	36512 KB	Output is correct
96	Correct	2 ms	4948 KB	Output is correct
97	Correct	17 ms	7476 KB	Output is correct
98	Correct	34 ms	9888 KB	Output is correct
99	Correct	239 ms	41932 KB	Output is correct
100	Correct	6 ms	5940 KB	Output is correct
101	Correct	24 ms	9608 KB	Output is correct
102	Correct	42 ms	13680 KB	Output is correct
103	Incorrect	98 ms	20108 KB	Tree @(110191, 196751) appears more than once: for edges on positions 20621 and 20736
104	Halted	0 ms	0 KB	-

답안 #831642

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 20.0

Subtask #5 0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 20.0

Subtask #5
0 / 20.0

Subtask #6
0 / 30.0