Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

問題追加 Euclidean MST #1207

Merged
merged 6 commits into from
Jul 13, 2024
Merged

問題追加 Euclidean MST #1207

merged 6 commits into from
Jul 13, 2024

Conversation

NachiaVivias
Copy link
Collaborator

@NachiaVivias NachiaVivias commented Jul 9, 2024

resolve #916

テストケースジェネレータの一部は Closest Pair of Points のものをもとにしていますが、 #1204 の該当部は修正済みです。

手元で、サイズの大きいケースを含めて、 naive_prim.cpp の出力で checker が OK を出すことを一度確認しました。

制約は

  • $1\leq N\leq 200, 000$
  • $|X _ i| , |Y _ i| \leq 10^4$

です。

Copy link
Collaborator

@maspypy maspypy left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

correct は見ていません、AC確認はしていません、naive_prim は見ました。

geo/euclidean_mst/gen/max_slender.cpp Outdated Show resolved Hide resolved
@NachiaVivias
Copy link
Collaborator Author

naive_prim.cpp の出力で checker が OK を出すことを再度確認しました。

@maspypy
Copy link
Collaborator

maspypy commented Jul 13, 2024

ありがとうございます、マージします。
幾何verify問題は自分も利用したいけど準備苦手という感じなのでとてもうれしい

@maspypy maspypy merged commit f59a877 into yosupo06:master Jul 13, 2024
6 checks passed
@NachiaVivias NachiaVivias deleted the euclid_mst branch July 18, 2024 08:56
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.

[問題案] Euclidean MST
2 participants