Hotel

https://ac.nowcoder.com/acm/contest/997/C 

总结：线段树区间合并；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=3e5+9;
const int maxm=4e5+9;
const int mod=1e9+7;

struct node
{
    int sum,suml,sumr;
    int lazy;
}tree[maxn<<1];

void pushup(int rt,int l,int r)
{
    int mid=(l+r)>>1;
    tree[rt].suml=tree[rt<<1].suml;
    tree[rt].sumr=tree[rt<<1|1].sumr;
    if(tree[rt].suml==mid-l+1) tree[rt].suml+=tree[rt<<1|1].suml;
    if(tree[rt].sumr==r-mid) tree[rt].sumr+=tree[rt<<1].sumr;
    tree[rt].sum=max(tree[rt<<1].sumr+tree[rt<<1|1].suml,max(tree[rt<<1].sum,tree[rt<<1|1].sum));
}
void pushdown(int rt,int l,int r)
{
    if(tree[rt].lazy!=-1)
    {
        tree[rt<<1].lazy=tree[rt].lazy;
        tree[rt<<1|1].lazy=tree[rt].lazy;
        int mid=(l+r)>>1;
        if(tree[rt].lazy==0)
            tree[rt<<1].sum=tree[rt<<1].sumr=tree[rt<<1].suml=mid-l+1;
        else
            tree[rt<<1].sum=tree[rt<<1].sumr=tree[rt<<1].suml=0;

        if(tree[rt].lazy==0)
            tree[rt<<1|1].sum=tree[rt<<1|1].sumr=tree[rt<<1|1].suml=r-mid;
        else
            tree[rt<<1|1].sum=tree[rt<<1|1].sumr=tree[rt<<1|1].suml=0;
        tree[rt].lazy=-1;
    }
}
void build(int rt,int l,int r)
{
    tree[rt].lazy=-1;
    tree[rt].sum=tree[rt].suml=tree[rt].sumr=r-l+1;
    if(l==r)
    {
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt,l,r);
}
int query(int rt,int l,int r,int val)
{
    if(l==r)
    {
        return l;
    }
    pushdown(rt,l,r);
    int mid=(l+r)>>1;
    if(tree[rt<<1].sum>=val) return query(rt<<1,l,mid,val);
    else if(tree[rt<<1].sumr+tree[rt<<1|1].suml>=val) return mid-tree[rt<<1].sumr+1;
    else return query(rt<<1|1,mid+1,r,val);
}
void update(int rt,int l,int r,int ql,int qr,int val)
{
    //if(ql>r||qr<l) return ;
    if(ql<=l&&qr>=r)
    {
        tree[rt].lazy=val;
        if(val==0)
            tree[rt].sum=tree[rt].suml=tree[rt].sumr=r-l+1;
        else tree[rt].sum=tree[rt].suml=tree[rt].sumr=0;
        return;
    }
    pushdown(rt,l,r);
    int mid=(l+r)>>1;
    if(ql<=mid) update(rt<<1,l,mid,ql,qr,val);
    if(qr>mid) update(rt<<1|1,mid+1,r,ql,qr,val);
    //update(rt<<1,l,mid,ql,qr,val);
    //update(rt<<1|1,mid+1,r,ql,qr,val);
    pushup(rt,l,r);
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,m;
    cin>>n>>m;
    build(1,1,n);

    while(m--)
    {
        int d,x;
        int op;
        cin>>op;
        if(op==1)
        {
            cin>>d;
            if(tree[1].sum<d)
                puts("0");
            else
            {
                int ans=query(1,1,n,d);
                pri(ans);
                update(1,1,n,ans,ans+d-1,1);
            }
        }
        else
        {
            cin>>x>>d;
            update(1,1,n,x,x+d-1,0);
        }
    }

    return 0;
}