ccf 202303-1

代码如下:(采用最暴力的解法，长宽举例出可能出现的6种情况)

#include<iostream>
using namespace std;

void test1(){
    int n,X,Y,x1,x2,y1,y2;
    cin>>n>>X>>Y;
    int res=0;
    for(int i=0;i<n;i++){
        int xx,yy; 
        cin>>x1>>y1>>x2>>y2;
        if(x1<0){
            if(x2<0){
                xx=0;
            }
            if(x2>=0&&x2<=X){
                xx=x2;
            }
            if(x2>X){
                xx=X;
            }
        }
         if(x1>=0&&x1<=X){
            if(x2>=0&&x2<=X){
                xx=x2-x1;
            }
            if(x2>X){
                xx=X-x1;
            }
        }
        if(x1>X){
            xx=0;
        }
        if(y1<0){
            if(y2<0){
                yy=0;
            }
            if(y2>=0&&y2<=Y){
                yy=y2;
            }
            if(y2>Y){
                yy=Y;
            }
        }
        if(y1>=0&&y1<=Y){
            if(y2>=0&&y2<=Y){
                yy=y2-y1;
            }
            if(y2>Y){
                yy=Y-y1;
            }
        }
        if(y1>Y){
            yy=0;
        }
        res+=xx*yy;
    }
    cout<<res;
}
int main(){
    test1();
    system("pause");
    return 0;
}