結果
問題 | No.2094 Symmetry |
ユーザー | McGregorsh |
提出日時 | 2022-10-24 00:15:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 416 ms / 2,000 ms |
コード長 | 1,993 bytes |
コンパイル時間 | 767 ms |
コンパイル使用メモリ | 87,080 KB |
実行使用メモリ | 126,020 KB |
最終ジャッジ日時 | 2023-09-15 08:15:33 |
合計ジャッジ時間 | 16,640 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
92,468 KB |
testcase_01 | AC | 248 ms
92,524 KB |
testcase_02 | AC | 254 ms
92,592 KB |
testcase_03 | AC | 252 ms
92,452 KB |
testcase_04 | AC | 243 ms
92,460 KB |
testcase_05 | AC | 248 ms
92,584 KB |
testcase_06 | AC | 250 ms
92,516 KB |
testcase_07 | AC | 248 ms
92,508 KB |
testcase_08 | AC | 248 ms
92,244 KB |
testcase_09 | AC | 395 ms
124,984 KB |
testcase_10 | AC | 392 ms
124,824 KB |
testcase_11 | AC | 399 ms
126,020 KB |
testcase_12 | AC | 391 ms
125,568 KB |
testcase_13 | AC | 362 ms
115,836 KB |
testcase_14 | AC | 390 ms
125,632 KB |
testcase_15 | AC | 388 ms
125,496 KB |
testcase_16 | AC | 387 ms
125,352 KB |
testcase_17 | AC | 360 ms
115,940 KB |
testcase_18 | AC | 360 ms
115,560 KB |
testcase_19 | AC | 390 ms
125,528 KB |
testcase_20 | AC | 390 ms
125,524 KB |
testcase_21 | AC | 392 ms
125,972 KB |
testcase_22 | AC | 401 ms
124,660 KB |
testcase_23 | AC | 364 ms
116,252 KB |
testcase_24 | AC | 369 ms
116,492 KB |
testcase_25 | AC | 416 ms
125,396 KB |
testcase_26 | AC | 392 ms
125,312 KB |
testcase_27 | AC | 248 ms
92,660 KB |
testcase_28 | AC | 324 ms
121,056 KB |
testcase_29 | AC | 249 ms
92,524 KB |
testcase_30 | AC | 324 ms
121,228 KB |
testcase_31 | AC | 327 ms
124,340 KB |
testcase_32 | AC | 320 ms
123,964 KB |
testcase_33 | AC | 248 ms
92,456 KB |
testcase_34 | AC | 325 ms
118,652 KB |
testcase_35 | AC | 326 ms
122,736 KB |
testcase_36 | AC | 311 ms
116,140 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, K = i_map() fild = [input() for i in range(2*N)] C = [i_list() for i in range(2*N)] nums = [] cou = 0 for i in range(2*N): for j in range(2*N): nums.append(C[i][j]) if fild[i][j] == '#': cou += 1 nums.sort(reverse=True) total = sum(nums[:cou]) if cou % 2 == 1: print(total) exit() lines = [] for i in range(2*N): for j in range(N): A = C[i][j] B = C[i][2*N-1-j] cost = A + B lines.append(cost) lines.sort(reverse=True) score = sum(lines[:cou//2]) + K print(max(total, score)) if __name__ == '__main__': main()