結果
問題 | No.1711 Divide LCM |
ユーザー | chineristAC |
提出日時 | 2021-08-13 04:05:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 601 ms / 4,000 ms |
コード長 | 1,223 bytes |
コンパイル時間 | 890 ms |
コンパイル使用メモリ | 81,636 KB |
実行使用メモリ | 187,680 KB |
最終ジャッジ日時 | 2023-10-17 19:49:40 |
合計ジャッジ時間 | 15,373 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
55,472 KB |
testcase_01 | AC | 41 ms
55,472 KB |
testcase_02 | AC | 41 ms
55,472 KB |
testcase_03 | AC | 82 ms
73,660 KB |
testcase_04 | AC | 93 ms
76,628 KB |
testcase_05 | AC | 118 ms
77,080 KB |
testcase_06 | AC | 106 ms
76,788 KB |
testcase_07 | AC | 114 ms
76,828 KB |
testcase_08 | AC | 101 ms
76,772 KB |
testcase_09 | AC | 138 ms
77,412 KB |
testcase_10 | AC | 100 ms
76,768 KB |
testcase_11 | AC | 163 ms
77,892 KB |
testcase_12 | AC | 101 ms
76,784 KB |
testcase_13 | AC | 56 ms
65,812 KB |
testcase_14 | AC | 86 ms
76,480 KB |
testcase_15 | AC | 91 ms
76,712 KB |
testcase_16 | AC | 60 ms
67,860 KB |
testcase_17 | AC | 88 ms
76,496 KB |
testcase_18 | AC | 394 ms
143,912 KB |
testcase_19 | AC | 402 ms
144,300 KB |
testcase_20 | AC | 397 ms
143,880 KB |
testcase_21 | AC | 283 ms
100,824 KB |
testcase_22 | AC | 601 ms
150,828 KB |
testcase_23 | AC | 553 ms
187,680 KB |
testcase_24 | AC | 279 ms
90,456 KB |
testcase_25 | AC | 272 ms
89,620 KB |
testcase_26 | AC | 268 ms
88,008 KB |
testcase_27 | AC | 272 ms
88,872 KB |
testcase_28 | AC | 269 ms
89,452 KB |
testcase_29 | AC | 84 ms
76,452 KB |
testcase_30 | AC | 285 ms
97,380 KB |
testcase_31 | AC | 85 ms
76,372 KB |
testcase_32 | AC | 302 ms
103,520 KB |
testcase_33 | AC | 280 ms
101,144 KB |
testcase_34 | AC | 99 ms
76,808 KB |
testcase_35 | AC | 298 ms
88,468 KB |
testcase_36 | AC | 308 ms
89,128 KB |
testcase_37 | AC | 302 ms
89,320 KB |
testcase_38 | AC | 292 ms
112,008 KB |
testcase_39 | AC | 301 ms
101,204 KB |
testcase_40 | AC | 84 ms
76,508 KB |
testcase_41 | AC | 85 ms
76,400 KB |
testcase_42 | AC | 83 ms
76,524 KB |
testcase_43 | AC | 83 ms
76,400 KB |
testcase_44 | AC | 76 ms
76,420 KB |
ソースコード
import sys from collections import deque input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) N = int(input()) LCM = {} all_divisors = set() A = [1 for i in range(N)] for i in range(N): m = int(input()) D = [1] for _ in range(m): p,e = mi() t = pow(p,e) A[i] *= t D = [d for d in D] + [d*t for d in D] if p in LCM: LCM[p] = max(LCM[p],t) else: LCM[p] = t for d in D: all_divisors.add(d) prime_pow = [LCM[p] for p in LCM] n = len(prime_pow) deq = deque([(1,-1)]) prod = -1 while deq: v,k = deq.popleft() for i in range(k+1,n): if v * prime_pow[i] not in all_divisors: prod = v * prime_pow[i] deq = [] break deq.append((v*prime_pow[i],i)) if prod==-1: exit(print(-1)) selected_p = [] for i in range(n): if prod%prime_pow[i]==0: selected_p.append(prime_pow[i]) k = len(selected_p) S = [[] for i in range(k)] for a in A: for i in range(k): if a%selected_p[i]: S[i].append(a) break print(k) for i in range(k): S[i] = [len(S[i])] + S[i] print(*S[i])