PAT T1011 Cut Rectangles

大模拟题，按要求建立多边形，先定位斜边的位置，再分类讨论~

#include<bits/stdc++.h>
using namespace std;
const int maxn=;
struct node {
    double x,y;
}Node[][maxn];
double distance (node a,node b) {
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int isXiebian (node a,node b) {
    if (a.x!=b.x&&a.y!=b.y) return ;
    return ;
}
double angle (node a,node b) {
    return fabs(a.x-b.x)/fabs(a.y-b.y);
}
vector<double> edge[];
int main () {
    int T;
    scanf ("%d",&T);
    int k1,k2;
    while (T--) {
        edge[].clear();edge[].clear();
        scanf ("%d",&k1);
        for (int i=;i<k1;i++) scanf ("%lf %lf",&Node[][i].x,&Node[][i].y);
        scanf ("%d",&k2);
        for (int i=;i<k2;i++) scanf ("%lf %lf",&Node[][i].x,&Node[][i].y);
        double xie1=,xie2=,cnt1=,cnt2=,angle1,angle2,p1,p2;
        for (int i=;i<k1;i++) {
            int j=i<k1-?i+:;
            if (isXiebian(Node[][i],Node[][j])) xie1=distance(Node[][i],Node[][j]),cnt1++,
            angle1=angle(Node[][i],Node[][j]);
            edge[].push_back(distance(Node[][i],Node[][j]));
        }
        for (int i=;i<k2;i++) {
            int j=i<k2-?i+:;
            if (isXiebian(Node[][i],Node[][j])) xie2=distance(Node[][i],Node[][j]),cnt2++,
            angle2=angle(Node[][i],Node[][j]);
            edge[].push_back(distance(Node[][i],Node[][j]));
        }
        if (k1+k2>||k1+k2<) printf ("NO\n");
        else if (xie1==xie2&&cnt1==&&cnt2==) {
            if ((angle1==angle2||angle1*angle2==)&&(k1!=||k2!=)) printf ("YES\n");
            else if (k1==&&k2==) {
                double z1=p1<k1-?p1+:p1+-k1;
                double z2=p2<k2-?p2+:p2+-k2;
                double z3=p1<k1-?p1+:;
                double z4=p1>?p1-:k1-;
                double z5=p2<k2-?p2+:;
                double z6=p2>?p2-:k2-;
                if (edge[][z1]==edge[][z2]&&(edge[][z3]+edge[][z5]==edge[][z4]+edge[][z6]||
                edge[][z3]+edge[][z6]==edge[][z4]+edge[][z5])) printf ("YES\n");
                else printf ("NO\n");
            }
            else printf ("NO\n");
        }
        else if (xie1==&&xie2==&&k1==&&k2==) {
            for (int i=;i<k1;i++) {
                for (int k=;k<k2;k++)
                if (edge[][i]==edge[][k]) cnt1++;
            }
            if (cnt1==||cnt1==) printf ("YES\n");
            else printf ("NO\n");
        }
        else printf ("NO\n");
    }
    return ;
}