Problem:


Score : 500 points

Problem Statement

There is an infinitely long street that runs west to east, which we consider as a number line.

There are N roadworks scheduled on this street.
The i-th roadwork blocks the point at coordinate X_i from time S_i - 0.5 to time T_i - 0.5.

Q people are standing at coordinate 0. The i-th person will start the coordinate 0 at time D_i, continue to walk with speed 1 in the positive direction and stop walking when reaching a blocked point.

Find the distance each of the Q people will walk.

Constraints

All values in input are integers.

1 \leq N, Q \leq 2 \times 10^5

0 \leq S_i < T_i \leq 10^9

1 \leq X_i \leq 10^9

0 \leq D_1 < D_2 < ... < D_Q \leq 10^9

If i \neq j and X_i = X_j, the intervals [S_i, T_i) and [S_j, T_j) do not overlap.

Input

Input is given from Standard Input in the following format:

N Q
S_1 T_1 X_1
:
S_N T_N X_N
D_1
:
D_Q

Output

Print Q lines. The i-th line should contain the distance the i-th person will walk or -1 if that person walks forever.

Sample Input 1

4 6
1 3 2
7 13 10
18 20 13
3 4 2
0
1
2
3
5
8

Sample Output 1

2
2
10
-1
13
-1

The first person starts coordinate 0 at time 0 and stops walking at coordinate 2 when reaching a point blocked by the first roadwork at time 2.

The second person starts coordinate 0 at time 1 and reaches coordinate 2 at time 3. The first roadwork has ended, but the fourth roadwork has begun, so this person also stops walking at coordinate 2.

The fourth and sixth persons encounter no roadworks while walking, so they walk forever. The output for these cases is -1.



Sample input:
4 6
1 3 2
7 13 10
18 20 13
3 4 2
0
1
2
3
5
8


Sample output:
2
2
10
-1
13
-1

Submission status: Wrong Answer

Solution code:
INF = 1
class SegTree():
    def __init__(self, A):
        n_ = len(A)
        self.n = 1
        while self.n < n_:
            self.n *= 2
        self.tree = [INF for _ in range(2 * self.n - 1)]
        for k, a in enumerate(A):
            self.update(k, a)

    def update(self, k, a):
        k += self.n - 1
        self.tree[k] = a
        while k > 0:
            k = (k - 1) // 2
            self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])

    def query(self, l, r):
        l += self.n - 1
        r += self.n - 2
        res = INF
        while r-l>1:
            if l&1 == 0:
                res = min(res,self.tree[l])
            if r&1 == 1:
                res = min(res,self.tree[r])
                r -= 1
            l = l//2
            r = (r-1)//2
        if l == r:
            res = min(res,self.tree[l])
        else:
            res = min(min(res,self.tree[l]),self.tree[r])
        return res

def main():
    import sys
    input = sys.stdin.readline
    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])
    tmp = []
    for i in range(q): tmp.append((-int(input()), "B", i))
    stx.sort(key=lambda x:x[2])
    cnt = 0
    for z in stx:
        tmp.append((z[2]-z[0], "C", cnt))
        tmp.append((z[2]-z[1], "A", cnt))
        cnt += 1
    tmp.sort()

    exit(0)
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val
    sgt = SegTree(l + [1])
    ans = [-1] * q
    sgt_update = sgt.update
    sgt_query = sgt.query

    for s, t, x in stx:
        v = sgt_query(s+1, t+1)
        while v < 1:
            i_sg, i_d = d2i[v]
            ans[i_d] = x
            sgt_update(i_sg, 1)
            v = sgt_query(s+1, t+1)

    for ansi in ans:
        print(ansi)


main()

Submission status: Wrong Answer

Solution code:
INF = 1
class SegTree():
    def __init__(self, A):
        n_ = len(A)
        self.n = 1
        while self.n < n_:
            self.n *= 2
        self.tree = [INF for _ in range(2 * self.n - 1)]
        for k, a in enumerate(A):
            self.update(k, a)

    def update(self, k, a):
        k += self.n - 1
        self.tree[k] = a
        while k > 0:
            k = (k - 1) // 2
            self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])

    def query(self, l, r):
        l += self.n - 1
        r += self.n - 2
        res = INF
        while r-l>1:
            if l&1 == 0:
                res = min(res,self.tree[l])
            if r&1 == 1:
                res = min(res,self.tree[r])
                r -= 1
            l = l//2
            r = (r-1)//2
        if l == r:
            res = min(res,self.tree[l])
        else:
            res = min(min(res,self.tree[l]),self.tree[r])
        return res

