oj.uz

Submission #831693

# Submission time Handle Problem Language Result Execution time Memory
831693 2023-08-20T12:23:29 Z andrey27_sm Fountain Parks (IOI21_parks) C++17
15 / 100
 326 ms 61216 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){
    			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 << "   --\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})) 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:24: 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)
      |                      ~~^~~~~~~~~~
parks.cpp:78:24: 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 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 5000 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 99 ms 26204 KB Output is correct
10 Correct 10 ms 7080 KB Output is correct
11 Correct 46 ms 16400 KB Output is correct
12 Correct 13 ms 8092 KB Output is correct
13 Correct 12 ms 9164 KB Output is correct
14 Correct 2 ms 5012 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 98 ms 26260 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 5000 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 99 ms 26204 KB Output is correct
10 Correct 10 ms 7080 KB Output is correct
11 Correct 46 ms 16400 KB Output is correct
12 Correct 13 ms 8092 KB Output is correct
13 Correct 12 ms 9164 KB Output is correct
14 Correct 2 ms 5012 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 98 ms 26260 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 5000 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 5000 KB Output is correct
23 Correct 326 ms 61216 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5272 KB Output is correct
26 Correct 3 ms 5344 KB Output is correct
27 Correct 4 ms 5460 KB Output is correct
28 Correct 115 ms 26936 KB Output is correct
29 Correct 174 ms 38340 KB Output is correct
30 Correct 239 ms 49092 KB Output is correct
31 Correct 307 ms 61116 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 5004 KB Output is correct
38 Correct 2 ms 5008 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 5000 KB Output is correct
41 Correct 2 ms 5004 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 3 ms 5148 KB Output is correct
44 Correct 4 ms 5208 KB Output is correct
45 Correct 104 ms 24788 KB Output is correct
46 Correct 160 ms 34384 KB Output is correct
47 Correct 161 ms 34408 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 5000 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 99 ms 26204 KB Output is correct
10 Correct 10 ms 7080 KB Output is correct
11 Correct 46 ms 16400 KB Output is correct
12 Correct 13 ms 8092 KB Output is correct
13 Correct 12 ms 9164 KB Output is correct
14 Correct 2 ms 5012 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 98 ms 26260 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 5000 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 5000 KB Output is correct
23 Correct 326 ms 61216 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5272 KB Output is correct
26 Correct 3 ms 5344 KB Output is correct
27 Correct 4 ms 5460 KB Output is correct
28 Correct 115 ms 26936 KB Output is correct
29 Correct 174 ms 38340 KB Output is correct
30 Correct 239 ms 49092 KB Output is correct
31 Correct 307 ms 61116 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 5004 KB Output is correct
38 Correct 2 ms 5008 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 5000 KB Output is correct
41 Correct 2 ms 5004 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 3 ms 5148 KB Output is correct
44 Correct 4 ms 5208 KB Output is correct
45 Correct 104 ms 24788 KB Output is correct
46 Correct 160 ms 34384 KB Output is correct
47 Correct 161 ms 34408 KB Output is correct
48 Correct 3 ms 5004 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 3 ms 5000 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 3 ms 4996 KB Output is correct
54 Correct 3 ms 5008 KB Output is correct
55 Incorrect 311 ms 60892 KB Tree @(5, 5) appears more than once: for edges on positions 133332 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 5000 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 99 ms 26204 KB Output is correct
10 Correct 10 ms 7080 KB Output is correct
11 Correct 46 ms 16400 KB Output is correct
12 Correct 13 ms 8092 KB Output is correct
13 Correct 12 ms 9164 KB Output is correct
14 Correct 2 ms 5012 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 98 ms 26260 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 259 ms 42532 KB Output is correct
21 Correct 266 ms 42396 KB Output is correct
22 Correct 230 ms 42032 KB Output is correct
23 Correct 197 ms 35748 KB Output is correct
24 Correct 71 ms 14288 KB Output is correct
25 Correct 83 ms 22020 KB Output is correct
26 Correct 89 ms 21892 KB Output is correct
27 Correct 229 ms 46448 KB Output is correct
28 Correct 217 ms 46376 KB Output is correct
29 Correct 209 ms 37148 KB Output is correct
30 Correct 206 ms 36904 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 17 ms 7704 KB Output is correct
33 Correct 34 ms 9708 KB Output is correct
34 Correct 225 ms 41476 KB Output is correct
35 Correct 6 ms 5940 KB Output is correct
36 Correct 27 ms 9324 KB Output is correct
37 Correct 43 ms 13192 KB Output is correct
38 Incorrect 90 ms 19848 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

# 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 5000 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 99 ms 26204 KB Output is correct
10 Correct 10 ms 7080 KB Output is correct
11 Correct 46 ms 16400 KB Output is correct
12 Correct 13 ms 8092 KB Output is correct
13 Correct 12 ms 9164 KB Output is correct
14 Correct 2 ms 5012 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 98 ms 26260 KB Output is correct
17 Correct 217 ms 42020 KB Output is correct
18 Correct 246 ms 44076 KB Output is correct
19 Correct 213 ms 43556 KB Output is correct
20 Correct 241 ms 50652 KB Output is correct
21 Correct 198 ms 41064 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Incorrect 37 ms 11732 KB Tree @(185213, 20877) appears more than once: for edges on positions 1618 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 5000 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5000 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 99 ms 26204 KB Output is correct
10 Correct 10 ms 7080 KB Output is correct
11 Correct 46 ms 16400 KB Output is correct
12 Correct 13 ms 8092 KB Output is correct
13 Correct 12 ms 9164 KB Output is correct
14 Correct 2 ms 5012 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 98 ms 26260 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 5000 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 5000 KB Output is correct
23 Correct 326 ms 61216 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5272 KB Output is correct
26 Correct 3 ms 5344 KB Output is correct
27 Correct 4 ms 5460 KB Output is correct
28 Correct 115 ms 26936 KB Output is correct
29 Correct 174 ms 38340 KB Output is correct
30 Correct 239 ms 49092 KB Output is correct
31 Correct 307 ms 61116 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 5004 KB Output is correct
38 Correct 2 ms 5008 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 5000 KB Output is correct
41 Correct 2 ms 5004 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 3 ms 5148 KB Output is correct
44 Correct 4 ms 5208 KB Output is correct
45 Correct 104 ms 24788 KB Output is correct
46 Correct 160 ms 34384 KB Output is correct
47 Correct 161 ms 34408 KB Output is correct
48 Correct 3 ms 5004 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 3 ms 5000 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 3 ms 4996 KB Output is correct
54 Correct 3 ms 5008 KB Output is correct
55 Incorrect 311 ms 60892 KB Tree @(5, 5) appears more than once: for edges on positions 133332 and 199997
56 Halted 0 ms 0 KB -