oj.uz

답안 #831636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831636 2023-08-20T11:36:59 Z andrey27_sm 분수 공원 (IOI21_parks) C++17
15 / 100
 255 ms 48884 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})) top = 2;
			if(top == 0 and lines.count({E[i].x+2,E[i].y})) 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 3 ms 4948 KB Output is correct
3 Correct 2 ms 4924 KB Output is correct
4 Correct 2 ms 5008 KB Output is correct
5 Correct 2 ms 4996 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 100 ms 25968 KB Output is correct
10 Correct 10 ms 7056 KB Output is correct
11 Correct 46 ms 16312 KB Output is correct
12 Correct 14 ms 8144 KB Output is correct
13 Correct 13 ms 9224 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 26016 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4924 KB Output is correct
4 Correct 2 ms 5008 KB Output is correct
5 Correct 2 ms 4996 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 100 ms 25968 KB Output is correct
10 Correct 10 ms 7056 KB Output is correct
11 Correct 46 ms 16312 KB Output is correct
12 Correct 14 ms 8144 KB Output is correct
13 Correct 13 ms 9224 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 26016 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 5004 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 5004 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 223 ms 47476 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 4 ms 5304 KB Output is correct
27 Correct 4 ms 5312 KB Output is correct
28 Correct 83 ms 22300 KB Output is correct
29 Correct 128 ms 30420 KB Output is correct
30 Correct 176 ms 39256 KB Output is correct
31 Correct 220 ms 47544 KB Output is correct
32 Correct 2 ms 5004 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 5008 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 5000 KB Output is correct
37 Correct 4 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 5076 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 5272 KB Output is correct
45 Correct 107 ms 24288 KB Output is correct
46 Correct 159 ms 33432 KB Output is correct
47 Correct 169 ms 33448 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4924 KB Output is correct
4 Correct 2 ms 5008 KB Output is correct
5 Correct 2 ms 4996 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 100 ms 25968 KB Output is correct
10 Correct 10 ms 7056 KB Output is correct
11 Correct 46 ms 16312 KB Output is correct
12 Correct 14 ms 8144 KB Output is correct
13 Correct 13 ms 9224 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 26016 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 5004 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 5004 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 223 ms 47476 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 4 ms 5304 KB Output is correct
27 Correct 4 ms 5312 KB Output is correct
28 Correct 83 ms 22300 KB Output is correct
29 Correct 128 ms 30420 KB Output is correct
30 Correct 176 ms 39256 KB Output is correct
31 Correct 220 ms 47544 KB Output is correct
32 Correct 2 ms 5004 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 5008 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 5000 KB Output is correct
37 Correct 4 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 5076 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 5272 KB Output is correct
45 Correct 107 ms 24288 KB Output is correct
46 Correct 159 ms 33432 KB Output is correct
47 Correct 169 ms 33448 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 3 ms 4948 KB Output is correct
52 Correct 2 ms 5004 KB Output is correct
53 Correct 2 ms 4948 KB Output is correct
54 Correct 2 ms 4948 KB Output is correct
55 Correct 220 ms 47044 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 6356 KB Output is correct
59 Correct 6 ms 5940 KB Output is correct
60 Correct 113 ms 26732 KB Output is correct
61 Correct 149 ms 35364 KB Output is correct
62 Correct 181 ms 41076 KB Output is correct
63 Correct 225 ms 48484 KB Output is correct
64 Correct 2 ms 5004 KB Output is correct
65 Correct 2 ms 5000 KB Output is correct
66 Correct 3 ms 4948 KB Output is correct
67 Correct 255 ms 47528 KB Output is correct
68 Correct 217 ms 48884 KB Output is correct
69 Correct 217 ms 48072 KB Output is correct
70 Correct 4 ms 5268 KB Output is correct
71 Correct 5 ms 5716 KB Output is correct
72 Incorrect 110 ms 24652 KB Tree @(5, 7) appears more than once: for edges on positions 41861 and 57951
73 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4924 KB Output is correct
4 Correct 2 ms 5008 KB Output is correct
5 Correct 2 ms 4996 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 100 ms 25968 KB Output is correct
10 Correct 10 ms 7056 KB Output is correct
11 Correct 46 ms 16312 KB Output is correct
12 Correct 14 ms 8144 KB Output is correct
13 Correct 13 ms 9224 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 26016 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 222 ms 42072 KB Output is correct
21 Correct 215 ms 41948 KB Output is correct
22 Correct 224 ms 42036 KB Output is correct
23 Correct 202 ms 35804 KB Output is correct
24 Correct 75 ms 14256 KB Output is correct
25 Correct 77 ms 21776 KB Output is correct
26 Correct 78 ms 21768 KB Output is correct
27 Correct 220 ms 46584 KB Output is correct
28 Correct 217 ms 46572 KB Output is correct
29 Correct 236 ms 37232 KB Output is correct
30 Correct 224 ms 37160 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Incorrect 17 ms 7632 KB Tree @(185697, 20413) appears more than once: for edges on positions 109 and 116
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4924 KB Output is correct
4 Correct 2 ms 5008 KB Output is correct
5 Correct 2 ms 4996 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 100 ms 25968 KB Output is correct
10 Correct 10 ms 7056 KB Output is correct
11 Correct 46 ms 16312 KB Output is correct
12 Correct 14 ms 8144 KB Output is correct
13 Correct 13 ms 9224 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 26016 KB Output is correct
17 Correct 244 ms 42624 KB Output is correct
18 Correct 225 ms 42140 KB Output is correct
19 Incorrect 224 ms 41464 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4924 KB Output is correct
4 Correct 2 ms 5008 KB Output is correct
5 Correct 2 ms 4996 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5004 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 100 ms 25968 KB Output is correct
10 Correct 10 ms 7056 KB Output is correct
11 Correct 46 ms 16312 KB Output is correct
12 Correct 14 ms 8144 KB Output is correct
13 Correct 13 ms 9224 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 105 ms 26016 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 5004 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 5004 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 223 ms 47476 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 4 ms 5304 KB Output is correct
27 Correct 4 ms 5312 KB Output is correct
28 Correct 83 ms 22300 KB Output is correct
29 Correct 128 ms 30420 KB Output is correct
30 Correct 176 ms 39256 KB Output is correct
31 Correct 220 ms 47544 KB Output is correct
32 Correct 2 ms 5004 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 5008 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 5000 KB Output is correct
37 Correct 4 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 5076 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 5272 KB Output is correct
45 Correct 107 ms 24288 KB Output is correct
46 Correct 159 ms 33432 KB Output is correct
47 Correct 169 ms 33448 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 3 ms 4948 KB Output is correct
52 Correct 2 ms 5004 KB Output is correct
53 Correct 2 ms 4948 KB Output is correct
54 Correct 2 ms 4948 KB Output is correct
55 Correct 220 ms 47044 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 6356 KB Output is correct
59 Correct 6 ms 5940 KB Output is correct
60 Correct 113 ms 26732 KB Output is correct
61 Correct 149 ms 35364 KB Output is correct
62 Correct 181 ms 41076 KB Output is correct
63 Correct 225 ms 48484 KB Output is correct
64 Correct 2 ms 5004 KB Output is correct
65 Correct 2 ms 5000 KB Output is correct
66 Correct 3 ms 4948 KB Output is correct
67 Correct 255 ms 47528 KB Output is correct
68 Correct 217 ms 48884 KB Output is correct
69 Correct 217 ms 48072 KB Output is correct
70 Correct 4 ms 5268 KB Output is correct
71 Correct 5 ms 5716 KB Output is correct
72 Incorrect 110 ms 24652 KB Tree @(5, 7) appears more than once: for edges on positions 41861 and 57951
73 Halted 0 ms 0 KB -