zoukankan      html  css  js  c++  java
  • cdoj 383 japan 树状数组

    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 (1M100001N10000). K superhighways will be build.(1K1000000) 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 – NMK. 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=999999999;
    inline ll read()
    {
        ll x=0,f=1;char ch=getchar();
        while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
        while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
        return x*f;
    }
    //*************************************************************************************
    
    int d[maxn];
    int N = 10050;
    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]+=1;
            x+=lowbit(x);
        }
    }
    int sum(int x)
    {
        int ans = 0;
        while(x)
        {
            ans+=d[x];
            x -= lowbit(x);
        }
        return ans;
    }
    int n,m,k;
    int main()
    {
        int t=read();
        for(int cas=1;cas<=t;cas++)
        {
            memset(a,0,sizeof(a));
            memset(d,0,sizeof(d));
            scanf("%d%d%d",&n,&m,&k);
            for(int i=1;i<=k;i++)
                a[i].x=read(),a[i].y=read();
            sort(a+1,a+k+1,cmp);
            int ans = 0;
            for(int i=1;i<=k;i++)
            {
                ans+=sum(a[i].y-1);
                updata(a[i].y);
            }
            printf("Test case %d: %d
    ",cas,ans);
    
        }
    }
  • 相关阅读:
    20080408 VS2003 中 Jscript 文件中文乱码问题
    20080330 single process memory on Windows and Windows virtual memory
    20080331 Corillian's product is a Component Container Name at least 3 component containers that ship now with the Windows Server Family
    20080330 the difference between an EXE and a DLL
    20080408 Javascript中的字符串替换replaceG
    20080501 修复Windows Update 自动更新
    20080331 How many processes can listen on a single TCPIP port
    20080329 What is a Windows Service and how does its lifecycle differ from a standard EXE
    20080407 Fire in the hole
    20080328 Adobe Launches Webbased Photoshop Express
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4799679.html
Copyright © 2011-2022 走看看