Problem:


Score : 600 points

Problem Statement

There is a grid of squares with H+1 horizontal rows and W vertical columns.

You will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \ldots, B_i-th squares from the left in the i-th row from the top.

For each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.

Constraints

1 \leq H,W \leq 2\times 10^5

1 \leq A_i \leq B_i \leq W

Input

Input is given from Standard Input in the following format:

H W
A_1 B_1
A_2 B_2
:
A_H B_H

Output

Print H lines. The i-th line should contain the answer for the case k=i.

Sample Input 1

4 4
2 4
1 1
2 3
2 4

Sample Output 1

1
3
6
-1

Let (i,j) denote the square at the i-th row from the top and j-th column from the left.

For k=1, we need one move such as (1,1) → (2,1).

For k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).

For k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).

For k=4, it is impossible to reach any square in the fifth row from the top.



Sample input:
4 4
2 4
1 1
2 3
2 4


Sample output:
1
3
6
-1

Submission status: Wrong Answer

Solution code:
import os
import sys

import numpy as np


def solve(inp):
    RBST_CHILDREN = []
    RBST_VALUES = []
    RBST_COUNTS = []
    RBST_INDICES = []
    RBST_ROOTS = []

    def rbst_init():
        lst = [0]
        lst.clear()
        RBST_CHILDREN.append([[0], [0]])
        RBST_VALUES.append([0])
        RBST_COUNTS.append([0])
        RBST_INDICES.append(lst)
        RBST_ROOTS.append(0)
        return len(RBST_ROOTS) - 1

    def rbst_merge(ins, left_root, right_root):
        children = RBST_CHILDREN[ins]
        counts = RBST_COUNTS[ins]
        li = left_root
        ri = right_root
        stack = []
        while li != 0 and ri != 0:
            if np.random.randint(counts[li] + counts[ri]) < counts[li]:
                stack.append((li, 1))
                li = children[1][li]
            else:
                stack.append((ri, 0))
                ri = children[0][ri]

        i = li if li != 0 else ri
        while stack:
            pi, is_right = stack.pop()
            children[is_right][pi] = i
            counts[pi] = counts[children[0][pi]] + counts[children[1][pi]] + 1
            i = pi

        return i

    def rbst_split(ins, x, root=-1):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        if root == -1:
            root = RBST_ROOTS[ins]
        i = root
        l_stack = []
        r_stack = []
        while i != 0:
            if x < values[i]:
                r_stack.append(i)
                i = children[0][i]
            else:
                l_stack.append(i)
                i = children[1][i]

        li, ri = 0, 0
        while l_stack:
            pi = l_stack.pop()
            children[1][pi] = li
            counts[pi] = counts[children[0][pi]] + counts[li] + 1
            li = pi
        while r_stack:
            pi = r_stack.pop()
            children[0][pi] = ri
            counts[pi] = counts[ri] + counts[children[1][pi]] + 1
            ri = pi

        return li, ri

    def rbst_insert(ins, x):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        indices = RBST_INDICES[ins]

        if indices:
            ni = indices.pop()
            children[0][ni] = children[1][ni] = 0
            values[ni] = x
            counts[ni] = 1
        else:
            ni = len(values)
            children[0].append(0)
            children[1].append(0)
            values.append(x)
            counts.append(1)

        li, ri = rbst_split(ins, x)
        i = rbst_merge(ins, li, ni)
        i = rbst_merge(ins, i, ri)
        RBST_ROOTS[ins] = i

    def rbst_delete(ins, x):
        children = RBST_CHILDREN[ins]
        counts = RBST_COUNTS[ins]
        indices = RBST_INDICES[ins]

        li, mri = rbst_split(ins, x - 1)
        mi, ri = rbst_split(ins, x, mri)

        if mi == 0:
            RBST_ROOTS[ins] = rbst_merge(ins, li, ri)
            return

        if counts[mi] == 1:
            indices.append(mi)
            RBST_ROOTS[ins] = rbst_merge(ins, li, ri)
            return

        i = mi
        stack = []
        while i != 0:
            if children[0][i] != 0 and children[1][i] != 0:
                to_right = 1 if counts[children[0][i]] < counts[children[1][i]] else 0
                stack.append((i, to_right))
                i = children[to_right][i]
            else:
                if children[0][i] != 0:
                    if stack:
                        pi, is_right = stack[-1]
                        children[is_right][pi] = children[0][i]
                    else:
                        mi = children[0][i]
                elif children[1][i] != 0:
                    if stack:
                        pi, is_right = stack[-1]
                        children[is_right][pi] = children[1][i]
                    else:
                        mi = children[1][i]
                else:
                    pi, is_right = stack[-1]
                    children[is_right][pi] = 0
                break

        indices.append(i)
        while stack:
            pi, _ = stack.pop()
            counts[pi] -= 1

        i = rbst_merge(ins, li, mi)
        i = rbst_merge(ins, i, ri)

        RBST_ROOTS[ins] = i

    def rbst_lower_bound(ins, x, default):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        i = RBST_ROOTS[ins]
        y = default
        c = counts[i]
        j = 0
        while i != 0:
            if x <= values[i]:
                y = values[i]
                c = j + counts[children[0][i]]
                i = children[0][i]
            else:
                j += counts[children[0][i]] + 1
                i = children[1][i]
        return y, c

    def rbst_get_k_th(ins, k, default):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        i = RBST_ROOTS[ins]

        if counts[i] <= k:
            return default
        j = k
        while i != 0:
            left_count = counts[children[0][i]]
            if left_count == j:
                return values[i]
            elif left_count > j:
                i = children[0][i]
            else:
                j -= left_count + 1
                i = children[1][i]
        return default

    h = inp[0]
    w = inp[1]
    aaa = inp[2::2]
    bbb = inp[3::2]

    ins1 = rbst_init()
    ins2 = rbst_init()
    INF = 10 ** 18

    for i in range(1, w + 1):
        rbst_insert(ins1, i)
        rbst_insert(ins2, 0)
    rbst_insert(ins1, INF)
    rbst_insert(ins2, INF)

    moves = np.zeros(w + 1, dtype=np.int64)
    ans = np.full(h, -1, dtype=np.int64)

    for row in range(h):
        a = aaa[row]
        b = bbb[row]
        c, _ = rbst_lower_bound(ins1, a, INF)
        stack = []
        while c <= b + 1:
            stack.append(c)
            c, _ = rbst_lower_bound(ins1, c + 1, INF)

        if len(stack) == 0:
            ans[row] = row + 1 + rbst_get_k_th(ins2, 0, INF)
            continue

        found_nearest = b == w

        while stack:
            c = stack.pop()
            if found_nearest:
                rbst_delete(ins1, c)
                rbst_delete(ins2, moves[c])
            else:
                if c < b + 1:
                    rbst_delete(ins1, c)
                    rbst_insert(ins1, b + 1)
                    rbst_delete(ins2, moves[c])
                    rbst_insert(ins2, moves[c] + b + 1 - c)
                    moves[b + 1] = moves[c] + b + 1 - c

                found_nearest = True

        move = rbst_get_k_th(ins2, 0, INF)
        if move == INF:
            break

        ans[row] = row + move + 1

    return ans


