제출 #436774

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436774		Apiram	분수 공원 (IOI21_parks)	C++17	15 / 100	242 ms	33772 KiB

parks

#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
struct point {
	int x,y,index;
};
bool dist(point x,point y){
	if (((x.x - y.x)*(x.x - y.x)+(x.y-y.y)*(x.y - y.y))!=4)return false;
	return true;
}
int binarysearch(int seg,int eq,int n,vector<point>arr){
	int left = 0;
	int right = n-1;
	while(left<=right){
		int mid = (left + right) >> 1;
		if (arr[mid].x<seg)left= mid + 1;
		else if (arr[mid].x>seg)right = mid-1;
		else {
			if (arr[mid].y<eq){
				left=mid+1;
			}
			else if (arr[mid].y>eq){
				right = mid-1;
			}
			else return mid;
		}
	}
	return -1;
}
void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b) ;
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{
    	vector<vector<int>>adj(n);
    	vector<vector<bool>>p(3,vector<bool>(1e5 + 5,false));
    	sort(arr.begin(),arr.end(),[&](point a,point b){
    		if (a.x==b.x)return a.y<b.y;
    		return a.x<b.x;
    });
    	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);
    		adj[i].push_back(i-1);
    		adj[i-1].push_back(i);
    		p[ansx.back()/2][ansy.back()/2]=true;
    		}
    		}
    		int j = i;
    
    	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);
    		adj[i].push_back(i-1);
    		adj[i-1].push_back(i);
    		p[ansx.back()/2][ansy.back()/2]=true;
    		}
    	}
	int left =j;
    	for (int  k =0;k<j;++k){
    		int right = n-1;
    		while(left<=right){
    			int mid = (left + right)>>1;
    			if (arr[mid].y==arr[k].y){
    			int first1 =  min(arr[k].x,arr[mid].x) + 1;
   				int second1 = 	min(arr[k].y,arr[mid].y) + 1;
   				int second2=min(arr[k].y,arr[mid].y) - 1;
   				if (!p[first1/2][second2/2]){
   					ansx.push_back(first1);
    				ansy.push_back(second2);
    				ansxi.push_back(arr[k].index);
    				ansyi.push_back(arr[mid].index);
    				adj[mid].push_back(k);
    				adj[k].push_back(mid);
    				p[ansx.back()/2][ansy.back()/2]=true;
   				}		
   				else if (!p[first1/2][second1/2]){
   					ansx.push_back(first1);
    				ansy.push_back(second1);
    				ansxi.push_back(arr[k].index);
    				ansyi.push_back(arr[mid].index);
    				adj[mid].push_back(k);
    				adj[k].push_back(mid);
    				p[ansx.back()/2][ansy.back()/2]=true;
    			}
    			break;
    			}
    			else if (arr[mid].y<arr[k].y){
    				left=mid+1;
    			}
    			else right = mid-1;
    		}
    	}
		vector<bool>visited(n,false);
		queue<int>q;
		
		q.push(0);
		while(!q.empty()){
			int u =q.front();
			q.pop();
			visited[u]=true;
			for (auto x:adj[u]){
				if (!visited[x]){
				q.push(x);
				visited[x]=true;}
			}
		}
		for (auto x:visited){
			if (!x)return 0;
		}
		build(ansxi,ansyi,ansx,ansy);
    return 1;
}}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30