Communication System

GitHub跳转原题关系图返回列表

本地题面缓存已迁移，解析内容待补充。

OJ: noi_openjudge

题目 ID: ch0406-20

难度:未知

标签:python

日期: 2026-07-30 23:01

目录

  1. 题意
  2. 思路
  3. 代码
  4. Python代码
    1. 复杂度
    2. 总结

题意

完整题面见同目录的 problem.md。

思路

代码

Python代码

python
case_count = int(input())
for _ in range(case_count):
    device_count = int(input())
    devices = []
    bandwidths = set()
    for _ in range(device_count):
        data = list(map(int, input().split()))
        options = list(zip(data[1::2], data[2::2]))
        devices.append(options)
        bandwidths.update(bandwidth for bandwidth, _ in options)
    best = 0.0
    for bandwidth in bandwidths:
        total_price = 0
        for options in devices:
            prices = [price for option_bandwidth, price in options if option_bandwidth >= bandwidth]
            if not prices:
                break
            total_price += min(prices)
        else:
            best = max(best, bandwidth / total_price)
    print(f"{best:.3f}")

复杂度

总结