def debug_print(children, values, counts, root):
    print(children.T)
    print(values)
    print(counts)
    _debug_print(children, values, counts, root, 0)


def _debug_print(children, values, counts, i, depth):
    if i != -1:
        _debug_print(children, values, counts, children[i, 0], depth + 1)
        print('      ' * depth, values[i], counts[i])
        _debug_print(children, values, counts, children[i, 1], depth + 1)


if sys.argv[-1] == 'ONLINE_JUDGE':
    from numba.pycc import CC

    cc = CC('my_module')
    cc.export('solve', '(i8[:],)')(solve)
    cc.compile()
    exit()

if os.name == 'posix':
    try:
        # noinspection PyUnresolvedReferences
        from my_module import solve
    except ModuleNotFoundError:
        print('WA')
        exit()
else:
    from numba import njit

    solve = njit('(i8[:],)', cache=True)(solve)
    print('compiled!', file=sys.stderr)

inp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')
ans = solve(inp)
print('\n'.join(map(str, ans)))

Submission status: Wrong Answer

Solution code:
import os
import sys

import numpy as np


def solve(inp):
    RBST_CHILDREN = []
    RBST_VALUES = []
    RBST_COUNTS = []
    RBST_INDICES = []
    RBST_ROOTS = []

    def rbst_init():
        lst = [0]
        lst.clear()
        RBST_CHILDREN.append([[0], [0]])
        RBST_VALUES.append([0])
        RBST_COUNTS.append([0])
        RBST_INDICES.append(lst)
        RBST_ROOTS.append(0)
        return len(RBST_ROOTS) - 1

    def rbst_merge(ins, left_root, right_root):
        children = RBST_CHILDREN[ins]
        counts = RBST_COUNTS[ins]
        li = left_root
        ri = right_root
        stack = []
        while li != 0 and ri != 0:
            if np.random.randint(counts[li] + counts[ri]) < counts[li]:
                stack.append((li, 1))
                li = children[1][li]
            else:
                stack.append((ri, 0))
                ri = children[0][ri]

        i = li if li != 0 else ri
        while stack:
            pi, is_right = stack.pop()
            children[is_right][pi] = i
            counts[pi] = counts[children[0][pi]] + counts[children[1][pi]] + 1
            i = pi

        return i

    def rbst_split(ins, x, root=-1):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        if root == -1:
            root = RBST_ROOTS[ins]
        i = root
        l_stack = []
        r_stack = []
        while i != 0:
            if x < values[i]:
                r_stack.append(i)
                i = children[0][i]
            else:
                l_stack.append(i)
                i = children[1][i]

        li, ri = 0, 0
        while l_stack:
            pi = l_stack.pop()
            children[1][pi] = li
            counts[pi] = counts[children[0][pi]] + counts[li] + 1
            li = pi
        while r_stack:
            pi = r_stack.pop()
            children[0][pi] = ri
            counts[pi] = counts[ri] + counts[children[1][pi]] + 1
            ri = pi

        return li, ri

    def rbst_insert(ins, x):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        indices = RBST_INDICES[ins]

        if indices:
            ni = indices.pop()
            children[0][ni] = children[1][ni] = 0
            values[ni] = x
            counts[ni] = 1
        else:
            ni = len(values)
            children[0].append(0)
            children[1].append(0)
            values.append(x)
            counts.append(1)

        li, ri = rbst_split(ins, x)
        i = rbst_merge(ins, li, ni)
        i = rbst_merge(ins, i, ri)
        RBST_ROOTS[ins] = i

    def rbst_delete(ins, x):
        children = RBST_CHILDREN[ins]
        counts = RBST_COUNTS[ins]
        indices = RBST_INDICES[ins]

        li, mri = rbst_split(ins, x - 1)
        mi, ri = rbst_split(ins, x, mri)

        if mi == 0:
            RBST_ROOTS[ins] = rbst_merge(ins, li, ri)
            return

        if counts[mi] == 1:
            indices.append(mi)
            RBST_ROOTS[ins] = rbst_merge(ins, li, ri)
            return

        i = mi
        stack = []
        while i != 0:
            if children[0][i] != 0 and children[1][i] != 0:
                to_right = 1 if counts[children[0][i]] < counts[children[1][i]] else 0
                stack.append((i, to_right))
                i = children[to_right][i]
            else:
                if children[0][i] != 0:
                    if stack:
                        pi, is_right = stack[-1]
                        children[is_right][pi] = children[0][i]
                    else:
                        mi = children[0][i]
                elif children[1][i] != 0:
                    if stack:
                        pi, is_right = stack[-1]
                        children[is_right][pi] = children[1][i]
                    else:
                        mi = children[1][i]
                else:
                    pi, is_right = stack[-1]
                    children[is_right][pi] = 0
                break

        indices.append(i)
        while stack:
            pi, _ = stack.pop()
            counts[pi] -= 1

        i = rbst_merge(ins, li, mi)
        i = rbst_merge(ins, i, ri)

        RBST_ROOTS[ins] = i

    def rbst_upper_bound(ins, x, default):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        i = RBST_ROOTS[ins]
        y = default
        c = counts[i]
        j = 0
        while i != 0:
            if x < values[i]:
                y = values[i]
                c = j + counts[children[0][i]]
                i = children[0][i]
            else:
                j += counts[children[0][i]] + 1
                i = children[1][i]
        return y, c

    def rbst_lower_bound(ins, x, default):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        i = RBST_ROOTS[ins]
        y = default
        c = counts[i]
        j = 0
        while i != 0:
            if x <= values[i]:
                y = values[i]
                c = j + counts[children[0][i]]
                i = children[0][i]
            else:
                j += counts[children[0][i]] + 1
                i = children[1][i]
        return y, c

    def rbst_get_k_th(ins, k, default):
        children = RBST_CHILDREN[ins]
        values = RBST_VALUES[ins]
        counts = RBST_COUNTS[ins]
        i = RBST_ROOTS[ins]

        if counts[i] <= k:
            return default
        j = k
        while i != 0:
            left_count = counts[children[0][i]]
            if left_count == j:
                return values[i]
            elif left_count > j:
                i = children[0][i]
            else:
                j -= left_count + 1
                i = children[1][i]
        return default

    h = inp[0]
    w = inp[1]
    aaa = inp[2::2]
    bbb = inp[3::2]

    ins1 = rbst_init()
    ins2 = rbst_init()
    INF = 10 ** 18

    for i in range(1, w + 1):
        rbst_insert(ins1, i)
        rbst_insert(ins2, 0)
    rbst_insert(ins1, INF)
    rbst_insert(ins2, INF)
    # debug_print(rbst1_children, rbst1_values, rbst1_counts, rbst1_root)

    moves = np.zeros(w + 1, dtype=np.int64)
    ans = np.full(h, -1, dtype=np.int64)

    for row in range(h):
        a = aaa[row]
        b = bbb[row]
        c, _ = rbst_lower_bound(ins1, a, INF)
        stack = []
        while c <= b + 1:
            stack.append(c)
            c, _ = rbst_lower_bound(ins1, c + 1, INF)

        if len(stack) == 0:
            ans[row] = row + 1 + rbst_get_k_th(ins2, 0, INF)
            continue

        found_nearest = b == w

        while stack:
            c = stack.pop()
            if found_nearest:
                rbst_delete(ins1, c)
                rbst_delete(ins2, moves[c])
            else:
                if c < b + 1:
                    rbst_delete(ins1, c)
                    rbst_insert(ins1, b + 1)
                    rbst_delete(ins2, moves[c])
                    rbst_insert(ins2, moves[c] + b + 1 - c)
                    moves[b + 1] = moves[c] + b + 1 - c

                found_nearest = True

        move = rbst_get_k_th(ins2, 0, INF)
        if move == INF:
            break

        ans[row] = row + move + 1

    return ans


