hdu 5258 数长方形 ·暴力

题解

范围小，直接暴力，

---

---

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
int n,m;

struct node{
    int x1,y1,x2,y2;
}a[N],b[N];//竖 横
int cnta,cntb;

bool judge(node a,node b,node c,node d){
    if(a.x1>b.x1)swap(a,b);
    if(c.y1>d.y1)swap(c,d);

    if(a.x2>d.x1 && a.y2>d.y1){
        if(b.x2<d.x2 && b.y2>d.y2){
            if(a.x1>c.x1 && a.y1<c.y1){
                if(b.x1<c.x2 && b.y1<c.y2) return true;
            }
        }
    }
    return false;
}

int main(){
    ios::sync_with_stdio(0);

    int T;
    cin>>T;
    for (int cs = 1; cs <= T; ++cs) {
        printf("Case #%d:\n",cs);
        //init
        cnta=cntb=0;

        cin>>n;
        for (int i = 1,x1,y1,x2,y2; i <= n; ++i) {
            cin>>x1>>y1>>x2>>y2;
            if(x1==x2){// | 竖
                if(y1>y2)swap(y1,y2);
                a[++cnta]={x1,y1,x2,y2};
            }else{// - 横
                if(x1>x2)swap(x1,x2);
                b[++cntb]={x1,y1,x2,y2};
            }
        }

        int cnt=0;
        for (int i = 1; i <= cnta; ++i) {
            for (int j = i + 1; j <= cnta; ++j) {
                for (int k = 1; k <= cntb; ++k) {
                    for (int l = k + 1; l <= cntb; ++l) {
                        if(judge(a[i],a[j],b[k],b[l]))cnt++;
                    }
                }
            }
        }
        printf("%d\n", cnt);
    }
    return 0;
}