AlgoLeap /AI爆题

Major AI leaps on difficult algorithmic problems

An auditable archive of specific algorithmic questions and AI-reported advances. Questions, results, and verification are recorded separately.

The initial corpus preserves the Luogu collection “AI 爆题总结” as provenance. GitHub repository ↗

Questions

Showing 13 of 13 questions

Major leaps

P10221

Luogu

[Provincial Selection 2024] Reshaping Time

[省选联考 2024] 重塑时光

  • Reported leap
  • Theory not checked
  • Code available
View question
Reference frontier
O ⁣(n×3n)\mathcal{O}\!\left(n \times 3^{n}\right)
Latest reported AI result
O ⁣(n3×2n)\mathcal{O}\!\left(n^{3} \times 2^{n}\right)
P11835

Luogu

[Provincial Selection 2025] Seal

[省选联考 2025] 封印

  • Reported leap
  • Theory not checked
  • Code available
View question
Reference frontier
O ⁣(Tn2)\mathcal{O}\!\left(T n^{2}\right)
Latest reported AI result
O ⁣(Tnlogn)\mathcal{O}\!\left(T n \log n\right)
P13272

Luogu

[NOI 2025] Sequence Transformation

[NOI2025] 序列变换

  • Reported leap
  • Theory not checked
  • Theory only · code pending
View question
Reference frontier
O ⁣(tn2)\mathcal{O}\!\left(t n^{2}\right)
Latest reported AI result
O ⁣(t(n+logP))\mathcal{O}\!\left(t (n + \log P)\right)
P14362

Luogu

[CSP-S 2025] Road Repair

[CSP-S 2025] 道路修复

  • Reported leap
  • Theory not checked
  • Unknown
View question
Reference frontier
O ⁣(mlogm+n×2k)\mathcal{O}\!\left(m \log m + n \times 2^{k}\right)
Latest reported AI result
O ⁣(mlogm+nk2+k2×2k)\mathcal{O}\!\left(m \log m + n k^{2} + k^{2} \times 2^{k}\right)
P14637

Luogu

[NOIP 2025] Value of a Tree

[NOIP2025] 树的价值

  • Reported leap
  • Theory not checked
  • Unknown
View question
Reference frontier
O ⁣(tn2)\mathcal{O}\!\left(t n^{2}\right)
Latest reported AI result
O ⁣(tnn)\mathcal{O}\!\left(t n \sqrt{n}\right)
P15649

Luogu

[Provincial Selection 2026] Seeker

[省选联考 2026] 找寻者

  • Reported leap
  • Theory not checked
  • Theory only · code pending
View question
Reference frontier
O ⁣(tn2)\mathcal{O}\!\left(t n^{2}\right)
Latest reported AI result
O ⁣(tnnlogn)\mathcal{O}\!\left(t n \sqrt{n} \log n\right)
P17145

Luogu

[NOI 2026] Rainbow Tree

[NOI 2026] 彩虹树

  • Reported leap
  • Theory not checked
  • Code available
View question
Reference frontier
O ⁣(n3)\mathcal{O}\!\left(n^{3}\right)
Latest reported AI result
O ⁣(n2log2n)\mathcal{O}\!\left(n^{2} \log^{2} n\right)
P4484

Luogu

[BJWC2018] Longest Increasing Subsequence

[BJWC2018] 最长上升子序列

  • Reported leap
  • Theory not checked
  • Theory only · code pending
View question
Reference frontier
O ⁣(n×2n)  or  O ⁣(np(n))\mathcal{O}\!\left(n \times 2^{n}\right)\;\text{or}\;\mathcal{O}\!\left(n p(n)\right)
Latest reported AI result
O ⁣(n23/12log2n)\mathcal{O}\!\left(n^{23/12} \log^{2} n\right)
P4619

Luogu

[SDOI2018] Old Exam Problems

[SDOI2018] 旧试题

  • Reported leap
  • Theory not checked
  • Theory only · code pending
View question
Reference frontier
O ⁣(nnlog3n)\mathcal{O}\!\left(n \sqrt{n} \log^{3} n\right)
Latest reported AI result
O ⁣(nlog3nΨ(n))\mathcal{O}\!\left(n \log^{3} n \Psi(n)\right)
P5659

Luogu

[CSP-S 2019] Numbers on a Tree

[CSP-S 2019] 树上的数

  • Reported leap
  • Theory not checked
  • Code available
View question
Reference frontier
O ⁣(Tn2)\mathcal{O}\!\left(T n^{2}\right)
Latest reported AI result
O ⁣(Tnlog2n)\mathcal{O}\!\left(T n \log^{2} n\right)
P8352

Luogu

[SDOI/SXOI2022] Little N's Independent Set

[SDOI/SXOI2022] 小 N 的独立集

  • Reported leap
  • Theory not checked
  • Code available
View question
Reference frontier
O ⁣(n2k4)\mathcal{O}\!\left(n^{2} k^{4}\right)
Latest reported AI result
O ⁣(k3(nk)log23)\mathcal{O}\!\left(k^{3} (n k)^{\log_{2} 3}\right)

Open questions

No curated open questions are published yet.

No questions match these filters.

Verification methodology

A reported advance is not a single verified fact. AlgoLeap records four independent axes.

Contribute

Propose a focused open question, add a result to an existing question, or contribute verification evidence through the public repository.