Codeforces Round #337 Vika and Segments
2 seconds
256 megabytes
: standard input
standard output
Vika has an infinite sheet of squared paper. Initially all squares are white. She introduced a two-dimensional coordinate system on this sheet and drew n black horizontal and vertical segments parallel to the coordinate axes. All segments have width equal to 1 square, that means every segment occupy some set of neighbouring squares situated in one row or one column.
Your task is to calculate the number of painted cells. If a cell was painted more than once, it should be calculated exactly once.
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of segments drawn by Vika.
Each of the next n lines contains four integers x1, y1, x2 and y2 ( - 109 ≤ x1, y1, x2, y2 ≤ 109) — the coordinates of the endpoints of the segments drawn by Vika. It is guaranteed that all the segments are parallel to coordinate axes. Segments may touch, overlap and even completely coincide.
Print the number of cells painted by Vika. If a cell was painted more than once, it should be calculated exactly once in the answer.
3
0 1 2 1
1 4 1 2
0 3 2 3
8
4
-2 -1 2 -1
2 1 -2 1
-1 -2 -1 2
1 2 1 -2
16
In the first sample Vika will paint squares (0, 1), (1, 1), (2, 1), (1, 2), (1, 3), (1, 4), (0, 3) and (2, 3).
分析:
这是一道计数题,方法比较传统,离散、扫描、树状数组、求差。
首先考虑将共线的线段合并,用O(nlogn)排序后线性合并。处理后的线段都是相离的。
再考虑用水平扫描线自顶向下扫描,将线段的左右端点看作是对纵线范围数值求和,事先将纵线按照较高的y值从大大小排列。
那么用树状数组储存那些横跨当前水平扫描线y值得纵线,如果是考虑线段,那么需要同时考虑进队和出队,然而若将线段看成前缀之差,那么只需考虑进队,进行两次计算
作差即可。从而计数交点的数目。
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
typedef __int64 ll;
const int maxn = 2e5 + ;
int n, nh, nv;
int base;
map<int, int> mapi;
struct H{
int x1, x2, y;
H(int x1 = , int x2 = , int y = ) : x1(x1), x2(x2), y(y) {}
bool operator < (const H &rhs) const{
if(y < rhs.y) return ;
if(y == rhs.y && x1 < rhs.x1) return ;
if(y == rhs.y && x1 == rhs.x1 && x2 < rhs.x2) return ;
return ;
}
}h[maxn], h1[maxn]; struct V{
int y1, y2, x;
V(int y1 = , int y2 = , int x = ) : y1(y1), y2(y2), x(x) {}
bool operator < (const V &rhs) const{
if(x < rhs.x) return ;
if(x == rhs.x && y1 < rhs.y1) return ;
if(x == rhs.x && y1 == rhs.y1 && y2 < rhs.y2) return ;
return ;
}
}v[maxn]; int inv[maxn];
int buf[maxn], nbuf;
ll x[maxn]; bool cmpv(V p, V q){
if(p.y2 > q.y2) return ;
if(p.y2 == q.y2 && p.y1 > q.y1) return ;
return ;
} bool cmph(H p, H q){
if(p.y > q.y) return ;
if(p.y == q.y && p.x1 < q.x1) return ;
if(p.y == q.y && p.x1 == q.x1 && p.x2 < q.x2) return ;
return ;
} bool cmpvy2(V p, V q){
return p.y2 > q.y2;
} int low_bit(int x) { return x & (-x); } void Push(int i){
int tem = mapi[v[i].x];
while(tem <= base){
x[tem]++;
tem += low_bit(tem);
}
} ll query(int i, int j){
i = mapi[i], j = mapi[j];
ll tem = ;
while(j >= ){
tem += x[j];
j -= low_bit(j);
}
--i;
while(i >= ){
tem -= x[i];
i -= low_bit(i);
}
return tem;
} void solve(){
sort(h, h + nh);
sort(v, v + nv);
mapi.clear();
ll ans = ;
int nh1 = , nv1 = ;
int head, tail;
if(nh){
head = h[].x1, tail = h[].x2;
nbuf = ;
for(int i = ; i < nh; i++){
if(h[i].y != h[i - ].y || h[i].x1 > tail){
ans += tail - head + ;
h[nh1++] = H(head, tail, h[i - ].y);
buf[nbuf++] = head, buf[nbuf++] = tail;
head = h[i].x1, tail = h[i].x2;
}else if(h[i].x2 > tail) tail = h[i].x2;
}
ans += tail - head + ;
h[nh1++] = H(head, tail, h[nh - ].y);
buf[nbuf++] = head, buf[nbuf++] = tail;
}if(nv){
head = v[].y1, tail = v[].y2;
for(int i = ; i < nv; i++){
if(v[i].x != v[i - ].x || v[i].y1 > tail){
ans += tail - head + ;
v[nv1++] = V(head, tail, v[i - ].x);
if(v[i].x != v[i - ].x) buf[nbuf++] = v[i - ].x;
head = v[i].y1, tail = v[i].y2;
}else if(v[i].y2 > tail) tail = v[i].y2;
}
ans += tail - head + ;
v[nv1++] = V(head, tail, v[nv - ].x);
buf[nbuf++] = v[nv - ].x;
}
sort(buf, buf + nbuf);
base = ;
mapi[buf[]] = base, inv[base] = buf[];
for(int i = ; i < nbuf; i++){
if(buf[i] == buf[i - ]) continue;
mapi[buf[i]] = ++base, inv[base] = buf[i];
}
nv = nv1, nh = nh1;
sort(v, v + nv, cmpv);
sort(h, h + nh, cmph);
memset(x, , sizeof x);
int pointer = ;
while(pointer < nv && v[pointer].y2 >= h[].y) Push(pointer), ++pointer;
ll tem = query(h[].x1, h[].x2);
ans -= tem;
for(int i = ; i < nh; i++){
if(h[i].y != h[i - ].y){
while(pointer < nv && v[pointer].y2 >= h[i].y) Push(pointer), ++pointer;
}
tem = query(h[i].x1, h[i].x2);
ans -= tem;
}
for(int i = ; i < nv; i++) v[i].y2 = v[i].y1 - ;
pointer = ;
sort(v, v + nv, cmpvy2);
memset(x, , sizeof x);
while(pointer < nv && v[pointer].y2 >= h[].y) Push(pointer), ++pointer;
tem = query(h[].x1, h[].x2);
ans += tem;
for(int i = ; i < nh; i++){
if(h[i].y != h[i - ].y){
while(pointer < nv && v[pointer].y2 >= h[i].y) Push(pointer), ++pointer;
}
tem = query(h[i].x1, h[i].x2);
ans += tem;
}
printf("%I64d\n", ans);
} int main(){
//freopen("in.txt", "r", stdin);
while(~scanf("%d", &n)){
int x1, y1, x2, y2;
nh = nv = ;
for(int i = ; i < n; i++){
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
if(y1 == y2) h[nh++] = H(min(x1, x2), max(x1, x2), y1);
else v[nv++] = V(min(y1, y2), max(y1, y2), x1);
}
solve();
}
return ;
}
Codeforces Round #337 Vika and Segments的更多相关文章
- Codeforces Round #535 E2-Array and Segments (Hard version)
Codeforces Round #535 E2-Array and Segments (Hard version) 题意: 给你一个数列和一些区间,让你选择一些区间(选择的区间中的数都减一), 求最 ...
- Codeforces Round #337 (Div. 2) D. Vika and Segments 线段树扫描线
D. Vika and Segments 题目连接: http://www.codeforces.com/contest/610/problem/D Description Vika has an i ...
- Codeforces Round #337 (Div. 2) D. Vika and Segments 线段树 矩阵面积并
D. Vika and Segments Vika has an infinite sheet of squared paper. Initially all squares are whit ...
- Codeforces Round #337 (Div. 2)
水 A - Pasha and Stick #include <bits/stdc++.h> using namespace std; typedef long long ll; cons ...
- codeforces 610D D. Vika and Segments(离散化+线段树+扫描线算法)
题目链接: D. Vika and Segments time limit per test 2 seconds memory limit per test 256 megabytes input s ...
- Codeforces Round #337 (Div. 2) D. Vika and Segments (线段树+扫描线+离散化)
题目链接:http://codeforces.com/contest/610/problem/D 就是给你宽度为1的n个线段,然你求总共有多少单位的长度. 相当于用线段树求面积并,只不过宽为1,注意y ...
- Codeforces Round #337 (Div. 2) B. Vika and Squares 贪心
B. Vika and Squares 题目连接: http://www.codeforces.com/contest/610/problem/B Description Vika has n jar ...
- Codeforces Round #337 (Div. 2) B. Vika and Squares 水题
B. Vika and Squares Vika has n jars with paints of distinct colors. All the jars are numbered from ...
- Codeforces Round #337 (Div. 2) B. Vika and Squares
B. Vika and Squares time limit per test 2 seconds memory limit per test 256 megabytes input standard ...
随机推荐
- Java nio 笔记:系统IO、缓冲区、流IO、socket通道
一.Java IO 和 系统 IO 不匹配 在大多数情况下,Java 应用程序并非真的受着 I/O 的束缚.操作系统并非不能快速传送数据,让 Java 有事可做:相反,是 JVM 自身在 I/O 方面 ...
- 学习OpenCV——粒子滤波(网上两篇文章总结)
粒子滤波的理论实在是太美妙了,用一组不同权重的随机状态来逼近复杂的概率密度函数.其再非线性.非高斯系统中具有优良的特性.opencv给出了一个实现,但是没有给出范例,学习过程中发现网络上也找不到.le ...
- PostgreSQL中initdb做了什么
在使用数据库前,是启动数据库,启动数据库前是initdb(初始化数据库):一起来看一下initdb做了什么吧. 初始化数据库的操作为: ./initdb -D /usr/local/pgsql/dat ...
- JS练习题 显示登入者相关好友
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/ ...
- html 标签内部元素上下居中
<div style="width: 200px; height: 200px; border: 1px solid red; line-height: 200px;"> ...
- 树形DP+RMQ+单调队列(Bob’s Race HDU4123)
题意:有n个房子,这些房子被n-1条道路连接,有一些运动员从一个房子为起点尽可能跑最远的距离且不能通过一条道路超过两次,这些运行员不能选择同样的起点,这些运动员跑的最远距离和最近距离的差值不能超过Q, ...
- A letter to a good guy in USA
Hi Nick:Busy recently forgetting to check Yammer in box.Really nice of you to agree to provide help ...
- [原创]java WEB学习笔记62:Struts2学习之路--表单标签:form,表单标签的属性,textfield, password, hidden,submit ,textarea ,checkbox ,list, listKey 和 listValue 属性,select ,optiongroup ,checkboxlist
本博客的目的:①总结自己的学习过程,相当于学习笔记 ②将自己的经验分享给大家,相互学习,互相交流,不可商用 内容难免出现问题,欢迎指正,交流,探讨,可以留言,也可以通过以下方式联系. 本人互联网技术爱 ...
- poj: 2255
跟LEETCODE的preorder,inorder转postorder题很像 #include <iostream> #include <stdio.h> #include ...
- HDU 4069 Squiggly Sudoku(DLX)(The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4069 Problem Description Today we play a squiggly sud ...