def debug_print(children, values, counts, root):
    print(children.T)
    print(values)
    print(counts)
    _debug_print(children, values, counts, root, 0)


def _debug_print(children, values, counts, i, depth):
    if i != -1:
        _debug_print(children, values, counts, children[i, 0], depth + 1)
        print('      ' * depth, values[i], counts[i])
        _debug_print(children, values, counts, children[i, 1], depth + 1)


if sys.argv[-1] == 'ONLINE_JUDGE':
    from numba.pycc import CC

    cc = CC('my_module')
    cc.export('solve', '(i8[:],)')(solve)
    cc.compile()
    exit()

if os.name == 'posix':
    try:
        # noinspection PyUnresolvedReferences
        from my_module import solve
    except ModuleNotFoundError:
        print('WA')
        exit()
else:
    from numba import njit

    solve = njit('(i8[:],)', cache=True)(solve)
    print('compiled!', file=sys.stderr)

inp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')
ans = solve(inp)
print('\n'.join(map(str, ans)))

Submission status: Wrong Answer

Solution code:
import sys
import time

if sys.argv[-1] == 'ONLINE_JUDGE':
  time.sleep(60)
  exit()

print('RE or WA or TLE')

Submission status: Wrong Answer

Solution code:
R, C = map(int, input().split(" "))
g = [[0 for i in range(C)] for j in range(R+1)]
ref = [[0 for i in range(C)] for j in range(R+1)]
INF = 2000000
for i in range(R):
    a, b = map(int, input().split(" "))
    a -= 1
    b -= 1
    for j in range(a, b + 1):
        ref[i][j] = 1
