Japan

Time Limit: 1 Sec

Memory Limit: 256 MB

题目连接

http://acm.uestc.edu.cn/#/problem/show/383

Description

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 (1≤M≤10000, 1≤N≤10000). K superhighways will be build.(1≤K≤1000000) 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

HINT

题意

左边有n个城市，右边有m个城市，然后连了k条线，问你一共有多少个交点

题解：

这种题一般和逆序数有关，于是就逆序数咯

排序之后，保证序列

代码：

//qscqesze

#include <cstdio>

#include <cmath>

#include <cstring>

#include <ctime>

#include <iostream>

#include <algorithm>

#include <set>

#include <bitset>

#include <vector>

#include <sstream>

#include <queue>

#include <typeinfo>

#include <fstream>

#include <map>

#include <stack>

typedef long long ll;

using namespace std;

//freopen("D.in","r",stdin);

//freopen("D.out","w",stdout);

#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)

#define maxn 200500

#define mod 1001

#define eps 1e-9

#define pi 3.1415926

int Num;

//const int inf=0x7fffffff;

const ll inf=;

inline ll read()

{

    ll x=,f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

//*************************************************************************************

int d[maxn];

int N = ;

struct node

{

    int x,y;

};

bool cmp(node a,node b)

{

    if(a.x==b.x)

        return a.y>b.y;

    return a.x>b.x;

}

node a[maxn];

int lowbit(int x){return x&(-x);}

void updata(int x)

{

    while(x<=N)

    {

        d[x]+=;

        x+=lowbit(x);

    }

}

int sum(int x)

{

    int ans = ;

    while(x)

    {

        ans+=d[x];

        x -= lowbit(x);

    }

    return ans;

}

int n,m,k;

int main()

{

    int t=read();

    for(int cas=;cas<=t;cas++)

    {

        memset(a,,sizeof(a));

        memset(d,,sizeof(d));

        scanf("%d%d%d",&n,&m,&k);

        for(int i=;i<=k;i++)

            a[i].x=read(),a[i].y=read();

        sort(a+,a+k+,cmp);

        int ans = ;

        for(int i=;i<=k;i++)

        {

            ans+=sum(a[i].y-);

            updata(a[i].y);

        }

        printf("Test case %d: %d\n",cas,ans);

    }

}

秒客网

cdoj 383 japan 树状数组