Programming VIP

Euler loop / Bridge Title Link: YBT2022 winter vacation Day3 B / LOJ 2460 General idea of the topic Give you a picture, the side is two-way, and the cost of walking on both sides is different. You should choose some edges to walk, and then form an Euler loop, and the maximum cost of the selected edge is the least. To output this cost and the ...

Title Link Topic analysis It can be seen that this problem should be solved by network flow, but if only network flow is used, "each tunnel takes a day to pass" can not be handled. In this problem, we notice that whether each computer can move is related to the current state of the graph, and the current state of the graph is related ...

Multi school provincial selection simulation 7 Passing Zhongdan meaning of the title Give you a string \ (s \), each time you ask if \ (s[l:r] \) can be worthy of Dan, and a string can be worthy of Dan, if and only if you can traverse each position of this substring through several walks. A walk is to move from a point \ (i \) to a different po ...

The first minimum cut I wrote Choose one from two, consider a fishbone type drawing (your own name), and then use the minimum cut to find the minimum cost. Fishbone mapping is about a row of points in the middle, and then \ (S \) on the left is connected to this row of points, and this row of points is connected to \ (T \) on the right, which l ...

luoguP1361 small M crops Title Description Xiaom has opened up two huge cultivated lands \ (A \) and \ (B \) (you can think that the capacity is infinite). Now, Xiaop has \ (n \) seeds of crops, and there are \ (1 \) seeds of each crop (that is, one crop can be planted), numbered \ (1 \) to \ (n \). Now, the \ (I \) crop can get \ (a_i \) incom ...

Problem surface have n n n teams compete, and each team needs to play the same number of games. Each game happens to be five wins for one team and five losses for the other. Give the number of games each team has won so far ...