http://codeforces.com/contest/1080/problem/C
纪念一下这个模拟,看了题解的,用了一点点容斥
#include<bits/stdc++.h>
#include<cstdio>
#include<string>
#include<string.h>
using namespace std;
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
const double eps=1e-9;
const int inf=1e9;
const int maxn=300;
ll n,m,k;
ll white(ll x1,ll y1,ll x2,ll y2){
return ((x2-x1+1)*(y2-y1+1)+(abs(x1-y1)%2==0))/2;
}
ll black(ll x1,ll y1,ll x2,ll y2){
if(x1>x2||y1>y2)return 0;
return (x2-x1+1)*(y2-y1+1)-white(x1,y1,x2,y2);
}
int main(){
ll ans=0;
int q;
scanf("%d",&q);
while(q--){
ll x1,x2,y1,y2;
ll x3,y3,x4,y4;
scanf("%lld%lld",&n,&m);
scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
scanf("%lld%lld%lld%lld",&x3,&y3,&x4,&y4);
ll ans=0;//白色的数量
ans=white(1,1,n,m);//这个白色的块
ans+=black(x1,y1,x2,y2);//加上涂白的黑色部分
ans-=white(x3,y3,x4,y4);//减去被涂黑的白色数
///以下是容斥部分 黑->白->黑(被多加了)
ans-=black(max(x1,x3),max(y1,y3),min(x2,x4),min(y2,y4));//减去相交部分的白色数
printf("%lld %lld\n",ans,n*m-ans);
}
return 0;
}