oj.uz

Submission #436633

# Submission time Handle Problem Language Result Execution time Memory
436633 2021-06-24T17:10:18 Z Apiram Fountain Parks (IOI21_parks) C++17
5 / 100
 3500 ms 16432 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;
    });
    
    	
   	for (int k =0;k<n;++k){
    	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 first2=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 (arr[j].x==arr[k].x){
    			second2=min(arr[k].y,arr[j].y) + 1;
    			first2 = min(arr[k].x,arr[j].x) - 1;
    		}
    		else if (arr[j].y!=arr[k].y){
    			continue;
    		}
    		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({first2,second1})==p.end()){
    			ok=true;
    			ansx.push_back(first2);
    			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 (p.find({first2,second2})==p.end()){
    			ok=true;
    			ansx.push_back(first2);
    			ansy.push_back(second2);
    			ansxi.push_back(arr[j].index);
    			unionset(j,k);
    			ansyi.push_back(arr[k].index);
    			p.insert({ansx.back(),ansy.back()});
    			break;
    		}
    		}
    	}
    	
    }
    if (siz[findsets(0)]!=n)return 0;
    	  build(ansxi,ansyi,ansx,ansy);
    	  return 1;
    }
    
    
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 4 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8064 KB Output is correct
9 Correct 71 ms 15972 KB Output is correct
10 Correct 10 ms 8984 KB Output is correct
11 Correct 35 ms 12172 KB Output is correct
12 Correct 13 ms 9312 KB Output is correct
13 Correct 16 ms 10016 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 5 ms 8136 KB Output is correct
16 Correct 71 ms 15944 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 4 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8064 KB Output is correct
9 Correct 71 ms 15972 KB Output is correct
10 Correct 10 ms 8984 KB Output is correct
11 Correct 35 ms 12172 KB Output is correct
12 Correct 13 ms 9312 KB Output is correct
13 Correct 16 ms 10016 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 5 ms 8136 KB Output is correct
16 Correct 71 ms 15944 KB Output is correct
17 Correct 4 ms 8140 KB Output is correct
18 Correct 4 ms 8012 KB Output is correct
19 Correct 4 ms 8088 KB Output is correct
20 Correct 4 ms 8012 KB Output is correct
21 Correct 4 ms 8140 KB Output is correct
22 Correct 4 ms 8012 KB Output is correct
23 Execution timed out 3576 ms 16432 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 4 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8064 KB Output is correct
9 Correct 71 ms 15972 KB Output is correct
10 Correct 10 ms 8984 KB Output is correct
11 Correct 35 ms 12172 KB Output is correct
12 Correct 13 ms 9312 KB Output is correct
13 Correct 16 ms 10016 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 5 ms 8136 KB Output is correct
16 Correct 71 ms 15944 KB Output is correct
17 Correct 4 ms 8140 KB Output is correct
18 Correct 4 ms 8012 KB Output is correct
19 Correct 4 ms 8088 KB Output is correct
20 Correct 4 ms 8012 KB Output is correct
21 Correct 4 ms 8140 KB Output is correct
22 Correct 4 ms 8012 KB Output is correct
23 Execution timed out 3576 ms 16432 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 4 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8064 KB Output is correct
9 Correct 71 ms 15972 KB Output is correct
10 Correct 10 ms 8984 KB Output is correct
11 Correct 35 ms 12172 KB Output is correct
12 Correct 13 ms 9312 KB Output is correct
13 Correct 16 ms 10016 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 5 ms 8136 KB Output is correct
16 Correct 71 ms 15944 KB Output is correct
17 Correct 4 ms 8012 KB Output is correct
18 Correct 4 ms 8012 KB Output is correct
19 Correct 4 ms 8140 KB Output is correct
20 Execution timed out 3553 ms 16168 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 4 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8064 KB Output is correct
9 Correct 71 ms 15972 KB Output is correct
10 Correct 10 ms 8984 KB Output is correct
11 Correct 35 ms 12172 KB Output is correct
12 Correct 13 ms 9312 KB Output is correct
13 Correct 16 ms 10016 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 5 ms 8136 KB Output is correct
16 Correct 71 ms 15944 KB Output is correct
17 Execution timed out 3568 ms 16400 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8012 KB Output is correct
2 Correct 4 ms 8012 KB Output is correct
3 Correct 4 ms 8012 KB Output is correct
4 Correct 4 ms 8140 KB Output is correct
5 Correct 6 ms 8012 KB Output is correct
6 Correct 4 ms 8012 KB Output is correct
7 Correct 4 ms 8140 KB Output is correct
8 Correct 4 ms 8064 KB Output is correct
9 Correct 71 ms 15972 KB Output is correct
10 Correct 10 ms 8984 KB Output is correct
11 Correct 35 ms 12172 KB Output is correct
12 Correct 13 ms 9312 KB Output is correct
13 Correct 16 ms 10016 KB Output is correct
14 Correct 4 ms 8140 KB Output is correct
15 Correct 5 ms 8136 KB Output is correct
16 Correct 71 ms 15944 KB Output is correct
17 Correct 4 ms 8140 KB Output is correct
18 Correct 4 ms 8012 KB Output is correct
19 Correct 4 ms 8088 KB Output is correct
20 Correct 4 ms 8012 KB Output is correct
21 Correct 4 ms 8140 KB Output is correct
22 Correct 4 ms 8012 KB Output is correct
23 Execution timed out 3576 ms 16432 KB Time limit exceeded
24 Halted 0 ms 0 KB -