結果
問題 | No.1711 Divide LCM |
ユーザー | 👑 tamato |
提出日時 | 2021-10-15 23:37:03 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,304 bytes |
コンパイル時間 | 154 ms |
コンパイル使用メモリ | 81,684 KB |
実行使用メモリ | 185,200 KB |
最終ジャッジ日時 | 2023-10-17 21:28:39 |
合計ジャッジ時間 | 18,747 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 38 ms
53,536 KB |
testcase_02 | AC | 39 ms
53,472 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 42 ms
55,592 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 286 ms
113,624 KB |
testcase_20 | AC | 288 ms
111,624 KB |
testcase_21 | AC | 370 ms
185,200 KB |
testcase_22 | AC | 350 ms
102,152 KB |
testcase_23 | AC | 446 ms
105,640 KB |
testcase_24 | AC | 753 ms
123,516 KB |
testcase_25 | AC | 2,005 ms
126,172 KB |
testcase_26 | AC | 358 ms
128,556 KB |
testcase_27 | AC | 275 ms
139,640 KB |
testcase_28 | AC | 496 ms
132,516 KB |
testcase_29 | WA | - |
testcase_30 | TLE | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
ソースコード
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 len(b) > 1: 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 if q in B_val: continue 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()