NOJ [1313] Anger Begins

链接地址：http://ac.nbutoj.com/Problem/view.xhtml?id=1313

线段相交 + 并查集
线段斜率可以是0也可以是无穷大。
只要有一条路的一个点在另一条路上就算连通。
将连通的路并在一起，然后直接就可以判断了。

出题代码：

#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;

int n;
struct pt
{
 double x1, y1, x2, y2;
};
pt p[1050];

int v[1050];
int r[1050];
int find(int x)
{
 if(v[x]!=x) v[x]=find(v[x]);
 return v[x];
}
void Union(int x, int y)
{
 if(r[x]>r[y]) v[y]=x;
 else if(r[x]<r[y]) v[x]=y;
 else
 {
  v[x]=y;
  r[y]++;
 }
}

bool jiao(int i, int j)//判断两线段相交函数
{
 if (p[i].x1 == p[j].x1 && p[i].y1 == p[j].y1) return 1;
 if (p[i].x1 == p[j].x2 && p[i].y1 == p[j].y2) return 1;
 if (p[i].x2 == p[j].x1 && p[i].y2 == p[j].y1) return 1;
 if (p[i].x2 == p[j].x2 && p[i].y2 == p[j].y2) return 1;
 
 if (p[i].x1 == p[i].x2)
 {
  if (p[j].x1 == p[i].x1 && p[j].y1 >= min(p[i].y1, p[i].y2) && p[j].y1 <= max(p[i].y1, p[i].y2)) return 1;
  if (p[j].x2 == p[i].x1 && p[j].y2 >= min(p[i].y1, p[i].y2) && p[j].y2 <= max(p[i].y1, p[i].y2)) return 1;
 }
 else
 {
  if (p[j].x1 >= min(p[i].x1, p[i].x2) && p[j].x1 <= max(p[i].x1, p[i].x2) && p[j].y1 >= min(p[i].y1, p[i].y2) && p[j].y1 <= max(p[i].y1, p[i].y2))
  {
   if (p[j].x1 != p[i].x1)
   {
    if ((p[i].y2 - p[i].y1) / (p[i].x2 - p[i].x1) == (p[j].y1 - p[i].y1) / (p[j].x1 - p[i].x1)) return 1;
   }
   else
   {
    if ((p[i].y2 - p[i].y1) / (p[i].x2 - p[i].x1) == (p[j].y1 - p[i].y2) / (p[j].x1 - p[i].x2)) return 1;
   }
  }
  if (p[j].x2 >= min(p[i].x1, p[i].x2) && p[j].x2 <= max(p[i].x1, p[i].x2) && p[j].y2 >= min(p[i].y1, p[i].y2) && p[j].y2 <= max(p[i].y1, p[i].y2))
  {
   if (p[j].x2 != p[i].x1)
   {
    if ((p[i].y2 - p[i].y1) / (p[i].x2 - p[i].x1) == (p[j].y2 - p[i].y1) / (p[j].x2 - p[i].x1)) return 1;
   }
   else
   {
    if ((p[i].y2 - p[i].y1) / (p[i].x2 - p[i].x1) == (p[j].y2 - p[i].y2) / (p[j].x2 - p[i].x2)) return 1;
   }
  }
 }
 if (p[j].x1 == p[j].x2)
 {
  if (p[i].x1 == p[j].x1 && p[i].y1 >= min(p[j].y1, p[j].y2) && p[i].y1 <= max(p[j].y1, p[j].y2)) return 1;
  if (p[i].x2 == p[j].x1 && p[i].y2 >= min(p[j].y1, p[j].y2) && p[i].y2 <= max(p[j].y1, p[j].y2)) return 1;
 }
 else
 {
  if (p[i].x1 >= min(p[j].x1, p[j].x2) && p[i].x1 <= max(p[j].x1, p[j].x2) && p[i].y1 >= min(p[j].y1, p[j].y2) && p[i].y1 <= max(p[j].y1, p[j].y2))
  {
   if (p[i].x1 != p[j].x1)
   {
    if ((p[j].y2 - p[j].y1) / (p[j].x2 - p[j].x1) == (p[i].y1 - p[j].y1) / (p[i].x1 - p[j].x1)) return 1;
   }
   else
   {
    if ((p[j].y2 - p[j].y1) / (p[j].x2 - p[j].x1) == (p[i].y1 - p[j].y2) / (p[i].x1 - p[j].x2)) return 1;
   }
  }
  if (p[i].x2 >= min(p[j].x1, p[j].x2) && p[i].x2 <= max(p[j].x1, p[j].x2) && p[i].y2 >= min(p[j].y1, p[j].y2) && p[i].y2 <= max(p[j].y1, p[j].y2))
  {
   if (p[i].x2 != p[j].x1)
   {
    if ((p[j].y2 - p[j].y1) / (p[j].x2 - p[j].x1) == (p[i].y2 - p[j].y1) / (p[i].x2 - p[j].x1)) return 1;
   }
   else
   {
    if ((p[j].y2 - p[j].y1) / (p[j].x2 - p[j].x1) == (p[i].y2 - p[j].y2) / (p[i].x2 - p[j].x2)) return 1;
   }
  }
 }
 
 double xi1 = p[i].x1 - p[j].x1;
 double xi2 = p[i].y1 - p[j].y1;
 double xi3 = p[i].x1 - p[j].x2;
 double xi4 = p[i].y1 - p[j].y2;
 double xi5 = p[i].x2 - p[j].x1;
 double xi6 = p[i].y2 - p[j].y1;
 double xi7 = p[i].x2 - p[j].x2;
 double xi8 = p[i].y2 - p[j].y2;
 
 if ((xi1 * xi4 - xi2 * xi3) * (xi5 * xi8 - xi6 * xi7) >= 0) return 0;
 
 double yj1 = p[j].x1 - p[i].x1;
 double yj2 = p[j].y1 - p[i].y1;
 double yj3 = p[j].x1 - p[i].x2;
 double yj4 = p[j].y1 - p[i].y2;
 double yj5 = p[j].x2 - p[i].x1;
 double yj6 = p[j].y2 - p[i].y1;
 double yj7 = p[j].x2 - p[i].x2;
 double yj8 = p[j].y2 - p[i].y2;
 
 if ((yj1 * yj4 - yj2 * yj3) * (yj5 * yj8 - yj6 * yj7) >= 0) return 0;
 
 return 1;
}

int main()
{
 //freopen("data.in", "r", stdin);
 //freopen("data.out", "w", stdout);
    while (~scanf("%d", &n) && n)
    {
     memset(r, 0, sizeof(r));
     for (int i = 1; i <= n; i++) v[i] = i;
     for (int i = 1; i <= n; i++)
     {
      scanf("%lf%lf%lf%lf", &p[i].x1, &p[i].y1, &p[i].x2, &p[i].y2);
     }
     for (int i = 1; i <= n; i++)
     {
      for (int j = i + 1; j <= n; j++)
      {
       if (jiao(i, j))
       {
        int s1 = find(i);
        int s2 = find(j);
        if (s1 != s2) Union(s1, s2);
       }
      }
     }
     int m;
     scanf("%d", &m);
     while (m--)
     {
      int a, b;
      scanf("%d%d", &a, &b);
      if (find(a) == find(b)) printf("YES\n");
      else printf("NO\n");
     }
    }
    
    return 0;
}