結果
問題 |
No.3214 small square
|
ユーザー |
|
提出日時 | 2025-07-25 20:03:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,641 ms / 3,000 ms |
コード長 | 6,578 bytes |
コンパイル時間 | 450 ms |
コンパイル使用メモリ | 82,240 KB |
実行使用メモリ | 168,628 KB |
最終ジャッジ日時 | 2025-09-01 21:54:47 |
合計ジャッジ時間 | 47,752 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
ソースコード
class LazySegTree: __slots__ = ["n", "log", "size", "data", "lazy", "e", "op", "mapping", "composition", "id"] def push(self, k): # self.all_apply(2 * k, self.lazy[k]) self.data[2 * k] = self.mapping(self.lazy[k], self.data[2 * k]) if 2 * k < self.size: self.lazy[2 * k] = self.composition(self.lazy[k], self.lazy[2 * k]) # self.all_apply(2 * k + 1, self.lazy[k]) self.data[2 * k + 1] = self.mapping(self.lazy[k], self.data[2 * k + 1]) if 2 * k < self.size: self.lazy[2 * k + 1] = self.composition(self.lazy[k], self.lazy[2 * k + 1]) self.lazy[k] = self.id def __init__(self, op, e, mapping, composition, id, lst): self.n = len(lst) self.log = (self.n - 1).bit_length() self.size = 1 << self.log self.data = [e] * (2 * self.size) self.lazy = [id] * (2 * self.size) self.e = e self.op = op self.mapping = mapping self.composition = composition self.id = id for i in range(self.n): self.data[self.size + i] = lst[i] for i in range(self.size - 1, 0, -1): # self.update(i) self.data[i] = self.op(self.data[i << 1], self.data[(i << 1) | 1]) def set(self, p, x): assert 0 <= p and p < self.n p += self.size for i in range(self.log, 0, -1): self.push(p >> i) self.data[p] = x for i in range(1, self.log + 1): # self.update(p >> i) k = p >> i self.data[k] = self.op(self.data[k << 1], self.data[(k << 1) | 1]) def get(self, p): assert 0 <= p and p < self.n p += self.size for i in range(self.log, 0, -1): self.push(p >> i) return self.data[p] def prod(self, l, r): assert 0 <= l and l <= r and r <= self.n if l == r: return self.e l += self.size r += self.size for i in range(self.log, 0, -1): if ((l >> i) << i) != l: self.push(l >> i) if ((r >> i) << i) != r: self.push(r >> i) sml, smr = self.e, self.e while l < r: if l & 1: sml = self.op(sml, self.data[l]) l += 1 if r & 1: r -= 1 smr = self.op(self.data[r], smr) l >>= 1 r >>= 1 return self.op(sml, smr) def all_prod(self): return self.data[1] def apply_point(self, p, f): assert 0 <= p and p < self.n p += self.size for i in range(self.log, 0, -1): self.push(p >> i) self.data[p] = self.mapping(f, self.data[p]) for i in range(1, self.log + 1): # self.update(p >> i) k = p >> i self.data[k] = self.op(self.data[k << 1], self.data[(k << 1) | 1]) def apply(self, l, r, f): assert 0 <= l and l <= r and r <= self.n if l == r: return l += self.size r += self.size for i in range(self.log, 0, -1): if ((l >> i) << i) != l: self.push(l >> i) if ((r >> i) << i) != r: self.push((r - 1) >> i) l2, r2 = l, r while l < r: if l & 1: # self.all_apply(l, f) self.data[l] = self.mapping(f, self.data[l]) if l < self.size: self.lazy[l] = self.composition(f, self.lazy[l]) l += 1 if r & 1: r -= 1 # self.all_apply(r, f) self.data[r] = self.mapping(f, self.data[r]) if l < self.size: self.lazy[r] = self.composition(f, self.lazy[r]) l >>= 1 r >>= 1 l, r = l2, r2 for i in range(1, self.log + 1): if ((l >> i) << i) != l: # self.update(l >> i) k = l >> i self.data[k] = self.op(self.data[k << 1], self.data[(k << 1) | 1]) if ((r >> i) << i) != r: # self.update((r - 1) >> i) k = (r - 1) >> i self.data[k] = self.op(self.data[k << 1], self.data[(k << 1) | 1]) def max_right(self, l, g): assert 0 <= l and l <= self.n assert g(self.e) if l == self.n: return self.n l += self.size for i in range(self.log, 0, -1): self.push(l >> i) sm = self.e while 1: while l % 2 == 0: l >>= 1 if not (g(self.op(sm, self.data[l]))): while l < self.size: self.push(l) l = 2*l if g(self.op(sm, self.data[l])): sm = self.op(sm, self.data[l]) l += 1 return l - self.size sm = self.op(sm, self.data[l]) l += 1 if (l&-l) == l: break return self.n def min_left(self, r, g): assert 0 <= r and r <= self.n assert g(self.e) if r == 0: return 0 r += self.size for i in range(self.log, 0, -1): self.push((r - 1) >> i) sm = self.e while 1: r -= 1 while r > 1 and (r % 2): r >>= 1 if not (g(self.op(self.data[r], sm))): while r < self.size: self.push(r) r = 2*r + 1 nsm = self.op(self.data[r], sm) if g(nsm): sm = nsm r -= 1 return r + 1 - self.size sm = self.op(self.data[r], sm) if (r&-r) == r: break return 0 def __str__(self): return str([self.get(i) for i in range(self.n)]) n, a = map(int, input().split()) # すべてを2倍しておくことで、簡単に整数で扱う ys = set() qry = [] for i in range(n): x, y, v = map(int, input().split()) qry.append((2*(x-a), y, v)) # 点の追加 qry.append((2*x+1, y, -v)) # 点の削除 ys.add(2*y+1) ys.add(2*(y-a)) idx = {y:i for i,y in enumerate(sorted(ys))} qry.sort() def add(x, y): return x + y seg = LazySegTree(max, 0, add, add, 0, [0] * (len(ys) + 1)) px = -1 ans = 0 for x, y, v in qry: if px != x: ans = max(ans, seg.all_prod()) l = idx[2*(y-a)] r = idx[2*y+1] + 1 seg.apply(l, r, v) px = x print(ans)