@@ -10,7 +10,7 @@ unusedStructMember:../library/trees/ladder_decomposition/linear_kth_par.hpp:17
1010unusedStructMember:../library/data_structures/dsu/dsu_bipartite.hpp:9
1111unusedStructMember:../library/trees/linear_lca.hpp:15
1212unusedScopedObject:../library/trees/centroid_decomp_uncommon/count_paths_per_length.hpp:12
13- unusedScopedObject:library_checker_aizu_tests/cd_asserts.hpp:5
13+ unusedScopedObject:library_checker_aizu_tests/cd_asserts.hpp:6
1414unusedScopedObject:../library/trees/centroid_decomp_uncommon/count_paths_per_node.hpp:14
1515unusedScopedObject:library_checker_aizu_tests/trees/centroid_path_dist.test.cpp:29
1616unusedScopedObject:../library/trees/edge_centroid_decomp_uncommon/count_paths_per_length.hpp:13
@@ -21,9 +21,10 @@ unusedScopedObject:library_checker_aizu_tests/trees/cd_jump_on_tree.test.cpp:58
2121arrayIndexOutOfBoundsCond:library_checker_aizu_tests/math/linear_prime_sieve.test.cpp:17
2222negativeContainerIndex:../library/strings/suffix_array/burrows_wheeler.hpp:50
2323useStlAlgorithm:../kactl/content/numerical/FastFourierTransform.h:53
24- useStlAlgorithm:../library/graphs/strongly_connected_components /add_edges_strongly_connected.hpp:58
24+ useStlAlgorithm:../library/graphs/scc /add_edges_strongly_connected.hpp:58
2525useStlAlgorithm:../library/math/matrix_related/row_reduce.hpp:28
26- useStlAlgorithm:../library/math/count_paths/count_paths_triangle.hpp:23
26+ useStlAlgorithm:../library/math/count_paths/count_paths_triangle.hpp:24
27+ useStlAlgorithm:../library/math/matrix_related/xor_basis_unordered_intersection.hpp:10
2728shadowFunction:../kactl/content/graph/BinaryLifting.h:17
2829unknownMacro:../kactl/content/graph/BinaryLifting.h:18
2930constParameter:../kactl/content/graph/BinaryLifting.h:29
0 commit comments