結果
問題 | No.455 冬の大三角 |
ユーザー | tonnnura172 |
提出日時 | 2020-04-21 22:52:18 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 32 ms / 2,000 ms |
コード長 | 1,151 bytes |
コンパイル時間 | 77 ms |
コンパイル使用メモリ | 10,904 KB |
実行使用メモリ | 9,768 KB |
最終ジャッジ日時 | 2023-10-09 23:54:50 |
合計ジャッジ時間 | 5,311 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
9,648 KB |
testcase_01 | AC | 31 ms
9,672 KB |
testcase_02 | AC | 31 ms
9,708 KB |
testcase_03 | AC | 30 ms
9,648 KB |
testcase_04 | AC | 30 ms
9,532 KB |
testcase_05 | AC | 29 ms
9,580 KB |
testcase_06 | AC | 30 ms
9,716 KB |
testcase_07 | AC | 31 ms
9,460 KB |
testcase_08 | AC | 32 ms
9,764 KB |
testcase_09 | AC | 30 ms
9,700 KB |
testcase_10 | AC | 30 ms
9,672 KB |
testcase_11 | AC | 30 ms
9,656 KB |
testcase_12 | AC | 30 ms
9,492 KB |
testcase_13 | AC | 31 ms
9,520 KB |
testcase_14 | AC | 30 ms
9,708 KB |
testcase_15 | AC | 30 ms
9,644 KB |
testcase_16 | AC | 30 ms
9,676 KB |
testcase_17 | AC | 30 ms
9,592 KB |
testcase_18 | AC | 30 ms
9,700 KB |
testcase_19 | AC | 31 ms
9,524 KB |
testcase_20 | AC | 30 ms
9,648 KB |
testcase_21 | AC | 30 ms
9,712 KB |
testcase_22 | AC | 30 ms
9,648 KB |
testcase_23 | AC | 30 ms
9,524 KB |
testcase_24 | AC | 30 ms
9,460 KB |
testcase_25 | AC | 30 ms
9,656 KB |
testcase_26 | AC | 32 ms
9,536 KB |
testcase_27 | AC | 30 ms
9,528 KB |
testcase_28 | AC | 30 ms
9,536 KB |
testcase_29 | AC | 32 ms
9,596 KB |
testcase_30 | AC | 31 ms
9,572 KB |
testcase_31 | AC | 31 ms
9,524 KB |
testcase_32 | AC | 31 ms
9,528 KB |
testcase_33 | AC | 32 ms
9,628 KB |
testcase_34 | AC | 30 ms
9,660 KB |
testcase_35 | AC | 31 ms
9,536 KB |
testcase_36 | AC | 30 ms
9,692 KB |
testcase_37 | AC | 31 ms
9,680 KB |
testcase_38 | AC | 31 ms
9,664 KB |
testcase_39 | AC | 32 ms
9,680 KB |
testcase_40 | AC | 32 ms
9,532 KB |
testcase_41 | AC | 32 ms
9,536 KB |
testcase_42 | AC | 30 ms
9,692 KB |
testcase_43 | AC | 31 ms
9,624 KB |
testcase_44 | AC | 30 ms
9,536 KB |
testcase_45 | AC | 31 ms
9,768 KB |
testcase_46 | AC | 31 ms
9,736 KB |
testcase_47 | AC | 31 ms
9,632 KB |
testcase_48 | AC | 30 ms
9,724 KB |
testcase_49 | AC | 29 ms
9,532 KB |
testcase_50 | AC | 30 ms
9,644 KB |
testcase_51 | AC | 30 ms
9,672 KB |
testcase_52 | AC | 30 ms
9,724 KB |
testcase_53 | AC | 30 ms
9,500 KB |
testcase_54 | AC | 30 ms
9,712 KB |
testcase_55 | AC | 29 ms
9,648 KB |
testcase_56 | AC | 30 ms
9,544 KB |
ソースコード
import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul, add from copy import deepcopy from string import ascii_lowercase, ascii_uppercase, digits from bisect import bisect, bisect_left from math import gcd from heapq import heappush, heappop from functools import reduce, lru_cache def input(): return sys.stdin.readline().strip() def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(): return list(map(int, input().split())) def ZIP(n): return zip(*(MAP() for _ in range(n))) sys.setrecursionlimit(10 ** 9) INF = float('inf') mod = 10 ** 9 + 7 H, W = MAP() S = [list(input()) for _ in range(H)] pos = [] for i in range(H): for j in range(W): if S[i][j] == "*": pos.append((i, j)) for i in range(H): for j in range(W): p1, p2 = deepcopy(pos) p1y, p1x = p1 p2y, p2x = p2 p1y, p2y = p1y-i, p2y-i p1x, p2x = p1x-j, p2x-j if p1x*p2y-p1y*p2x != 0: S[i][j] = "*" for s in S: print("".join(s)) exit()