非遗工坊排期：体验场次并行教室统计代码附录

站内文件视图直接读取仓库内容，Markdown 使用文档排版渲染，其余文本文件保持原始排版，方便校对训练证据链。

文件类型Markdown

10-cases/s1-jh-06-heritage-workshop-schedule/06-deliverables/appendix-code.md

完整解题档案：complete-solution-dossier.md

Python 主实现

源文件：main.py

实现状态：当前已有可执行实现

import sys


def solve(data: str) -> str:
    tokens = list(map(int, data.split()))
    if not tokens:
        return ""
    it = iter(tokens)
    n = next(it)
    m = next(it)
    diff = [0] * (m + 3)
    for _ in range(n):
        start = next(it)
        end = next(it)
        diff[start] += 1
        diff[end + 1] -= 1
    current = 0
    best = -1
    first_peak = 0
    idle = 0
    for slot in range(1, m + 1):
        current += diff[slot]
        if current > best:
            best = current
            first_peak = slot
        if current == 0:
            idle += 1
    return "\n".join(
        [
            f"max_rooms={best}",
            f"first_peak_slot={first_peak}",
            f"idle_slots={idle}",
        ]
    )


if __name__ == "__main__":
    sys.stdout.write(solve(sys.stdin.read()).strip())
    sys.stdout.write("\n")

非遗工坊排期：体验场次并行教室统计 代码附录

Python 主实现

非遗工坊排期：体验场次并行教室统计代码附录