結果
問題 | No.2183 LCA on Rational Tree |
ユーザー |
![]() |
提出日時 | 2023-01-07 20:20:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 259 ms / 2,000 ms |
コード長 | 3,589 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 79,340 KB |
最終ジャッジ日時 | 2024-05-08 21:56:31 |
合計ジャッジ時間 | 1,973 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
52,992 KB |
testcase_01 | AC | 232 ms
78,704 KB |
testcase_02 | AC | 194 ms
78,104 KB |
testcase_03 | AC | 229 ms
78,644 KB |
testcase_04 | AC | 163 ms
77,952 KB |
testcase_05 | AC | 259 ms
79,340 KB |
ソースコード
# 高速素因数分解 を改変したもの # https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98 # 実装が違くてWAかも import os import sys from io import BytesIO, IOBase BUFSIZE = 8192 class FastIO(IOBase): newlines = 0 def __init__(self, file): self._fd = file.fileno() self.buffer = BytesIO() self.writable = "x" in file.mode or "r" not in file.mode self.write = self.buffer.write if self.writable else None def read(self): while True: b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE)) if not b: break ptr = self.buffer.tell() self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr) self.newlines = 0 return self.buffer.read() def readline(self): while self.newlines == 0: b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE)) self.newlines = b.count(b"\n")+(not b) ptr = self.buffer.tell() self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr) self.newlines -= 1 return self.buffer.readline() def flush(self): if self.writable: os.write(self._fd, self.buffer.getvalue()) self.buffer.truncate(0), self.buffer.seek(0) class IOWrapper(IOBase): def __init__(self, file): self.buffer = FastIO(file) self.flush = self.buffer.flush self.writable = self.buffer.writable self.write = lambda s:self.buffer.write(s.encode("ascii")) self.read = lambda:self.buffer.read().decode("ascii") self.readline = lambda:self.buffer.readline().decode("ascii") sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout) input = lambda:sys.stdin.readline().rstrip("\r\n") from math import gcd # plist の実装 遅めだった!(でもあまり変わらない気もするが) def isPrimeMR(n): d = n - 1 d = d // (d & -d) L = [2] for a in L: t = d y = pow(a, t, n) if y == 1: continue while y != n - 1: y = (y * y) % n if y == 1 or t == n - 1: return 0 t <<= 1 return 1 def findFactorRho(n): m = 1 << n.bit_length() // 8 for c in range(1, 99): f = lambda x: (x * x + c) % n y, r, q, g = 2, 1, 1, 1 while g == 1: x = y for i in range(r): y = f(y) k = 0 while k < r and g == 1: ys = y for i in range(min(m, r - k)): y = f(y) q = q * abs(x - y) % n g = gcd(q, n) k += m r <<= 1 if g == n: g = 1 while g == 1: ys = f(ys) g = gcd(abs(x - ys), n) if g < n: if isPrimeMR(g): return g elif isPrimeMR(n // g): return n // g return findFactorRho(g) def plist(n): i = 2 ret = [] rhoFlg = 0 while i*i <= n: k = 0 while n % i == 0: n //= i k += 1 if k: ret.append(i) i += 1 + i % 2 if i == 101 and n >= 2 ** 20: while n > 1: if isPrimeMR(n): ret.append(n) n = 1 else: j = findFactorRho(n) k = 0 while n % j == 0: n //= j k += 1 if k > 0: ret.append(j) if n > 1: ret.append(n) return ret def gogo(p:int, q:int, lst:list): pl = plist(q-p) while q-p > 1: x = 10 ** 18 for i in pl: if (q-p)%i == 0: x = min(x, i-(p%i)) g = gcd(p+x, q+x) lst.append((q-p, p, p+x)) p, q = (p+x)//g, (q+x)//g lst.append((1, p, 9 * 10 ** 18)) Q = int(input()) for _ in range(Q): lst1 = [] lst2 = [] p1,q1,p2,q2 = map(int,input().split()) gogo(p1,q1,lst1) gogo(p2,q2,lst2) g_begin = dict() g_end = dict() for i, st, ed in lst1: g_begin[i] = st g_end[i] = ed ans1 = 0 ans2 = 0 for i, st, ed in lst2: if i in g_begin.keys(): if max(0, min(ed, g_end[i]) - max(st, g_begin[i])) > 0: ans1 = max(st, g_begin[i]) ans2 = i + ans1 break print(ans1, ans2)