uva 273

 

trick test一大堆

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 55
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
struct straw{
    double x1,y1,x2,y2;
}straws[20];
int p[20],rank[20];
int n;
bool con(straw a,straw b){
    double x1=b.x1,x2=b.x2,y1=b.y1,y2=b.y2;
    double ax1=a.x1,ax2=a.x2,ay1=a.y1,ay2=a.y2;
    double m=(x1-x2==0)?oo:(double)(y1-y2)/(x1-x2);
    double db=(m==oo)?x1:y1-m*x1;
    double m2=(ax1-ax2==0)?oo:(double)(ay1-ay2)/(ax1-ax2);
    double db2=(m2==oo)?ax1:ay1-m2*ax1;
//    double m1=(ax1-x2==0)?oo:(double)(ay1-y1)/(ax1-x1);
//    double m2=(ax1-x2==0)?oo:(double)(ay1-y2)/(ax1-x2);
//    double ma=(ax1-ax2==0)?oo:(double)(ay1-ay2)/(ax1-ax2);
    double tmp=(m==oo)?ax1-db:m*ax1+db-ay1;
    double tmp2=(m==oo)?ax1-db:m*ax2+db-ay2;
    double tmp3=(m2==oo)?x1-db2:m2*x1+db2-y1;
    double tmp4=(m2==oo)?x1-db2:m2*x2+db2-y2;
//    if(m1>m2)swap(m1,m2);
//    debug("%lf %lf %lf %lf\n",tmp,tmp2,tmp3,tmp4);
    if((tmp>0&&tmp2>0)||(tmp<0&&tmp2<0)){
        return false;
    }
    if((tmp3>0&&tmp4>0)||(tmp3<0&&tmp4<0)){
        return false;
    }
    if(tmp==tmp2&&tmp2==tmp3&&tmp3==tmp4){
        if(ax1>ax2)swap(ax1,ax2);
        if(x1>x2)swap(x1,x2);
        if(x1<=ax1&&ax1<=x2)return true;
        if(ax1<=x1&&x1<=ax2)return true;
        return false;
    }
    return true;
}
void init(){
    for(int i=0;i<20;i++){
        p[i]=i;
        rank[i]=0;
    }
}
int getf(int x){
    if(x!=p[x])p[x]=getf(p[x]);
    return p[x];
}
void _union(int x,int y){
    x=getf(x);y=getf(y);
    if(x!=y){
        if(rank[x]>rank[y])p[y]=x;
        else{
            p[x]=y;
            if(rank[x]==rank[y])rank[y]++;
        }
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    while(test--){
        init();
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%lf%lf%lf%lf",&straws[i].x1,&straws[i].y1,&straws[i].x2,&straws[i].y2);
            if(straws[i].x1>straws[i].x2){
                swap(straws[i].x1,straws[i].x2);
                swap(straws[i].y1,straws[i].y2);
            }
        }
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                if(con(straws[i],straws[j])){
                    _union(i,j);
                }
            }
        }
        while(1){
            int x,y;
            scanf("%d%d",&x,&y);
            if(x+y==0)break;
            if(getf(x-1)==getf(y-1)){
                printf("CONNECTED\n");
            }else printf("NOT CONNECTED\n");
        }
        if(test)Pln();
    }

















}