小米 Online Judge TCO 预选赛 Rectangle (二维差分)

题意

题解

因为是求期望，答案应该是：所有出现的面积交的和/选矩形的方案数，对于一块面积，如果它被x个矩形覆盖，那么它作为面积交就出现了(x-1)*x/2次。所以只要统计每一块面积被覆盖次数就可以了。
第一反应就是扫描线去维护每块面积对答案的贡献，然后开始敲bug。最后调了1个多小时bug，终于过了样例，怀着激动的心情提交……然后T了。1e6个矩阵做扫描线，我在想什么
然后想到用差分，把点离散化之后进行二维差分就可以得到每块面积被覆盖几次了。。
二维差分代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int mod = 1000000007;
const int maxn = 2050;
ll qm(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b&1)
            res = res*a%mod;
        a = a*a%mod;
        b >>=1;
    }
    return res;
}
int cnt = 0;
ll cc[maxn];
int num = 0;
ll x[2000], y[2000];
ll mp[maxn][maxn];
void add(ll x1, ll x2, ll y1, ll y2)
{
    if(x1 > x2)
        swap(x1,x2);
    if(y1 > y2)
        swap(y1,y2);
    x1 = lower_bound(cc,cc+num,x1) - cc;x1++;
    x2 = lower_bound(cc,cc+num,x2) - cc;
    y1 = lower_bound(cc,cc+num,y1) - cc;y1++;
    y2 = lower_bound(cc,cc+num,y2) - cc;
    mp[x1][y1]++;
    mp[x1][y2+1]--;
    mp[x2+1][y1]--;
    mp[x2+1][y2+1]++;
}
ll n;
void init()
{
    cin>>n;
    for(int i = 0; i < n; ++i)
    {
        scanf("%lld%lld",&x[i],&y[i]);
        cc[num++] = x[i];
        cc[num++] = y[i];
    }
    sort(cc,cc+num);
    num = unique(cc, cc+num) - cc;
    for(int i = 0; i < n; ++i)
    {
        for(int j = i+1; j < n; ++j)
            add(x[i], x[j], y[i], y[j]);
    };
}
void sol()
{
    ll ans = 0;
    for(int i = 1; i < num ;++i){
        for(int j = 1; j < num; ++j){
            mp[i][j] += (mp[i-1][j] + mp[i][j-1] - mp[i-1][j-1]);
            ll s = (cc[i]-cc[i-1])*(cc[j] - cc[j-1])%mod;
            ans =  (ans + (mp[i][j] * (mp[i][j] - 1) / 2%mod)*s)%mod;
        }
    }
    ll fm = (ll)n*(n-1)/2;
    fm = fm*(fm-1)/2;
    fm %= mod;
    fm = qm(fm, mod-2);
    ans = ans*fm%mod;
    ans = (ans + mod)%mod;
    printf("%lld\n",ans);
}
int main()
{
    init();
    sol();
}

辣鸡扫描线代码：

#include<bits/stdc++.h>
#define ll long long
#define mid ((l+r)>>1)
#define lson rt*2,l,mid
#define rson rt*2+1,mid+1,r
using namespace std;
int mod = 1000000007;
const int maxn = 1e6 + 50;
ll qm(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b&1)
            res = res*a%mod;
        a = a*a%mod;
        b >>=1;
    }
    return res;
}
struct node
{
    int l,r,h;
    int f;
    bool operator <(const node& x)const
    {
        return h < x.h;
    }
} e[maxn];
int cnt = 0;
void add(ll x1, ll x2, ll y1, ll y2)
{
    if(x1 > x2)
        swap(x1,x2);
    if(y1 > y2)
        swap(y1,y2);
    e[cnt].l = x1, e[cnt].r = x2, e[cnt].h = y1;
    e[cnt].f = 1;
    cnt++;
    e[cnt].l = x1, e[cnt].r = x2, e[cnt].h = y2;
    e[cnt].f = -1;
    cnt++;
}
int cc[2000];
int num = 0;
int x[2000], y[2000];
int n;
void init()
{
    cin>>n;
    for(int i = 0; i < n; ++i)
    {
        scanf("%d%d",&x[i],&y[i]);
        cc[num++] = x[i];
    }
    sort(cc,cc+num);
    num = unique(cc, cc+num) - cc;
    for(int i = 0; i < n; ++i)
    {
        for(int j = i+1; j < n; ++j)
            add(x[i], x[j], y[i], y[j]);
    }
    sort(e, e+cnt);
}
int sum[2000*4],lz[2000*4];
void up(int rt)
{
    sum[rt] = (sum[rt*2] + sum[rt*2+1])%mod;
    if(lz[rt*2]!=lz[rt*2+1])
        lz[rt] = -1;
    else
        lz[rt] = lz[2*rt];
}
void down(int rt, int l, int r)
{
    if(lz[rt] == -1)
        return;
    lz[2*rt] = lz[2*rt+1] = lz[rt];
    sum[rt*2] = (ll)(cc[mid] - cc[l-1])*((ll)lz[rt]*(lz[rt]-1)/2%mod)%mod;
    sum[rt*2+1] = (ll)(cc[r] - cc[mid])*(ll)(lz[rt]*(lz[rt]-1)/2%mod)%mod;
    return;
}
void build(int rt, int l, int r)
{
    if(l == r)
    {
        sum[rt] = lz[rt] = 0;
        return;
    }
    build(lson);
    build(rson);
}
void update(int rt, int l, int r, int L, int R, ll v)
{
    if(L <= l && r <= R)
    {
        if(lz[rt]!=-1)
        {
            lz[rt] = (lz[rt] + v)%mod;
            sum[rt] = (ll)(cc[r] - cc[l-1])*((ll)(lz[rt]-1)*lz[rt]/2)%mod;
            return;
        }
    }
    down(rt,l,r);
    if(L <= mid)
        update(lson, L, R, v);
    if(R > mid)
        update(rson, L, R, v);
    up(rt);
    return;
}
void sol()
{
    build(1,1,num-1);
    ll ans = 0;
    for(int i = 0; i < cnt-1; ++i)
    {
        int l = lower_bound(cc, cc+num, e[i].l) - cc;
        int r = lower_bound(cc, cc+num, e[i].r) - cc;
        update(1,1,num-1,l+1,r,e[i].f);
        ans = (ans + (ll)sum[1]*(e[i+1].h - e[i].h)%mod)%mod;
    }
    ll fm = (ll)n*(n-1)/2;
    fm = fm*(fm-1)/2;
    fm %= mod;
    fm = qm(fm, mod-2);
    ans = ans*fm%mod;
    ans = (ans + mod)%mod;
    printf("%lld\n",ans);
}
int main()
{
    init();
    sol();
}