input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import heapq
N,Q=list(map(int,input().split()))
event_list=[]
for i in range(N):
S,T,X=list(map(int,input().split()))
event_list.append((S-X-0.5,1,X))
event_list.append((T-X-0.5,-1,X))
dlist=[]
for i in range(Q):
D=int(eval(input()))
event_list.append((D,0,X))
dlist.append(D)
event_list.... | import heapq
import sys
input=sys.stdin.readline
N,Q=list(map(int,input().split()))
event_list=[]
for i in range(N):
S,T,X=list(map(int,input().split()))
event_list.append((S-X-0.5,1,X))
event_list.append((T-X-0.5,-1,X))
dlist=[]
for i in range(Q):
D=int(eval(input()))
event_list.append((D,0... | p03033 |
from bisect import bisect_left
N,Q = map(int, input().split())
STX = []
for i in range(N):
*stx, = list(map(int, input().split()))
STX.append(stx)
D = []
for i in range(Q):
D.append(int(input()))
STX = sorted(STX, key=lambda x: x[2])
DI = [i for i in range(Q)]
ANS = [-1]*Q
for (s,t,x) in STX:
... | from bisect import bisect_left
N,Q = map(int, input().split())
STX = []
for i in range(N):
*stx, = list(map(int, input().split()))
STX.append(stx)
D = []
for i in range(Q):
D.append(int(input()))
STX = sorted(STX, key=lambda x: x[2])
mask = [-1]*Q
ANS = [-1]*Q
for (s,t,x) in STX:
s2 = (s - ... | p03033 |
import sys
INF = 1 << 30
class Node:
def __init__(self, key, val):
self.key = key
self.val = val
self.lst = None
self.rst = None
self.bias = 0
class AVLTree:
def __init__(self):
self.root = None
def rotate_left(self, v):
u = v.rs... | import sys
INF = 1 << 30
class Node:
def __init__(self, key, val):
self.key = key
self.val = val
self.lst = None
self.rst = None
self.bias = 0
class AVLTree:
def __init__(self):
self.root = None
def rotate_left(self, v):
u = v.rs... | p03033 |
import sys
INF = 1 << 30
class Node:
__slots__ = ["key", "val", "lch", "rch", "bias"]
def __init__(self, key, val):
self.key = key
self.val = val
self.lch = None
self.rch = None
self.bias = 0
class AVLTree:
__slots__ = ["root"]
def __init__(sel... | import sys
INF = 1 << 30
class Node:
__slots__ = ["key", "val", "lch", "rch", "bias"]
def __init__(self, key, val):
self.key = key
self.val = val
self.lch = None
self.rch = None
self.bias = 0
class AVLTree:
__slots__ = ["root"]
def __init__(sel... | p03033 |
import sys
INF = 1 << 30
class Node:
__slots__ = ["key", "val", "lch", "rch", "bias"]
def __init__(self, key, val):
self.key = key
self.val = val
self.lch = None
self.rch = None
self.bias = 0
class AVLTree:
__slots__ = ["root"]
def __init__(sel... | import sys
INF = 1 << 30
class Node:
def __init__(self, key):
self.key = key
self.lch = None
self.rch = None
self.bias = 0
class AVLTree:
def __init__(self):
self.root = None
def rotate_left(self, v):
u = v.rch
v.rch = u.lch
... | p03033 |
import sys
input = sys.stdin.readline
# Segment Tree
class Segment:
def __init__(self, N, init_val):
self.N0 = 2 ** (N - 1).bit_length()
# 0-indexedで管理
self.dat = [identity_element] * (2 * self.N0)
# 値を代入
for i in range(N):
self.dat[i + self.N0 - 1] ... | import sys
input = sys.stdin.readline
# Segment Tree
# segfunc : min, +, *, xor, gcd など
# identity_element : 単位元(min:inf, 和:0, 積:1, xor:0, gcd:0)
class Segment:
def __init__(self, N, init_val):
"""[セグメント木]
Args:
N ([int]): [要素数]
init_val ([list]): [初期化する値]
... | p03033 |
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
events = []
for _ in range(n):
s, t, x = list(map(int, input().split()))
events.append((s-x-0.5, 's', x)) # start construction
events.append((t-x-0.5, 'e', x)) # end construction
for i in range(q):
d = int(eval(inp... | import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
events = []
for _ in range(n):
s, t, x = list(map(int, input().split()))
events.append((s-x-0.5, 1, x)) # start construction
events.append((t-x-0.5, -1, x)) # end construction
for i in range(q):
d = int(eval(input(... | p03033 |
from bisect import bisect_left
from operator import itemgetter
N, Q = list(map(int, input().split(" ")))
check_points = [tuple(map(int, input().split(" "))) for _ in range(N)]
querys = [int(eval(input())) for _ in range(Q)]
time = [-1 for _ in range(Q)]
jump = [-1 for _ in range(Q)]
check_points = sorted(check... | from bisect import bisect_left
from operator import itemgetter
N, Q = list(map(int, input().split(" ")))
check_points = [tuple(map(int, input().split(" "))) for _ in range(N)]
querys = [int(eval(input())) for _ in range(Q)]
time = [-1] * Q
jump = [-1] * Q
check_points = sorted(check_points, key=itemgetter(2))
... | p03033 |
from bisect import bisect_left
from operator import itemgetter
N, Q = list(map(int, input().split(" ")))
check_points = [tuple(map(int, input().split(" "))) for _ in range(N)]
querys = [int(eval(input())) for _ in range(Q)]
time = [-1] * Q
jump = [-1] * Q
check_points = sorted(check_points, key=itemgetter(2))
... | from bisect import bisect_left
from operator import itemgetter
import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split(" ")))
check_points = [tuple(map(int, input().split(" "))) for _ in range(N)]
querys = [int(eval(input())) for _ in range(Q)]
time = [-1] * Q
jump = [-1] * Q
check_points ... | p03033 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, q = list(map(int, readline().split()))
event = [0] * (2 * n + q)
for i in range(n):
s, t, x = list(map(int, readline().split()))
event[i * 2] = (s - x... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, q = list(map(int, readline().split()))
event = [0] * (2 * n + q)
for i in range(n):
s, t, x = list(map(int, readline().split()))
event[i * 2] = (s - x... | p03033 |
import sys
input = sys.stdin.readline
from heapq import heappop, heappush
from collections import defaultdict
N, Q = list(map(int, input().split()))
lst = []
l_append = lst.append
for i in range(N):
s, t, x = list(map(int, input().split()))
l_append((t - x, 0, x)) #xで止まらなくなる
l_append((s - x,... | import sys
input = sys.stdin.readline
from heapq import heappop, heappush
from collections import defaultdict
N, Q = list(map(int, input().split()))
lst = []
l_append = lst.append
for i in range(N):
s, t, x = list(map(int, input().split()))
l_append((t - x, 0, x)) #xで止まらなくなる
l_append((s - x,... | p03033 |
def main():
import sys
from collections import defaultdict
from heapq import heappop, heappush
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
used = defaultdict(int)
tank = []
p = []
p_append = p.append
for i in range(N):
s, t, x = li... | def main():
import sys
input = sys.stdin.readline
from bisect import bisect_left
N, Q = list(map(int, input().split()))
c = []
c_append = c.append
for _ in range(N):
s, t, x = list(map(int, input().split()))
c_append((x, s, t))
c.sort()
D = [int(eval(in... | p03033 |
import bisect
n, q = list(map(int, input().split()))
ran = []
for i in range(n):
s, t, x = list(map(int, input().split()))
ran.append((s-x, t-x-1, x))
ran.sort(key=lambda a: a[2])
qu = []
convert = {}
for i in range(q):
que = int(eval(input()))
convert[que] = i
qu.append(que)
qu.sor... | import sys
input = sys.stdin.readline
import bisect
n, q = list(map(int, input().split()))
ran = []
for i in range(n):
s, t, x = list(map(int, input().split()))
ran.append((s-x, t-x-1, x))
ran.sort(key=lambda a: a[2])
qu = []
convert = {}
for i in range(q):
que = int(eval(input()))
conv... | p03033 |
def main():
import sys,heapq
from collections import defaultdict
input = sys.stdin.readline
n,q = list(map(int,input().split()))
#used[i]:0より大きいならi
used = defaultdict(int)
tank = []
p = []
for i in range(n):
s,t,x = list(map(int,input().split()))
p.appe... | def main():
import sys,heapq
from collections import defaultdict
input = sys.stdin.readline
n,q = list(map(int,input().split()))
#used[i]:0より大きいならi
used = defaultdict(int)
tank = []
p = []
for i in range(n):
s,t,x = list(map(int,input().split()))
p.appe... | p03033 |
import bisect
N,Q = (int(x) for x in input().split())
stop_arr = [tuple(map(int, input().split())) for _ in range(N)]
Q_arr = [int(input()) for _ in range(Q)]
stop_arr_ind = list(range(N))
stop_arr_ind.sort(key=lambda x:stop_arr[x][2])
# stop_arr.sort(key=lambda x:x[2], reverse=True)
ans_arr = [-1]*Q
skip... | import bisect
N,Q = (int(x) for x in input().split())
stop_arr = [tuple(map(int, input().split())) for _ in range(N)]
Q_arr = [int(input()) for _ in range(Q)]
stop_arr.sort(key=lambda x:x[2])
ans_arr = [-1]*Q
skip_arr = [-1]*(Q+1)
def update_skip(skip_arr, x):
if skip_arr[x] == -1:
return... | p03033 |
import bisect
N,Q = (int(x) for x in input().split())
stop_arr = [tuple(map(int, input().split())) for _ in range(N)]
Q_arr = [int(input()) for _ in range(Q)]
stop_arr.sort(key=lambda x:x[2])
ans_arr = [-1]*Q
skip_arr = [-1]*(Q+1)
def update_skip(skip_arr, x):
if skip_arr[x] == -1:
return... | import bisect
N,Q = (int(x) for x in input().split())
stop_arr = [tuple(map(int, input().split())) for _ in range(N)]
Q_arr = [int(input()) for _ in range(Q)]
stop_arr.sort(key=lambda x:x[2])
ans_arr = [-1]*Q
skip_arr = [-1]*(Q+1)
for s,t,x in stop_arr:
q_start = bisect.bisect_left(Q_arr, s-x)
... | p03033 |
import sys
input = sys.stdin.readline
import bisect
N,Q = (int(x) for x in input().split())
stop_arr = [tuple(map(int, input().split())) for _ in range(N)]
Q_arr = [int(input()) for _ in range(Q)]
stop_arr_ind = list(range(N))
stop_arr_ind.sort(key=lambda x:stop_arr[x][2], reverse=True)
ans_arr = [-1]*Q... | import sys
input = sys.stdin.readline
import bisect
N,Q = (int(x) for x in input().split())
stop_arr = [tuple(map(int, input().split())) for _ in range(N)]
Q_arr = [int(input()) for _ in range(Q)]
stop_arr_ind = list(range(N))
stop_arr_ind.sort(key=lambda x:stop_arr[x][2])
ans_arr = [-1]*Q
skip_arr = [... | p03033 |
import sys
import bisect
N, Q = list(map(int, input().split(' ')))
G = [list(map(int, sys.stdin.readline().split(' '))) for _ in range(N)]
T = [int(sys.stdin.readline()) for _ in range(Q)]
G.sort(key = lambda x : -x[2])
class SegTree :
def __init__(self, n) :
self.n = n
self.A = [No... | import sys
import bisect
N, Q = list(map(int, input().split(' ')))
G = [list(map(int, sys.stdin.readline().split(' '))) for _ in range(N)]
T = [int(sys.stdin.readline()) for _ in range(Q)]
class SegTree :
def __init__(self, n) :
self.n = n
self.A = [10**15] * (2 << (n + 1).bit_length())... | p03033 |
N,Q = list(map(int, input().split()))
STX = [list(map(int, input().split())) for _ in range(N)]
D = [int(eval(input())) for _ in range(Q)]
L = [(s-x-0.5, t-x-0.5,x) for s,t,x in STX] + [(d,) for d in D]
L.sort()
import heapq
hp = [] # (x,t-x)を入れる
for l in L:
if len(l)==1:
while hp and l[0] > hp[0][... | N,Q = list(map(int, input().split()))
STX = [list(map(int, input().split())) for _ in range(N)]
D = [int(eval(input())) for _ in range(Q)]
L = [(s-x-0.5, t-x-0.5,x) for s,t,x in STX] + [(d,) for d in D]
L.sort()
import heapq
hp = [] # xを入れる
memo = {} # x:t-x
for l in L:
if len(l)==1:
while hp and ... | p03033 |
import heapq
def main():
N, Q = list(map(int, input().split()))
ls = []
lt = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
ls.append((s-x, x))
lt.append((t-x, x))
ls.sort(reverse=True)
lt.sort(reverse=True)
dh = []
dl = []
for i ... | import heapq
def main():
N, Q = list(map(int, input().split()))
l = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
l.append((s-x, 1, x))
l.append((t-x, 0, x))
for i in range(Q):
d = int(eval(input()))
l.append((d, 2, i))
r = [-1] * ... | p03033 |
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss ... | import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss ... | p03033 |
import sys
from bisect import bisect_left
class RangeUpdateTree:
def __init__(self, n, initial=-1, sentinel=-2):
n2 = 1 << n.bit_length()
self.n = n2
self.offset = n2
self.data = [initial] * (n2 << 1)
self.sentinel = sentinel
def update(self, a, b, x):
... | import sys
from bisect import bisect_left
class RangeUpdateTree:
def __init__(self, n, initial=-1, sentinel=-2):
n2 = 1 << n.bit_length()
self.n = n2
self.offset = n2
self.data = [initial] * (n2 << 1)
self.sentinel = sentinel
def update(self, a, b, x):
... | p03033 |
import sys
from bisect import bisect_left
class RangeUpdateTree:
def __init__(self, n, initial=-1, sentinel=-2):
n2 = 1 << n.bit_length()
self.n = n2
self.offset = n2
self.data = [initial] * (n2 << 1)
self.sentinel = sentinel
def update(self, a, b, x):
... | import sys
from bisect import bisect_left
n, q = list(map(int, input().split()))
lines = sys.stdin.readlines()
kkk = []
for line in lines[:n]:
s, t, x = list(map(int, line.split()))
kkk.append((x, s, t))
kkk.sort()
ddd = list(map(int, lines[n:]))
ans = [-1] * q
skip = [-1] * q
for x, s, t in kkk... | p03033 |
from collections import deque
import heapq
import sys
n,p=list(map(int,input().split()))
e=[]
for _ in range(n):
s,t,x = list(map(int,input().split()))
e.append((s-x,1,x))
e.append((t-x,-1,x))
e = sorted(e)
q = deque()
for _ in range(p):
q.append(int(eval(input())))
s=set()
for t,f,x i... | import sys
input = sys.stdin.readline
n,q = list(map(int,input().split()))
imos = []
for i in range(n):
s,t,x = list(map(int,input().split()))
imos.append((s-x,x))
imos.append((t-x,-x))
ans = set()
j = 0
for i in range(q):
d = int(eval(input()))
imos.append((d,1e100))
imos.sort()
m ... | p03033 |
n,q=[int(j) for j in input().split()]
l=[]
for i in range(n):
s,t,x=[int(j) for j in input().split()]
l.append((s-x,1,x))
l.append((t-x,0,x))
for i in range(q):
d=int(eval(input()))
l.append((d,2,i))
l.sort()
ans=[-1]*q
ll=set()
m=10**18
p=False
for i,j,x in l:
if j==1:
... | import sys
input = sys.stdin.readline
n,q=[int(j) for j in input().split()]
l=[]
for i in range(n):
s,t,x=[int(j) for j in input().split()]
l.append((s-x,1,x))
l.append((t-x,0,x))
for i in range(q):
d=int(eval(input()))
l.append((d,2,i))
l.sort()
ans=[-1]*q
ll=set()
m=10**18
p=F... | p03033 |
import sys
input = sys.stdin.readline
n,q=[int(j) for j in input().split()]
l=[]
for i in range(n):
s,t,x=[int(j) for j in input().split()]
l.append((s-x,1,x))
l.append((t-x,0,x))
for i in range(q):
d=int(eval(input()))
l.append((d,2,i))
l.sort()
ans=[-1]*q
ll=set()
m=10**18
p=F... | def f():
import sys
input = sys.stdin.readline
n,q=[int(j) for j in input().split()]
l=[]
for i in range(n):
s,t,x=[int(j) for j in input().split()]
l.append((s-x,1,x))
l.append((t-x,0,x))
for i in range(q):
d=int(eval(input()))
l.append((d,2,... | p03033 |
import sys
from bisect import *
input = sys.stdin.readline
def f(n, q, ss):
xst = []
for ssk in ss[:n]:
s, t, x = map(int, ssk.split())
xst.append([x, s - x, t - x])
xst.sort()
ds = list(map(int, ss[n:]))
ans = [-1] * q
for x, s, t in xst:
i = bisect_l... | import sys
from bisect import *
input = sys.stdin.readline
def f(n, q):
xst = []
for i in range(n):
s, t, x = map(int, input().split())
xst.append([x, s - x, t - x])
xst.sort()
ds = []
for i in range(q):
d = int(input())
ds.append(d)
ans = [-1... | p03033 |
from bisect import*
from collections import*
import sys;input=sys.stdin.readline
def doevent(lis):
global stop
a,b=lis
if b>=0:
if stop=={-1}:
stop=set()
stop.add(b)
else:
if -b in stop:
stop.remove(-b)
if stop==set():
s... | import sys;input=sys.stdin.readline
n,q=list(map(int, input().split()))
event=[]
for _ in range(n):
s,t,x=list(map(int,input().split()))
event.append((s-x-0.5,1,x))
event.append((t-x-0.5,-1,x))
for i in range(q):
event.append((int(eval(input())),0,i))
event.sort()
is_stop=False
stop=s... | p03033 |
class DualSegmentTree():
def __init__(self, n, op, e):
"""
:param n: 配列の要素数
:param op: 作用素（モノイド＝結合則＋単位元存在）
:param e: 単位元
"""
self.n = n
self.op = op
self.e = e
self.size = 1 << (self.n - 1).bit_length()
self.lazy = [self.e... | class DualSegmentTree():
def __init__(self, n, op, e):
"""
:param n: 配列の要素数
:param op: 作用素（モノイド＝結合則＋単位元存在）
:param e: 単位元
"""
self.n = n
self.op = op
self.e = e
self.size = 1 << (self.n - 1).bit_length()
self.lazy = [self.e... | p03033 |
class DualSegmentTree():
def __init__(self, n, op, e):
"""
:param n: 配列の要素数
:param op: 作用素（モノイド＝結合則＋単位元存在）
:param e: 単位元
"""
self.n = n
self.op = op
self.e = e
self.depth = (self.n - 1).bit_length()
self.size = 1 << self.d... | class DualSegmentTree():
def __init__(self, n, op, e):
"""
:param n: 配列の要素数
:param op: 作用素（モノイド＝結合則＋単位元存在）
:param e: 単位元
"""
self.n = n
self.op = op
self.e = e
self.depth = (self.n - 1).bit_length()
self.size = 1 << self.d... | p03033 |
class DualSegmentTree():
def __init__(self, n, op, e):
"""
:param n: 配列の要素数
:param op: 作用素（モノイド＝結合則＋単位元存在）
:param e: 単位元
"""
self.n = n
self.op = op
self.e = e
self.depth = (self.n - 1).bit_length()
self.size = 1 << self.d... | class DualSegmentTree():
def __init__(self, n, op, e):
"""
:param n: 配列の要素数
:param op: 作用素（モノイド＝結合則＋単位元存在）
:param e: 単位元
"""
self.n = n
self.op = op
self.e = e
self.depth = (self.n - 1).bit_length()
self.size = 1 << self.d... | p03033 |
import sys
from itertools import accumulate
from collections import Counter
from bisect import bisect as br, bisect_left as bl
from operator import itemgetter
class DammyMap:
#1-indexed
def __init__(self, A, B):
#Aに初期状態の要素をすべて入れる,Bは値域のリスト
self.X, self.comp = self.compress(B)
se... | import sys
from itertools import accumulate
from collections import Counter
from bisect import bisect as br, bisect_left as bl
from operator import itemgetter
class DammyMap:
#1-indexed
def __init__(self, A, B):
#Aに初期状態の要素をすべて入れる,Bは値域のリスト
#self.X, self.comp = self.compress(B)
s... | p03033 |
import bisect
import sys
sys.setrecursionlimit(10000)
INF = float('inf')
N, Q = list(map(int, next(sys.stdin).split()))
STX = [list(map(int, next(sys.stdin).split())) for _ in range(N)]
D = [int(next(sys.stdin)) for _ in range(Q)]
ans = [-1 for _ in range(Q)]
nexts = [-1 for _ in range(Q)]
for s, t, x ... | import bisect
import sys
sys.setrecursionlimit(10000)
INF = float('inf')
N, Q = list(map(int, next(sys.stdin).split()))
STX = [list(map(int, next(sys.stdin).split())) for _ in range(N)]
D = [int(next(sys.stdin)) for _ in range(Q)]
ans = [-1] * Q
nexts = [-1] * Q
for s, t, x in sorted(STX, key=lambda st... | p03033 |
from collections import defaultdict
from heapq import heappop, heappush
N, Q = list(map(int, input().split()))
INF = float('inf')
events = []
for i in range(N):
S, T, X = list(map(int, input().split()))
events.append((S - X, 0, X))
events.append((T - X, 1, X))
for _ in range(Q):
events.a... | import sys
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush
N, Q = list(map(int, input().split()))
INF = float('inf')
events = []
for i in range(N):
S, T, X = list(map(int, input().split()))
events.append((S - X, 0, X))
events.append((T - X, 1,... | p03033 |
from collections import deque
from heapq import heappush, heappop
N, Q = map(int, input().split())
E = []
for i in range(N):
s, t, x = map(int, input().split())
E.append((0, t - x, x, i))
E.append((1, s - x, x, i))
D = [int(input()) for _ in range(Q)]
E.sort(key=lambda a: a[1], reverse=True)
... | from heapq import heappush, heappop
import sys
input = sys.stdin.buffer.readline
N, Q = map(int, input().split())
E = []
for i in range(N):
s, t, x = map(int, input().split())
E.append((0, t - x, x, i))
E.append((1, s - x, x, i))
D = [int(input()) for _ in range(Q)]
E.sort(key=lambda a: a[... | p03033 |
from bisect import bisect_left
n, Q = [int(x) for x in input().split()]
stx = [[int(x) for x in input().split()] for i in range(n)]
q = [int(eval(input())) for i in range(Q)]
stx.sort(key=lambda x: x[2])
ans = [-1 for i in range(Q)]
skip = [-1 for i in range(Q)]
for (s, t, x) in stx:
begin = bisect_left(q, ... | from bisect import bisect_left
n, Q = list(map(int, input().split()))
stx = [list(map(int, input().split())) for i in range(n)]
q = [int(eval(input())) for i in range(Q)]
stx.sort(key=lambda x: x[2])
ans = [-1 for i in range(Q)]
skip = [-1 for i in range(Q)]
for (s, t, x) in stx:
begin = bisect_left(q, s-x)... | p03033 |
from bisect import bisect_left
n, Q = list(map(int, input().split()))
stx = [list(map(int, input().split())) for i in range(n)]
q = [int(eval(input())) for i in range(Q)]
stx.sort(key=lambda x: x[2])
ans = [-1 for i in range(Q)]
skip = [-1 for i in range(Q)]
for (s, t, x) in stx:
begin = bisect_left(q, s-x)... | from bisect import bisect_left
n, Q = [int(x) for x in input().split()]
stx = [[int(x) for x in input().split()] for i in range(n)]
q = [int(eval(input())) for i in range(Q)]
stx.sort(key=lambda x: x[2])
ans = [-1 for i in range(Q)]
skip = [-1 for i in range(Q)]
for (s, t, x) in stx:
begin = bisect_left(q, ... | p03033 |
from bisect import bisect_left
n, Q = [int(x) for x in input().split()]
stx = [[int(x) for x in input().split()] for i in range(n)]
q = [int(eval(input())) for i in range(Q)]
stx.sort(key=lambda x: x[2])
ans = [-1 for i in range(Q)]
skip = [-1 for i in range(Q)]
for (s, t, x) in stx:
begin = bisect_left(q, ... | from bisect import bisect_left
import sys
n, Q = [int(x) for x in sys.stdin.readline().split()]
stx = [[int(x) for x in sys.stdin.readline().split()] for i in range(n)]
q = [int(sys.stdin.readline()) for i in range(Q)]
stx.sort(key=lambda x: x[2])
ans = [-1 for i in range(Q)]
skip = [-1 for i in range(Q)]
for... | p03033 |
from bisect import bisect_left
N, Q = map(int, input().split())
W = [tuple(map(int, input().split())) for _ in range(N)]
W.sort(key=lambda x:x[2])
D = [int(input()) for _ in range(Q)]
ans = [-1]*Q
skip = [-1]*Q
for s, t, x in W:
l = bisect_left(D, s-x)
r = bisect_left(D, t-x)
while l < r:
... | import sys
input = sys.stdin.readline
from bisect import bisect_left
N, Q = map(int, input().split())
W = [tuple(map(int, input().split())) for _ in range(N)]
W.sort(key=lambda x:x[2])
D = [int(input()) for _ in range(Q)]
ans = [-1]*Q
skip = [-1]*Q
for s, t, x in W:
l = bisect_left(D, s-x)
r = bisect... | p03033 |
import heapq
def main():
N, Q = list(map(int, input().split()))
STX = tuple(list(map(int, input().split())) for _ in range(N))
D = tuple([int(eval(input())) for _ in range(Q)])
L = []
for s, t, x in STX:
L.append((x, s - x, t - x))
L.sort(key = lambda x: x[1])
q = []
cnt = 0
for i i... | import heapq
def main():
N, Q = list(map(int, input().split()))
STX = tuple(list(map(int, input().split())) for _ in range(N))
D = tuple([int(eval(input())) for _ in range(Q)])
L = []
for s, t, x in STX:
L.append((x, s - x, t - x))
L.sort(key = lambda x: x[1])
q = []
cnt = 0
push = ... | p03033 |
def update(l, r, v):
L = l + N0; R = r + N0
while L < R:
if R & 1:
R -= 1
data[R-1] = v
if L & 1:
data[L-1] = v
L += 1
L >>= 1; R >>= 1
# a_iの現在の値を取得
def _query(k):
k += N0-1
s = INF
while k >= 0:
if dat... | def update(l, r, v):
L = l + N0; R = r + N0
while L < R:
if R & 1:
R -= 1
data[R-1] = v
if L & 1:
data[L-1] = v
L += 1
L >>= 1; R >>= 1
# a_iの現在の値を取得
def _query(k):
k += N0-1
s = INF
while k >= 0:
if dat... | p03033 |
from bisect import bisect_right
N,Q,*L = list(map(int, open(0).read().split()))
D = L[3*N:]
ls = [0]*N
for i in range(N):
s,t,x = L[3*i],L[3*i+1],L[3*i+2]
ls[i] = (x,s,t)
ls.sort()
line = [0]*(2*N)
for i in range(N):
x,s,t = ls[i]
line[2*i] = (s-x,0,i)
line[2*i+1] = (t-x,1,i)
line.sort()
road = ... | from heapq import heappush, heappop
N,Q,*L = list(map(int, open(0).read().split()))
D = L[3*N:]
ls = []
for i in range(N):
s,t,x = L[3*i],L[3*i+1],L[3*i+2]
ls.append((s-x,1,x))
ls.append((t-x,0,x))
for i,d in enumerate(D):
ls.append((d,2,i))
ls.sort()
ans = [0]*Q
S = set()
hq = []
for a,b,c in ls:... | p03033 |
n,q = list(map(int, input().split()))
stx = [tuple(map(int, input().split())) for _ in range(n)]
d = [int(eval(input())) for _ in range(q)]
#これはセグ木 * bisect
import bisect
inf = 10**9 + 100
def init(n,init_num=0):
num = len(str(bin(n-1))) + 1
seg = [init_num] * (2**num)
seg[0] = 2**(num-1)
... | import sys
input = sys.stdin.readline
n,q = list(map(int, input().split()))
# stx = [tuple(map(int, input().split())) for _ in range(n)]
stx = [0]*n
for i in range(n):
stx[i] = tuple(map(int, input().split()))
# d = [int(input()) for _ in range(q)]
d = [0]*q
for i in range(q):
d[i] = int(eval(input(... | p03033 |
n,q = list(map(int, input().split()))
# stx = [tuple(map(int, input().split())) for _ in range(n)]
stx = [0]*n
for i in range(n):
stx[i] = tuple(map(int, input().split()))
# d = [int(input()) for _ in range(q)]
d = [0]*q
for i in range(q):
d[i] = int(eval(input()))
#これはセグ木 * bisect
import bisect
in... | import sys
input = sys.stdin.readline
n,q = list(map(int, input().split()))
stx = [tuple(map(int, input().split())) for _ in range(n)]
d = [int(eval(input())) for _ in range(q)]
#これはセグ木 * bisect
import bisect
inf = 10**9 + 100
def init(n,init_num=0):
num = len(str(bin(n-1))) + 1
seg = [init_num]... | p03033 |
import heapq
class HeapDict:
def __init__(self):
self.h = []
self.d = {}
def insert(self,x):
if x not in self.d or self.d[x] == 0:
heapq.heappush(self.h, x)
self.d.setdefault(x,0)
self.d[x] += 1
def erase(self,x):
if x not in self.... | import heapq
class HeapDict:
def __init__(self):
self.h = []
self.d = {}
def insert(self,x):
if x not in self.d or self.d[x] == 0:
heapq.heappush(self.h, x)
self.d.setdefault(x,0)
self.d[x] += 1
def erase(self,x):
if x not in self.... | p03033 |
import heapq
class HeapDict:
def __init__(self):
self.h = []
self.d = {}
def insert(self,x):
if x not in self.d or self.d[x] == 0:
heapq.heappush(self.h, x)
self.d.setdefault(x,0)
self.d[x] += 1
def erase(self,x):
if x not in self.... | import heapq
class HeapDict:
def __init__(self):
self.h = []
self.d = {}
def insert(self,x):
if x not in self.d or self.d[x] == 0:
heapq.heappush(self.h, x)
self.d.setdefault(x,0)
self.d[x] += 1
def erase(self,x):
if x not in self.... | p03033 |
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
import bisect
"""
各工事場所について，
Dがどのレンジなら引っかかるかを記録しておく．
最初全部のDに関して，infまで行けるものとして，
Xが大きい順に工事区間を見て，引っ... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
import bisect
"""
各工事場所について，
Dがどのレンジなら引っかかるかを記録しておく．
最初全部のDに関して，infまで行けるものとして，
Xが小さい順に工事区間を見て，引っ... | p03033 |
import sys
input = sys.stdin.buffer.readline
N,Q = list(map(int, input().split()))
List = []
dic = {}
for _ in range(N):
s, t, x = list(map(int, input().split()))
List.append([s-0.5-x, 1, x])
List.append([t-0.5-x, -1, x])
dic[x] = False
import heapq
List.sort()
h = []
j = 0
for... | import sys
input = sys.stdin.buffer.readline
N,Q = list(map(int, input().split()))
List = []
dic = {}
for _ in range(N):
s, t, x = list(map(int, input().split()))
List.append((s-0.5-x, 1, x))
List.append((t-0.5-x, -1, x))
dic[x] = False
import heapq
List.sort()
h = []
j = 0
for... | p03033 |
import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | p03033 |
import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | p03033 |
import bisect
N, Q = list(map(int, input().rstrip().split(' ')))
construction = [list(map(int, input().rstrip().split(' '))) for _ in range(N)]
D = [int(eval(input())) for _ in range(Q)]
construction = sorted(construction, key=lambda x: x[2])
dist = [-1] * Q
jump = [-1] * Q
indices = list(range(Q))
for c ... | import sys
import bisect
input=sys.stdin.readline
N, Q = list(map(int, input().split(' ')))
construction = [list(map(int, input().split(' '))) for _ in range(N)]
D = [int(eval(input())) for _ in range(Q)]
construction = sorted(construction, key=lambda x: x[2])
dist = [-1] * Q
jump = [-1] * Q
indices = li... | p03033 |
def main():
import bisect
n,q=list(map(int,input().split()))
stx=[list(map(int,input().split())) for _ in [0]*n]
d=[int(eval(input())) for _ in [0]*q]
stx=[[s-x,t-x-1,x] for s,t,x in stx]
stx=[[bisect.bisect_left(d,s),bisect.bisect_right(d,t),x] for s,t,x in stx]
#セグ木の要素数（num）および深... | def main():
from bisect import bisect_left
from bisect import bisect_right
from sys import stdin
input=stdin.readline
n,q=list(map(int,input().split()))
stx=[list(map(int,input().split())) for _ in [0]*n]
d=[int(eval(input())) for _ in [0]*q]
stx=[[s-x,t-x-1,x] for s,t,x in stx... | p03033 |
import sys, heapq
input = sys.stdin.buffer.readline # 入出力高速化
def main():
N, Q = list(map(int, input().split()))
tl = [] # イベントタイムライン
for _ in range(N):
S, T, X = list(map(int, input().split()))
tl.append((S-X, 1, X)) # insert
tl.append((T-X, 0, X)) # erase
for _ in ran... | import sys
input = sys.stdin.buffer.readline # 入出力高速化
def main():
N, Q = list(map(int, input().split()))
tl = [] # イベントタイムライン
for _ in range(N):
S, T, X = list(map(int, input().split()))
tl.append((S-X, 1, X)) # insert
tl.append((T-X, 0, X)) # erase
for _ in range(Q):
... | p03033 |
from ctypes import *
import subprocess as sp
from operator import itemgetter
import sys
import os.path
set_code = r"""
#include <set>
std::set<int> s;
void add(int x) {
s.insert(x);
}
bool find(int x) {
return s.find(x) != s.end();
}
void remove(int x) {
s.erase(x);
}
bool empty... | from ctypes import *
import subprocess as sp
from operator import itemgetter
import sys
import os.path
set_code = r"""
#include <set>
std::set<int> s;
void add(int x) {
s.insert(x);
}
bool find(int x) {
return s.find(x) != s.end();
}
void remove(int x) {
s.erase(x);
}
bool empty... | p03033 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000000)
MOD = 10 ** 9 + 7
INF = (1<<31) - 1
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from bisect import bisect_left
class LazySegmentTree():
fx = min
fa = min
fm = min
unit_x = INF
unit_m = INF
def __init__(self,Q):
... | import sys
input = sys.stdin.readline
INF = (1<<31)
from bisect import bisect_left
class LazySegmentTree():
def __init__(self,Q):
self.N = Q
self.tree = [INF]*(2*self.N)
self.lazy = [INF]*(2*self.N)
def _evaluate(self,K):#Kの上の遅延配列を評価する
H = K.bit_length() - 1
... | p03033 |
from operator import itemgetter
import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
events = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
add_event = (s - x, 1, x)
remove_event = (t - x, -1, x)
events.append(add_event)
events.append(remov... | from operator import itemgetter
import sys
input = sys.stdin.readline
inf = float('inf')
N, Q = list(map(int, input().split()))
events = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
add_event = (s - x, 1, x)
remove_event = (t - x, -1, x)
events.append(add_event)
... | p03033 |
from operator import itemgetter
import sys
input = sys.stdin.readline
inf = float('inf')
N, Q = list(map(int, input().split()))
es = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
es.append((s - x, 1, x))
es.append((t - x - 0.5, -1, x))
es.sort(key=itemgetter(0))
st = s... | from operator import itemgetter
import sys
input = sys.stdin.readline
inf = float('inf')
n, q = list(map(int, input().split()))
e = []
for _ in range(n):
s, t, x = list(map(int, input().split()))
# 区間[s, t)に通行止め
e.append((s - x, x, 0)) # 通行止め開始
e.append((t - x - 0.5, x, 1)) # 通行止め解除
e... | p03033 |
# https://atcoder.jp/contests/abc128/submissions/8312583
# 写経
def solve():
from heapq import heappush, heappop
from collections import defaultdict
from operator import itemgetter
import sys
input = sys.stdin.readline
inf = 1 << 31
n, q = map(int, input().split())
e = ... | # https://atcoder.jp/contests/abc128/submissions/8312583
# 写経
def solve():
from heapq import heappush, heappop
from collections import defaultdict
from operator import itemgetter
import sys
input = sys.stdin.readline
inf = 1 << 31
n, q = map(int, input().split())
S = ... | p03033 |
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
def main():
kouji_num, person_num = list(map(int, input().split()))
koji_data = [list(map(int, input().split())) for i in ... | from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
def main():
kouji_num, person_num = list(map(int, input().split()))
koji_data = [list(map(int, input().split())) for i in ... | p03033 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | p03033 |
class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | p03033 |
class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | p03033 |
class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | p03033 |
class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | p03033 |
class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | class AVLtree:
"""
参考：http://www.nct9.ne.jp/m_hiroi/light/pyalgo12.html
insert : 挿入
erase : 削除
lower_bound(x) : x <= v なる最小のv、なければ-float("inf")、最小値はlower(-float("inf"))
upper_bound(x) : v < x なる最大のv、なければfloat("inf")、最大値はupper(float("inf"))
print(avltree) : デバッグ用
"""
def _... | p03033 |
# -*- coding: utf-8 -*-
import sys
from collections import Counter, defaultdict
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d f... | # -*- coding: utf-8 -*-
import sys
from heapq import heappush, heappop
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in r... | p03033 |
import sys
import bisect
from heapq import heappush, heappop
sys.setrecursionlimit(10 ** 7)
# TLE
N, Q = list(map(int, input().split()))
STX = [[int(x) for x in input().split()] for _ in range(N)]
EVENT = []
for s, t, x in STX:
EVENT.append((s-x, 1, x))
EVENT.append((t-x, 0, x))
for i in range(... | import sys
import bisect
from heapq import heappush, heappop
sys.setrecursionlimit(10 ** 7)
# TLE
N, Q = list(map(int, input().split()))
STX = [[int(x) for x in input().split()] for _ in range(N)]
EVENT = []
for s, t, x in STX:
EVENT.append((s-x, 1, x))
EVENT.append((t-x, 0, x))
for i in range(... | p03033 |
import sys
import bisect
from heapq import heappush, heappop
sys.setrecursionlimit(10 ** 7)
# TLE
N, Q = list(map(int, input().split()))
STX = [[int(x) for x in input().split()] for _ in range(N)]
EVENT = []
for s, t, x in STX:
EVENT.append((s-x, 1, x))
EVENT.append((t-x, 0, x))
for i in range(... | import sys
from heapq import heappush, heappop
sys.setrecursionlimit(10 ** 7)
# TLE
N, Q = list(map(int, input().split()))
STX = [[int(x) for x in input().split()] for _ in range(N)]
EVENT = []
for s, t, x in STX:
EVENT.append((s-x, 1, x))
EVENT.append((t-x, 0, x))
for i in range(Q):
d = in... | p03033 |
#D in [S_i-X_i,T_i-X_i) → Xiで止まる
import sys
input = sys.stdin.readline
from heapq import heappop,heappush
from collections import defaultdict
N,Q = list(map(int,input().split()))
task = []
STX = [[int(x) for x in input().split()] for _ in range(N)]
for s,t,x in STX:
task.append((t-x,0,x)) # xで止まらなくなる
... | from heapq import heappush, heappop
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, Q = list(map(int, input().split()))
STX = [[int(x) for x in input().split()] for _ in range(N)]
EVENT = []
for s, t, x in STX:
EVENT.append((s-x, 1, x))
EVENT.append((t-x, 0, x))
for i in ra... | p03033 |
# coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
STX.sort(key=lambda x: x[2], reverse=True)
event = []
for s, t, x in STX:
... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
event = []
for s, t, x in STX:
event.append((s-x, 0, x))
event.append((t-x, -1, x))
for i in range(Q):
d ... | p03033 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
event = []
for s, t, x in STX:
event.append((s-x, 0, x))
event.append((t-x, -1, x))
for i in range(Q):
d ... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def main():
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
event = []
for s, t, x in STX:
event.append((s-x, 0, x))
event.append((t-x, ... | p03033 |
# coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
STX.sort(key=lambda x: x[2], reverse=True)
event = []
for s, t, x in STX:
... | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
event = []
append = event.append
for s, t, x in STX:
append((s-x, 0, x)... | p03033 |
# coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
event = []
append = event.append
for s, t, x in STX:
append((s-x, 0, x)... | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
STX = [tuple(lr()) for _ in range(N)]
event = []
append = event.append
for s, t, x in STX:
append((s-x, 0, x)... | p03033 |
from bisect import bisect_left
def main():
N, Q, *I = map(int, open(0).read().split())
STX, D = I[:3 * N], I[3 * N:]
E = sorted(zip(*[iter(STX)] * 3), key=lambda x: x[2])
R = [-1] * Q
ans = [-1] * Q
for s, t, x in E:
l = bisect_left(D, s - x)
r = bisect_left(D,... | from bisect import bisect_left
def main():
N, Q, *I = list(map(int, open(0).read().split()))
STX, D = I[:3 * N], I[3 * N:]
E = sorted(zip(*[iter(STX)] * 3), key=lambda x: x[2])
R = [-1] * Q
ans = [-1] * Q
for s, t, x in E:
l = bisect_left(D, s - x)
r = bisect_l... | p03033 |
#D in [S_i-X_i,T_i-X_i) → Xiで止まる
import sys
input = sys.stdin.readline
from heapq import heappop,heappush
from collections import defaultdict
N,Q = list(map(int,input().split()))
task = []
STX = [[int(x) for x in input().split()] for _ in range(N)]
for s,t,x in STX:
task.append((t-x,0,x)) # xで止まらなくなる
... | import sys
input = lambda : sys.stdin.readline().rstrip()
from heapq import heappush, heappop
running = []
events = []
delete = set()
n, q = list(map(int, input().split()))
for _ in range(n):
s, t, x = list(map(int, input().split()))
time = max(s - x, 0)
if t - x < 0:
continue
... | p03033 |
import sys
input = lambda : sys.stdin.readline().rstrip()
from heapq import heappush, heappop
running = []
events = []
delete = set()
n, q = list(map(int, input().split()))
for _ in range(n):
s, t, x = list(map(int, input().split()))
time = max(s - x, 0)
if t - x < 0:
continue
... | def main():
import sys
input = lambda : sys.stdin.readline().rstrip()
from heapq import heappush, heappop
running = []
events = []
delete = set()
n, q = list(map(int, input().split()))
for _ in range(n):
s, t, x = list(map(int, input().split()))
time = ma... | p03033 |
import sys, heapq
input = sys.stdin.buffer.readline # 入出力高速化
def main():
N, Q = list(map(int, input().split()))
tl = [] # イベントタイムライン
for _ in range(N):
S, T, X = list(map(int, input().split()))
tl.append((S-X, 1, X)) # insert
tl.append((T-X, 0, X)) # erase
for _ in ran... | import sys
input = sys.stdin.buffer.readline # 入出力高速化
def main():
N, Q = list(map(int, input().split()))
tl = [] # イベントタイムライン
for _ in range(N):
S, T, X = list(map(int, input().split()))
tl.append((S-X, 1, X)) # insert
tl.append((T-X, 0, X)) # erase
for _ in range(Q):
... | p03033 |
import sys
input = lambda : sys.stdin.readline().rstrip()
def segfun(x, y):
return min(x, y)
ide_ele = float("inf")
class SegmentTree:
def __init__(self, n, ele, segfun):
self.ide_ele = ele
self.segfun = segfun
self.n = n
self.N0 = 1 << n.bit_length()
sel... | import sys
input = lambda : sys.stdin.readline().rstrip()
def segfun(x, y):
return min(x, y)
ide_ele = 10**9 + 1
class SegmentTree:
def __init__(self, n, ele, segfun):
self.ide_ele = ele
self.segfun = segfun
self.n = n
self.N0 = 1 << n.bit_length()
self.d... | p03033 |
def main():
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in fi... | def main():
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in fi... | p03033 |
# -*- coding: utf-8 -*-
import sys
from heapq import heappush, heappop, heapify
from collections import defaultdict
import copy
N,Q=list(map(int, sys.stdin.readline().split()))
S=[]
event=[]
for _ in range(N):
s,t,x=list(map(int, sys.stdin.readline().split()))
event.append( ( s-x ,1, x) ) #Start
ev... | # -*- coding: utf-8 -*-
import sys
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
N,Q=list(map(int, sys.stdin.readline().split()))
S=[]
event=[] #x, s, t
for _ in range(N):
s,t,x=list(map(int, sys.stdin.readline().split()))
heappush( event, (x, max(0,s-x) , max(0,t-1-x))... | p03033 |
import sys
input = sys.stdin.readline
from heapq import heappop,heappush
N,Q = list(map(int,input().split()))
task = []
STX = [[int(x) for x in input().split()] for _ in range(N)]
for s,t,x in STX:
task.append((t-x,0,x))
task.append((s-x,1,x))
for i in range(Q):
d = int(eval(input()))
task.appe... | import sys
input = sys.stdin.buffer.readline
import heapq
def main():
N,Q = list(map(int,input().split()))
event = []
for _ in range(N):
s,t,x = list(map(int,input().split()))
event.append((s-x,1,x))
event.append((t-x,0,x))
for i in range(Q):
... | p03033 |
import bisect
n, q = list(map(int, input().split()))
rws = [list(map(int, input().split())) for _ in range(n)]
ds = [int(eval(input())) for _ in range(q)]
rws.sort(key = lambda x: x[2])
ans = [-1 for _ in range(q)]
for rw in rws:
st = bisect.bisect_left(ds, rw[0] - rw[2])
en = bisect.bisect_left(ds, rw[1]... | import bisect
n, q = list(map(int, input().split()))
rws = [list(map(int, input().split())) for _ in range(n)]
ds = [int(eval(input())) for _ in range(q)]
rws.sort(key = lambda x: x[2])
ans = [-1 for _ in range(q)]
nxt = [-1 for _ in range(q)]
for rw in rws:
st = bisect.bisect_left(ds, rw[0] - rw[2])
e... | p03033 |
class BIT():
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def getsum(self, k):
ret = 0
while k:
ret += self.bit[k]
k -= k & -k
return ret
def p_sum(self, i, j):
return self.getsum(j) - self.getsum(i - 1)
def add(self, k, x):
while k <= self.n:
self.bit[k] += ... | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter as get
from heapq import *
def main():
n, q = list(map(int, input().split()))
event = []
Xs = []
for _ in range(n):
s, t, x = list(map(int, input().split()))
event.append((-2, s - x, x))
event.append((-1, t - x, x))
... | p03033 |
from heapq import heappush, heappop
n, q = list(map(int, input().split()))
events = []
for i in range(n):
s, t, i = list(map(int, input().split()))
if t >= i:
events.append([t - i, 0, i])
events.append([s - i, 1, i])
for i in range(q):
d = int(eval(input()))
events.append([d, 2... | from heapq import heappush, heappop
n, q = list(map(int, input().split()))
events = []
for i in range(n):
s, t, x = list(map(int, input().split()))
if t >= x:
events.append([t - x, 0, x])
events.append([s - x, 1, x])
for i in range(q):
d = int(eval(input()))
events.append... | p03033 |
from heapq import heappush, heappop
n, q = list(map(int, input().split()))
events = []
for i in range(n):
s, t, x = list(map(int, input().split()))
if t >= x:
events.append([t - x, 0, x])
events.append([s - x, 1, x])
for i in range(q):
d = int(eval(input()))
events.append... | from heapq import heappush, heappop
n, q = map(int, input().split())
events = []
for i in range(n):
s, t, x = map(int, input().split())
if t >= x:
events.append([t - x, 0, x])
events.append([s - x, 1, x])
for i in range(q):
d = int(input())
events.append([d, 2, i])
event... | p03033 |
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
import bisect
N,Q = list(map(int,input().split()))
# STX = [list(map(int,input().split())) for _ in range (N)]
STX = []
vals = set()
for _ in range(N):
s,t,x = list(map(int,input().split()))
STX.append([max(0,s-x), max(0,t-x), x])
... | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
import bisect
N,Q = list(map(int,input().split()))
# STX = [list(map(int,input().split())) for _ in range (N)]
STX = []
vals = set()
for _ in range(N):
s,t,x = list(map(int,input().split()))
STX.append([max(0,s-x), max(0,t-x), x])
... | p03033 |
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
import bisect
N,Q = list(map(int,input().split()))
# STX = [list(map(int,input().split())) for _ in range (N)]
STX = []
vals = set()
for _ in range(N):
s,t,x = list(map(int,input().split()))
STX.append((max(0,s-x), max(0,t-x), x))
... | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
import bisect
N,Q = list(map(int,input().split()))
# STX = [list(map(int,input().split())) for _ in range (N)]
STX = []
vals = set()
for _ in range(N):
s,t,x = list(map(int,input().split()))
STX.append((max(0,s-x), max(0,t-x), x))
... | p03033 |
def main():
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
X = []
stx = []
tmp = set([])
for _ in range(n):
s,t,x = list(map(int, input().split()))
stx.append((s,t,x))
tmp.add(x-t)
tmp.add(x-s)
d = {}
fo... | def main():
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
stx = []
tmp = set([])
for _ in range(n):
s,t,x = list(map(int, input().split()))
stx.append((s,t,x))
tmp.add(x-t)
tmp.add(x-s)
d = {}
for i in ran... | p03033 |
import sys
import bisect
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
STX = [list(map(int, input().split())) for _ in range(N)]
# xの昇順に工事の区間をsort
STX = sorted(STX, key=lambda x: x[2])
D = [int(eval(input())) for _ in range(Q)]
ans = [-1] * Q
for s, t, x in STX:
left = bisect.b... | import sys
import bisect
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
STX = [list(map(int, input().split())) for _ in range(N)]
# xの昇順に工事の区間をsort
STX = sorted(STX, key=lambda x: x[2])
D = [int(eval(input())) for _ in range(Q)]
ans = [-1] * Q
index = [-1] * Q
for s, t, x in STX:
... | p03033 |
# -*- coding: utf-8 -*-
import sys
from heapq import heappush,heappop
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
d... | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
class BIT:
... | p03033 |
from operator import itemgetter
def main():
n, q = list(map(int, input().split()))
stops = []
for _ in range(n):
s, t, x = list(map(int, input().split()))
stops.append((s, t, x))
delay = []
for i in range(q):
delay.append([int(eval(input())), False, -1])
s... | from operator import itemgetter
from bisect import bisect_left
def main():
n, q = list(map(int, input().split()))
stops = []
for _ in range(n):
s, t, x = list(map(int, input().split()))
stops.append((s, t, x))
delay = []
for i in range(q):
delay.append(int(eval(... | p03033 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,q=list(map(int,input().split()))
STX=[tuple(map(int,input().split())) for i in range(n)]... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,q=list(map(int,input().split()))
STX=[tuple(map(int,input().split())) for i in range(n)]... | p03033 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,q=list(map(int,input().split()))
STX=[tuple(map(int,input().split())) for i in range(n)]... | #!/usr/bin/env python3
import sys
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
# inf = float('inf') ;mod = 10**9+7
# mans = inf ;ans = 0 ;count = 0 ;pro = 1
from heapq import heappush,heappop
n,q=list(map(int,input().split()))
STX=[tuple(map(int,input().split())) for i in range(n)]
D=[... | p03033 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
# inf = float('inf') ;mod = 10**9+7
# mans = inf ;ans = 0 ;count = 0 ;pro = 1
from heapq import heappush,heappop
n,q=list(map(int,input().split()))
STX=[tuple(map(int,inp... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,q=list(map(int,input().split()))
STX=[tuple(map(int,input().split())) for i in range(n)]... | p03033 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect, heapq
input = lambda: sys.stdin.buffer.readline()
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,q=map(int,input().split())
STX=[tuple(map(int,input().split())) for i in range(n)]
D=[int(input()) for i in rang... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,q=list(map(int,input().split()))
STX=[tuple(map(int,input().split())) for i in range(n)]... | p03033 |
# -*- coding: utf-8 -*-
from bisect import bisect_left
from sys import stdin
from heapq import heappush, heappop
readl = stdin.readline
## input
N,Q = list(map(int, readl().rstrip().split()))
STX = [list(map(int, readl().rstrip().split())) for _ in range(N)]
Dn = [None for _ in range(Q+1)]
for i in ran... | import sys
from bisect import bisect_left
N,Q = list(map(int, input().split()))
lines = sys.stdin.readlines()
kkk = []
for line in lines[:N]:
s, t, x = list(map(int, line.split()))
kkk.append((x, s, t))
kkk.sort()
ddd = list(map(int, lines[N:]))
ans = [-1] * Q
skip = [-1] * Q
for x, s, t in kkk:... | p03033 |
import bisect
import sys
input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''
def main():
N, Q = list(map(int, input().split()))
S, T, X = [0] * N, [0] * N, [0] * N
for i in range(N):
S[i], T[i], X[i] = list(map(int, input().split()))
D =... | import bisect
import sys
input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''
N, Q = list(map(int, input().split()))
S, T, X = [0] * N, [0] * N, [0] * N
work = []
for i in range(N):
S[i], T[i], X[i] = list(map(int, input().split()))
work.append((X... | p03033 |
N,Q = map(int,input().split())
STX = [tuple(map(int,input().split())) for i in range(N)]
D = [int(input()) for i in range(Q)]
starts = []
ends = []
for i,(s,t,x) in enumerate(STX):
starts.append((s-x,i))
ends.append((t-x,i))
starts.sort(key=lambda x:x[0], reverse=True)
ends.sort(key=lambda x:x[0], re... | N,Q = map(int,input().split())
STX = [tuple(map(int,input().split())) for i in range(N)]
D = [int(input()) for i in range(Q)]
starts = []
ends = []
for i,(s,t,x) in enumerate(STX):
starts.append((s-x,i))
ends.append((t-x,i))
starts.sort(key=lambda x:x[0], reverse=True)
ends.sort(key=lambda x:x[0], re... | p03033 |
import sys
input = sys.stdin.readline
from bisect import bisect_left
# 区間更新 1点取得
class SegmentTree:
def __init__(self, N):
tmp = 1
while tmp < N:
tmp <<= 1
# self.N : 完全二分木の葉の数(N以上の最小の2べき)
self.N = tmp
# 2*self.N - 1 : 完全二分木のノード数
# 1-indexedで... | from bisect import bisect_left
import sys
input = sys.stdin.readline
class SegmentTree():
def __init__(self,size,func,default):
self.leaf=2**(size-1).bit_length()
self.data=[default]*(2*self.leaf-1)
self.f=func; self.d=default
def rangeupdate(self,l,r,x):
l+=self.leaf-... | p03033 |
import sys
input=sys.stdin.readline
from bisect import bisect_left
class SegmentTree():
def __init__(self,size,func,default):
self.leaf=2**(size-1).bit_length()
self.data=[default]*(2*self.leaf-1)
self.f=func; self.d=default
def rangeupdate(self,l,r,x):
l+=self.leaf-1; r... | import sys
input=sys.stdin.readline
from bisect import bisect_left
n,q=map(int,input().split())
STX=[tuple(map(int,input().split())) for _ in range(n)]
STX.sort(key=lambda x: x[2])
D=[int(input()) for _ in range(q)]
Ans=[-1]*q; Jump=[-1]*q
for s,t,x in STX:
l=bisect_left(D,s-x)
r=bisect_left(D,t-x)
... | p03033 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.