for r in range(R+1):
    for c in range(C):
        if r == 0 and c == 0:
            g[r][c] = INF if ref[r][c] == 1 else 0
        elif r == 0:
            g[r][c] = g[r][c - 1] + 1
        elif c == 0:
            g[r][c] = INF if ref[r - 1][c] == 1 else g[r - 1][c] + 1
        else:
            g[r][c] = min((INF if ref[r - 1][c] == 1 else g[r - 1][c] + 1),
                          g[r][c - 1] + 1)
print(g)
for i in range(1,R+1):
    print(-1 if min(g[i]) >= INF else min(g[i]))

Submission status: Wrong Answer

Solution code:
H, W = list(map(int, input().split()))
A, B = [0]*(H+2), [0]*(H+2)
for i in range(1, H+1):
    A[i], B[i] = list(map(int, input().split()))

m = [1]*(H+3)
for h in range(1, H+2):
    if h!=1:
        if m[h] <= W+1:
            print (m[h]+h-2)
        else:
            print(-1)
    if m[h] < A[h] or m[h] > B[h]:
        m[h+1] = m[h]
    else:
        m[h+1] = B[h] + 1

Submission status: Wrong Answer

Solution code:
H, W = list(map(int, input().split()))
A, B = [0]*(H+2), [0]*(H+2)
for i in range(1, H+1):
    A[i], B[i] = list(map(int, input().split()))

