2016暑假多校联合---Counting Intersections
The input data guarantee that no two segments share the same endpoint, no covered segments, and no segments with length 0.
The first line of each test case contains a number n(1<=n<=100000), the number of segments. Next n lines, each with for integers, x1, y1, x2, y2, means the two endpoints of a segment. The absolute value of the coordinate is no larger than 1e9.
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
typedef long long LL;
LL ax[],ay[];
LL c[];
LL Lowbit(LL t)
{
return t&(t^(t-));
}
LL Sum(LL x)
{
LL sum = ;
while(x > )
{
sum += c[x];
x -= Lowbit(x);
}
return sum;
}
void add(LL li,LL d)
{
while(li<)
{
c[li]+=d;
li=li+Lowbit(li);
}
} struct Nodex
{
LL x1,x2;
LL y;
}nodex[]; struct Nodey
{
LL y1,y2;
LL x;
}nodey[]; struct Node
{
LL x;
LL y;
}node[]; bool cmp1(const Nodey s1,const Nodey s2)
{
return s1.x<s2.x;
} bool cmp2(const Node s1,const Node s2)
{
return s1.x<s2.x;
}
map<LL,LL>q1;
map<LL,LL>q2; int main()
{
LL T,n;
scanf("%I64d",&T);
while(T--)
{
q1.clear();
q2.clear();
scanf("%I64d",&n);
LL tot1=,tot2=;
for(LL i=;i<n;i++)
{
LL x1,x2,y1,y2;
scanf("%I64d%I64d%I64d%I64d",&x1,&y1,&x2,&y2);
if(x1==x2)
{
nodey[tot2].y1=min(y1,y2);
nodey[tot2].y2=max(y1,y2);
nodey[tot2++].x=x1;
}
else
{
nodex[tot1].x1=min(x1,x2);
nodex[tot1].x2=max(x1,x2);
nodex[tot1++].y=y1;
}
} LL num1,num2;
for(LL i=;i<tot1;i++)
{
ax[i*]=nodex[i].x1;
ax[i*+]=nodex[i].x2;
}
num1=*tot1;
for(LL i=;i<tot2;i++)
{
ax[num1++]=nodey[i].x;
}
sort(ax,ax+num1);
LL tot=,pre=-;
for(LL i=;i<num1;i++)
{
if(ax[i]!=pre)
{
pre=ax[i];
q1[pre]=++tot;
}
} for(LL i=;i<tot2;i++)
{
ay[i*]=nodey[i].y1;
ay[i*+]=nodey[i].y2;
}
num2=*tot2;
for(LL i=;i<tot1;i++)
ay[num2++]=nodex[i].y;
sort(ay,ay+num2);
tot=,pre=-;
for(LL i=;i<num2;i++)
{
if(ay[i]!=pre)
{
pre=ay[i];
q2[pre]=++tot;
}
} for(LL i=;i<tot1;i++)
{
nodex[i].x1=q1[nodex[i].x1];
nodex[i].x2=q1[nodex[i].x2];
nodex[i].y=q2[nodex[i].y];
}
for(LL i=;i<tot2;i++)
{
nodey[i].y1=q2[nodey[i].y1];
nodey[i].y2=q2[nodey[i].y2];
nodey[i].x=q1[nodey[i].x];
} //for(LL i=0;i<tot1;i++)
//cout<<"x: "<<nodex[i].x1<<" "<<nodex[i].x2<<" "<<nodex[i].y<<endl;
//for(LL i=0;i<tot1;i++)
//cout<<"y: "<<nodey[i].y1<<" "<<nodey[i].y2<<" "<<nodey[i].x<<endl;
sort(nodey,nodey+tot2,cmp1);
tot=;
for(LL i=;i<tot1;i++)
{
node[tot].x=nodex[i].x1;
node[tot++].y=nodex[i].y;
node[tot].x=nodex[i].x2+;
node[tot++].y=-nodex[i].y;
}
sort(node,node+tot,cmp2);
LL j=,k=,sum=;
memset(c,,sizeof(c));
for(LL i=;i<=;i++)
{
while(node[j].x==i&&j<tot)
{
if(node[j].y>)
add(node[j].y,);
else
add(-node[j].y,-);
j++;
}
while(nodey[k].x==i&&k<tot2)
{
sum+=Sum(nodey[k].y2)-Sum(nodey[k].y1-);
k++;
}
if(j>=tot) break;
if(k>=tot2) break;
}
printf("%I64d\n",sum);
}
return ;
}
2016暑假多校联合---Counting Intersections的更多相关文章
- 2016暑假多校联合---Rikka with Sequence (线段树)
2016暑假多校联合---Rikka with Sequence (线段树) Problem Description As we know, Rikka is poor at math. Yuta i ...
- 2016暑假多校联合---Windows 10
2016暑假多校联合---Windows 10(HDU:5802) Problem Description Long long ago, there was an old monk living on ...
- 2016暑假多校联合---Substring(后缀数组)
2016暑假多校联合---Substring Problem Description ?? is practicing his program skill, and now he is given a ...
- 2016暑假多校联合---To My Girlfriend
2016暑假多校联合---To My Girlfriend Problem Description Dear Guo I never forget the moment I met with you. ...
- 2016暑假多校联合---A Simple Chess
2016暑假多校联合---A Simple Chess Problem Description There is a n×m board, a chess want to go to the po ...
- 2016暑假多校联合---Another Meaning
2016暑假多校联合---Another Meaning Problem Description As is known to all, in many cases, a word has two m ...
- 2016暑假多校联合---Death Sequence(递推、前向星)
原题链接 Problem Description You may heard of the Joseph Problem, the story comes from a Jewish historia ...
- 2016暑假多校联合---Joint Stacks (STL)
HDU 5818 Problem Description A stack is a data structure in which all insertions and deletions of e ...
- 2016暑假多校联合---GCD
Problem Description Give you a sequence of N(N≤100,000) integers : a1,...,an(0<ai≤1000,000,000). ...
随机推荐
- PHP数据库操作:使用ORM
之前我发了一篇博文PHP数据库操作:从MySQL原生API到PDO,向大家展示PHP是如何使用MySQL原生API.MySQLi面向过程.MySQLi面向对象.PDO操作MySQL数据库的.本文介绍如 ...
- Java程序员的日常 —— 多进程开发IO阻塞问题
本篇仍旧是源于最近的工作,总结一下纪念那些年埋下的坑... 背景故事 需求:"使用进程方式启动另一个程序!" 开发:"OK! Runtime.getRuntime().e ...
- Linux初学 - Elasticsearch环境安装
下载 https://www.elastic.co/downloads/elasticsearch 安装 rpm -ivh 也可以双击rpm包安装 修改elastaticsearch host配置 修 ...
- github无法访问?试试修改hosts
github国内无法访问时,可以试试如下修改hosts,亲测有效: 204.232.175.78 http://documentcloud.github.com 207.97.227.239 http ...
- fir.im Weekly - 除了写代码,还需要了解什么
雾霾天,宜撸代码.吹牛,不宜出门约会(¬_¬)ノ 本期 fir.im Weekly 亦如往期,收集了优秀的 iOS/Android 开发资源,GitHub 源码.前端方面的热点分享.除了代码,也许你 ...
- 转载:Spring AOP (下)
昨天记录了Spring AOP学习的一部分(http://www.cnblogs.com/yanbincn/archive/2012/08/13/2635413.html),本来是想一口气梳理完的.但 ...
- 快速入门系列--WCF--01基础概念
转眼微软的WCF已走过十个年头,它是微软通信框架的集大成者,将之前微软所有的通信框架进行了整合,提供了统一的应用方式.记得从自己最开始做MFC时,就使用过Named Pipe命名管道,之后做Winfo ...
- JS原生第二篇 (帅哥)
1.1 Javascript 作用 1. 网页特效 2. 用户交互 3. 表单验证 Js 就是可以用来控制 结构 和 样式 . 1.2 体验js 认识常用的三个输出语句. 都属于 ...
- HDU 1024Max Sum Plus Plus(最大m字段和)
/* 动态转移方程:dp[i][j]=max(dp[i-1]+a[i], max(dp[t][j-1])+a[i]) (j-1<=t<i) 表示的是前i个数j个字段和的最大值是多少! */ ...
- 使用webpack打包ThinkPHP的资源文件
使用webpack打包ThinkPHP的资源文件 利用自己的空余时间一直在维护http://www.wx2share.com这个小网站,全是一个人在弄,由于只租得起虚拟空间,所以后台采用了简单方便的T ...