結果
問題 | No.2225 Treasure Searching Rod (Easy) |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 12:45:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 385 ms / 2,000 ms |
コード長 | 1,816 bytes |
コンパイル時間 | 1,296 ms |
コンパイル使用メモリ | 86,684 KB |
実行使用メモリ | 94,208 KB |
最終ジャッジ日時 | 2023-08-18 07:50:42 |
合計ジャッジ時間 | 10,551 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 243 ms
91,896 KB |
testcase_01 | AC | 240 ms
92,296 KB |
testcase_02 | AC | 247 ms
91,844 KB |
testcase_03 | AC | 241 ms
92,064 KB |
testcase_04 | AC | 243 ms
92,256 KB |
testcase_05 | AC | 244 ms
92,072 KB |
testcase_06 | AC | 242 ms
92,136 KB |
testcase_07 | AC | 385 ms
94,072 KB |
testcase_08 | AC | 319 ms
94,208 KB |
testcase_09 | AC | 318 ms
93,772 KB |
testcase_10 | AC | 290 ms
93,664 KB |
testcase_11 | AC | 289 ms
93,452 KB |
testcase_12 | AC | 323 ms
94,016 KB |
testcase_13 | AC | 318 ms
94,016 KB |
testcase_14 | AC | 320 ms
94,040 KB |
testcase_15 | AC | 293 ms
93,360 KB |
testcase_16 | AC | 298 ms
93,376 KB |
testcase_17 | AC | 298 ms
93,604 KB |
testcase_18 | AC | 299 ms
93,492 KB |
testcase_19 | AC | 293 ms
93,556 KB |
testcase_20 | AC | 300 ms
93,580 KB |
testcase_21 | AC | 274 ms
93,680 KB |
testcase_22 | AC | 241 ms
92,152 KB |
testcase_23 | AC | 281 ms
93,304 KB |
testcase_24 | AC | 277 ms
93,312 KB |
testcase_25 | AC | 264 ms
93,172 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): H, W, K = i_map() fild = [[0] * W for i in range(H)] for i in range(K): x, y, v = i_map() x -= 1 y -= 1 fild[x][y] = v ans = 0 for i in range(H): for j in range(W): cou = 0 for k in range(H): for l in range(W): if k - l >= i - j and k + l >= i + j: cou += fild[k][l] cou %= MOD2 ans += cou ans %= MOD2 print(ans) if __name__ == '__main__': main()