80分 第二个点没过
查看原帖
80分 第二个点没过
790361
LeR_lirun楼主2024/9/1 09:18
#include<bits/stdc++.h>
const int mod=1e9+7;
using namespace std;
long long maxs(long long x,long long y){
	if(x>y)return x;
	return y;
}
long long  mins(long long x,long long y){
	if(x>y)return y;
	return x;
}
int nx[1000005],ny[1000005];
int maxx,minx,maxy,miny;
int  n,gx,gy,gm,gl;
long long ans;
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>gx>>gy>>gm>>gl;
	for(int i=1;i<=n;i++){
		cin>>nx[i]>>ny[i];
	}
	maxx=nx[1];minx=nx[1];maxy=ny[1];miny=ny[1];
	for(int i=1;i<=n;i++){
		maxx=maxs(maxx,nx[i]);
		minx=mins(minx,nx[i]);
		maxy=maxs(maxy,ny[i]);
		miny=mins(miny,ny[i]);
	}
	ans=(minx-gx+1)*(gm-maxx+1)*(miny-gl+1)*(gy-maxy+1)%mod;
	cout<<ans;
	return 0;
}

/*
2 2 2 1 2 4 
*/
2024/9/1 09:18
加载中...