結果
問題 | No.988 N×Mマス計算(総和) |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 11:53:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 212 ms / 2,000 ms |
コード長 | 1,723 bytes |
コンパイル時間 | 429 ms |
コンパイル使用メモリ | 82,372 KB |
実行使用メモリ | 103,040 KB |
最終ジャッジ日時 | 2024-04-18 11:15:18 |
合計ジャッジ時間 | 5,345 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 129 ms
89,604 KB |
testcase_01 | AC | 142 ms
89,344 KB |
testcase_02 | AC | 146 ms
89,600 KB |
testcase_03 | AC | 135 ms
89,716 KB |
testcase_04 | AC | 133 ms
89,668 KB |
testcase_05 | AC | 133 ms
89,572 KB |
testcase_06 | AC | 133 ms
89,556 KB |
testcase_07 | AC | 134 ms
89,572 KB |
testcase_08 | AC | 131 ms
89,652 KB |
testcase_09 | AC | 133 ms
89,676 KB |
testcase_10 | AC | 173 ms
91,904 KB |
testcase_11 | AC | 172 ms
97,664 KB |
testcase_12 | AC | 202 ms
102,576 KB |
testcase_13 | AC | 172 ms
96,948 KB |
testcase_14 | AC | 178 ms
94,208 KB |
testcase_15 | AC | 177 ms
90,756 KB |
testcase_16 | AC | 190 ms
97,596 KB |
testcase_17 | AC | 194 ms
99,840 KB |
testcase_18 | AC | 168 ms
96,652 KB |
testcase_19 | AC | 192 ms
101,076 KB |
testcase_20 | AC | 212 ms
103,040 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(): N, M, K = i_map() base = s_list() flag = True if base[0] == '+': flag = False else: flag = True total = 0 for i in range(1, M+1): total += int(base[i]) ans = 0 for i in range(N): n = int(input()) if flag: ans += n * total else: ans += total + n * M ans %= K print(ans) if __name__ == '__main__': main()