ural1019 Line Painting

Line Painting

Time limit: 2.0 second
Memory limit: 64 MB

The segment of numerical axis from 0 to 109 is painted into white color. After that some parts of this segment are painted into black, then some into white again and so on. In total there have been made N re-paintings (1 ≤ N ≤ 5000). You are to write a program that finds the longest white open interval after this sequence of re-paintings.

Input

The first line of input contains the only number N. Next N lines contain information about re-paintings. Each of these lines has a form:
ai bi ci
where ai and bi are integers, ci is symbol 'b' or 'w', ai, bi, ci are separated by spaces. 
This triple of parameters represents repainting of segment from ai to bi into color ci ('w' — white, 'b' — black). You may assume that 0 < ai < bi < 109.

Output

Output should contain two numbers x and y (x < y) divided by space(s). These numbers should define the longest white open interval. If there are more than one such an interval output should contain the one with the smallest x.

Sample

input	output
4 1 999999997 b 40 300 w 300 634 w 43 47 b	47 634

分析：离散化+线段树+答案二分；

　　　坑点2个：一是要把0和1e9边界考虑到，二是要注意染色和答案都是左闭右开区间；

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<int,int>
#define Lson L, mid, rt<<1
#define Rson mid+1, R, rt<<1|1
const int maxn=2e4+;
const int dis[][]={{,},{-,},{,-},{,}};
using namespace std;
ll gcd(ll p,ll q){return q==?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=;while(q){if(q&)f=f*p%mod;p=p*p%mod;q>>=;}return f;}
int n,m,k,t,c[maxn],ma;
int ans[];
struct Node
{
    int sum, lazy;
} T[maxn<<];

void PushUp(int rt)
{
    T[rt].sum = T[rt<<].sum + T[rt<<|].sum;
}

void PushDown(int L, int R, int rt)
{
    int mid = (L + R) >> ;
    int t = T[rt].lazy;
    T[rt<<].sum = t * (mid - L + );
    T[rt<<|].sum = t * (R - mid);
    T[rt<<].lazy = T[rt<<|].lazy = t;
    T[rt].lazy = ;
}

void Update(int l, int r, int v, int L, int R, int rt)
{
    if(l==L && r==R)
    {
        T[rt].lazy = v;
        T[rt].sum = v * (R - L + );
        return ;
    }
    int mid = (L + R) >> ;
    if(T[rt].lazy) PushDown(L, R, rt);
    if(r <= mid) Update(l, r, v, Lson);
    else if(l > mid) Update(l, r, v, Rson);
    else
    {
        Update(l, mid, v, Lson);
        Update(mid+, r, v, Rson);
    }
    PushUp(rt);
}
int Query(int l, int r, int L, int R, int rt)
{
    if(l==L && r== R)
    {
        return T[rt].sum;
    }
    int mid = (L + R) >> ;
    if(T[rt].lazy) PushDown(L, R, rt);
    if(r <= mid) return Query(l, r, Lson);
    else if(l > mid) return Query(l, r, Rson);
    return Query(l, mid, Lson) + Query(mid + , r, Rson);
}
struct node
{
    int x,y;
    char b[];
}a[maxn];
int main()
{
    int i,j;
    j=;
    scanf("%d",&n);
    c[j++]=,c[j++]=1e9-;
    rep(i,,n)scanf("%d%d%s",&a[i].x,&a[i].y,a[i].b),c[j++]=a[i].x,c[j++]=a[i].y,c[j++]=a[i].x-,c[j++]=a[i].y-;
    sort(c,c+j);
    int num=unique(c,c+j)-c;
    rep(i,,n)
    {
        a[i].x=lower_bound(c,c+num,a[i].x)-c+;
        a[i].y--;
        a[i].y=lower_bound(c,c+num,a[i].y)-c+;
        Update(a[i].x,a[i].y,(a[i].b[]=='b'),,num,);
    }
    rep(i,,num)
    {
        int l=i,r=num;
        while(l<=r)
        {
            int mid=l+r>>;
            if(Query(i,mid,,num,)==)
            {
                if(ma<c[mid-]-c[i-]+)
                {
                    ma=c[mid-]-c[i-]+;
                    ans[]=c[i-];
                    ans[]=c[mid-]+;
                }
                l=mid+;
            }
            else r=mid-;
        }
    }
    printf("%d %d\n",ans[],ans[]);
    //system("pause");
    return ;
}