Skip to content

Verify fork snippets on Library Checker - #79

Open
frex-e wants to merge 7 commits into
mainfrom
cursor/lc-verify-kactl-deltas-4799
Open

Verify fork snippets on Library Checker#79
frex-e wants to merge 7 commits into
mainfrom
cursor/lc-verify-kactl-deltas-4799

Conversation

@frex-e

@frex-e frex-e commented Aug 29, 2026

Copy link
Copy Markdown
Owner

Wrap this fork’s additions and API deltas vs upstream KACTL as Library Checker submissions.

Account: inj. 29/29 accepted.

Remaining four (small snippet hooks)

The last four families needed a tiny hook so the rest of the algorithm could be judged:

Problem Snippet Hook Sub
enumerate_primes LinearSieve.h linearSieve(n) with n > SIEVE_N skips lp 397539 AC
dynamic_graph_vertex_add_component_sum OfflineDynamicConnectivity.h addVal / query(v) component sums 397540 AC
range_affine_range_sum LazySegmentTree.h seglen during applyUpdate 397541 AC
range_affine_range_sum_large_array SparseLazySegmentTree.h same seglen 397542 AC
matrix_rank RREF.h modular rref(A, mod) 397543 AC

persistent_range_affine_range_sum is still unmapped (range-copy-from-another-version). Persistent tree has the same seglen hook.

Harness

  • lc-verify/problems/*.cpp — one solver per LC problem, inlining content/ headers (or the same tree/HLD code with the V/U/binop edits the headers already tell you to make).
  • bundle.py / submit.py / submit_all.py — single TU and POST to v3.api.judge.yosupo.jp.

Full table with submission links is in lc-verify/README.md.

gcd_convolution had a first WA (397516) from a descending multiples-zeta in the wrapper; resubmit 397536 is AC.

Open in Web Open in Cursor 

cursoragent and others added 2 commits August 29, 2026 11:25
Wrap added and replaced KACTL snippets as yosupo submissions so they can
be checked on Library Checker. Customizable trees are pasted with the
V/U/binop edits the headers already document.

Co-authored-by: IndraK <frex-e@users.noreply.github.com>
All 24 mapped problems AC on yosupo (account inj). The gcd convolution
wrapper used a descending multiples zeta and double-counted; Mobius.h
was already correct. Poller now waits for a final verdict, not x/y.

Co-authored-by: IndraK <frex-e@users.noreply.github.com>
@frex-e
frex-e marked this pull request as ready for review August 29, 2026 11:35
cursoragent and others added 5 commits August 29, 2026 11:35
All three yosupo min-plus problems accepted with the notebook SMAWK
and concave-border implementations. Ignore lc-verify build/results.

Co-authored-by: IndraK <frex-e@users.noreply.github.com>
… the logic.

seglen on lazy/sparse/persistent trees, primes-only linear sieve for n > SIEVE_N,
DynCon vertex add + component sum, and modular RREF.

Co-authored-by: IndraK <frex-e@users.noreply.github.com>
enumerate_primes, dyncon component sum, range affine sum (dense + large array),
and matrix_rank. Treat n/m judging statuses as in-progress when polling.

Co-authored-by: IndraK <frex-e@users.noreply.github.com>
Co-authored-by: IndraK <frex-e@users.noreply.github.com>
Co-authored-by: IndraK <frex-e@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants