結果
問題 | No.550 夏休みの思い出(1) |
ユーザー | ebicochineal |
提出日時 | 2017-11-07 14:39:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,601 ms / 2,000 ms |
コード長 | 2,425 bytes |
コンパイル時間 | 284 ms |
コンパイル使用メモリ | 87,316 KB |
実行使用メモリ | 78,584 KB |
最終ジャッジ日時 | 2023-08-15 20:11:38 |
合計ジャッジ時間 | 11,159 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 137 ms
77,328 KB |
testcase_01 | AC | 158 ms
78,216 KB |
testcase_02 | AC | 154 ms
78,240 KB |
testcase_03 | AC | 155 ms
78,532 KB |
testcase_04 | AC | 159 ms
78,144 KB |
testcase_05 | AC | 162 ms
78,304 KB |
testcase_06 | AC | 161 ms
78,268 KB |
testcase_07 | AC | 160 ms
78,584 KB |
testcase_08 | AC | 156 ms
78,264 KB |
testcase_09 | AC | 124 ms
77,932 KB |
testcase_10 | AC | 125 ms
77,904 KB |
testcase_11 | AC | 132 ms
77,980 KB |
testcase_12 | AC | 128 ms
78,104 KB |
testcase_13 | AC | 96 ms
76,392 KB |
testcase_14 | AC | 178 ms
78,084 KB |
testcase_15 | AC | 113 ms
76,440 KB |
testcase_16 | AC | 113 ms
77,848 KB |
testcase_17 | AC | 113 ms
77,848 KB |
testcase_18 | AC | 106 ms
77,560 KB |
testcase_19 | AC | 143 ms
78,044 KB |
testcase_20 | AC | 100 ms
76,368 KB |
testcase_21 | AC | 98 ms
76,384 KB |
testcase_22 | AC | 126 ms
77,960 KB |
testcase_23 | AC | 124 ms
78,028 KB |
testcase_24 | AC | 118 ms
78,236 KB |
testcase_25 | AC | 140 ms
78,236 KB |
testcase_26 | AC | 112 ms
78,040 KB |
testcase_27 | AC | 111 ms
77,860 KB |
testcase_28 | AC | 116 ms
77,968 KB |
testcase_29 | AC | 160 ms
78,156 KB |
testcase_30 | AC | 108 ms
77,460 KB |
testcase_31 | AC | 123 ms
78,324 KB |
testcase_32 | AC | 125 ms
78,004 KB |
testcase_33 | AC | 132 ms
78,104 KB |
testcase_34 | AC | 1,601 ms
78,484 KB |
testcase_35 | AC | 103 ms
77,336 KB |
testcase_36 | AC | 99 ms
76,920 KB |
testcase_37 | AC | 132 ms
77,952 KB |
testcase_38 | AC | 127 ms
77,972 KB |
testcase_39 | AC | 140 ms
77,952 KB |
testcase_40 | AC | 110 ms
77,980 KB |
testcase_41 | AC | 129 ms
78,076 KB |
testcase_42 | AC | 127 ms
77,840 KB |
testcase_43 | AC | 140 ms
77,988 KB |
testcase_44 | AC | 114 ms
77,816 KB |
testcase_45 | AC | 113 ms
77,580 KB |
testcase_46 | AC | 128 ms
78,052 KB |
testcase_47 | AC | 127 ms
78,056 KB |
testcase_48 | AC | 112 ms
77,812 KB |
testcase_49 | AC | 94 ms
72,448 KB |
testcase_50 | AC | 96 ms
71,900 KB |
testcase_51 | AC | 126 ms
78,404 KB |
testcase_52 | AC | 115 ms
77,596 KB |
testcase_53 | AC | 114 ms
77,752 KB |
testcase_54 | AC | 114 ms
77,944 KB |
testcase_55 | AC | 116 ms
77,812 KB |
testcase_56 | AC | 106 ms
76,444 KB |
testcase_57 | AC | 103 ms
76,544 KB |
ソースコード
#! /usr/bin/env python3 import itertools import random def rho(n): f = lambda x : (x * x + 1) % n x = y = 2 d = 1 while d == 1: x = f(x) y = f(f(y)) d = gcd(abs(x - y), n) return d def gcd(a, b): if a < b: a, b = b, a while b > 0 : b, a = a % b, b return a def _primefactor(n): r = [] a, b = 0, 2 while b * b <= n: if n % b == 0: n //= b r += [b] else: b += 1 + a a = 1 if n > 1 : r += [n] return r def primefactor(n): r = [] cnt = 0 while cnt < 2 and n > 100000: cnt += 1 d = rho(n) if d != n: n //= d r += _primefactor(d) else: break a, b = 0, 2 while b * b <= n: if n % b == 0: n //= b r += [b] else: b += 1 + a a = 1 if n > 1 : r += [n] return r def f(A, B, C, a, b, c): for i, j, k in itertools.product([0, 1], repeat = 3): ai = a * [-1, 1][i] bj = b * [-1, 1][j] ck = c * [-1, 1][k] if sum([ai, bj, ck]) == -A and ai * bj * ck == -C and ai * bj + ai * ck + bj * ck == B: return 1, ai, bj, ck return 0, 0, 0, 0 def f2(A, B, C, a, b): for i, j in itertools.product([0, 1], repeat = 2): ai = a * [-1, 1][i] bj = b * [-1, 1][j] if sum([ai, bj]) == -A and ai * bj == B: return 1, ai, bj return 0, 0, 0 def main(): A, B, C = map(int, input().split()) p = primefactor(abs(C)) t = [-1, 0, 1] if C != 0: for i in itertools.product([0, 1, 2], repeat = len(p)): a = b = c = 1 for j, k in enumerate(i): if k == 0 : a *= p[j] if k == 1 : b *= p[j] if k == 2 : c *= p[j] d, a, b, c = f(A, B, C, a, b, c) if d: t = [a, b, c] break print(*sorted(t)) else: p = primefactor(abs(B)) for i in itertools.product([0, 1], repeat = len(p)): a = b = 1 for j, k in enumerate(i): if k == 0 : a *= p[j] if k == 1 : b *= p[j] d, a, b = f2(A, B, C, a, b) if d: t = [a, b, 0] break print(*sorted(t)) if __name__ == '__main__': main()