CF-46D-Parking Lot (line tree), cf-46d-parkinglot

CF-46D-Parking Lot (line tree), cf-46d-parkinglot

Nowadays it is becoming increasingly difficult to park a car in cities successfully. Let's imagine a segment of a street as longLMeters along which a parking lot is located. drivers shocould park their cars strictly parallel to the pavement on the right side of the street (remember that in the country the authors of the tasks come from the driving is right side !). Every driver when parking wants to leave for themselves some extra space to move their car freely, that's why a driver is looking for a place where the distance between his car and the one behind his will be no lessBMeters and the distance between his car and the one in front of his will be no lessFMeters (if there's no car behind then the car can be parked at the parking lot segment edge; the same is true for the case when there're no cars parked in front of the car ). let's introduce an axis of coordinates along the pavement. let the parking lot begin at point 0 and end at pointL. The drivers drive in the direction of the coordinates 'creasing and look for the earliest place (with the smallest possible coordinate) where they can park the car. in case there's no such place, the driver drives on searching for his perfect peaceful haven. sometimes some cars leave the street and free some space for parking. considering that there never are two moving cars on a street at a time write a program that can use the data on the drivers, entering the street hoping to park there and the drivers leaving it, to model the process and determine a parking lot space for each car.

Input

The first line contains three integersL,BBytesF(10 cores ≤ CoresLLimit ≤ limit 100000, limit 1 limit ≤ limitB, Bytes,FLimit ≤ limit 100). The second line contains an integerN(1 digit ≤ DigitNLimit ≤ limit 100) that indicates the number of requests the program has got. every request is described on a single line and is given by two numbers. the first number represents the request type. if the request type is equal to 1, then in that case the second number indicates the length of a car (in meters) that enters the street looking for a place to park. and if the request type is equal to 2, then the second number identifies the number of such a request (starting with 1) that the car whose arrival to the parking lot was described by a request with this number, leaves the parking lot. it is guaranteed that car was parked at the moment the request of the 2 type was made. the lengths of cars are integers from 1 to1000.

Output

For every request of the 1 type print number-1 on the single line if the corresponding car couldn't find place to park along the street. otherwise, print a single number equal to the distance between the back of the car in its parked position and the beginning of the parking lot zone.

Sample test (s) input

30 1 261 51 41 52 21 51 4

Output

06111723

Input

30 1 161 51 41 52 21 51 4

Output

0611176

Input

10 1 111 12

Output

-1

Idea: Maintain the length of the open space on the left and right sides of the interval and the continuous open space length with the maximum range.

#include <stdio.h>#define max(A,B)(A>B?A:B)struct{    int l,r;}qur[100];int mx[400005],ls[400005],rs[400005],att[400005];void build(int idx,int s,int e){    if(s!=e)    {        int mid=(s+e)>>1;        build(idx<<1,s,mid);        build(idx<<1|1,mid+1,e);    }    mx[idx]=ls[idx]=rs[idx]=e-s+1;    att[idx]=-1;}void update(int idx,int s,int e,int l,int r,int val){    if(l==s && e==r)    {        att[idx]=val;        mx[idx]=ls[idx]=rs[idx]=(e-s+1)*val;        return;    }    int mid=(s+e)>>1;    if(att[idx]!=-1)    {        mx[idx<<1]=ls[idx<<1]=rs[idx<<1]=(mid-s+1)*att[idx];        mx[idx<<1|1]=ls[idx<<1|1]=rs[idx<<1|1]=(e-mid)*att[idx];        att[idx<<1]=att[idx<<1|1]=att[idx];        att[idx]=-1;    }    if(r<=mid) update(idx<<1,s,mid,l,r,val);    else if(l>mid) update(idx<<1|1,mid+1,e,l,r,val);    else    {        update(idx<<1,s,mid,l,mid,val);        update(idx<<1|1,mid+1,e,mid+1,r,val);    }    ls[idx]=ls[idx<<1];    rs[idx]=rs[idx<<1|1];    mx[idx]=max(mx[idx<<1],mx[idx<<1|1]);    if(ls[idx]==mid-s+1) ls[idx]+=ls[idx<<1|1];    if(rs[idx]==e-mid) rs[idx]+=rs[idx<<1];    mx[idx]=max(rs[idx<<1]+ls[idx<<1|1],mx[idx]);}int query(int idx,int s,int e,int val){    int mid=(s+e)>>1;    if(att[idx]!=-1)    {        mx[idx<<1]=ls[idx<<1]=rs[idx<<1]=(mid-s+1)*att[idx];        mx[idx<<1|1]=ls[idx<<1|1]=rs[idx<<1|1]=(e-mid)*att[idx];        att[idx<<1]=att[idx<<1|1]=att[idx];        att[idx]=-1;    }    if(mx[idx<<1]>=val) return query(idx<<1,s,mid,val);    else if(rs[idx<<1]+ls[idx<<1|1]>=val) return mid-rs[idx<<1]+1;    else if(mx[idx<<1|1]>=val) return query(idx<<1|1,mid+1,e,val);    else return -1;}int main(){    int n,b,f,q,i,type,val,ans;    while(~scanf("%d%d%d%d",&n,&b,&f,&q))    {        n+=b+f-1;        build(1,0,n);        for(i=1;i<=q;i++)        {            scanf("%d%d",&type,&val);            if(type==1)            {                ans=query(1,0,n,val+b+f);                printf("%d\n",ans);                if(ans==-1) continue;                qur[i].l=ans+b;                qur[i].r=ans+b+val-1;                update(1,0,n,qur[i].l,qur[i].r,0);            }            else update(1,0,n,qur[val].l,qur[val].r,1);        }    }}

What is Iot in parking lot?

What does parking lot mean? First, it depends on where it comes from, in the United States, or in the UK.

In the United States, parking lot is a parking lot.
In the UK, parking lot is a parking space.

A lot refers to a place. It can also be divided into big or small places.

Parking Lot lyrics

Song name: Parking
Singing: Lee Ryan
Waiting, watching the clock
Breathing, like I'm gonna stop.
Knowing, this door's gonna knock
And there you'll be
And I pick you up
In my car
Take you away somewhere
We'll sit, parked in my car
Minutes, turning to hours
We'll watch the bright lights of the city
Just you and me
Dreaming
Your lips dance internal ss mine
Our hands, fingers entwined
There we'll fulfill our desires
Set me free
Oooh
Oooh yeah
And I pick you up
When you're down
Take you away .........
Oooooooooooooh
Yes we'll sit, parked in my car
Minutes, turning to hours
We'll watch the bright lights of the city
Just you and me
Dreaming.

Music.baidu.com/song/7442658