結果
問題 | No.2718 Best Consonance |
ユーザー | titia |
提出日時 | 2024-04-10 01:17:27 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 6,288 bytes |
コンパイル時間 | 376 ms |
コンパイル使用メモリ | 82,364 KB |
実行使用メモリ | 268,896 KB |
最終ジャッジ日時 | 2024-10-02 02:33:30 |
合計ジャッジ時間 | 77,232 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 174 ms
106,752 KB |
testcase_01 | AC | 175 ms
106,880 KB |
testcase_02 | AC | 175 ms
106,572 KB |
testcase_03 | AC | 179 ms
106,368 KB |
testcase_04 | AC | 181 ms
106,848 KB |
testcase_05 | AC | 180 ms
106,496 KB |
testcase_06 | AC | 184 ms
106,576 KB |
testcase_07 | AC | 179 ms
106,880 KB |
testcase_08 | AC | 180 ms
106,752 KB |
testcase_09 | AC | 282 ms
115,328 KB |
testcase_10 | AC | 285 ms
115,716 KB |
testcase_11 | AC | 283 ms
115,992 KB |
testcase_12 | AC | 291 ms
115,980 KB |
testcase_13 | AC | 281 ms
115,712 KB |
testcase_14 | AC | 3,045 ms
266,116 KB |
testcase_15 | AC | 2,221 ms
235,880 KB |
testcase_16 | AC | 2,409 ms
247,824 KB |
testcase_17 | AC | 1,986 ms
221,244 KB |
testcase_18 | AC | 2,610 ms
255,356 KB |
testcase_19 | AC | 2,285 ms
235,332 KB |
testcase_20 | AC | 3,003 ms
268,172 KB |
testcase_21 | AC | 2,715 ms
261,076 KB |
testcase_22 | AC | 2,796 ms
262,996 KB |
testcase_23 | AC | 1,895 ms
214,616 KB |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | TLE | - |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | AC | 179 ms
106,368 KB |
testcase_35 | AC | 179 ms
106,496 KB |
testcase_36 | AC | 315 ms
131,844 KB |
testcase_37 | AC | 180 ms
107,008 KB |
testcase_38 | AC | 317 ms
131,984 KB |
testcase_39 | AC | 180 ms
107,008 KB |
ソースコード
import sys import io, os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline from operator import itemgetter # https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py import math from bisect import bisect_left, bisect_right from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional T = TypeVar('T') class SortedMultiset(Generic[T]): BUCKET_RATIO = 16 SPLIT_RATIO = 24 def __init__(self, a: Iterable[T] = []) -> None: "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)" a = list(a) n = self.size = len(a) if any(a[i] > a[i + 1] for i in range(n - 1)): a.sort() num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO))) self.a = [a[n * i // num_bucket : n * (i + 1) // num_bucket] for i in range(num_bucket)] def __iter__(self) -> Iterator[T]: for i in self.a: for j in i: yield j def __reversed__(self) -> Iterator[T]: for i in reversed(self.a): for j in reversed(i): yield j def __eq__(self, other) -> bool: return list(self) == list(other) def __len__(self) -> int: return self.size def __repr__(self) -> str: return "SortedMultiset" + str(self.a) def __str__(self) -> str: s = str(list(self)) return "{" + s[1 : len(s) - 1] + "}" def _position(self, x: T) -> Tuple[List[T], int, int]: "return the bucket, index of the bucket and position in which x should be. self must not be empty." for i, a in enumerate(self.a): if x <= a[-1]: break return (a, i, bisect_left(a, x)) def __contains__(self, x: T) -> bool: if self.size == 0: return False a, _, i = self._position(x) return i != len(a) and a[i] == x def count(self, x: T) -> int: "Count the number of x." return self.index_right(x) - self.index(x) def add(self, x: T) -> None: "Add an element. / O(√N)" if self.size == 0: self.a = [[x]] self.size = 1 return a, b, i = self._position(x) a.insert(i, x) self.size += 1 if len(a) > len(self.a) * self.SPLIT_RATIO: mid = len(a) >> 1 self.a[b:b+1] = [a[:mid], a[mid:]] def _pop(self, a: List[T], b: int, i: int) -> T: ans = a.pop(i) self.size -= 1 if not a: del self.a[b] return ans def discard(self, x: T) -> bool: "Remove an element and return True if removed. / O(√N)" if self.size == 0: return False a, b, i = self._position(x) if i == len(a) or a[i] != x: return False self._pop(a, b, i) return True def lt(self, x: T) -> Optional[T]: "Find the largest element < x, or None if it doesn't exist." for a in reversed(self.a): if a[0] < x: return a[bisect_left(a, x) - 1] def le(self, x: T) -> Optional[T]: "Find the largest element <= x, or None if it doesn't exist." for a in reversed(self.a): if a[0] <= x: return a[bisect_right(a, x) - 1] def gt(self, x: T) -> Optional[T]: "Find the smallest element > x, or None if it doesn't exist." for a in self.a: if a[-1] > x: return a[bisect_right(a, x)] def ge(self, x: T) -> Optional[T]: "Find the smallest element >= x, or None if it doesn't exist." for a in self.a: if a[-1] >= x: return a[bisect_left(a, x)] def __getitem__(self, i: int) -> T: "Return the i-th element." if i < 0: for a in reversed(self.a): i += len(a) if i >= 0: return a[i] else: for a in self.a: if i < len(a): return a[i] i -= len(a) raise IndexError def pop(self, i: int = -1) -> T: "Pop and return the i-th element." if i < 0: for b, a in enumerate(reversed(self.a)): i += len(a) if i >= 0: return self._pop(a, ~b, i) else: for b, a in enumerate(self.a): if i < len(a): return self._pop(a, b, i) i -= len(a) raise IndexError def index(self, x: T) -> int: "Count the number of elements < x." ans = 0 for a in self.a: if a[-1] >= x: return ans + bisect_left(a, x) ans += len(a) return ans def index_right(self, x: T) -> int: "Count the number of elements <= x." ans = 0 for a in self.a: if a[-1] > x: return ans + bisect_right(a, x) ans += len(a) return ans # エラトステネスの篩を用いた素因数分解・約数列挙 MAX=200000+10 # 使いたい最大値を指定 # Sieve[i]で、iの最も小さい約数を返す。 Sieve=[i for i in range(MAX)] for i in range(2,MAX): if Sieve[i]!=i: continue for j in range(i,MAX,i): if Sieve[j]==j: Sieve[j]=i # 素因数分解 def fact(x): D=dict() while x!=1: k=Sieve[x] if k in D: D[k]+=1 else: D[k]=1 x//=k return D # 約数列挙 def faclist(x): LIST=[1] while x!=1: k=Sieve[x] count=0 while x%k==0: count+=1 x//=k LIST2=[] for l in LIST: for i in range(1,count+1): LIST2.append(l*k**i) LIST+=LIST2 return LIST N=int(input()) A=[list(map(int,input().split())) for i in range(N)] A.sort(key=itemgetter(1),reverse=True) A.sort(key=itemgetter(0)) ANS=0 A2=[] for a,b in A: if A2 and A2[-1][0]==a: ANS=max(ANS,b) else: A2.append((a,b)) A=A2 A.sort(key=lambda x:x[0]*x[1]) LIST=[SortedMultiset() for i in range(202020)] SA=[[] for i in range(202020)] for a,b in A: SA[a]=faclist(a) for f in SA[a]: if len(LIST[f])>0: x=LIST[f][-1] ANS=max(ANS,x*f//a) for f in SA[a]: LIST[f].add(b) print(ANS)