def main():
    import sys
    input = sys.stdin.readline
    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])
    tmp = []
    for i in range(q): tmp.append((-int(input()), "B", i))
    stx.sort(key=lambda x:x[2])
    exit(0)
    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, "C", i))
        tmp.append((x-t, "A", i))
    tmp.sort()

    exit(0)
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val
    sgt = SegTree(l + [1])
    ans = [-1] * q
    sgt_update = sgt.update
    sgt_query = sgt.query

    for s, t, x in stx:
        v = sgt_query(s+1, t+1)
        while v < 1:
            i_sg, i_d = d2i[v]
            ans[i_d] = x
            sgt_update(i_sg, 1)
            v = sgt_query(s+1, t+1)

    for ansi in ans:
        print(ansi)


main()

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline

    INF = 1

    class SegTree():
        def __init__(self, A):
            n_ = len(A)
            self.n = 1
            while self.n < n_:
                self.n *= 2
            self.tree = [INF for _ in range(2 * self.n - 1)]
            for k, a in enumerate(A):
                self.update(k, a)
        def update(self, k, a):
            k += self.n - 1
            self.tree[k] = a
            while k > 0:
                k = (k - 1) // 2
                self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])
        def query(self, l, r):
            l += self.n - 1
            r += self.n - 2
            res = INF
            while r-l>1:
                if l&1 == 0:
                    res = min(res,self.tree[l])
                if r&1 == 1:
                    res = min(res,self.tree[r])
                    r -= 1
                l = l//2
                r = (r-1)//2
            if l == r:
                res = min(res,self.tree[l])
            else:
                res = min(min(res,self.tree[l]),self.tree[r])
            return res

    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])

    tmp = []
    for i in range(q):
        tmp.append((-int(input()), "B", i))

    stx.sort(key = lambda x:x[2])


    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, "C", i))
        tmp.append((x-t, "A", i))    

    tmp.sort(key= lambda x:x[0])
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val

            
    # sgt = SegTree(l + [1])
    # ans = [-1] * q

    # sgt_update = sgt.update
    # sgt_query = sgt.query
        
    # for s, t, x in stx:
    #     v = sgt_query(s+1, t+1)
    #     while v < 1:
    #         i_sg, i_d = d2i[v]
    #         ans[i_d] = x
    #         sgt_update(i_sg, 1)
    #         v = sgt_query(s+1, t+1)

    # for ansi in ans:
    #     print(ansi)
            

main()

Submission status: Wrong Answer

Solution code:
INF = 1
class SegTree():
    def __init__(self, A):
        n_ = len(A)
        self.n = 1
        while self.n < n_:
            self.n *= 2
        self.tree = [INF for _ in range(2 * self.n - 1)]
        for k, a in enumerate(A):
            self.update(k, a)

    def update(self, k, a):
        k += self.n - 1
        self.tree[k] = a
        while k > 0:
            k = (k - 1) // 2
            self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])

    def query(self, l, r):
        l += self.n - 1
        r += self.n - 2
        res = INF
        while r-l>1:
            if l&1 == 0:
                res = min(res,self.tree[l])
            if r&1 == 1:
                res = min(res,self.tree[r])
                r -= 1
            l = l//2
            r = (r-1)//2
        if l == r:
            res = min(res,self.tree[l])
        else:
            res = min(min(res,self.tree[l]),self.tree[r])
        return res

def main():
    import sys
    input = sys.stdin.readline
    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        STX = list(map(int, input().split()))
        stx.append(STX)
    tmp = []
    for i in range(q): tmp.append((-int(input()), 1, i))
    stx.sort(key=lambda x:x[2])
    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, 2, i))
        tmp.append((x-t, 0, i))
    tmp.sort()

    exit(0)
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val
    sgt = SegTree(l + [1])
    ans = [-1] * q
    sgt_update = sgt.update
    sgt_query = sgt.query

    for s, t, x in stx:
        v = sgt_query(s+1, t+1)
        while v < 1:
            i_sg, i_d = d2i[v]
            ans[i_d] = x
            sgt_update(i_sg, 1)
            v = sgt_query(s+1, t+1)

    for ansi in ans:
        print(ansi)


main()

Submission status: Wrong Answer

