結果

問題 No.1360 [Zelkova 4th Tune] 協和音
ユーザー KeroruKeroru
提出日時 2021-01-22 21:49:26
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 444 ms / 2,000 ms
コード長 3,580 bytes
コンパイル時間 376 ms
コンパイル使用メモリ 87,148 KB
実行使用メモリ 84,456 KB
最終ジャッジ日時 2023-08-27 18:38:04
合計ジャッジ時間 20,008 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 223 ms
83,172 KB
testcase_01 AC 223 ms
83,216 KB
testcase_02 AC 227 ms
83,560 KB
testcase_03 AC 223 ms
83,340 KB
testcase_04 AC 225 ms
83,104 KB
testcase_05 AC 227 ms
83,112 KB
testcase_06 AC 229 ms
83,248 KB
testcase_07 AC 230 ms
83,072 KB
testcase_08 AC 222 ms
82,992 KB
testcase_09 AC 224 ms
83,160 KB
testcase_10 AC 229 ms
83,020 KB
testcase_11 AC 224 ms
83,184 KB
testcase_12 AC 226 ms
83,212 KB
testcase_13 AC 222 ms
83,276 KB
testcase_14 AC 237 ms
83,788 KB
testcase_15 AC 233 ms
83,812 KB
testcase_16 AC 227 ms
83,288 KB
testcase_17 AC 233 ms
83,848 KB
testcase_18 AC 227 ms
83,020 KB
testcase_19 AC 237 ms
84,108 KB
testcase_20 AC 232 ms
83,772 KB
testcase_21 AC 223 ms
83,184 KB
testcase_22 AC 241 ms
84,188 KB
testcase_23 AC 253 ms
84,284 KB
testcase_24 AC 278 ms
83,924 KB
testcase_25 AC 438 ms
84,120 KB
testcase_26 AC 244 ms
84,192 KB
testcase_27 AC 237 ms
84,300 KB
testcase_28 AC 438 ms
84,132 KB
testcase_29 AC 253 ms
84,308 KB
testcase_30 AC 256 ms
84,048 KB
testcase_31 AC 257 ms
84,364 KB
testcase_32 AC 257 ms
84,300 KB
testcase_33 AC 441 ms
84,016 KB
testcase_34 AC 439 ms
84,200 KB
testcase_35 AC 443 ms
84,016 KB
testcase_36 AC 444 ms
84,112 KB
testcase_37 AC 444 ms
83,924 KB
testcase_38 AC 440 ms
84,136 KB
testcase_39 AC 442 ms
84,020 KB
testcase_40 AC 434 ms
84,016 KB
testcase_41 AC 442 ms
84,020 KB
testcase_42 AC 438 ms
84,456 KB
testcase_43 AC 225 ms
83,404 KB
testcase_44 AC 429 ms
84,284 KB
testcase_45 AC 224 ms
83,108 KB
testcase_46 AC 436 ms
84,304 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()
import bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def I():return int(input())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def INP():
    N=9
    n=random.randint(1,N)
    A=[random.randint(1,n) for i in range(m)]
    return n,A
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print(inp)
            print('naive',a1)
            print('solve',a2)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:a,b=inp;c=1
        else:a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
#mo=998244353
inf=1<<63
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
alp=[chr(ord('a')+i)for i in range(26)]
sys.setrecursionlimit(10**7)

show_flg=False
show_flg=True

ans=0

n=I()
a=LI()
b=[LI()for i in range(n)]

ans=-inf
for i in range(1,1<<n):
    s=[]
    p=0
    for j in range(n):
        if (i>>j)&1:
            s+=j,
            p+=a[j]
    ns=len(s)
    for j in range(ns):
        for k in range(j+1,ns):
            p+=b[s[j]][s[k]]
    if ans<p:
        ans=p
        m=s[:]

print(ans)
print(*[i+1 for i in m])
0