結果

問題 No.2756 GCD Teleporter
ユーザー hato336hato336
提出日時 2024-05-10 21:54:49
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
WA  
(最初)
実行時間 -
コード長 3,708 bytes
コンパイル時間 324 ms
コンパイル使用メモリ 82,372 KB
実行使用メモリ 154,976 KB
最終ジャッジ日時 2024-12-20 05:18:34
合計ジャッジ時間 50,704 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
55,676 KB
testcase_01 AC 45 ms
55,424 KB
testcase_02 AC 44 ms
55,164 KB
testcase_03 AC 46 ms
54,752 KB
testcase_04 AC 427 ms
81,784 KB
testcase_05 AC 874 ms
90,216 KB
testcase_06 AC 1,872 ms
111,800 KB
testcase_07 AC 1,534 ms
104,788 KB
testcase_08 AC 1,463 ms
103,172 KB
testcase_09 AC 1,288 ms
100,064 KB
testcase_10 AC 1,736 ms
108,784 KB
testcase_11 TLE -
testcase_12 WA -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 TLE -
testcase_20 AC 1,938 ms
109,544 KB
testcase_21 AC 1,037 ms
92,272 KB
testcase_22 AC 1,985 ms
109,860 KB
testcase_23 AC 485 ms
82,424 KB
testcase_24 AC 1,577 ms
102,808 KB
testcase_25 AC 1,656 ms
103,416 KB
testcase_26 AC 1,845 ms
106,788 KB
testcase_27 AC 1,819 ms
109,928 KB
testcase_28 AC 1,175 ms
92,424 KB
testcase_29 AC 1,670 ms
99,444 KB
testcase_30 TLE -
testcase_31 AC 1,012 ms
89,732 KB
testcase_32 AC 1,039 ms
109,780 KB
testcase_33 AC 481 ms
88,216 KB
testcase_34 AC 195 ms
79,696 KB
testcase_35 AC 716 ms
108,232 KB
testcase_36 AC 678 ms
108,052 KB
testcase_37 WA -
testcase_38 AC 1,431 ms
111,592 KB
testcase_39 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import collections,sys
def gcd(a, b):
    while a:
        a, b = b%a, a
    return b


def is_prime(n):
    if n == 2:
        return 1
    if n == 1 or n%2 == 0:
        return 0

    m = n - 1
    lsb = m & -m
    s = lsb.bit_length()-1
    d = m // lsb

    test_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]

    for a in test_numbers:
        if a == n:
            continue
        x = pow(a,d,n)
        r = 0
        if x == 1:
            continue
        while x != m:
            x = pow(x,2,n)
            r += 1
            if x == 1 or r == s:
                return 0
    return 1


def find_prime_factor(n):
    if n%2 == 0:
        return 2

    m = int(n**0.125)+1

    for c in range(1,n):
        f = lambda a: (pow(a,2,n)+c)%n
        y = 0
        g = q = r = 1
        k = 0
        while g == 1:
            x = y
            while k < 3*r//4:
                y = f(y)
                k += 1
            while k < r and g == 1:
                ys = y
                for _ in range(min(m, r-k)):
                    y = f(y)
                    q = q*abs(x-y)%n
                g = gcd(q,n)
                k += m
            k = r
            r *= 2
        if g == n:
            g = 1
            y = ys
            while g == 1:
                y = f(y)
                g = gcd(abs(x-y),n)
        if g == n:
            continue
        if is_prime(g):
            return g
        elif is_prime(n//g):
            return n//g
        else:
            return find_prime_factor(g)


def factorize(n):
    res = {}
    while not is_prime(n) and n > 1:  # nが合成数である間nの素因数の探索を繰り返す
        p = find_prime_factor(n)
        s = 0
        while n%p == 0:  # nが素因数pで割れる間割り続け、出力に追加
            n //= p
            s += 1
        res[p] = s
    if n > 1:  # n>1であればnは素数なので出力に追加
        res[n] = 1
    return res

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = collections.defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return ''.join(f'{r}: {m}' for r, m in self.all_group_members().items())
n = int(input())
a = list(map(int,input().split()))
check = [10**18 for i in range(n)]
uf = UnionFind(n)
c = collections.defaultdict(list)
for i in range(n):
    x = factorize(a[i])
    for j in x.keys():
        c[j].append(i)
for i in c:
    for j in range(len(c[i])-1):
        uf.union(c[i][j],c[i][j+1])
    check[uf.find(c[i][0])] = min(check[uf.find(c[i][0])],i)
ans = 10**18
for i in range(n):
    if uf.find(i) == i:
        ans = min(ans,check[i])
print(ans * uf.group_count() - ans)
0