結果
| 問題 |
No.180 美しいWhitespace (2)
|
| ユーザー |
|
| 提出日時 | 2023-11-23 18:57:34 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,730 bytes |
| コンパイル時間 | 237 ms |
| コンパイル使用メモリ | 81,948 KB |
| 実行使用メモリ | 76,724 KB |
| 最終ジャッジ日時 | 2024-09-26 08:17:40 |
| 合計ジャッジ時間 | 4,140 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 16 WA * 15 |
ソースコード
n = int(input())
A = [0] * n
B = [0] * n
for i in range(n):
B[i], A[i] = map(int, input().split())
mi = [None] * n
ma = [None] * n
for i in range(n):
l = 1
r = 1 << 60
for j in range(n):
if i == j:
continue
if A[i] == A[j]:
if B[i] > B[j]:
r = -1
break
elif A[i] > A[j]:
r = min(r, (B[j] - B[i]) // (A[i] - A[j]))
else:
db = B[i] - B[j]
da = A[j] - A[i]
l = max(l, (db + da - 1) // da)
if l <= r:
mi[i] = (l, r)
l = 1
r = 1 << 60
for j in range(n):
if i == j:
continue
if A[i] == A[j]:
if B[i] < B[j]:
r = -1
break
elif A[i] > A[j]:
da = A[i] - A[j]
db = B[j] - B[i]
l = max(l, (db + da - 1) // da)
else:
r = min(r, (B[i] - B[j]) // (A[j] - A[i]))
if l <= r:
ma[i] = (l, r)
ans = 1 << 60
x = 1 << 60
for i in range(n):
if mi[i] is None:
continue
l1, r1 = mi[i]
for j in range(n):
if i == j or ma[j] is None:
continue
l2, r2 = ma[j]
if l2 <= l1 <= r1:
ma_ = A[j] * l1 + B[j]
mi_ = A[i] * l1 + B[i]
if ma_ - mi_ < ans:
ans = ma_ - mi_
x = l1
elif ma_ - mi_ == ans and l1 < x:
x = l1
if l1 <= l2 <= r1:
ma_ = A[j] * l2 + B[j]
mi_ = A[i] * l2 + B[i]
if ma_ - mi_ < ans:
ans = ma_ - mi_
x = l2
elif ma_ - mi_ == ans and l1 < x:
x = l2
print(x)