ALFR T1 80pts求条

一场只打了一个小时没写出一道橙题的比赛

#include <bits/stdc++.h>
typedef long long ll;
const int maxn = 1e6+10;
const ll mod = 1e9+10;
ll n,x1_,y1_,x2_,y2_,xl,yl,xr,yr,x,y;
int main(){
    scanf("%lld%lld%lld%d%lld",&n,&xl,&yl,&xr,&yr);
    x1_ = INT_MAX,y1_ = INT_MIN;  
    x2_ = INT_MIN,y2_ = INT_MAX;  
    for(ll i = 1;i <= n;i++) {
        scanf("%lld%lld",&x,&y);
        if(p[i].x <= x1_) x1_ = x;
        if(p[i].x >= x2_) x2_ = x;
        if(p[i].y >= y1_) y1_ = y;
        if(p[i].y <= y2_) y2_ = y;
    }
    ll ans = (x1_ - xl + 1) % mod * (yl - y1_ + 1) %mod * (xr - x2_ + 1)% mod *  (y2_ - yr + 1)%mod;
    printf("%lld\n",ans);
    system("pause");
    return 0;
}