結果

問題 No.1360 [Zelkova 4th Tune] 協和音
ユーザー McGregorshMcGregorsh
提出日時 2023-05-09 15:44:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,143 ms / 2,000 ms
コード長 1,960 bytes
コンパイル時間 454 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 197,120 KB
最終ジャッジ日時 2024-11-26 02:19:57
合計ジャッジ時間 25,116 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 144 ms
88,960 KB
testcase_01 AC 149 ms
89,036 KB
testcase_02 AC 148 ms
89,600 KB
testcase_03 AC 147 ms
89,280 KB
testcase_04 AC 148 ms
89,532 KB
testcase_05 AC 143 ms
89,344 KB
testcase_06 AC 147 ms
89,344 KB
testcase_07 AC 146 ms
89,588 KB
testcase_08 AC 147 ms
89,600 KB
testcase_09 AC 151 ms
89,448 KB
testcase_10 AC 147 ms
89,472 KB
testcase_11 AC 146 ms
89,472 KB
testcase_12 AC 147 ms
89,384 KB
testcase_13 AC 147 ms
89,344 KB
testcase_14 AC 160 ms
90,240 KB
testcase_15 AC 160 ms
90,240 KB
testcase_16 AC 153 ms
89,984 KB
testcase_17 AC 157 ms
90,112 KB
testcase_18 AC 145 ms
89,344 KB
testcase_19 AC 160 ms
90,316 KB
testcase_20 AC 154 ms
90,144 KB
testcase_21 AC 145 ms
89,116 KB
testcase_22 AC 161 ms
90,368 KB
testcase_23 AC 278 ms
100,224 KB
testcase_24 AC 365 ms
113,024 KB
testcase_25 AC 1,143 ms
196,812 KB
testcase_26 AC 168 ms
90,496 KB
testcase_27 AC 171 ms
90,496 KB
testcase_28 AC 1,129 ms
197,120 KB
testcase_29 AC 205 ms
93,524 KB
testcase_30 AC 276 ms
100,080 KB
testcase_31 AC 278 ms
100,224 KB
testcase_32 AC 185 ms
90,948 KB
testcase_33 AC 1,134 ms
197,000 KB
testcase_34 AC 1,141 ms
196,992 KB
testcase_35 AC 1,135 ms
196,852 KB
testcase_36 AC 1,135 ms
196,864 KB
testcase_37 AC 1,140 ms
196,992 KB
testcase_38 AC 1,136 ms
196,936 KB
testcase_39 AC 1,125 ms
196,864 KB
testcase_40 AC 1,123 ms
196,864 KB
testcase_41 AC 1,119 ms
197,080 KB
testcase_42 AC 1,115 ms
197,120 KB
testcase_43 AC 144 ms
89,344 KB
testcase_44 AC 956 ms
152,104 KB
testcase_45 AC 142 ms
89,472 KB
testcase_46 AC 987 ms
149,756 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 = int(input())
   A = i_list()
   B = [i_list() for i in range(N)]
   
   logs = defaultdict(list)
   ans = -INF
   for bit in product([0, 1], repeat=N):
   	  if sum(bit) == 0:
   	  	  continue
   	  cou = 0
   	  for i in range(N):
   	  	  if bit[i] == 1:
   	  	  	  cou += A[i]
   	  for j in range(N-1):
   	  	  for k in range(j+1, N):
   	  	  	  if bit[j] == 1 and bit[k] == 1:
   	  	  	  	  cou += B[j][k]
   	  ans = max(ans, cou)
   	  logs[cou].append(bit)
   
   print(ans)
   P = logs[ans][0]
   bits = []
   for i in range(N):
   	  if P[i] == 1:
   	  	  bits.append(i+1)
   print(*bits)
   
if __name__ == '__main__':
    main()
0