【Codeforces 46 D . Parking Lot 】

CF 46 D
其实和poj 的hotel 是一个东西
这道题我学会了的地方是 扩树
你需要把树从 1 - n 扩展成 1 - n + b + f
思路还是很巧妙的

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl



#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 100025;
int b,f,ls[MAX_N<<2],rs[MAX_N<<2],ms[MAX_N<<2],col[MAX_N<<2];
int Max(int a,int b){if(a>b) return a;return b;}
struct node
{
    int x,y;
}car[MAX_N];
void up(int rt,int l,int r)
{
    ls[rt] = ls[rt<<1];
    rs[rt] = rs[rt<<1|1];
    if(ls[rt]==mid -l + 1) ls[rt] += ls[rt<<1|1];
    if(rs[rt]==r-mid) rs[rt] += rs[rt<<1];
    ms[rt] = Max(rs[rt<<1] + ls[rt<<1|1],Max(ms[rt<<1],ms[rt<<1|1]));
}
void down(int rt,int l,int r)
{
    if(col[rt]!=-1)
    {
        col[rt<<1] = col[rt<<1|1] = col[rt];
        ms[rt<<1] = rs[rt<<1] = ls[rt<<1] = col[rt]?0:mid-l+1;
        ms[rt<<1|1] = rs[rt<<1|1] = ls[rt<<1|1] = col[rt]?0:r-mid;
        col[rt] = -1;
    }
}
void build(int rt,int l,int r)
{
    ls[rt] = ms[rt] = rs[rt] = r-l+1;
    col[rt] = -1;
    if(l==r)
    {
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt,l,r);
}
void update(int rt,int l,int r,int x,int y,int v)
{
    if(x<=l&&r<=y)
    {
        col[rt] = v;
        ms[rt] = ls[rt] = rs[rt] = v?0:r-l+1;
        return;
    }
    down(rt,l,r);
    if(x>mid) update(rt<<1|1,mid+1,r,x,y,v);
    else if(y<=mid) update(rt<<1,l,mid,x,y,v);
    else update(rt<<1,l,mid,x,y,v),update(rt<<1|1,mid+1,r,x,y,v);
    up(rt,l,r);
}
int query(int rt,int l,int r,int x,int y,int v)
{
    if(l==r) return l;
    down(rt,l,r);
    if(ms[rt<<1]>=v) return query(rt<<1,l,mid,x,y,v);
    else if(rs[rt<<1] + ls[rt<<1|1] >=v) return mid - rs[rt<<1] + 1  ;
    else return query(rt<<1|1,mid+1,r,x,y,v);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int x,y,cnt = 0,Q,L;
    scanf("%d%d%d",&L,&b,&f);
    L = L+b+f;
    build(1,1,L);
    scanf("%d",&Q);
    while(Q--)
    {
        scanf("%d%d",&x,&y);
        cnt++;
        if(x==1)
        {
            if(ms[1]<y+b+f)
            {
                printf("-1\n");
                continue;
            }
            car[cnt].y = y;
            car[cnt].x = query(1,1,L,1,L,y+b+f);
            update(1,1,L,car[cnt].x +b,car[cnt].x+y-1+b,1);
            printf("%d\n",car[cnt].x-1);
        }
        else
        {
            update(1,1,L,car[y].x+b,car[y].x+car[y].y-1+b,0);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}