結果

問題 No.1360 [Zelkova 4th Tune] 協和音
ユーザー McGregorshMcGregorsh
提出日時 2023-05-09 15:44:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,142 ms / 2,000 ms
コード長 1,960 bytes
コンパイル時間 316 ms
コンパイル使用メモリ 87,024 KB
実行使用メモリ 201,776 KB
最終ジャッジ日時 2023-08-17 07:28:57
合計ジャッジ時間 29,393 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 232 ms
92,484 KB
testcase_01 AC 229 ms
92,712 KB
testcase_02 AC 230 ms
92,608 KB
testcase_03 AC 239 ms
92,624 KB
testcase_04 AC 225 ms
92,564 KB
testcase_05 AC 224 ms
92,556 KB
testcase_06 AC 225 ms
92,644 KB
testcase_07 AC 227 ms
92,712 KB
testcase_08 AC 250 ms
92,352 KB
testcase_09 AC 232 ms
92,420 KB
testcase_10 AC 228 ms
92,476 KB
testcase_11 AC 231 ms
92,564 KB
testcase_12 AC 225 ms
92,348 KB
testcase_13 AC 230 ms
92,512 KB
testcase_14 AC 241 ms
93,908 KB
testcase_15 AC 238 ms
93,944 KB
testcase_16 AC 231 ms
93,240 KB
testcase_17 AC 238 ms
93,880 KB
testcase_18 AC 226 ms
92,424 KB
testcase_19 AC 242 ms
93,896 KB
testcase_20 AC 239 ms
93,900 KB
testcase_21 AC 226 ms
92,544 KB
testcase_22 AC 242 ms
93,888 KB
testcase_23 AC 355 ms
104,524 KB
testcase_24 AC 450 ms
118,340 KB
testcase_25 AC 1,133 ms
201,012 KB
testcase_26 AC 252 ms
94,644 KB
testcase_27 AC 261 ms
94,448 KB
testcase_28 AC 1,142 ms
201,232 KB
testcase_29 AC 297 ms
99,524 KB
testcase_30 AC 353 ms
104,700 KB
testcase_31 AC 349 ms
104,704 KB
testcase_32 AC 265 ms
94,648 KB
testcase_33 AC 1,118 ms
200,168 KB
testcase_34 AC 1,114 ms
200,956 KB
testcase_35 AC 1,081 ms
200,004 KB
testcase_36 AC 1,119 ms
199,952 KB
testcase_37 AC 1,102 ms
199,952 KB
testcase_38 AC 1,124 ms
201,080 KB
testcase_39 AC 1,091 ms
201,272 KB
testcase_40 AC 1,075 ms
199,988 KB
testcase_41 AC 1,075 ms
201,124 KB
testcase_42 AC 1,055 ms
201,776 KB
testcase_43 AC 222 ms
92,564 KB
testcase_44 AC 956 ms
155,852 KB
testcase_45 AC 221 ms
92,388 KB
testcase_46 AC 976 ms
153,940 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