結果

問題 No.1711 Divide LCM
ユーザー tamato
提出日時 2021-10-15 23:25:52
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,243 bytes
コンパイル時間 156 ms
コンパイル使用メモリ 82,368 KB
実行使用メモリ 185,872 KB
最終ジャッジ日時 2024-09-17 18:21:11
合計ジャッジ時間 12,144 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 22 TLE * 1 -- * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

mod = 998244353
eps = 10**-9
def main():
import sys
from itertools import combinations
input = sys.stdin.readline
N = int(input())
A = []
PE = []
P = {}
for i in range(N):
M = int(input())
a = 1
D = {}
for j in range(M):
p, e = map(int, input().split())
if p not in P:
P[p] = 0
P[p] = max(P[p], e)
a *= p ** e
D[p] = e
A.append(a)
PE.append(D)
B = []
BA = []
BB = []
B_val = []
for i in range(N):
D = PE[i]
b = set()
val = 1
for p in D:
if D[p] == P[p]:
b.add(p)
val *= p
if b:
B.append(b)
BA.append(A[i])
B_val.append(val)
else:
BB.append(A[i])
for i, b in enumerate(B):
ok = 0
for pp in P:
if pp not in b:
# ans[j].append(BA[i])
ok = 1
break
if 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)] += 1
B_val = list(set(B_val))
comb = L
for k in range(2, L+1):
comb *= (L - k + 1)
comb //= k
if cov[k] == comb:
continue
for J in combinations(P_list, k):
J = list(J)
q = 1
for pp in J:
q *= pp
ans = [[] for _ in range(k)]
flg = 1
for i, b in enumerate(B_val):
if b % q == 0:
flg = 0
break
if flg:
for i, b in enumerate(B):
for j, pp in enumerate(J):
if pp not in b:
ans[j].append(BA[i])
break
ans[0].extend(BB)
print(k)
for a in ans:
a = [len(a)] + a
print(*a)
exit()
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0