結果
問題 | No.2094 Symmetry |
ユーザー | McGregorsh |
提出日時 | 2022-10-24 00:11:29 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,941 bytes |
コンパイル時間 | 760 ms |
コンパイル使用メモリ | 87,092 KB |
実行使用メモリ | 126,240 KB |
最終ジャッジ日時 | 2023-09-15 08:11:56 |
合計ジャッジ時間 | 14,840 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 236 ms
92,464 KB |
testcase_01 | AC | 238 ms
92,536 KB |
testcase_02 | AC | 238 ms
92,376 KB |
testcase_03 | AC | 230 ms
92,420 KB |
testcase_04 | WA | - |
testcase_05 | AC | 234 ms
92,600 KB |
testcase_06 | AC | 233 ms
92,668 KB |
testcase_07 | AC | 236 ms
92,584 KB |
testcase_08 | AC | 235 ms
92,692 KB |
testcase_09 | AC | 387 ms
125,308 KB |
testcase_10 | AC | 401 ms
125,184 KB |
testcase_11 | AC | 385 ms
126,136 KB |
testcase_12 | AC | 387 ms
125,848 KB |
testcase_13 | AC | 383 ms
125,560 KB |
testcase_14 | AC | 380 ms
125,732 KB |
testcase_15 | AC | 384 ms
125,940 KB |
testcase_16 | AC | 384 ms
125,436 KB |
testcase_17 | WA | - |
testcase_18 | AC | 381 ms
125,360 KB |
testcase_19 | AC | 380 ms
125,652 KB |
testcase_20 | AC | 382 ms
125,664 KB |
testcase_21 | AC | 387 ms
125,884 KB |
testcase_22 | AC | 382 ms
124,848 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 381 ms
125,768 KB |
testcase_26 | AC | 383 ms
125,768 KB |
testcase_27 | AC | 234 ms
92,452 KB |
testcase_28 | AC | 306 ms
121,432 KB |
testcase_29 | AC | 237 ms
92,616 KB |
testcase_30 | AC | 309 ms
121,164 KB |
testcase_31 | AC | 316 ms
124,144 KB |
testcase_32 | AC | 313 ms
124,560 KB |
testcase_33 | AC | 234 ms
92,468 KB |
testcase_34 | AC | 311 ms
118,696 KB |
testcase_35 | AC | 311 ms
122,948 KB |
testcase_36 | WA | - |
ソースコード
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]) 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()