結果
問題 | No.1711 Divide LCM |
ユーザー |
![]() |
提出日時 | 2021-10-15 23:33:41 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,295 bytes |
コンパイル時間 | 170 ms |
コンパイル使用メモリ | 82,440 KB |
実行使用メモリ | 186,004 KB |
最終ジャッジ日時 | 2024-09-17 18:38:11 |
合計ジャッジ時間 | 16,510 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 TLE * 1 -- * 14 |
ソースコード
mod = 998244353eps = 10**-9def main():import sysfrom itertools import combinationsinput = sys.stdin.readlineN = int(input())A = []PE = []P = {}for i in range(N):M = int(input())a = 1D = {}for j in range(M):p, e = map(int, input().split())if p not in P:P[p] = 0P[p] = max(P[p], e)a *= p ** eD[p] = eA.append(a)PE.append(D)B = []BA = []BB = []B_val = []for i in range(N):D = PE[i]b = set()val = 1for p in D:if D[p] == P[p]:b.add(p)val *= pif b:B.append(b)BA.append(A[i])B_val.append(val)else:BB.append(A[i])for i, b in enumerate(B):ok = 0for pp in P:if pp not in b:# ans[j].append(BA[i])ok = 1breakif not ok:print(-1)exit()L = len(P)P_list = list(P.keys())cov = [0] * (L+1)seen = set()for b, val in zip(B, B_val):if val not in seen:seen.add(val)cov[len(b)] += 1B_val = list(set(B_val))comb = Lfor k in range(2, L+1):comb *= (L - k + 1)comb //= kif cov[k] == comb:continuefor J in combinations(P_list, k):J = list(J)q = 1for pp in J:q *= ppif q in B_val:continueans = [[] for _ in range(k)]flg = 1for i, b in enumerate(B_val):if b % q == 0:flg = 0breakif flg:for i, b in enumerate(B):for j, pp in enumerate(J):if pp not in b:ans[j].append(BA[i])breakans[0].extend(BB)print(k)for a in ans:a = [len(a)] + aprint(*a)exit()if __name__ == '__main__':main()