We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Problem name: Triangle detection Problem ID: triangle_detection
単純無向グラフが与えられる 3 頂点であってどの組も互いに結ばれているものを一つ見つけるか、ないことを報告せよ
類題: #442
https://www.researchgate.net/publication/220618165_Finding_a_Minimum_Circuit_in_a_Graph の方法で $O(M^{3/2})$
N M u_0 v_0 : u_{M-1}, v_{M-1}
Yes a b c
or
No
The text was updated successfully, but these errors were encountered:
https://judge.yosupo.jp/problem/enumerate_triangles ?
検出だけならもっといい計算量あるんでしょうか
Sorry, something went wrong.
数えるのも $O^*(M^{3/2})$ でできたんですね…。 close します
No branches or pull requests
Problem name: Triangle detection
Problem ID: triangle_detection
Problem
単純無向グラフが与えられる
3 頂点であってどの組も互いに結ばれているものを一つ見つけるか、ないことを報告せよ
類題: #442
Constraint
Solution / Reference
https://www.researchgate.net/publication/220618165_Finding_a_Minimum_Circuit_in_a_Graph の方法で$O(M^{3/2})$
(Optional) Input
(Optional) Output
or
The text was updated successfully, but these errors were encountered: