[CSP-S 2025] Road Repair

The question

Can the source-listed reference complexity O(m log m + n × 2^k) be substantially improved?

Algorithmic frontier

Reference frontier: $\mathcal{O}\!\left(m \log m + n \times 2^{k}\right)$
Latest reported AI result: $\mathcal{O}\!\left(m \log m + n k^{2} + k^{2} \times 2^{k}\right)$

Normalized growth proxy · not benchmark data

This compares source-reported bounds; it is not a correctness or novelty finding.

Results

2026-09-12

Claimed result: $\mathcal{O}\!\left(m \log m + n k^{2} + k^{2} \times 2^{k}\right)$

AI / model: Not identified

Verification

Source: Source inaccessible
Theory: Theory not checked
Implementation: Unknown
Prior art: Prior art not reviewed

The result source returned HTTP 401 behind a login wall; its contents were not observed.

The result link is a Luogu discussion thread (discuss/1373966?page=4) that returns HTTP 401 and redirects to the Luogu login page on both www.luogu.com and www.luogu.com.cn. P02 did not log in, use cookies, or bypass any check, so this record is explicitly un-audited and must not be filled in by inference from the problem statement or prior knowledge.

The question

Algorithmic frontier

Results

Claimed result: $\mathcal{O}\!\left(m \log m + n k^{2} + k^{2} \times 2^{k}\right)$

Verification

Credits

Sources and history

Sources and history

Contribute