結果

問題 No.937 Ultra Sword
ユーザー vwxyzvwxyz
提出日時 2023-11-29 19:35:29
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,618 bytes
コンパイル時間 338 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 111,332 KB
最終ジャッジ日時 2023-11-29 19:35:48
合計ジャッジ時間 18,024 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 140 ms
88,804 KB
testcase_01 WA -
testcase_02 AC 140 ms
88,804 KB
testcase_03 AC 143 ms
88,804 KB
testcase_04 AC 136 ms
89,188 KB
testcase_05 AC 357 ms
109,668 KB
testcase_06 AC 589 ms
108,132 KB
testcase_07 AC 563 ms
109,668 KB
testcase_08 AC 592 ms
101,860 KB
testcase_09 AC 580 ms
100,196 KB
testcase_10 AC 613 ms
111,332 KB
testcase_11 AC 204 ms
90,724 KB
testcase_12 AC 222 ms
102,500 KB
testcase_13 AC 218 ms
102,628 KB
testcase_14 AC 238 ms
104,036 KB
testcase_15 AC 211 ms
98,660 KB
testcase_16 AC 204 ms
89,828 KB
testcase_17 AC 206 ms
90,212 KB
testcase_18 AC 207 ms
101,220 KB
testcase_19 AC 224 ms
95,076 KB
testcase_20 AC 203 ms
93,668 KB
testcase_21 AC 472 ms
109,796 KB
testcase_22 AC 139 ms
88,804 KB
testcase_23 AC 137 ms
88,804 KB
testcase_24 AC 435 ms
111,204 KB
testcase_25 AC 362 ms
107,748 KB
testcase_26 AC 351 ms
105,060 KB
testcase_27 AC 384 ms
105,060 KB
testcase_28 AC 371 ms
106,340 KB
testcase_29 AC 343 ms
96,996 KB
testcase_30 AC 386 ms
103,012 KB
testcase_31 AC 357 ms
109,540 KB
testcase_32 AC 360 ms
102,756 KB
testcase_33 AC 378 ms
109,412 KB
testcase_34 AC 364 ms
97,124 KB
testcase_35 AC 348 ms
96,996 KB
testcase_36 AC 373 ms
107,748 KB
testcase_37 AC 374 ms
97,124 KB
testcase_38 AC 370 ms
105,060 KB
testcase_39 AC 350 ms
96,996 KB
testcase_40 AC 395 ms
106,212 KB
testcase_41 AC 326 ms
98,660 KB
testcase_42 AC 361 ms
103,780 KB
testcase_43 AC 367 ms
102,756 KB
testcase_44 AC 394 ms
97,636 KB
testcase_45 AC 345 ms
99,428 KB
testcase_46 AC 366 ms
99,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

def Hadamard(polynomial,n,mod=0,inverse=False):
    assert mod%2
    polynomial_=[x for x in polynomial]+[0]*((1<<n)-len(polynomial))
    for bit in range(n):
        for i in range(1<<n):
            ii=i^(1<<bit)
            if i>ii:
                continue
            polynomial_[i],polynomial_[ii]=polynomial_[i]+polynomial_[ii],polynomial_[i]-polynomial_[ii]
            if mod:
                polynomial_[i]%=mod
                polynomial_[ii]%=mod
    if inverse:
        if mod:
            inve_2=pow((mod+1)//2,n)
            for i in range(1<<n):
                polynomial_[i]*=inve_2
                polynomial_[i]%=mod
        else:
            pow_2=pow(2,n)
            for i in range(1<<n):
                polynomial_[i]/=pow_2
    return polynomial_

def XOR_Convolution(polynomial0,polynomial1,mod=0):
    n=(max(len(polynomial0),len(polynomial1))-1).bit_length()
    Hadamard_polynomial0=Hadamard(polynomial0,n,mod=mod)
    Hadamard_polynomial1=Hadamard(polynomial1,n,mod=mod)
    if mod:
        convolution=[x*y%mod for x,y in zip(Hadamard_polynomial0,Hadamard_polynomial1)]
    else:
        convolution=[x*y for x,y in zip(Hadamard_polynomial0,Hadamard_polynomial1)]
    convolution=Hadamard(convolution,n,mod=mod,inverse=True)
    return convolution

N=int(readline())
A=list(map(int,readline().split()))
max_A=max(A)
le=max_A.bit_length()
poly=[0]*(1<<le)
poly[0]=1
for a in A:
    while a<1<<le:
        poly[a]=1
        a*=2
mod=(1<<61)-1
poly=Hadamard(poly,le,mod=mod)
for i in range(1<<le):
    poly[i]=pow(poly[i],10**9,mod)
poly=Hadamard(poly,le,mod=mod,inverse=True)
C=[0]*(max_A+1)
for a in A:
    C[a]+=1
sum_A=sum(A)
ans=sum_A
for i in range(1,max_A+1):
    if poly[i]==0:
        continue
    s=sum_A
    for j in range(i,max_A+1,i):
        s-=C[j]*(j-j//i)
    ans=min(ans,s)
print(ans)
0