제출 #83039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83039		FedericoS	Spiral (BOI16_spiral)	C++14	0 / 100	156 ms	63224 KiB

spiral

#include <iostream>
using namespace std;
typedef long long int ll;

ll md=1e9+7;
ll N,Q;
ll A[2005][2005];
ll B[2005][2005];
ll C[2005][2005];
ll K=2;
ll a,b,c,d;
ll ans;

int main(){

	cin>>N;
	A[N][N]=1;

	for(ll i=1;i<N+1;i++){
		for(ll x=N+i,y=N-i+1;y<N+i+1;y++)
			A[x][y]=K++;
		for(ll x=N+i-1,y=N+i;x>N-i-1;x--)
			A[x][y]=K++;
		for(ll x=N-i,y=N+i-1;y>N-i-1;y--)
			A[x][y]=K++;
		for(ll x=N-i+1,y=N-i;x<N+i+1;x++)
			A[x][y]=K++;
			
	}

	for(ll i=1;i<2*N+2;i++)
		for(ll j=1;j<2*N+2;j++)
			B[i][j]=(B[i-1][j]+B[i][j-1]-B[i-1][j-1]+A[i-1][j-1])%md;

	cin>>Q;
	while(Q--){
		cin>>a>>b>>c>>d;
		a+=N+1,b+=N+1,c+=N+1,d+=N+1;
		ans=(B[c][d]-B[c][b-1]-B[a-1][d]+B[a-1][b-1])%md;
		cout<<ans<<"\n";
	}


}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 31
• Subtask 5: 0 / 25