Hotel

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 5e4 + 10;

struct Node{
    int l, r, s, ls, rs, add;
}tr[N << 2];

void pushup(int u, int len)
{
    if(len == 1) return;
    tr[u].ls = tr[u << 1].ls;
    tr[u].rs = tr[u << 1 | 1].rs;
    if(tr[u].ls == (len - len / 2)) tr[u].ls += tr[u << 1 | 1].ls;
    if(tr[u].rs == len / 2) tr[u].rs += tr[u << 1].rs;
    tr[u].s = max(tr[u << 1].rs + tr[u << 1 | 1].ls, max(tr[u << 1].s, tr[u << 1 | 1].s));
}

void pushdown(int u, int len)
{
    if(len == 1) return;
    if (tr[u].add){
        tr[u << 1].add = tr[u << 1 | 1].add = tr[u].add;
        if (tr[u].add == 2){
            tr[u << 1].s = tr[u << 1].ls = tr[u << 1].rs = len - len / 2;
            tr[u << 1 | 1].s = tr[u << 1 | 1].ls = tr[u << 1 | 1].rs = len / 2;
        }
        else if(tr[u].add == 1){
            tr[u << 1].s = tr[u << 1].ls = tr[u << 1].rs = 0;
            tr[u << 1 | 1].s = tr[u << 1 | 1].ls = tr[u << 1 | 1].rs = 0;
        }
        tr[u].add = 0;
    }
}

void build(int u, int l, int r)
{
    tr[u].l = l, tr[u].r = r;
    tr[u].ls = tr[u].rs = tr[u].s = 1;
    tr[u].add = 0;
    if (l == r) return;
    int mid = l + r >> 1;
    build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
    pushup(u, r - l + 1);
}

void modify(int u, int l, int r, int z)
{
    if(tr[u].l >= l && tr[u].r <= r){
        if (z == 1)
            tr[u].s = tr[u].ls = tr[u].rs = 0;
        else if(z == 2)
            tr[u].s = tr[u].ls = tr[u].rs = tr[u].r - tr[u].l + 1;
        tr[u].add = z;
        return;
    }
    pushdown(u, tr[u].r - tr[u].l + 1);
    int mid = tr[u].l + tr[u].r >> 1;
    if(l <= mid) modify(u << 1, l, r, z);
    if(r > mid) modify(u << 1 | 1, l, r, z);
    pushup(u, tr[u].r - tr[u].l + 1);
}

int query(int u, int len)
{
    if(tr[u].l == tr[u].r) return tr[u].l;
    pushdown(u, tr[u].r - tr[u].l + 1);
    int mid = tr[u].l + tr[u].r >> 1;
    if(tr[u << 1].s >= len) return query(u << 1, len);
    else if(tr[u << 1].rs + tr[u << 1 | 1].ls >= len) return mid - tr[u << 1].rs + 1;
    else return query(u << 1 | 1, len);
}

int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    build(1, 1, n);
    int op;
    while (m -- ){
        scanf("%d", &op);
        if (op == 1){
            int k;
            scanf("%d", &k);
            if (tr[1].s >= k){
                int pos = query(1, k);
                printf("%d\n", pos);
                modify(1, pos, pos + k - 1, 1);
            }
            else printf("0\n");
        }
        else if(op == 2){
            int l, len;
            scanf("%d%d", &l, &len);
            modify(1, l, l + len - 1, 2);
        }
    }
    return 0;
}

Lost Cows

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define lowbit(x) -x&x
using namespace std;
typedef long long LL;
const int N = 8e4 + 10;

int tr[N], a[N], ans[N], n;

void add(int i, int z){
    for (; i <= n; i += lowbit(i))
        tr[i] += z;
}

int ask(int i){
    int res = 0;
    for (; i; i -= lowbit(i))
        res += tr[i];
    return res;
}

int main()
{
    scanf("%d", &n);
    a[1] = 0;
    for (int i = 2; i <= n; i ++ ) scanf("%d", &a[i]);
    for (int i = n; i; i -- ){
        int l = 1, r = n;
        while (l < r){
            int mid = l + r >> 1;
            if (mid - ask(mid) > a[i]) r = mid;
            else l = mid + 1;
        }
        ans[i] = l;
        add(l, 1);
    }
    for (int i = 1; i <= n; i ++ )
        printf("%d\n", ans[i]);
    return 0;
}