POJ 3067 Japan (树状数组求逆序数---经典)
来源:互联网 发布:apple id被盗 mac被锁 编辑:程序博客网 时间:2024/05/22 07:49
Japan
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27472 Accepted: 7430
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 (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)
Test case (case number): (number of crossings)
Sample Input
13 4 41 42 33 23 1
Sample Output
Test case 1: 5
这题有巨坑!!!没指明K的范围,K的范围在10^6左右!!输出用long long 型
题意:日本东、西两沿海城市修高速公路,求交点总个数(交点处最多有两条公路)
分析:用树状数组做,a表示东边沿海城市,b表示西边沿海城市,先将ai从小到大排序,若ai==bi,则按bi小到大排序,然后求逆序数就行了。
AC代码:
#include<cstdio>#include<cstring>#include<algorithm> using namespace std;const int maxn=1e6+10;struct node{int a,b;}nt[maxn];int C[1010];int N,M,K;bool cmp(const node& n1,const node& n2){return n1.a<n2.a || (n1.a==n2.a&&n1.b<n2.b); }int lowbit(int i){return i&-i;}void update(int i){while(i<=M){C[i]++;i+=lowbit(i);}}int sum(int i){int ans=0;while(i){ans+=C[i];i-=lowbit(i);}return ans;}int main(){int T;scanf("%d",&T);int cnt=0;while(T--){scanf("%d%d%d",&N,&M,&K);for(int i=0;i<K;i++){scanf("%d%d",&nt[i].a,&nt[i].b);}sort(nt,nt+K,cmp);memset(C,0,sizeof(C));long long tol=0;for(int i=K-1;i>=0;i--){update(nt[i].b);tol+=sum(nt[i].b-1);}printf("Test case %d: %lld\n",++cnt,tol);}return 0;}
1 0
- POJ 3067 Japan (树状数组求逆序数---经典)
- POJ 3067 Japan (树状数组求逆序数)
- POJ 3067 Japan(树状数组/求逆序数)
- 【树状数组】poj 3067 Japan(树状数组求逆序数)
- poj 3067 Japan 树状数组求逆序数
- POJ 3067 Japan(树状数组:求逆序)
- POJ 3067 Japan(树状数组:求逆序)
- poj--3067 Japan(树状数组+逆序数)
- POJ 3067 Japan (树状数组 + 逆序数)
- POJ 3067 Japan(树状数组求逆序对)
- POJ 3067 Japan(树状数组+逆序数)
- POJ 3067-Japan(树状数组-逆序数)
- 【树状数组--求逆序数】poj3067 Japan
- pku 3067 Japan 树状数组求逆序数
- POJ 3067 Japan 树状数组求逆序对
- poj 3067 Japan 树状数组求逆序对
- POJ 3067 Japan (树状数组求逆序对)
- POJ 3067 Japan(树状数组求逆序对个数)
- 基于ARM9的伪指令汇总
- 平时学习用到的一些资料的记录
- [编程题] 奇怪的表达式求值
- hdu 4826 Labyrinth
- Message类源码
- POJ 3067 Japan (树状数组求逆序数---经典)
- lintcode/leetcode由易至难第1题:返回第n个斐波那契数
- ch追妹 博弈
- 读书笔记——简介
- Nginx开发从入门到精通
- 二叉树的路径和
- js调整浏览器窗口大小
- zoj 3962 Seven Segment Display 数位dp
- LeetCode #455: Assign Cookies