描述

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=15&page=show_problem&problem=1264

给出一个一笔画的所有折点,求这个一笔画共把平面分成了几个区域(包括优先区域与无限区域).

3263 - That Nice Euler Circuit

3263
That Nice Euler Circuit
Little Joey invented a scrabble machine that he called Euler, after the great mathematician. In his
primary school Joey heard about the nice story of how Euler started the study about graphs. The
problem in that story was – let me remind you – to draw a graph on a paper without lifting your
pen, and finally return to the original position. Euler proved that you could do this if and only if the
(planar) graph you created has the following two properties: (1) The graph is connected; and (2) Every
vertex in the graph has even degree.
Joey’s Euler machine works exactly like this. The device consists of a pencil touching the paper,
and a control center issuing a sequence of instructions. The paper can be viewed as the infinite two-
dimensional plane; that means you do not need to worry about if the pencil will ever go off the boundary.
In the beginning, the Euler machine will issue an instruction of the form (X0, Y 0) which moves the
pencil to some starting position (X0, Y 0). Each subsequent instruction is also of the form (X ′ , Y ′ ),
which means to move the pencil from the previous position to the new position (X ′ , Y ′ ), thus draw a
line segment on the paper. You can be sure that the new position is different from the previous position
for each instruction. At last, the Euler machine will always issue an instruction that move the pencil
back to the starting position (X0, Y 0). In addition, the Euler machine will definitely not draw any
lines that overlay other lines already drawn. However, the lines may intersect.
After all the instructions are issued, there will be a nice picture on Joey’s paper. You see, since the
pencil is never lifted from the paper, the picture can be viewed as an Euler circuit.
Your job is to count how many pieces (connected areas) are created on the paper by those lines
drawn by Euler.
Input
There are no more than 25 test cases. Ease case starts with a line containing an integer N ≥ 4, which
is the number of instructions in the test case. The following N pairs of integers give the instructions
and appear on a single line separated by single spaces. The first pair is the first instruction that gives
the coordinates of the starting position. You may assume there are no more than 300 instructions in
each test case, and all the integer coordinates are in the range (-300, 300). The input is terminated
when N is 0.
Output
For each test case there will be one output line in the format
Case x: There are w pieces.,
where x is the serial number starting from 1.
Note: The figures below illustrate the two sample input cases.
Sample Input
5
0 0 0 1 1 1 1 0 0 0
7

#include <bits/stdc++.h>
using namespace std;

const int maxn=300+10;
const double eps=1e-8;

int n,kase;
struct Point{
double x,y;
Point(double x=0,double y=0):x(x),y(y){}
}p[maxn],v[maxn*maxn];
typedef Point Vector;
int dcmp(double x){
if(fabs(x)<eps) return 0;
return x<0?-1:1;
}
Vector operator + (Vector a,Vector b){ return Vector(a.x+b.x,a.y+b.y); }
Vector operator - (Vector a,Vector b){ return Vector(a.x-b.x,a.y-b.y); }
Vector operator * (Vector a,double p){ return Vector(a.x*p,a.y*p); }
Vector operator / (Vector a,double p){ return Vector(a.x/p,a.y/p); }
bool operator < (const Point &a,const Point &b){ return a.x<b.x||(a.x==b.x&&a.y<b.y); }
bool operator == (const Point &a,const Point &b){ return dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0; }
double dot(Vector a,Vector b){ return a.x*b.x+a.y*b.y; }
double cross(Vector a,Vector b){ return a.x*b.y-a.y*b.x; }
bool segment_proper_intersection(Point a,Point b,Point c,Point d){
double c1=cross(b-a,c-a), c2=cross(b-a,d-a),
c3=cross(d-c,a-c), c4=cross(d-c,b-c);
return (dcmp(c1)^dcmp(c2))==-2&&(dcmp(c3)^dcmp(c4))==-2;
}
Point get_line_intersection(Point P,Vector v,Point Q,Vector w){
Vector u=P-Q;
double t=cross(w,u)/cross(v,w);
return P+v*t;
}
bool on_segment(Point p,Point a,Point b){ return dcmp(cross(a-p,b-p))==0&&dcmp(dot(a-p,b-p)<0); }

void solve(){
for(int i=1;i<=n;i++){
scanf("%lf%lf",&p[i].x,&p[i].y);
v[i]=p[i];
}
n--;//输入的是n+1个点
int c=n,e=n;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++){
if(segment_proper_intersection(p[i],p[i+1],p[j],p[j+1]))
v[++c]=get_line_intersection(p[i],p[i+1]-p[i],p[j],p[j+1]-p[j]);}
sort(v+1,v+c+1);
c=unique(v+1,v+c+1)-(v+1);//去重,注意减去的时(v+1)
for(int i=1;i<=c;i++)
for(int j=1;j<=n;j++)
if(on_segment(v[i],p[j],p[j+1])) e++;
printf("Case %d: There are %d pieces.\n",++kase,e+2-c);//欧拉定理
}
int main(){
while(scanf("%d",&n)&&n) solve();
return 0;
}