TOJ 1840 Jack Straws
Description
In the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. Here, we are only concerned with if various pairs of straws are connected by a path of touching straws. You will be given a list of the endpoints for some straws (as if they were dumped on a large piece of graph paper) and then will be asked if various pairs of straws are connected. Note that touching is connecting, but also two straws can be connected indirectly via other connected straws.
Input
Input consist multiple case,each case consists of multiple lines. The first line will be an integer n (1 < n < 13) giving the number of straws on the table. Each of the next n lines contain 4 positive integers,x1,y1,x2 and y2, giving the coordinates, (x1,y1),(x2,y2) of the endpoints of a single straw. All coordinates will be less than 100. (Note that the straws will be of varying lengths.) The first straw entered will be known as straw #1, the second as straw #2, and so on. The remaining lines of the current case(except for the final line) will each contain two positive integers, a and b, both between 1 and n, inclusive. You are to determine if straw a can be connected to straw b. When a = 0 = b, the current case is terminated.
When n=0,the input is terminated.
There will be no illegal input and there are no zero-length straws.
Output
You
should generate a line of output for each line containing a pair a and
b, except the final line where a = 0 = b. The line should say simply
"CONNECTED", if straw a is connected to straw b, or "NOT CONNECTED", if
straw a is not connected to straw b. For our purposes, a straw is
considered connected to itself.
Sample Input
7
1 6 3 3
4 6 4 9
4 5 6 7
1 4 3 5
3 5 5 5
5 2 6 3
5 4 7 2
1 4
1 6
3 3
6 7
2 3
1 3
0 0
2
0 2 0 0
0 0 0 1
1 1
2 2
1 2
0 0
0
Sample Output
CONNECTED
NOT CONNECTED
CONNECTED
CONNECTED
NOT CONNECTED
CONNECTED
CONNECTED
CONNECTED
CONNECTED
Source
East Central North America 1994
判断两线段是否相交,直接上模板。
先用并查集预处理好两线段相交,最后判断两两是否在同一个集合就可以了。
#include <stdio.h>
#define eps 1e-8
#define zero(x) (((x)>0?(x):-(x))<eps) int cnt;
int lis[];
struct Point{
double x;
double y;
};
struct Line{
Point a1;
Point a2;
}ll[]; double xmult(Point p1, Point p2, Point p0){
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
} int dots_inline(Point p1, Point p2, Point p3){
return zero(xmult(p1,p2,p3));
} int dot_online_in(Point p,Line l){
return zero(xmult(p,l.a1,l.a2))&&(l.a1.x-p.x)*(l.a2.x-p.x)<eps
&&(l.a1.y-p.y)*(l.a2.y-p.y)<eps;
} int same_side(Point p1,Point p2,Line l){
return xmult(l.a1,p1,l.a2)*xmult(l.a1,p2,l.a2)>eps;
} int intersect_in(Line u, Line v){
if(!dots_inline(u.a1,u.a2,v.a1)||!dots_inline(u.a1,u.a2,v.a1)){
return !same_side(u.a1,u.a2,v)&&!same_side(v.a1,v.a2,u);
}
return dot_online_in(u.a1,v)||dot_online_in(u.a2,v)||
dot_online_in(v.a1,u)||dot_online_in(v.a1,u);
} void set(){
for(int i=; i<=cnt; i++){
lis[i]=i;
}
} int find(int u){
while(lis[u]!=u){
u=lis[u];
}
return u;
} int main(int argc, char *argv[])
{
while( scanf("%d",&cnt)!=EOF && cnt ){
for(int i=; i<=cnt; i++){
scanf("%lf %lf %lf %lf",&ll[i].a1.x ,&ll[i].a1.y ,&ll[i].a2.x ,&ll[i].a2.y);
}
set();
for(int i=; i<=cnt; i++){
for(int j=i+; j<=cnt; j++){
if(intersect_in(ll[i], ll[j])){
int tx=find(i);
int ty=find(j);
if(tx!=ty)
lis[tx]=ty;
}
}
}
int u,v;
while( scanf("%d %d" ,&u ,&v)!=EOF ){
if(u==&& v==)break;
if(find(u)==find(v))
puts("CONNECTED");
else
puts("NOT CONNECTED");
}
}
return ;
}
最新文章
- Java系列:《Java核心技术 卷一》学习笔记,chapter11 记录日志
- iOS9TableView分割线默认不显示,只有滑动的时候才显示 解决办法
- 深入解析MySQL视图view
- 【BZOJ3262】陌上花开 (CDQ分治+树状数组+排序)
- chrome开发工具指南(十一)
- 我珍藏的神兵利器 - 效率工具for Win[转]
- 如何修改Jupyter Notebook的主题
- ExtJs 编译
- Mac10.13 telnet不能用的解决方法
- springsecurity的remember me
- HDU 1308 What Day Is It?(模拟题)
- Java中String、StringBuffer和StringBuilder的区别
- 32位MD5加密补齐丢失的0
- 结对编程——四则运算器(UI第十组)
- 如何在ChemDraw中绘制分子立体结构
- python爬虫实战(七)--------伯乐在线文章(模版)
- maven(18)-mybatis generator插件
- 1、量化投资—为什么选择Python?
- websocket小荔枝
- 请写出一个超链接,点击链接后可以向zhangsan@d-heaven.com发送电子邮件。