cp-library
This documentation is automatically generated by online-judge-tools/verification-helper
cp_library/alg/dp/chmin_fn.py
- View this file on GitHub
- Last update: 2025-03-30 20:17:47+09:00
Required by
- cp_library/alg/dp/lis_fn.py
- cp_library/alg/graph/dijkstra_fn.py
- cp_library/alg/graph/fast/digraph_cls.py
- cp_library/alg/graph/fast/digraph_weighted_cls.py
cp_library/alg/graph/fast/digraph_weighted_meta_cls.py
- cp_library/alg/graph/fast/graph_base_cls.py
- cp_library/alg/graph/fast/graph_cls.py
- cp_library/alg/graph/fast/graph_weighted_base_cls.py
- cp_library/alg/graph/fast/graph_weighted_cls.py
- cp_library/alg/graph/fast/graph_weighted_meta_cls.py
- cp_library/alg/graph/fast/grid_graph_base_cls.py
- cp_library/alg/graph/fast/grid_graph_cls.py
- cp_library/alg/graph/fast/grid_graph_walled_base_cls.py
- cp_library/alg/graph/fast/snippets/biconnected_components_vertices_fn.py
- cp_library/alg/graph/fast/snippets/cut_edges_fn.py
- cp_library/alg/graph/fast/snippets/cut_vertices_fn.py
- cp_library/alg/graph/fast/snippets/is_bipartite_fn.py
- cp_library/alg/graph/fast/snippets/strongly_connected_components_fn.py
- cp_library/alg/graph/fast/snippets/two_edge_connected_components_fn.py
- cp_library/alg/graph/strongly_connected_components_fn.py
- cp_library/alg/tree/fast/aux_tree_base_cls.py
- cp_library/alg/tree/fast/aux_tree_cls.py
- cp_library/alg/tree/fast/aux_tree_weighted_cls.py
- cp_library/alg/tree/fast/hld_base_cls.py
- cp_library/alg/tree/fast/hld_bit_cls.py
- cp_library/alg/tree/fast/hld_cls.py
- cp_library/alg/tree/fast/hld_commutative_cls.py
- cp_library/alg/tree/fast/hld_monoid_cls.py
- cp_library/alg/tree/fast/hld_weighted_cls.py
- cp_library/alg/tree/fast/tree_base_cls.py
- cp_library/alg/tree/fast/tree_cls.py
- cp_library/alg/tree/fast/tree_weighted_base_cls.py
- cp_library/alg/tree/fast/tree_weighted_cls.py
- cp_library/alg/tree/fast/tree_weighted_meta_cls.py
Verified with
- test/aoj/grl/grl_1_a_dijkstra.test.py
- test/aoj/grl/grl_1_a_fast_dijkstra.test.py
- test/aoj/grl/grl_1_b_fast_bellman_ford.test.py
- test/aoj/grl/grl_1_c_fast_floyd_warshall.test.py
- test/aoj/grl/grl_3_a_cut_vertices_snippet_fn.test.py
- test/aoj/grl/grl_3_b_cut_edges_snippet.test.py
- test/aoj/grl/grl_5_a_fast_diameter.test.py
- test/aoj/grl/grl_5_b_fast_height.test.py
- test/aoj/vol/0439_aux_dijkstra.test.py
- test/aoj/vol/0439_aux_rerooting_dp.test.py
- test/aoj/vol/0439_aux_weighted_rerooting_dp.test.py
- test/atcoder/abc/abc202_e_fast_dfs.test.py
- test/atcoder/abc/abc202_e_fast_dfs_enter_leave.test.py
- test/atcoder/abc/abc218_f_fast_shortest_path.test.py
- test/atcoder/abc/abc294_g_fast_tree_hld.test.py
- test/atcoder/abc/abc294_g_fast_tree_hld_bit.test.py
- test/atcoder/abc/abc294_g_fast_tree_lca_table_weighted_bit.test.py
- test/atcoder/abc/abc301_e_fast_grid_graph.test.py
- test/atcoder/abc/abc337_g_tree_inversion_hld_bit.test.py
- test/atcoder/abc/abc337_g_tree_inversion_hld_fast.test.py
- test/atcoder/dp/dp_v_subtree_rerooting_dp.test.py
- test/library-checker/graph/biconnected_components.test.py
- test/library-checker/graph/cycle_detection.test.py
- test/library-checker/graph/cycle_detection_undirected.test.py
- test/library-checker/graph/minimum_spanning_tree_kruskal.test.py
- test/library-checker/graph/minimum_spanning_tree_kruskal_heap.test.py
- test/library-checker/graph/scc.test.py
- test/library-checker/graph/scc_strongly_connected_components.test.py
- test/library-checker/graph/shortest_path_fast_graph.test.py
- test/library-checker/graph/two_edge_connected_components.test.py
- test/library-checker/other/longest_increasing_sequence.test.py
- test/library-checker/tree/jump_on_tree.test.py
- test/library-checker/tree/lca.test.py
- test/library-checker/tree/tree_diameter.test.py
- test/library-checker/tree/tree_path_composite_sum.test.py
- test/library-checker/tree/vertex_add_path_sum_hld.test.py
- test/library-checker/tree/vertex_add_path_sum_hld_bit.test.py
- test/library-checker/tree/vertex_add_path_sum_hld_commutative.test.py
- test/library-checker/tree/vertex_add_path_sum_hld_monoid.test.py
- test/library-checker/tree/vertex_add_subtree_sum.test.py
- test/library-checker/tree/vertex_set_path_composite.test.py
- test/yukicoder/3407.test.py
Code
import cp_library.alg.dp.__header__
def chmin(dp, i, v):
if ch:=dp[i]>v:dp[i]=v
return ch'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
https://kobejean.github.io/cp-library
'''
def chmin(dp, i, v):
if ch:=dp[i]>v:dp[i]=v
return ch