結果
問題 | No.707 書道 |
ユーザー | McGregorsh |
提出日時 | 2022-07-02 15:24:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 270 ms / 2,000 ms |
コード長 | 1,970 bytes |
コンパイル時間 | 739 ms |
コンパイル使用メモリ | 87,060 KB |
実行使用メモリ | 94,176 KB |
最終ジャッジ日時 | 2023-08-18 06:28:33 |
合計ジャッジ時間 | 4,658 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 243 ms
92,848 KB |
testcase_01 | AC | 246 ms
92,792 KB |
testcase_02 | AC | 267 ms
94,176 KB |
testcase_03 | AC | 248 ms
92,816 KB |
testcase_04 | AC | 245 ms
92,840 KB |
testcase_05 | AC | 270 ms
94,064 KB |
testcase_06 | AC | 265 ms
93,884 KB |
testcase_07 | AC | 266 ms
93,920 KB |
testcase_08 | AC | 248 ms
93,560 KB |
ソースコード
import sys, re 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 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(): h, w = i_map() fild = [['-1'] * (w+2)] for i in range(h): num = ['-1'] + list(input()) + ['-1'] fild.append(num) fild.append([['-1'] * (w+2)]) skip = [[0, 0], [0, w+2-1], [h+2-1, 0], [h+2-1, w+2-1]] ans = INF for i in range(h+2): for j in range(w+2): if [i, j] in skip: continue if i == 0 or j == 0 or i == h+2-1 or j == w+2-1: score = 0 for k in range(1, h+1): for l in range(1, w+1): if fild[k][l] == '1': score += get_distance(i, j, k, l) ans = min(ans, score) print(ans) if __name__ == '__main__': main()