HDU - 6681 Rikka with Cake

最新推荐文章于 2019-11-16 11:07:21 发布

你先画个包络面

最新推荐文章于 2019-11-16 11:07:21 发布

阅读量257

点赞数

分类专栏： ACM练习文章标签： ACM C/C++

本文链接：https://blog.csdn.net/qq_43549984/article/details/99762559

版权

ACM练习专栏收录该内容

50 篇文章 0 订阅

订阅专栏

Rikka with Cake

Time Limit: 6000/3000 MS (Java/Others)
Memory Limit: 524288/524288 K (Java/Others)

Problem Description

Rikka’s birthday is on June 12th. The story of this problem happens on that day.

Today is Rikka’s birthday. Yuta prepares a big cake for her: the shape of this cake is a rectangular of n centimeters times m centimeters. With the guidance of a grimoire, Rikka is going to cut the cake.

For simplicity, Rikka firstly builds a Cartesian coordinate system on the cake: the coordinate of the left bottom corner is $(0, 0)$ while that of the right top corner is $(n, m)$ . There are $K$ instructions on the grimoire: The $i$ th cut is a ray starting from $x_i,y_i)$ while the direction is $D_i$ . There are four possible directions: $L$ , passes $x_i−1,y_i)$ ; $R$ , passes $x_i+1,y_i)$ ; $U$ , passes $x_i,y_i+1)$ ; $D$ , passes $x_i,y_i−1)$ .

Take advantage of the infinite power of Tyrant’s Eye, Rikka finishes all the instructions quickly. Now she wants to count the number of pieces of the cake. However, since a huge number of cuts have been done, the number of pieces can be very large. Therefore, Rikka wants you to finish this task.

Input

The first line of the input contains a single integer $T (1 \leq T \leq 100)$ , the number of the test cases.

For each test case, the first line contains three positive integers $n,m,K(1≤n,m≤10^9,1≤K≤10^5)$ , which represents the shape of the cake and the number of instructions on the grimoire.

Then K lines follow, the ith line contains two integers %xi,yi(1≤xi<n,1≤yi<m)% and a char $D_i∈$ {‘L’,‘R’,‘U’,‘D’}, which describes the $i$ th cut.

The input guarantees that there are no more than 5 test cases with $K > 1000$ , and no two cuts share the same $x$ coordinate or $y$ coordinate, i.e., $\forall 1 \leq i < j \leq K$ , $x_i≠x_j$ and $y_i≠y_j$ .

Output

For each test case, output a single line with a single integer, the number of pieces of the cake.

Hint

The left image and the right image show the results of the first and the second test case in the sample input respectively. Clearly, the answer to the first test case is 3 while the second one is 5.

alt

Sample Input

Sample Output

3
5

Tips

题意

一个 $n\times m$ 的矩形，左下角的坐标为 $(0, 0)$ ，右上角的坐标为 $(n, m)$ 。现给定 $K$ 条射线，每条射线的出发点都在矩形内部，且同一个横纵坐标上最多只有一个起点。问这些射线将矩形分成多少个部分。

题解

不难发现，最终的答案为射线的交点数加一。

当然，我们也可以证明。证明需要用到欧拉公式 $V - E + F = 2$ 。

设射线的交点共 $c$ 个。则在这个图中， $V = K + 4 + K + c = 2 K + c + 4$ ， $E=2\sum (c_i+1)+K+4=2K+2c+4$ 。因此 $F = 2 - V + E = c + 2$ 。减去外面的无穷区域，得出答案为 $c + 1$ 。

下面只需将坐标离散化然后用线段数求解即可。

首先从左向右考虑，我们用线段数存储每一个纵坐标上已经有多少条上下方向的射线经过，然后每遇到一条向左的边，则交点数加上这个纵坐标对应的射线数。然后从右向左考虑，存储每个纵坐标经过上下方向射线的数量，每遇到一条向右的射线，则交点数加上对应值。

最终，输出交点数加一即可。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+10;
struct Line{
    int x,y;
    char d;
}line[MAXN];
ll tree[MAXN<<2],lazy[MAXN<<2];
bool cmpx(const Line &a,const Line &b){return a.x<b.x;}
bool cmpy(const Line &a,const Line &b){return a.y<b.y;}
int K;
void build(int rt=1,int l=1,int r=K){
    tree[rt]=lazy[rt]=0;
    if (l!=r){
        int mid=(l+r)>>1;
        build(rt<<1,l,mid);
        build(rt<<1|1,mid+1,r);
    }
}
void update(int a,int b,int rt=1,int l=1,int r=K){
    if (a>r||b<l) return;
    else if (a<=l&&b>=r){
        ++lazy[rt];
        tree[rt]+=r-l+1;
    }
    else{
        int mid=(l+r)>>1;
        update(a,b,rt<<1,l,mid);
        update(a,b,rt<<1|1,mid+1,r);
    }
}
inline void push_down(int rt,int l,int r){
    int mid=(l+r)>>1;
    lazy[rt<<1]+=lazy[rt];
    tree[rt<<1]+=1LL*(mid-l+1)*lazy[rt];
    lazy[rt<<1|1]+=lazy[rt];
    tree[rt<<1|1]+=1LL*(r-mid)*lazy[rt];
    lazy[rt]=0;
}
ll query(int y,int rt=1,int l=1,int r=K){
    if (l==y&&r==y) return tree[rt];
    else if (l<=y&&r>=y){
        push_down(rt,l,r);
        int mid=(l+r)>>1;
        if (mid>=y) return query(y,rt<<1,l,mid);
        else return query(y,rt<<1|1,mid+1,r);
    }
    return 0;
}
int t,n,m;
int main(){
    scanf("%d",&t);
    while (t--){
        scanf("%d%d%d",&n,&m,&K);
        for (int i=0;i<K;++i)
            scanf("%d%d %c",&line[i].x,&line[i].y,&line[i].d);
        sort(line,line+K,cmpy);
        for (int i=0;i<K;++i)
            line[i].y=i+1;
        sort(line,line+K,cmpx);
        ll res(0);
        build();
        for (int i=0;i<K;++i){
            if (line[i].d=='U') update(line[i].y,K);
            else if (line[i].d=='D') update(1,line[i].y);
            else if (line[i].d=='L') res+=query(line[i].y);
        }
        build();
        for (int i=K-1;i>=0;--i){
            if (line[i].d=='U') update(line[i].y,K);
            else if (line[i].d=='D') update(1,line[i].y);
            else if (line[i].d=='R') res+=query(line[i].y);
        }
        printf("%lld\n",++res);
    }
}