Japan (POJ 3067)

Japan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <= 1000, N <= 1000). K superhighways will be build. Cities on each coast are numbered 1, 2, ... from North to South. Each superhighway is straight line and connects city on the East coast with city of the West coast. The funding for the construction is guaranteed by ACM. A major portion of the sum is determined by the number of crossings between superhighways. At most two superhighways cross at one location. Write a program that calculates the number of the crossings between superhighways.

Input

The input file starts with T - the number of test cases. Each test case starts with three numbers – N, M, K. Each of the next K lines contains two numbers – the numbers of cities connected by the superhighway. The first one is the number of the city on the East coast and second one is the number of the city of the West coast.

Output

For each test case write one line on the standard output: 
Test case (case number): (number of crossings)

Sample Input

1
3 4 4
1 4
2 3
3 2
3 1

Sample Output

Test case 1: 5

题解：水平方向有2n个城市点，他们分别按顺序分布在平行的两条直线上，编号都是从1到n。然后现在在上直线与下直线的两个城市点之间建公路，一共建k条公路。问你这k条公路一共有多少个交点(保证最多只有两条公路会交于同一点)？        这题画个图就一目了然了，我们将获得所有边以y坐标从小到大排序，如果y坐标相同，则x坐标小的排在前面。那么我们当前扫描到的xi，yi边有多少个交点？只要看xi前面有多少个xj(j<=i-1)是大于xi的就行。这就是xi的逆序数。该题就转化为求排序后的x坐标的逆序数之和了。结果要用long long保存。

代码如下：

#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <ctime>
#define maxn 32007
#define N 1000005
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define eps 0.000000001
#define read(x) scanf("%d",&x)
#define put(x) printf("%d\n",x)
#define Debug(x) cout<<x<<" "<<endl
#define lson i << 1,l,m
#define rson i << 1 | 1,m + 1,r
using namespace std;
typedef long long ll;
int c[N];
int n,x,y;

struct node
{
    int l,r,id;
}a[N];
int cmp(node a,node b)
{
    if(a.l!=b.l)
        return a.l<b.l;
    return a.r<b.r;
}
void add(int k,int d)
{
    while(k<=y)
    {
        c[k]+=d;
        k+=lowbit(k);
    }
}
int sum(int k)
{
    int ret=0;
    while(k>0)
    {
        ret+=c[k];
        k-=lowbit(k);
    }
    return ret;
}
ll ans;
int main()
{
    int t,cnt=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&x,&y,&n);
        memset(c,0,sizeof(c));
        for(int i=1;i<=n;i++)
            scanf("%d%d",&a[i].l,&a[i].r);
        sort(a+1,a+n+1,cmp);
        ans=0;
        for(int i=1;i<=n;i++)
        {
            add(a[i].r,1);
            ans+=sum(y)-sum(a[i].r);
        }
        printf("Test case %d: %lld\n",cnt++,ans);
    }
    return 0;
}