結果
問題 | No.2229 Treasure Searching Rod (Hard) |
ユーザー |
![]() |
提出日時 | 2023-02-24 21:49:28 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 1,903 bytes |
コンパイル時間 | 167 ms |
コンパイル使用メモリ | 81,540 KB |
実行使用メモリ | 844,120 KB |
最終ジャッジ日時 | 2024-09-13 05:20:41 |
合計ジャッジ時間 | 3,268 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 4 MLE * 1 -- * 24 |
ソースコード
import osimport sysfrom io import BytesIO, IOBaseBUFSIZE = 8192class FastIO(IOBase):newlines = 0def __init__(self, file):self._fd = file.fileno()self.buffer = BytesIO()self.writable = "x" in file.mode or "r" not in file.modeself.write = self.buffer.write if self.writable else Nonedef read(self):while True:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))if not b:breakptr = self.buffer.tell()self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)self.newlines = 0return self.buffer.read()def readline(self):while self.newlines == 0:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))self.newlines = b.count(b"\n")+(not b)ptr = self.buffer.tell()self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)self.newlines -= 1return self.buffer.readline()def flush(self):if self.writable:os.write(self._fd, self.buffer.getvalue())self.buffer.truncate(0), self.buffer.seek(0)class IOWrapper(IOBase):def __init__(self, file):self.buffer = FastIO(file)self.flush = self.buffer.flushself.writable = self.buffer.writableself.write = lambda s:self.buffer.write(s.encode("ascii"))self.read = lambda:self.buffer.read().decode("ascii")self.readline = lambda:self.buffer.readline().decode("ascii")sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)input = lambda:sys.stdin.readline().rstrip("\r\n")mod = 998244353h,w,k = map(int,input().split())a = [[0] * w for i in range(h)]# -t + w+1 = y# t = w+1-y# -t +1 = -y# t = y+1ans = 0for i in range(k):x,y,v = map(int,input().split())#print(x-w-1+y, x-y)ans += x * x % mod * vans %= modif x-w-1+y > 0:ans -= max(0, (x-w-1+y) * (x-w+y) // 2) * vans %= modif x-y > 0:ans -= max(0, (x-y) * (x-y+1) // 2) * vans %= mod#print(ans)print(ans)