Solution code:
INF = 1
class SegTree():
    def __init__(self, A):
        n_ = len(A)
        self.n = 1
        while self.n < n_:
            self.n *= 2
        self.tree = [INF for _ in range(2 * self.n - 1)]
        for k, a in enumerate(A):
            self.update(k, a)

    def update(self, k, a):
        k += self.n - 1
        self.tree[k] = a
        while k > 0:
            k = (k - 1) // 2
            self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])

    def query(self, l, r):
        l += self.n - 1
        r += self.n - 2
        res = INF
        while r-l>1:
            if l&1 == 0:
                res = min(res,self.tree[l])
            if r&1 == 1:
                res = min(res,self.tree[r])
                r -= 1
            l = l//2
            r = (r-1)//2
        if l == r:
            res = min(res,self.tree[l])
        else:
            res = min(min(res,self.tree[l]),self.tree[r])
        return res

def main():
    import sys
    input = sys.stdin.readline

    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])

    tmp = []
    for i in range(q): tmp.append((-int(input()), "B", i))
    stx.sort(key=lambda x:x[2])
    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, "C", i))
        tmp.append((x-t, "A", i))
    tmp.sort()

    exit(0)
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val
    sgt = SegTree(l + [1])
    ans = [-1] * q
    sgt_update = sgt.update
    sgt_query = sgt.query

    for s, t, x in stx:
        v = sgt_query(s+1, t+1)
        while v < 1:
            i_sg, i_d = d2i[v]
            ans[i_d] = x
            sgt_update(i_sg, 1)
            v = sgt_query(s+1, t+1)

    for ansi in ans:
        print(ansi)


main()

Submission status: Wrong Answer

Solution code:
INF = 1
class SegTree():
    def __init__(self, A):
        n_ = len(A)
        self.n = 1
        while self.n < n_:
            self.n *= 2
        self.tree = [INF for _ in range(2 * self.n - 1)]
        for k, a in enumerate(A):
            self.update(k, a)

    def update(self, k, a):
        k += self.n - 1
        self.tree[k] = a
        while k > 0:
            k = (k - 1) // 2
            self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])

    def query(self, l, r):
        l += self.n - 1
        r += self.n - 2
        res = INF
        while r-l>1:
            if l&1 == 0:
                res = min(res,self.tree[l])
            if r&1 == 1:
                res = min(res,self.tree[r])
                r -= 1
            l = l//2
            r = (r-1)//2
        if l == r:
            res = min(res,self.tree[l])
        else:
            res = min(min(res,self.tree[l]),self.tree[r])
        return res

def main():
    import sys
    input = sys.stdin.readline

    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])

    exit(0)
    tmp = []
    for i in range(q): tmp.append((-int(input()), "B", i))
    stx.sort(key=lambda x:x[2])


    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, "C", i))
        tmp.append((x-t, "A", i))

    tmp.sort()
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val
    sgt = SegTree(l + [1])
    ans = [-1] * q
    sgt_update = sgt.update
    sgt_query = sgt.query

    for s, t, x in stx:
        v = sgt_query(s+1, t+1)
        while v < 1:
            i_sg, i_d = d2i[v]
            ans[i_d] = x
            sgt_update(i_sg, 1)
            v = sgt_query(s+1, t+1)

    for ansi in ans:
        print(ansi)


main()

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline

    INF = 1

    class SegTree():
        def __init__(self, A):
            n_ = len(A)
            self.n = 1
            while self.n < n_:
                self.n *= 2
            self.tree = [INF for _ in range(2 * self.n - 1)]
            for k, a in enumerate(A):
                self.update(k, a)
        def update(self, k, a):
            k += self.n - 1
            self.tree[k] = a
            while k > 0:
                k = (k - 1) // 2
                self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])
        def query(self, l, r):
            l += self.n - 1
            r += self.n - 2
            res = INF
            while r-l>1:
                if l&1 == 0:
                    res = min(res,self.tree[l])
                if r&1 == 1:
                    res = min(res,self.tree[r])
                    r -= 1
                l = l//2
                r = (r-1)//2
            if l == r:
                res = min(res,self.tree[l])
            else:
                res = min(min(res,self.tree[l]),self.tree[r])
            return res

    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])

    tmp = []
    for i in range(q):
        tmp.append((-int(input()), "B", i))

    stx.sort(key = lambda x:x[2])


    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, "C", i))
        tmp.append((x-t, "A", i))    

    # tmp.sort()
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val

            
    # sgt = SegTree(l + [1])
    # ans = [-1] * q

    # sgt_update = sgt.update
    # sgt_query = sgt.query
        
    # for s, t, x in stx:
    #     v = sgt_query(s+1, t+1)
    #     while v < 1:
    #         i_sg, i_d = d2i[v]
    #         ans[i_d] = x
    #         sgt_update(i_sg, 1)
    #         v = sgt_query(s+1, t+1)

    # for ansi in ans:
    #     print(ansi)
            

