Submission #8432073
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define mo 1000000007ll
#define N 2000010
ll jc[N],ijc[N],r,x[N],y[N];
int t;
ll qp(ll x,ll y){
ll r=1;
for(;y;y>>=1,x=x*x%mo)
if(y&1)r=r*x%mo;
return r;
}
struct no{
int x,y,t;
}v[N];
ll cc(ll y,ll x){return jc[y]*ijc[x]%mo*ijc[y-x]%mo;}
ll f(ll a,ll b,ll c,ll d){
int e=abs(c-a),f=abs(d-b);
return cc(e+f,f);
}
ll ga(int a,int b,int c,int d,int e,int g){
int r=0;
for(int i=x[3];i<=x[4];i++){
r=(r+f(a,b,i,y[4])*f(i,y[4]+1,c,d)%mo*(i+y[4]+1)%mo)%mo;
r=(r-f(a,b,i,y[3]-1)*f(i,y[3],c,d)%mo*(i+y[3])%mo+mo)%mo;
}
for(int i=y[3];i<=y[4];i++){
r=(r+f(a,b,x[4],i)*f(x[4]+1,i,c,d)%mo*(x[4]+i+1)%mo)%mo;
r=(r-f(a,b,x[3]-1,i)*f(x[3],i,c,d)%mo*(x[3]+i)+mo)%mo;
}
r*=e*g;
return r;
}
signed main(){
jc[0]=ijc[0]=1;
for(ll i=1;i<N;i++)jc[i]=jc[i-1]*i%mo;
ijc[N-1]=qp(jc[N-1],mo-2);
for(ll i=N-2;i;i--)ijc[i]=ijc[i+1]*(i+1ll)%mo;
for(int i=1;i<7;i++)cin>>x[i];
for(int i=1;i<7;i++)cin>>y[i];
v[1]=(no){x[1]-1,y[1]-1,1};
v[2]=(no){x[2],y[1]-1,-1};
v[3]=(no){x[1]-1,y[2],-1};
v[4]=(no){x[2],y[2],1};
v[5]=(no){x[5],y[5],1};
v[6]=(no){x[6]+1,y[5],-1};
v[7]=(no){x[5],y[6]+1,-1};
v[8]=(no){x[6]+1,y[6]+1,1};
for(int i=1;i<5;i++)
for(int j=5;j<9;j++)
r=(r+ga(v[i].x,v[i].y,v[j].x,v[j].y,v[i].t,v[j].t)+mo)%mo;
cout<<r;
}
Submission Info
Submission Time |
|
Task |
E - Sightseeing Plan |
User |
luogu_bot4 |
Language |
C++14 (GCC 5.4.1) |
Score |
1600 |
Code Size |
1390 Byte |
Status |
AC |
Exec Time |
924 ms |
Memory |
35968 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
1600 / 1600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
31 ms |
35840 KB |
sample_02.txt |
AC |
31 ms |
35968 KB |
sample_03.txt |
AC |
160 ms |
35840 KB |
subtask_1_01.txt |
AC |
31 ms |
35968 KB |
subtask_1_02.txt |
AC |
71 ms |
35840 KB |
subtask_1_03.txt |
AC |
608 ms |
35840 KB |
subtask_1_04.txt |
AC |
147 ms |
35968 KB |
subtask_1_05.txt |
AC |
465 ms |
35840 KB |
subtask_1_06.txt |
AC |
93 ms |
35968 KB |
subtask_1_07.txt |
AC |
213 ms |
35840 KB |
subtask_1_08.txt |
AC |
167 ms |
35968 KB |
subtask_1_09.txt |
AC |
171 ms |
35968 KB |
subtask_1_10.txt |
AC |
161 ms |
35968 KB |
subtask_1_11.txt |
AC |
167 ms |
35968 KB |
subtask_1_12.txt |
AC |
31 ms |
35840 KB |
subtask_1_13.txt |
AC |
77 ms |
35840 KB |
subtask_1_14.txt |
AC |
31 ms |
35840 KB |
subtask_1_15.txt |
AC |
31 ms |
35840 KB |
subtask_1_16.txt |
AC |
109 ms |
35968 KB |
subtask_1_17.txt |
AC |
74 ms |
35840 KB |
subtask_1_18.txt |
AC |
92 ms |
35840 KB |
subtask_1_19.txt |
AC |
31 ms |
35840 KB |
subtask_1_20.txt |
AC |
924 ms |
35840 KB |
subtask_1_21.txt |
AC |
31 ms |
35840 KB |
subtask_1_22.txt |
AC |
644 ms |
35968 KB |
subtask_1_23.txt |
AC |
823 ms |
35968 KB |
subtask_1_24.txt |
AC |
665 ms |
35968 KB |