結果

問題 No.3345 Reducible Sequence
コンテスト
ユーザー N-noa21
提出日時 2025-11-18 00:50:51
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,830 ms / 2,000 ms
コード長 2,718 bytes
コンパイル時間 367 ms
コンパイル使用メモリ 82,772 KB
実行使用メモリ 315,368 KB
最終ジャッジ日時 2025-11-18 00:51:06
合計ジャッジ時間 14,812 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

# Hopcroft-Karp Algorithm
from collections import deque
class HopcroftKarp:
    def __init__(self, N0, N1):
        self.N0 = N0
        self.N1 = N1
        self.N = N = 2+N0+N1
        self.G = [[] for i in range(N)]
        for i in range(N0):
            forward = [2+i, 1, None]
            forward[2] = backward = [0, 0, forward]
            self.G[0].append(forward)
            self.G[2+i].append(backward)
        self.backwards = bs = []
        for i in range(N1):
            forward = [1, 1, None]
            forward[2] = backward = [2+N0+i, 0, forward]
            bs.append(backward)
            self.G[2+N0+i].append(forward)
            self.G[1].append(backward)
 
    def add_edge(self, fr, to):
        #assert 0 <= fr < self.N0
        #assert 0 <= to < self.N1
        v0 = 2 + fr
        v1 = 2 + self.N0 + to
        forward = [v1, 1, None]
        forward[2] = backward = [v0, 0, forward]
        self.G[v0].append(forward)
        self.G[v1].append(backward)
 
    def bfs(self):
        G = self.G
        level = [None]*self.N
        deq = deque([0])
        level[0] = 0
        while deq:
            v = deq.popleft()
            lv = level[v] + 1
            for w, cap, _ in G[v]:
                if cap and level[w] is None:
                    level[w] = lv
                    deq.append(w)
        self.level = level
        return level[1] is not None
 
    def dfs(self, v, t):
        if v == t:
            return 1
        level = self.level
        for e in self.it[v]:
            w, cap, rev = e
            if cap and level[v] < level[w] and self.dfs(w, t):
                e[1] = 0
                rev[1] = 1
                return 1
        return 0
 
    def flow(self):
        flow = 0
        G = self.G
        bfs = self.bfs; dfs = self.dfs
        while bfs():
            *self.it, = map(iter, G)
            while dfs(0, 1):
                flow += 1
        return flow
 
    def matching(self):
        return [cap for _, cap, _ in self.backwards]

N = int(input())
A = list(map(int, input().split()))

l = [[] for i in range(N)]

for i in range(N):

    for j in range(1,int(A[i]**0.5)+1):
        if A[i]%j == 0:
            if A[i]//j == j:
                l[i].append(j)
            else:
                l[i].append(j)
                l[i].append(A[i]//j)
  

def is_ok(arg):
    G = HopcroftKarp(N,arg)

    for i in range(N):
        for j in l[i]:
            if j <= arg:
                G.add_edge(i,j-1)
    return G.flow() == arg
def meguru_bisect(ng, ok):
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if is_ok(mid):
            ok = mid
        else:
            ng = mid
    return ok

id = meguru_bisect(N+1,0)
print(id)
0