World Robot Contest2025-2026Algorithm Application ThemeJunior Highwrc.hao.work
WRC
Contest Archive / Structured Dossiers青少年算法应用训练档案馆

把训练题、知识点、执行证据和最终解题档案统一归档成可直接浏览的竞赛资料库。

Archive30 Cases

四大文化赛道完整展开

AccessHTTPS

完整题面 / 题解 / 运行证据

No Rounded CornersTailwind FirstDossier Ready
02-solution/src/python/main.py

main.py

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

文件类型.py

10-cases/s2-jh-05-checkpoint-grid/02-solution/src/python/main.py

import sys


def solve(data: str) -> str:
    tokens = list(map(int, data.split()))
    if not tokens:
        return ""
    it = iter(tokens)
    rows = next(it)
    cols = next(it)
    queries = next(it)
    prefix = [[0] * (cols + 1) for _ in range(rows + 1)]
    for row in range(1, rows + 1):
        row_sum = 0
        for col in range(1, cols + 1):
            value = next(it)
            row_sum += value
            prefix[row][col] = prefix[row - 1][col] + row_sum
    answers = []
    best_query = 1
    best_sum = -1
    for query_id in range(1, queries + 1):
        r1 = next(it)
        c1 = next(it)
        r2 = next(it)
        c2 = next(it)
        total = prefix[r2][c2] - prefix[r1 - 1][c2] - prefix[r2][c1 - 1] + prefix[r1 - 1][c1 - 1]
        answers.append(str(total))
        if total > best_sum:
            best_sum = total
            best_query = query_id
    return f"results={' '.join(answers)}\nbest_query={best_query} {best_sum}"


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