結果
問題 | No.987 N×Mマス計算(基本) |
ユーザー | McGregorsh |
提出日時 | 2023-04-29 12:24:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 138 ms / 2,000 ms |
コード長 | 1,817 bytes |
コンパイル時間 | 133 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 90,496 KB |
最終ジャッジ日時 | 2024-04-29 08:09:02 |
合計ジャッジ時間 | 3,799 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 118 ms
89,548 KB |
testcase_01 | AC | 121 ms
89,600 KB |
testcase_02 | AC | 128 ms
90,496 KB |
testcase_03 | AC | 132 ms
90,468 KB |
testcase_04 | AC | 133 ms
90,112 KB |
testcase_05 | AC | 132 ms
90,400 KB |
testcase_06 | AC | 126 ms
90,196 KB |
testcase_07 | AC | 127 ms
90,112 KB |
testcase_08 | AC | 119 ms
89,660 KB |
testcase_09 | AC | 121 ms
89,724 KB |
testcase_10 | AC | 120 ms
89,472 KB |
testcase_11 | AC | 128 ms
90,368 KB |
testcase_12 | AC | 132 ms
90,200 KB |
testcase_13 | AC | 126 ms
90,496 KB |
testcase_14 | AC | 124 ms
89,472 KB |
testcase_15 | AC | 137 ms
90,112 KB |
testcase_16 | AC | 138 ms
90,368 KB |
testcase_17 | AC | 128 ms
90,368 KB |
testcase_18 | AC | 134 ms
90,112 KB |
testcase_19 | AC | 138 ms
90,384 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()