結果
問題 | No.937 Ultra Sword |
ユーザー | vwxyz |
提出日時 | 2023-11-29 19:27:30 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,503 bytes |
コンパイル時間 | 425 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 131,684 KB |
最終ジャッジ日時 | 2023-11-29 19:27:54 |
合計ジャッジ時間 | 23,098 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
89,060 KB |
testcase_01 | WA | - |
testcase_02 | AC | 141 ms
89,060 KB |
testcase_03 | AC | 144 ms
89,188 KB |
testcase_04 | AC | 145 ms
89,444 KB |
testcase_05 | AC | 490 ms
131,684 KB |
testcase_06 | AC | 729 ms
123,108 KB |
testcase_07 | AC | 732 ms
122,340 KB |
testcase_08 | AC | 703 ms
119,908 KB |
testcase_09 | AC | 720 ms
118,372 KB |
testcase_10 | AC | 716 ms
123,876 KB |
testcase_11 | AC | 218 ms
94,692 KB |
testcase_12 | AC | 261 ms
105,316 KB |
testcase_13 | AC | 233 ms
105,188 KB |
testcase_14 | AC | 238 ms
106,980 KB |
testcase_15 | AC | 232 ms
102,628 KB |
testcase_16 | AC | 216 ms
92,772 KB |
testcase_17 | AC | 237 ms
94,436 KB |
testcase_18 | AC | 229 ms
103,908 KB |
testcase_19 | AC | 224 ms
99,428 KB |
testcase_20 | AC | 222 ms
97,892 KB |
testcase_21 | AC | 745 ms
122,980 KB |
testcase_22 | AC | 140 ms
89,188 KB |
testcase_23 | AC | 135 ms
88,804 KB |
testcase_24 | AC | 507 ms
125,796 KB |
testcase_25 | AC | 487 ms
120,420 KB |
testcase_26 | AC | 499 ms
119,072 KB |
testcase_27 | AC | 513 ms
119,896 KB |
testcase_28 | AC | 490 ms
120,060 KB |
testcase_29 | AC | 486 ms
116,452 KB |
testcase_30 | AC | 481 ms
117,492 KB |
testcase_31 | AC | 501 ms
121,316 KB |
testcase_32 | AC | 524 ms
116,444 KB |
testcase_33 | AC | 482 ms
121,316 KB |
testcase_34 | AC | 498 ms
114,916 KB |
testcase_35 | AC | 470 ms
114,788 KB |
testcase_36 | AC | 492 ms
120,292 KB |
testcase_37 | AC | 488 ms
114,916 KB |
testcase_38 | AC | 492 ms
119,504 KB |
testcase_39 | AC | 490 ms
116,324 KB |
testcase_40 | AC | 513 ms
119,996 KB |
testcase_41 | AC | 490 ms
114,532 KB |
testcase_42 | AC | 496 ms
116,452 KB |
testcase_43 | AC | 478 ms
117,320 KB |
testcase_44 | AC | 505 ms
116,580 KB |
testcase_45 | AC | 473 ms
114,916 KB |
testcase_46 | AC | 511 ms
116,324 KB |
ソースコード
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) poly=[0]*(2*max_A+1) poly[0]=1 for a in A: while a<=max_A*2: poly[a]+=1 a*=2 poly=XOR_Convolution(poly,poly,mod=(1<<61)-1) 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)