main()

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline

    INF = 1

    class SegTree():
        def __init__(self, A):
            n_ = len(A)
            self.n = 1
            while self.n < n_:
                self.n *= 2
            self.tree = [INF for _ in range(2 * self.n - 1)]
            for k, a in enumerate(A):
                self.update(k, a)
        def update(self, k, a):
            k += self.n - 1
            self.tree[k] = a
            while k > 0:
                k = (k - 1) // 2
                self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])
        def query(self, l, r):
            l += self.n - 1
            r += self.n - 2
            res = INF
            while r-l>1:
                if l&1 == 0:
                    res = min(res,self.tree[l])
                if r&1 == 1:
                    res = min(res,self.tree[r])
                    r -= 1
                l = l//2
                r = (r-1)//2
            if l == r:
                res = min(res,self.tree[l])
            else:
                res = min(min(res,self.tree[l]),self.tree[r])
            return res

    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])

    tmp = []
    for i in range(q):
        tmp.append((-int(input()), "B", i))

    stx.sort(key = lambda x:x[2])


    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, "C", i))
        tmp.append((x-t, "A", i))    

    tmp.sort()
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val

            
    # sgt = SegTree(l + [1])
    # ans = [-1] * q

    # sgt_update = sgt.update
    # sgt_query = sgt.query
        
    # for s, t, x in stx:
    #     v = sgt_query(s+1, t+1)
    #     while v < 1:
    #         i_sg, i_d = d2i[v]
    #         ans[i_d] = x
    #         sgt_update(i_sg, 1)
    #         v = sgt_query(s+1, t+1)

    # for ansi in ans:
    #     print(ansi)
            

main()

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline

    INF = 1

    class SegTree():
        def __init__(self, A):
            n_ = len(A)
            self.n = 1
            while self.n < n_:
                self.n *= 2
            self.tree = [INF for _ in range(2 * self.n - 1)]
            for k, a in enumerate(A):
                self.update(k, a)
        def update(self, k, a):
            k += self.n - 1
            self.tree[k] = a
            while k > 0:
                k = (k - 1) // 2
                self.tree[k] = min(self.tree[k * 2 + 1], self.tree[k * 2 + 2])
        def query(self, l, r):
            l += self.n - 1
            r += self.n - 2
            res = INF
            while r-l>1:
                if l&1 == 0:
                    res = min(res,self.tree[l])
                if r&1 == 1:
                    res = min(res,self.tree[r])
                    r -= 1
                l = l//2
                r = (r-1)//2
            if l == r:
                res = min(res,self.tree[l])
            else:
                res = min(min(res,self.tree[l]),self.tree[r])
            return res

    n, q = map(int, input().split())
    stx = []
    for _ in range(n):
        s,t,x = map(int, input().split())
        stx.append([s,t,x])

    tmp = []
    for i in range(q):
        tmp.append((-int(input()), "B", i))

    stx.sort(key = lambda x:x[2])


    for i, (s, t, x) in enumerate(stx):
        tmp.append((x-s, "C", i))
        tmp.append((x-t, "A", i))    

    tmp.sort()
    l = []
    d2i = {}
    memo = - 10 ** 10
    i_sg = -1

    for val, cat, index in tmp:
        if val > memo:
            i_sg += 1
            l.append(1)
        if cat == "B":
            l[i_sg]=val
            d2i[val] = (i_sg, index)
        elif cat == "A":
            stx[index][0] = i_sg
        else:
            stx[index][1] = i_sg

        memo = val

            
    sgt = SegTree(l + [1])
    ans = [-1] * q

    # sgt_update = sgt.update
    # sgt_query = sgt.query
        
    # for s, t, x in stx:
    #     v = sgt_query(s+1, t+1)
    #     while v < 1:
    #         i_sg, i_d = d2i[v]
    #         ans[i_d] = x
    #         sgt_update(i_sg, 1)
    #         v = sgt_query(s+1, t+1)

    # for ansi in ans:
    #     print(ansi)
            

