oj.uz

답안 #831648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831648 2023-08-20T11:53:35 Z andrey27_sm 분수 공원 (IOI21_parks) C++17
5 / 100
 242 ms 46132 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) or 1)
    				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) or 1)
    				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: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)
      |                      ~~^~~~~~~~~~
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:22: 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: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

# 결과 실행 시간 메모리 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 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 99 ms 25432 KB Output is correct
10 Correct 9 ms 7044 KB Output is correct
11 Correct 46 ms 16044 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 13 ms 8928 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 112 ms 25440 KB Output is correct

Subtask #2
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 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 99 ms 25432 KB Output is correct
10 Correct 9 ms 7044 KB Output is correct
11 Correct 46 ms 16044 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 13 ms 8928 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 112 ms 25440 KB Output is correct
17 Runtime error 6 ms 9940 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #3
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 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 99 ms 25432 KB Output is correct
10 Correct 9 ms 7044 KB Output is correct
11 Correct 46 ms 16044 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 13 ms 8928 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 112 ms 25440 KB Output is correct
17 Runtime error 6 ms 9940 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

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 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 99 ms 25432 KB Output is correct
10 Correct 9 ms 7044 KB Output is correct
11 Correct 46 ms 16044 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 13 ms 8928 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 112 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 239 ms 41208 KB Output is correct
21 Correct 242 ms 41204 KB Output is correct
22 Correct 239 ms 41200 KB Output is correct
23 Correct 189 ms 35104 KB Output is correct
24 Correct 92 ms 13740 KB Output is correct
25 Correct 76 ms 21300 KB Output is correct
26 Correct 76 ms 21320 KB Output is correct
27 Correct 223 ms 45876 KB Output is correct
28 Correct 215 ms 45832 KB Output is correct
29 Correct 211 ms 36644 KB Output is correct
30 Correct 207 ms 36512 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 16 ms 7552 KB Output is correct
33 Correct 33 ms 9412 KB Output is correct
34 Correct 227 ms 41228 KB Output is correct
35 Correct 6 ms 5812 KB Output is correct
36 Correct 23 ms 8960 KB Output is correct
37 Correct 46 ms 13036 KB Output is correct
38 Incorrect 92 ms 19632 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 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 99 ms 25432 KB Output is correct
10 Correct 9 ms 7044 KB Output is correct
11 Correct 46 ms 16044 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 13 ms 8928 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 112 ms 25440 KB Output is correct
17 Runtime error 119 ms 46132 KB Execution killed with signal 6
18 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 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 99 ms 25432 KB Output is correct
10 Correct 9 ms 7044 KB Output is correct
11 Correct 46 ms 16044 KB Output is correct
12 Correct 13 ms 8080 KB Output is correct
13 Correct 13 ms 8928 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 112 ms 25440 KB Output is correct
17 Runtime error 6 ms 9940 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -