Pizza Cutter Gym - 101908C

https://cn.vjudge.net/problem/Gym-101908C 

思路：离散加逆序对；

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=2e6+9;
const int maxm=1e6+9;

struct point
{
    int x,y;
    bool operator < (const point &b)const
    {
        return x<b.x;
    }
}p[maxn];

int c[maxn];
int yy[maxn];

void add(int x,int val)
{
    while(x<=maxn)
    {
        c[x]+=val;
        x+=lowbit(x);
    }
}
ll query(int x)
{
    ll ans=0;
    while(x>0)
    {
        ans+=c[x];
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n,m;
    cin>>n>>m;
    int h,v;
    cin>>h>>v;
    for(int i=0;i<h;i++)
    {
        cin>>p[i].x>>p[i].y;
        yy[i]=p[i].y;
    }
    sort(p,p+h);
    ll ans=0;
    //fl();
    sort(yy,yy+h);
    int len=unique(yy,yy+h)-yy;
    //cout<<len<<endl;
    for(int i=h-1;i>=0;i--)
    {
        int pos=lower_bound(yy,yy+len,p[i].y)-yy+1;
        ans=ans+query(pos)+1;
        //cout<<p[i].x<<" "<<p[i].y<<" "<<query(p[i].y)<<endl;
        add(pos,1);
    }
    //fl();
    //cout<<ans<<endl;
    for(int i=0;i<v;i++)
    {
        cin>>p[i].x>>p[i].y;
        yy[i]=p[i].y;
    }
    sort(p,p+v);
    sort(yy,yy+v);
    len=unique(yy,yy+v)-yy;
    ans++;
    mem(c,0);
    for(int i=v-1;i>=0;i--)
    {
        int pos=lower_bound(yy,yy+len,p[i].y)-yy+1;
        ans=ans+query(pos)+h+1;
        //cout<<query(p[i].y)<<endl;
        add(pos,1);
    }
    cout<<ans<<endl;

    return 0;
}