main()

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def same(self, x, y):
        return self.find(x) == self.find(y)
def main():
    N, Q = map(int, input().split())
    kouji = [list(map(int, input().split())) for _ in range(N)]
    D = [int(input()) for _ in range(Q)]
    ans = [[-1, i+1] for i in range(Q)]
    uf = UnionFind(Q)
    kouji.sort(key=lambda x: x[2])
    for i in range(N):
        S, T, X = kouji[i]
        L = S-X
        R = T-X-1
        L_idx = bisect_left(D, L)
        R_idx = bisect_left(D, R+1)
        p = L_idx
        while p < R_idx:
            if ans[p][0] == -1:
                ans[p][0] = X
                uf.union(L_idx, p)
                ans[p][1] = R_idx
                p += 1
            else:
                par = uf.find(p)
                p = ans[par][1]
                uf.union(L_idx, par)
                if L_idx < par:
                    par = L_idx
                if ans[par][1] < R_idx:
                    ans[par][1] = R_idx
                if ans[par][1] < p:
                    ans[par][1] = p
    for i in range(Q):
        print(ans[i][0])

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left, bisect_right
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())
    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}
    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
def main():
    N, Q = map(int, input().split())
    kouji = [list(map(int, input().split())) for _ in range(N)]
    D = [int(input()) for _ in range(Q)]
    ans = [[-1, i+1] for i in range(Q)]
    uf = UnionFind(Q)
    kouji.sort(key=lambda x: (x[2], x[0]))
    for i in range(N):
        S, T, X = kouji[i]
        L = S-X
        R = T-X-1
        L_idx = bisect_left(D, L)
        R_idx = bisect_right(D, R)
        p = L_idx
        while p < Q and p < R_idx:
            if ans[p][0] == -1:
                ans[p][0] = X
                uf.union(L_idx, p)
                ans[p][1] = R_idx
                p += 1
            else:
                par = uf.find(p)
                p = ans[par][1]
                uf.union(L_idx, par)
                par = uf.find(par)
                if ans[par][1] < R_idx:
                    ans[par][1] = R_idx
    for i in range(Q):
        print(ans[i][0])

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left, bisect_right
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())
    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}
    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
def main():
    N, Q = map(int, input().split())
    kouji = [list(map(int, input().split())) for _ in range(N)]
    D = [int(input()) for _ in range(Q)]
    ans = [[-1, i+1] for i in range(Q)]
    uf = UnionFind(Q)
    kouji.sort(key=lambda x: (x[2], x[0]))
    for i in range(N):
        S, T, X = kouji[i]
        L = S-X
        R = T-X-1
        L_idx = bisect_left(D, L)
        R_idx = bisect_right(D, R)
        p = L_idx
        while p < Q and p < R_idx:
            if ans[p][0] == -1:
                ans[p][0] = X
            par = uf.find(p)
            if par != p:
                p = ans[par][1]
                uf.union(L_idx, par)
                par = uf.find(par)
                if ans[par][1] < R_idx:
                    ans[par][1] = R_idx
            else:
                uf.union(L_idx, p)
                ans[p][1] = R_idx
                p += 1
    for i in range(Q):
        print(ans[i][0])

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left, bisect_right
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())
    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}
    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
def main():
    N, Q = map(int, input().split())
    kouji = [list(map(int, input().split())) for _ in range(N)]
    D = [int(input()) for _ in range(Q)]
    ans = [[-1, i+1] for i in range(Q)]
    uf = UnionFind(Q)
    kouji.sort(key=lambda x: (x[2], x[0]))
    for i in range(N):
        S, T, X = kouji[i]
        L = S-X
        R = T-X-1
        L_idx = bisect_left(D, L)
        R_idx = bisect_right(D, R)
        p = L_idx
        while p < Q and p < R_idx:
            if ans[p][0] == -1:
                ans[p][0] = X
            par = uf.find(p)
            if par != p:
                p = ans[par][1]
                if ans[par][1] < R_idx:
                    ans[par][1] = R_idx
                uf.union(L_idx, par)
                if L_idx < par:
                    if ans[L_idx][1] < ans[par][1]:
                        ans[L_idx][1] = ans[par][1]
            else:
                uf.union(L_idx, p)
                ans[p][1] = R_idx
                p += 1
    for i in range(Q):
        print(ans[i][0])

if __name__ == "__main__":
    main()