m = [1]*(H+3)
for h in range(1, H+2):
    if h!=1:
        if m[h] <= W:
            print (m[h]+h-2)
        else:
            print(-1)
    if m[h] < A[h] or m[h] > B[h]:
        m[h+1] = m[h]
    else:
        m[h+1] = B[h] + 1

Submission status: Wrong Answer

Solution code:
import os
import sys

import numpy as np


def solve(inp):
    def rbst_merge(children, counts, left_root, right_root):
        li = left_root
        ri = right_root
        stack = []
        while li != -1 and ri != -1:
            if np.random.randint(counts[li] + counts[ri]) < counts[li]:
                stack.append((li, 1))
                li = children[li, 1]
            else:
                stack.append((ri, 0))
                ri = children[ri, 0]

        i = li if li != -1 else ri
        while stack:
            pi, is_right = stack.pop()
            children[pi, is_right] = i
            counts[pi] = counts[children[pi, 0]] + counts[children[pi, 1]] + 1
            i = pi

        return i

    def rbst_split(children, values, counts, root, x):
        i = root
        l_stack = []
        r_stack = []
        while i != -1:
            if x < values[i]:
                r_stack.append(i)
                i = children[i, 0]
            else:
                l_stack.append(i)
                i = children[i, 1]

        li, ri = -1, -1
        while l_stack:
            pi = l_stack.pop()
            children[pi, 1] = li
            counts[pi] = counts[children[pi, 0]] + counts[li] + 1
            li = pi
        while r_stack:
            pi = r_stack.pop()
            children[pi, 0] = ri
            counts[pi] = counts[ri] + counts[children[pi, 1]] + 1
            ri = pi

        return li, ri

    # ↓この関数の定義時点でREがでてる

    def rbst_insert(children, values, counts, indices, root, x):
        ni = indices.pop()
        children[ni, 0] = children[ni, 1] = -1
        values[ni] = x
        counts[ni] = 1

        li, ri = rbst_split(children, values, counts, root, x)
        mi = rbst_merge(children, counts, li, ni)
        # i = rbst_merge(children, counts, mi, ri)

        return root

    def rbst_delete(children, values, counts, indices, root, x):
        li, mri = rbst_split(children, values, counts, root, x - 1)
        mi, ri = rbst_split(children, values, counts, mri, x)
        # print('delete', x, root, li, mi, ri)

        if mi == -1:
            return rbst_merge(children, counts, li, ri)

        if counts[mi] == 1:
            indices.add(mi)
            return rbst_merge(children, counts, li, ri)

        i = mi
        stack = []
        while i != -1:
            if children[i, 0] != -1 and children[i, 1] != -1:
                to_right = 1 if counts[children[i, 0]] < counts[children[i, 1]] else 0
                stack.append((i, to_right))
                i = children[i, to_right]
            else:
                if children[i, 0] != -1:
                    if stack:
                        pi, is_right = stack[-1]
                        children[pi, is_right] = children[i, 0]
                    else:
                        mi = children[i, 0]
                elif children[i, 1] != -1:
                    if stack:
                        pi, is_right = stack[-1]
                        children[pi, is_right] = children[i, 1]
                    else:
                        mi = children[i, 1]
                else:
                    pi, is_right = stack[-1]
                    children[pi, is_right] = -1
                break

        indices.add(i)
        while stack:
            pi, _ = stack.pop()
            counts[pi] -= 1

        i = rbst_merge(children, counts, li, mi)
        i = rbst_merge(children, counts, i, ri)

        return i

    def rbst_upper_bound(children, values, counts, default, root, x):
        i = root
        y = default
        c = counts[i]
        j = 0
        while i != -1:
            if x < values[i]:
                y = values[i]
                c = j + counts[children[i, 0]]
                i = children[i, 0]
            else:
                j += counts[children[i, 0]] + 1
                i = children[i, 1]
        return y, c

    def rbst_lower_bound(children, values, counts, default, root, x):
        i = root
        y = default
        c = counts[i]
        j = 0
        while i != -1:
            if x <= values[i]:
                y = values[i]
                c = j + counts[children[i, 0]]
                i = children[i, 0]
            else:
                j += counts[children[i, 0]] + 1
                i = children[i, 1]
        return y, c

    def rbst_get_k_th(children, values, counts, default, root, k):
        i = root
        if counts[i] <= k:
            return default
        j = k
        while i != -1:
            left_count = counts[children[i, 0]]
            if left_count == j:
                return values[i]
            elif left_count > j:
                i = children[i, 0]
            else:
                j -= left_count + 1
                i = children[i, 1]
        return default

    h = inp[0]
    w = inp[1]
    aaa = inp[2::2]
    bbb = inp[3::2]

    rbst_size = w + 10
    rbst1_indices = set(range(rbst_size - 1))
    rbst1_children = np.zeros((rbst_size, 2), dtype=np.int64)
    rbst1_values = np.zeros(rbst_size, dtype=np.int64)
    rbst1_counts = np.zeros(rbst_size, dtype=np.int64)
    rbst1_root = -1
    rbst2_indices = set(range(rbst_size - 1))
    rbst2_children = np.zeros((rbst_size, 2), dtype=np.int64)
    rbst2_values = np.zeros(rbst_size, dtype=np.int64)
    rbst2_counts = np.zeros(rbst_size, dtype=np.int64)
    rbst2_root = -1
    INF = 10 ** 18

    for i in range(1, w + 1):
        rbst1_root = rbst_insert(rbst1_children, rbst1_values, rbst1_counts, rbst1_indices, rbst1_root, i)
        rbst2_root = rbst_insert(rbst2_children, rbst2_values, rbst2_counts, rbst2_indices, rbst2_root, 0)
    rbst1_root = rbst_insert(rbst1_children, rbst1_values, rbst1_counts, rbst1_indices, rbst1_root, INF)
    rbst2_root = rbst_insert(rbst2_children, rbst2_values, rbst2_counts, rbst2_indices, rbst2_root, INF)
    # debug_print(rbst1_children, rbst1_values, rbst1_counts, rbst1_root)

    moves = np.zeros(w + 1, dtype=np.int64)
    ans = np.full(h, -1, dtype=np.int64)

    for row in range(h):
        a = aaa[row]
        b = bbb[row]
        c, _ = rbst_lower_bound(rbst1_children, rbst1_values, rbst1_counts, INF, rbst1_root, a)
        stack = []
        while c <= b + 1:
            stack.append(c)
            c, _ = rbst_lower_bound(rbst1_children, rbst1_values, rbst1_counts, INF, rbst1_root, c + 1)

        if len(stack) == 0:
            ans[row] = row + 1 + rbst_get_k_th(rbst2_children, rbst2_values, rbst2_counts, INF, rbst2_root, 0)
            continue

        found_nearest = b == w

        while stack:
            c = stack.pop()
            if found_nearest:
                rbst1_root = rbst_delete(rbst1_children, rbst1_values, rbst1_counts, rbst1_indices, rbst1_root, c)
                rbst2_root = rbst_delete(rbst2_children, rbst2_values, rbst2_counts, rbst2_indices, rbst2_root,
                                         moves[c])
            else:
                if c < b + 1:
                    rbst1_root = rbst_delete(rbst1_children, rbst1_values, rbst1_counts, rbst1_indices, rbst1_root, c)
                    rbst1_root = rbst_insert(rbst1_children, rbst1_values, rbst1_counts, rbst1_indices, rbst1_root,
                                             b + 1)
                    rbst2_root = rbst_delete(rbst2_children, rbst2_values, rbst2_counts, rbst2_indices, rbst2_root,
                                             moves[c])
                    rbst2_root = rbst_insert(rbst2_children, rbst2_values, rbst2_counts, rbst2_indices, rbst2_root,
                                             moves[c] + b + 1 - c)
                    moves[b + 1] = moves[c] + b + 1 - c

                found_nearest = True

        # debug_print(rbst1_children, rbst1_values, rbst1_counts, rbst1_root)
        # debug_print(rbst2_children, rbst2_values, rbst2_counts, rbst2_root)

        move = rbst_get_k_th(rbst2_children, rbst2_values, rbst2_counts, INF, rbst2_root, 0)
        if move == INF:
            break

        ans[row] = row + move + 1

    return ans


def debug_print(children, values, counts, root):
    print(children.T)
    print(values)
    print(counts)
    _debug_print(children, values, counts, root, 0)


def _debug_print(children, values, counts, i, depth):
    if i != -1:
        _debug_print(children, values, counts, children[i, 0], depth + 1)
        print('      ' * depth, values[i], counts[i])
        _debug_print(children, values, counts, children[i, 1], depth + 1)


if sys.argv[-1] == 'ONLINE_JUDGE':
    from numba.pycc import CC

    cc = CC('my_module')
    cc.export('solve', '(i8[:],)')(solve)
    cc.compile()
    exit()

if os.name == 'posix':
    # noinspection PyUnresolvedReferences
    from my_module import solve
else:
    from numba import njit

    solve = njit('(i8[:],)', cache=True)(solve)
    print('compiled!', file=sys.stderr)

inp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')
ans = solve(inp)
print('\n'.join(map(str, ans)))