結果

問題 No.1360 [Zelkova 4th Tune] 協和音
ユーザー McGregorshMcGregorsh
提出日時 2023-05-09 15:42:17
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,915 bytes
コンパイル時間 413 ms
コンパイル使用メモリ 82,108 KB
実行使用メモリ 196,880 KB
最終ジャッジ日時 2024-11-26 02:18:27
合計ジャッジ時間 22,110 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 137 ms
89,084 KB
testcase_01 AC 133 ms
89,412 KB
testcase_02 AC 130 ms
89,336 KB
testcase_03 AC 136 ms
89,324 KB
testcase_04 AC 138 ms
89,580 KB
testcase_05 AC 129 ms
89,268 KB
testcase_06 AC 128 ms
89,044 KB
testcase_07 AC 126 ms
89,024 KB
testcase_08 AC 129 ms
89,508 KB
testcase_09 AC 133 ms
89,544 KB
testcase_10 AC 129 ms
89,492 KB
testcase_11 AC 129 ms
89,028 KB
testcase_12 AC 129 ms
89,368 KB
testcase_13 AC 133 ms
89,536 KB
testcase_14 AC 139 ms
89,992 KB
testcase_15 AC 152 ms
90,092 KB
testcase_16 AC 130 ms
89,932 KB
testcase_17 AC 139 ms
89,972 KB
testcase_18 AC 129 ms
89,052 KB
testcase_19 AC 141 ms
90,240 KB
testcase_20 AC 138 ms
90,096 KB
testcase_21 AC 128 ms
89,472 KB
testcase_22 AC 145 ms
90,200 KB
testcase_23 AC 231 ms
100,224 KB
testcase_24 AC 320 ms
112,180 KB
testcase_25 AC 953 ms
196,260 KB
testcase_26 AC 145 ms
90,252 KB
testcase_27 AC 140 ms
90,308 KB
testcase_28 AC 927 ms
196,504 KB
testcase_29 AC 171 ms
94,396 KB
testcase_30 AC 227 ms
100,116 KB
testcase_31 AC 225 ms
100,176 KB
testcase_32 AC 152 ms
91,484 KB
testcase_33 AC 948 ms
196,296 KB
testcase_34 AC 943 ms
196,096 KB
testcase_35 AC 935 ms
196,428 KB
testcase_36 AC 931 ms
196,460 KB
testcase_37 AC 924 ms
196,428 KB
testcase_38 AC 952 ms
196,352 KB
testcase_39 AC 949 ms
196,352 KB
testcase_40 AC 956 ms
196,444 KB
testcase_41 AC 924 ms
196,880 KB
testcase_42 AC 937 ms
196,468 KB
testcase_43 AC 128 ms
89,412 KB
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
権限があれば一括ダウンロードができます

ソースコード

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 = 0
   for bit in product([0, 1], repeat=N):
   	  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