2022.07.06 A Group summary

summary ： Examine the subject carefully .

A

The question ： Given a directed graph , Every side $x\to y$ , If $y$ It can also be reached through the path on the diagram $x$ So this is a “ Good side ”, Edge right is $z$ ; Otherwise, this is a “ Bad side ”, The boundary right is $2z$ . Ask for no more than $k$ The shortest path of the bad side .

practice ： The meaning of the title is not clear , The original structure is also a directed graph . We Floyd Run again to measure the permeability , And then “ Bad side ” establish $k$ A picture of the floor . And then use dijkstra Run the algorithm over .

summary ： The meaning of the title depends on the completeness ……

Code ： Code \GM1782\20220706\A\A.cpp .

B

Collect in Thinking routine \ character string \ Hash \ Interesting routine \GM3337_20220706.md Inside .

Code ： Code \GM3337\20220706\B\B.cpp .

C

Collect in Thinking routine \ graph theory \ Tree problems \ Heuristic merging \ Heuristic merge notes .md Inside .

Code ： Code \GM3337\20220706\C\C_test2.cpp .

D

The question ： A number on the interval XOR , Find the minimum value of an interval XOR number .

practice ： Listen to the conversion of the solution , Can be dealt with violently . I don't know much about this transformation , So we need to study Game theory .

summary ： Some conclusions need to be recorded , For a rainy day .