cf540E. Infinite Inversions

链接

点击跳转

题解

离散化的精髓：左闭右开

这个直接离散化然后直接交换，然后求逆序对就行了

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ll n, u[maxn], v[maxn], a[maxn], b[maxn];
map<ll,ll> sz;
struct BIT
{
    ll bit[maxn], n;
    void init(int N){n=N;for(int i=1;i<=n;i++)bit[i]=0;}
    ll lowbit(ll x){return x&(-x);}
    void add(ll pos, ll v)
    {
        for(;pos<=n;pos+=lowbit(pos))bit[pos]+=v;
    }
    ll sum(ll pos)
    {
        ll ans(0);
        for(;pos;pos-=lowbit(pos))ans+=bit[pos];
        return ans;
    }
}bit;
struct Lisan
{
    int tmp[maxn], tot;
    void clear(){tot=0;}
    void insert(int x){tmp[++tot]=x;}
    void run()
    {
        sort(tmp+1,tmp+tot+1);
        tot=unique(tmp+1,tmp+tot+1)-tmp-1;
    }
    void lisan(int *a, int len)
    {
        for(int i=1;i<=len;i++)a[i]=lower_bound(tmp+1,tmp+tot+1,a[i])-tmp;
    }
    int lisan(int x)
    {
        return lower_bound(tmp+1,tmp+tot+1,x)-tmp;
    }
}ls;
int main()
{
    ll n, i, j;
    n=read();
    rep(i,n)
    {
        u[i]=read(), v[i]=read();
        ls.insert(u[i]);
        ls.insert(u[i]+1);
        ls.insert(v[i]);
        ls.insert(v[i]+1);
    }
    ls.insert(1);
    ls.run();
    rep(i,ls.tot)a[i]=i;
    rep(i,ls.tot)b[i]=ls.tmp[i+1]-ls.tmp[i];
    rep(i,n)
    {
        ll x=ls.lisan(u[i]), y=ls.lisan(v[i]);
        swap(a[x],a[y]);
    }
    bit.init(ls.tot);
    ll ans=0;
    rep(i,ls.tot-1)
    {
        ans += b[i] * ( bit.sum(ls.tot) - bit.sum(a[i]) );
        bit.add(a[i],b[i]);
    }
    printf("%lld",ans);
    return 0;
}