oj.uz

Submission #436618

# Submission time Handle Problem Language Result Execution time Memory
436618 2021-06-24T16:57:40 Z Apiram Fountain Parks (IOI21_parks) C++17
5 / 100
 3500 ms 32988 KB 
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>parent(1e6);
vector<int>siz(1e6);
void makesets(int v){
	parent[v]=v;
	siz[v]=1;
}
int findsets (int v){
	if (v==parent[v])return v;
	parent[v]=findsets(parent[v]);
	return parent[v];
}
void unionset(int a,int b){
	a = findsets(a);
	b =findsets(b);
	if (a==b)return;
	if (siz[a]<siz[b])swap(a,b);
	siz[a]+=siz[b];
	parent[b]=a;
}
void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);
struct point {
	int x,y,index;
};
bool dist(point x,point y){
	if (pow(x.x - y.x,2)+pow(x.y-y.y,2)!=4)return false;
	return true;
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
    vector<point>arr;
    int n = x.size();
    bool ok=true;
    
    for (int i = 0 ;i<n;++i){
    	if (x[i]!=x[0])ok=false;
    	arr.push_back({x[i],y[i],i});
    }
    vector<int>ansx,ansy,ansxi,ansyi;
    if (ok){
    sort(arr.begin(),arr.end(),[&](point a,point b){
    	return a.y<b.y;
    });
    
    for (int i = 1;i<n;++i){
    	if (dist(arr[i],arr[i-1])){
    		ansx.push_back(min(arr[i].x,arr[i-1].x) + 1);
    		ansy.push_back(min(arr[i].y,arr[i-1].y)+1);
    		ansxi.push_back(arr[i].index);
    		ansyi.push_back(arr[i-1].index);
    	}
    	else return 0;
    }
    build(ansxi,ansyi,ansx,ansy);
    return 1;}
    else{
    	for (int i =0;i<n;++i){
    		makesets(i);
    	}
    	set<pair<int,int>>p;
    	sort(arr.begin(),arr.end(),[&](point a,point b){
    		if (a.x==b.x)return a.y<b.y;
    		return a.x<b.x;
    });
    stack<int>check;
    	int i =1;
    	for (;i<n;++i){
    		if (arr[i].x!=2)break;
    		if (dist(arr[i],arr[i-1])){
    		ansx.push_back(min(arr[i].x,arr[i-1].x) - 1);
    		ansy.push_back(min(arr[i].y,arr[i-1].y) + 1);
    		ansxi.push_back(arr[i].index);
    		ansyi.push_back(arr[i-1].index);
    		unionset(i-1,i);
    		p.insert({ansx.back(),ansy.back()});
    		}
    		else {
    			check.push(i);
    			check.push(i-1);
    		}
    	}
    		check.push(i);
    		check.push(i-1);
    
    	for (;i<n;++i){
    		if (arr[i-1].x==2)continue;
    		if (dist(arr[i],arr[i-1])){
    		ansx.push_back(min(arr[i].x,arr[i-1].x) + 1);
    		ansy.push_back(min(arr[i].y,arr[i-1].y) + 1);
    		ansxi.push_back(arr[i].index);
    		ansyi.push_back(arr[i-1].index);
    		unionset(i-1,i);
    		p.insert({ansx.back(),ansy.back()});
    		}
    		else {
    			
    			check.push(i-1);
    		}
    	}
    
    	
    while(!check.empty()){
    	int k = check.top();
    	bool ok=false;
    	check.pop();
    	for (int j =0;j<n;++j){
    		if (dist(arr[j],arr[k])&&findsets(j)!=findsets(k)){
    			int first1=min(arr[k].x,arr[j].x) + 1;
    		int second1=min(arr[k].y,arr[j].y) + 1;
    		int second2 = min(arr[k].y,arr[j].y) - 1;
    		if (p.find({first1,second1})==p.end()){
    			ok=true;
    			ansx.push_back(first1);
    			ansy.push_back(second1);
    			ansxi.push_back(arr[j].index);
    			ansyi.push_back(arr[k].index);
    			unionset(j,k);
    			p.insert({ansx.back(),ansy.back()});
    			break;
    		}
    		if (p.find({first1,second2})==p.end()){
    			ok=true;
    			ansx.push_back(first1);
    			ansy.push_back(second2);
    			ansxi.push_back(arr[j].index);
    			ansyi.push_back(arr[k].index);
    			unionset(j,k);
    			p.insert({ansx.back(),ansy.back()});
    			break;
    		}
    		}
    	}
   
    	
    }
    if (siz[findsets(0)]!=n)return 0;
    	  build(ansxi,ansyi,ansx,ansy);
    	  return 1;
    }
    
    
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:105:11: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
  105 |      bool ok=false;
      |           ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 4 ms 8140 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 4 ms 8012 KB Output is correct
9 Correct 70 ms 15896 KB Output is correct
10 Correct 10 ms 8932 KB Output is correct
11 Correct 37 ms 12256 KB Output is correct
12 Correct 15 ms 9328 KB Output is correct
13 Correct 14 ms 10056 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 74 ms 15948 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 4 ms 8140 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 4 ms 8012 KB Output is correct
9 Correct 70 ms 15896 KB Output is correct
10 Correct 10 ms 8932 KB Output is correct
11 Correct 37 ms 12256 KB Output is correct
12 Correct 15 ms 9328 KB Output is correct
13 Correct 14 ms 10056 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 74 ms 15948 KB Output is correct
17 Correct 5 ms 8028 KB Output is correct
18 Correct 4 ms 8012 KB Output is correct
19 Correct 4 ms 8140 KB Output is correct
20 Correct 4 ms 8012 KB Output is correct
21 Correct 5 ms 8012 KB Output is correct
22 Correct 5 ms 8012 KB Output is correct
23 Correct 196 ms 32988 KB Output is correct
24 Correct 5 ms 8012 KB Output is correct
25 Correct 6 ms 8268 KB Output is correct
26 Correct 6 ms 8396 KB Output is correct
27 Correct 7 ms 8396 KB Output is correct
28 Correct 77 ms 18012 KB Output is correct
29 Correct 117 ms 22824 KB Output is correct
30 Correct 157 ms 28224 KB Output is correct
31 Correct 203 ms 32916 KB Output is correct
32 Correct 5 ms 8012 KB Output is correct
33 Correct 5 ms 8012 KB Output is correct
34 Correct 5 ms 8012 KB Output is correct
35 Correct 5 ms 8012 KB Output is correct
36 Correct 4 ms 8012 KB Output is correct
37 Correct 5 ms 8140 KB Output is correct
38 Correct 6 ms 8040 KB Output is correct
39 Correct 5 ms 8012 KB Output is correct
40 Correct 5 ms 8012 KB Output is correct
41 Correct 4 ms 8140 KB Output is correct
42 Correct 4 ms 8012 KB Output is correct
43 Correct 11 ms 8268 KB Output is correct
44 Correct 18 ms 8428 KB Output is correct
45 Execution timed out 3567 ms 16684 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 4 ms 8140 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 4 ms 8012 KB Output is correct
9 Correct 70 ms 15896 KB Output is correct
10 Correct 10 ms 8932 KB Output is correct
11 Correct 37 ms 12256 KB Output is correct
12 Correct 15 ms 9328 KB Output is correct
13 Correct 14 ms 10056 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 74 ms 15948 KB Output is correct
17 Correct 5 ms 8028 KB Output is correct
18 Correct 4 ms 8012 KB Output is correct
19 Correct 4 ms 8140 KB Output is correct
20 Correct 4 ms 8012 KB Output is correct
21 Correct 5 ms 8012 KB Output is correct
22 Correct 5 ms 8012 KB Output is correct
23 Correct 196 ms 32988 KB Output is correct
24 Correct 5 ms 8012 KB Output is correct
25 Correct 6 ms 8268 KB Output is correct
26 Correct 6 ms 8396 KB Output is correct
27 Correct 7 ms 8396 KB Output is correct
28 Correct 77 ms 18012 KB Output is correct
29 Correct 117 ms 22824 KB Output is correct
30 Correct 157 ms 28224 KB Output is correct
31 Correct 203 ms 32916 KB Output is correct
32 Correct 5 ms 8012 KB Output is correct
33 Correct 5 ms 8012 KB Output is correct
34 Correct 5 ms 8012 KB Output is correct
35 Correct 5 ms 8012 KB Output is correct
36 Correct 4 ms 8012 KB Output is correct
37 Correct 5 ms 8140 KB Output is correct
38 Correct 6 ms 8040 KB Output is correct
39 Correct 5 ms 8012 KB Output is correct
40 Correct 5 ms 8012 KB Output is correct
41 Correct 4 ms 8140 KB Output is correct
42 Correct 4 ms 8012 KB Output is correct
43 Correct 11 ms 8268 KB Output is correct
44 Correct 18 ms 8428 KB Output is correct
45 Execution timed out 3567 ms 16684 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 4 ms 8140 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 4 ms 8012 KB Output is correct
9 Correct 70 ms 15896 KB Output is correct
10 Correct 10 ms 8932 KB Output is correct
11 Correct 37 ms 12256 KB Output is correct
12 Correct 15 ms 9328 KB Output is correct
13 Correct 14 ms 10056 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 74 ms 15948 KB Output is correct
17 Correct 5 ms 8012 KB Output is correct
18 Correct 5 ms 8012 KB Output is correct
19 Correct 4 ms 8012 KB Output is correct
20 Execution timed out 3578 ms 20744 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 4 ms 8140 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 4 ms 8012 KB Output is correct
9 Correct 70 ms 15896 KB Output is correct
10 Correct 10 ms 8932 KB Output is correct
11 Correct 37 ms 12256 KB Output is correct
12 Correct 15 ms 9328 KB Output is correct
13 Correct 14 ms 10056 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 74 ms 15948 KB Output is correct
17 Execution timed out 3567 ms 20704 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8012 KB Output is correct
2 Correct 5 ms 8012 KB Output is correct
3 Correct 4 ms 8140 KB Output is correct
4 Correct 5 ms 8012 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8012 KB Output is correct
7 Correct 5 ms 8012 KB Output is correct
8 Correct 4 ms 8012 KB Output is correct
9 Correct 70 ms 15896 KB Output is correct
10 Correct 10 ms 8932 KB Output is correct
11 Correct 37 ms 12256 KB Output is correct
12 Correct 15 ms 9328 KB Output is correct
13 Correct 14 ms 10056 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 74 ms 15948 KB Output is correct
17 Correct 5 ms 8028 KB Output is correct
18 Correct 4 ms 8012 KB Output is correct
19 Correct 4 ms 8140 KB Output is correct
20 Correct 4 ms 8012 KB Output is correct
21 Correct 5 ms 8012 KB Output is correct
22 Correct 5 ms 8012 KB Output is correct
23 Correct 196 ms 32988 KB Output is correct
24 Correct 5 ms 8012 KB Output is correct
25 Correct 6 ms 8268 KB Output is correct
26 Correct 6 ms 8396 KB Output is correct
27 Correct 7 ms 8396 KB Output is correct
28 Correct 77 ms 18012 KB Output is correct
29 Correct 117 ms 22824 KB Output is correct
30 Correct 157 ms 28224 KB Output is correct
31 Correct 203 ms 32916 KB Output is correct
32 Correct 5 ms 8012 KB Output is correct
33 Correct 5 ms 8012 KB Output is correct
34 Correct 5 ms 8012 KB Output is correct
35 Correct 5 ms 8012 KB Output is correct
36 Correct 4 ms 8012 KB Output is correct
37 Correct 5 ms 8140 KB Output is correct
38 Correct 6 ms 8040 KB Output is correct
39 Correct 5 ms 8012 KB Output is correct
40 Correct 5 ms 8012 KB Output is correct
41 Correct 4 ms 8140 KB Output is correct
42 Correct 4 ms 8012 KB Output is correct
43 Correct 11 ms 8268 KB Output is correct
44 Correct 18 ms 8428 KB Output is correct
45 Execution timed out 3567 ms 16684 KB Time limit exceeded
46 Halted 0 ms 0 KB -