結果
問題 | No.2225 Treasure Searching Rod (Easy) |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 12:45:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 241 ms / 2,000 ms |
コード長 | 1,816 bytes |
コンパイル時間 | 269 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 91,264 KB |
最終ジャッジ日時 | 2024-11-27 11:35:44 |
合計ジャッジ時間 | 6,414 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 154 ms
89,344 KB |
testcase_01 | AC | 151 ms
89,216 KB |
testcase_02 | AC | 150 ms
89,344 KB |
testcase_03 | AC | 154 ms
89,344 KB |
testcase_04 | AC | 149 ms
89,472 KB |
testcase_05 | AC | 146 ms
89,088 KB |
testcase_06 | AC | 146 ms
89,344 KB |
testcase_07 | AC | 241 ms
90,880 KB |
testcase_08 | AC | 226 ms
90,880 KB |
testcase_09 | AC | 224 ms
90,624 KB |
testcase_10 | AC | 205 ms
90,752 KB |
testcase_11 | AC | 203 ms
90,368 KB |
testcase_12 | AC | 224 ms
90,880 KB |
testcase_13 | AC | 225 ms
91,264 KB |
testcase_14 | AC | 230 ms
90,880 KB |
testcase_15 | AC | 206 ms
90,496 KB |
testcase_16 | AC | 206 ms
90,496 KB |
testcase_17 | AC | 203 ms
90,240 KB |
testcase_18 | AC | 204 ms
90,240 KB |
testcase_19 | AC | 204 ms
90,240 KB |
testcase_20 | AC | 202 ms
90,496 KB |
testcase_21 | AC | 184 ms
90,112 KB |
testcase_22 | AC | 151 ms
89,216 KB |
testcase_23 | AC | 186 ms
90,496 KB |
testcase_24 | AC | 189 ms
90,752 KB |
testcase_25 | AC | 167 ms
90,496 KB |
ソースコード
import sys, refrom fractions import Fractionfrom math import ceil, floor, sqrt, pi, factorial, gcdfrom copy import deepcopyfrom collections import Counter, deque, defaultdictfrom heapq import heapify, heappop, heappushfrom itertools import accumulate, product, combinations, combinations_with_replacement, permutationsfrom bisect import bisect, bisect_left, bisect_rightfrom functools import reducefrom decimal import Decimal, getcontext, ROUND_HALF_UPdef 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 ddef rotate(table):n_fild = []for x in zip(*table[::-1]):n_fild.append(x)return n_fildsys.setrecursionlimit(10 ** 7)INF = float('inf')MOD = 10 ** 9 + 7MOD2 = 998244353def 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 -= 1y -= 1fild[x][y] = vans = 0for i in range(H):for j in range(W):cou = 0for k in range(H):for l in range(W):if k - l >= i - j and k + l >= i + j:cou += fild[k][l]cou %= MOD2ans += couans %= MOD2print(ans)if __name__ == '__main__':main()