結果

問題 No.3051 Make All Divisible
ユーザー lif4635
提出日時 2025-03-07 22:14:53
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,036 bytes
コンパイル時間 683 ms
コンパイル使用メモリ 82,508 KB
実行使用メモリ 73,064 KB
最終ジャッジ日時 2025-03-07 22:14:59
合計ジャッジ時間 5,555 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 11 WA * 2 TLE * 1 -- * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


def solve():
    n,k = MI() # 2000以下
    a = LI()
    
    # 適当にk個選んで引く
    if sum(a) % k != 0:
        print(-1)
        return
    
    d = []
    s = 0
    for i in range(n):
        d.append([a[i]%k, a[i]//k])
        s += a[i] % k
    
    d.sort()
    op = max(d)[0] #操作回数の自明な下界
    if s == op*k:
        print(op)
        return
    sadd = 0
    c = [0]*n
    sc = 0
    ans = inf
    for p in range(n * 100):
        for i in range(n):
            if d[i][1] >= 1:
                d[i][1] -= 1
                d[i][0] += k
                sadd += k
                op = d[i][0] #操作回数
                if s + (d[i][0]//k) * k <= op * k <= s + sadd:
                    ans = min(ans, op)
    # assert False
    prinf(ans)
    return

t = II()
for _ in range(t):
    solve()
0