結果
問題 | No.987 N×Mマス計算(基本) |
ユーザー | McGregorsh |
提出日時 | 2023-04-29 12:24:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 159 ms / 2,000 ms |
コード長 | 1,817 bytes |
コンパイル時間 | 160 ms |
コンパイル使用メモリ | 82,392 KB |
実行使用メモリ | 90,472 KB |
最終ジャッジ日時 | 2024-11-18 09:46:22 |
合計ジャッジ時間 | 4,395 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
89,240 KB |
testcase_01 | AC | 142 ms
89,580 KB |
testcase_02 | AC | 153 ms
90,124 KB |
testcase_03 | AC | 159 ms
90,076 KB |
testcase_04 | AC | 149 ms
90,400 KB |
testcase_05 | AC | 147 ms
90,468 KB |
testcase_06 | AC | 149 ms
90,472 KB |
testcase_07 | AC | 157 ms
90,048 KB |
testcase_08 | AC | 144 ms
89,264 KB |
testcase_09 | AC | 144 ms
89,540 KB |
testcase_10 | AC | 143 ms
89,440 KB |
testcase_11 | AC | 152 ms
90,088 KB |
testcase_12 | AC | 154 ms
90,096 KB |
testcase_13 | AC | 155 ms
90,260 KB |
testcase_14 | AC | 143 ms
89,164 KB |
testcase_15 | AC | 152 ms
90,316 KB |
testcase_16 | AC | 152 ms
90,332 KB |
testcase_17 | AC | 153 ms
90,224 KB |
testcase_18 | AC | 152 ms
90,268 KB |
testcase_19 | AC | 154 ms
90,048 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 = i_map() S = input() SS = [] p = '' for i in range(len(S)): if S[i] != ' ': p += S[i] else: SS.append(p) p = '' SS.append(p) cost = [int(input()) for i in range(N)] for i in range(N): ans = [] for j in range(M): if S[0] == '+': score = int(SS[j+1]) + cost[i] else: score = int(SS[j+1]) * cost[i] ans.append(score) print(*ans) if __name__ == '__main__': main()