山东省第九届省赛F题 Four-tuples(容斥定理)

Four-tuples

时间限制: 10 Sec  内存限制: 128 MB

题目描述

Given l1,r1,l2,r2,l3,r3,l4,r4, please count the number of four-tuples (x1,x2,x3,x4) such that li≤ xi≤ ri and x1≠x2,x2≠x3,x3≠x4,x4≠x1. The answer should modulo 10^9+7 before output.

输入

The input consists of several test cases. The first line gives the number of test cases, T(1≤ T≤ 10^6).
For each test case, the input contains one line with 8 integers l1,r1,l2, r2, l3,r3,l4,r4(1≤ li≤ ri≤ 10^9)

输出

For each test case, output one line containing one integer, representing the answer.

样例输入

1

1 1 2 2 3 3 4 4

样例输出

1

Hint

Source

2018 Shandong ACM programing real contest, on-site problem replay

 

Submit Status

解题报告：容斥原理

公式：|A∪B∪C∪D|=|A|+|B|+|C|+|D|-|A ∩B|-|A ∩C|-|A ∩D|- |B∩C| - |B∩D| - |C∩D|+|A∩B∩C|+|A∩B∩D|+|A∩C∩D|+|B∩C∩D| 

-|A ∩B ∩C ∩D|

第一种特殊情况 A： x1 = x2  , 第二种特殊情况 B： x2 = x3  , 第三种特殊情况 C： x3 = x4  , 第四种特殊情况 D： x4 = x1  

总情况 sum = （r1 - l1 + 1）*（r2 - l2 + 1）*（r3 - l3 + 1）*（r4 - l4 + 1）

总特殊情况：使用容斥定理

需要注意的是 A ∩ B ∩ C 和 A ∩Ｂ∩Ｃ∩Ｄ　因为等号具有传递性，所以是一样的，即三交集与四交集都一样。

结果 = 总情况 - 总特殊情况

注意：

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <cstring>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <stdlib.h>
#include <list>
#include <map>
#include <utility>
#include <set>
#include <bitset>
#include <vector>
#define pi acos(-1.0)
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3fLL
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
int gcd(int x, int y){if(y==0)return x;return gcd(y, x%y);}
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;}

ll mod=1e9+7;
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {

        ll l1, r1, l2, r2, l3, r3, l4, r4;
        ll acl, acr, accl, accr;
        scanf("%lld%lld%lld%lld%lld%lld%lld%lld", &l1, &r1, &l2, &r2, &l3, &r3, &l4, &r4);

        ll ans=(r1-l1+1)%mod*(r2-l2+1)%mod*(r3-l3+1)%mod*(r4-l4+1)%mod;

        //x1==x2
        acl=max(l1, l2);
        acr=min(r1, r2);
        if(acl<=acr)
            ans = ((ans-(acr-acl+1)*(r3-l3+1)%mod*(r4-l4+1)%mod)%mod+mod)%mod;

        //x2==x3
        acl=max(l2, l3);
        acr=min(r2, r3);
        if(acl<=acr)
            ans = ((ans-(acr-acl+1)*(r4-l4+1)%mod*(r1-l1+1)%mod)%mod+mod)%mod;

        //x3==x4
        acl=max(l3, l4);
        acr=min(r3, r4);
        if(acl<=acr)
            ans = ((ans-(acr-acl+1)*(r1-l1+1)%mod*(r2-l2+1)%mod)%mod+mod)%mod;

        //x1==x4
        acl=max(l1, l4);
        acr=min(r1, r4);
        if(acl<=acr)
            ans = ((ans-(acr-acl+1)*(r2-l2+1)%mod*(r3-l3+1)%mod)%mod+mod)%mod;

        //x1==x2 && x2==x3
        acl=max(l1, max(l2, l3));
        acr=min(r1, min(r2, r3));
        if(acl<=acr)
            ans = (ans+(acr-acl+1)*(r4-l4+1)%mod)%mod;

        //x1==x2 && x1==x4
        acl=max(l1, max(l2, l4));
        acr=min(r1, min(r2, r4));
        if(acl<=acr)
            ans = (ans+(acr-acl+1)*(r3-l3+1)%mod)%mod;

        //x1==x2 && x3==x4
        acl=max(l1, l2);
        acr=min(r1, r2);
        accl=max(l3, l4);
        accr=min(r3, r4);
        if(acr>=acl && accr>=accl)
            ans = (ans+(acr-acl+1)*(accr-accl+1)%mod)%mod;

        //x2==x3 && x3==x4
        acl=max(l2, max(l3, l4));
        acr=min(r2, min(r3, r4));
        if(acl<=acr)
            ans = (ans+(acr-acl+1)*(r1-l1+1)%mod)%mod;

        //x2==x3 && x1==x4
        acl=max(l3, l2);
        acr=min(r3, r2);
        accl=max(l1, l4);
        accr=min(r1, r4);
        if(acr>=acl && accr>=accl)
            ans = (ans+(acr-acl+1)*(accr-accl+1)%mod)%mod;

        //x3==x4 && x1==x4
        acl=max(l1, max(l3, l4));
        acr=min(r1, min(r3, r4));
        if(acl<=acr)
            ans = (ans+(acr-acl+1)*(r2-l2+1)%mod)%mod;

        //x1==x2 && x2==x3 && x3==x4
        acl=max(max(l1, l2),max(l3, l4));
        acr=min(min(r1, r2),min(r3, r4));
        if(acl<=acr)
            ans = ((ans-(acr-acl+1)*3)%mod+mod)%mod;

        printf("%lld\n", ans);

    }

    return 0;
}