結果
問題 | No.2520 L1 Explosion |
ユーザー | flygon |
提出日時 | 2023-10-27 23:48:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,435 ms / 2,000 ms |
コード長 | 1,295 bytes |
コンパイル時間 | 619 ms |
コンパイル使用メモリ | 81,824 KB |
実行使用メモリ | 123,684 KB |
最終ジャッジ日時 | 2023-10-27 23:48:30 |
合計ジャッジ時間 | 14,027 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
55,748 KB |
testcase_01 | AC | 40 ms
55,748 KB |
testcase_02 | AC | 37 ms
55,748 KB |
testcase_03 | AC | 36 ms
55,748 KB |
testcase_04 | AC | 38 ms
55,748 KB |
testcase_05 | AC | 37 ms
55,748 KB |
testcase_06 | AC | 920 ms
123,596 KB |
testcase_07 | AC | 310 ms
84,380 KB |
testcase_08 | AC | 1,009 ms
123,684 KB |
testcase_09 | AC | 101 ms
78,176 KB |
testcase_10 | AC | 1,416 ms
118,044 KB |
testcase_11 | AC | 1,435 ms
118,908 KB |
testcase_12 | AC | 1,423 ms
118,836 KB |
testcase_13 | AC | 815 ms
91,284 KB |
testcase_14 | AC | 860 ms
92,408 KB |
testcase_15 | AC | 93 ms
76,640 KB |
testcase_16 | AC | 622 ms
85,832 KB |
testcase_17 | AC | 378 ms
80,772 KB |
testcase_18 | AC | 408 ms
81,564 KB |
testcase_19 | AC | 387 ms
80,340 KB |
testcase_20 | AC | 77 ms
76,544 KB |
testcase_21 | AC | 880 ms
99,296 KB |
testcase_22 | AC | 157 ms
77,560 KB |
testcase_23 | AC | 110 ms
76,992 KB |
testcase_24 | AC | 734 ms
95,040 KB |
ソースコード
import sys sys.setrecursionlimit(5*10**5) input = sys.stdin.readline from collections import defaultdict, deque, Counter from heapq import heappop, heappush from bisect import bisect_left, bisect_right from math import gcd n,m = map(int,input().split()) xyh = [list(map(int,input().split())) for i in range(n)] xyh = [[x-y,x+y,h] for x,y,h in xyh] mod = 998244353 allx = [] inx = defaultdict(list) outx = defaultdict(list) xs = set() for i in range(n): x,y,h = xyh[i] inx[x-(m-h)].append(i) outx[x+(m-h)].append(i) xs.add(x-(m-h)) xs.add(x+(m-h)) xs = sorted(list(xs)) ans = [0]*(n+1) nowy = set() cnt = 0 lastx = -10**18 for xi in xs: iny = defaultdict(list) outy = defaultdict(list) ys = set() for i in nowy: x,y,h = xyh[i] iny[y-(m-h)].append(i) outy[y+(m-h)].append(i) ys.add(y-(m-h)) ys.add(y+(m-h)) ys = sorted(list(ys)) cnt = 0 lasty = -10**18 for yi in ys: ans[cnt] += (yi-lasty)*(xi-lastx)%mod cnt -= len(outy[yi]) cnt += len(iny[yi]) lasty = yi lastx = xi for i in outx[xi]: nowy.discard(i) for i in inx[xi]: nowy.add(i) div2 = pow(2, mod-2, mod) for i in range(len(ans)): ans[i] = ans[i]*div2%mod print(*ans[1:], sep = "\n")