## [YBT2022 winter vacation Day3 B] [LOJ 2460] Euler loop / bridge (two points) (Euler loop) (network flow)

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 ...

Added by keeve on Tue, 08 Feb 2022 13:41:16 +0200

## UVA1324 Bring Them There

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 ...

Added by ace_lovegrove on Fri, 28 Jan 2022 16:47:15 +0200

## Multi school provincial selection simulation 07

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 ...

Added by Ali25m on Tue, 25 Jan 2022 21:42:43 +0200

## Codeforces 311E Biologist

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 ...

Added by Dark[NSF] on Wed, 19 Jan 2022 01:22:56 +0200

## Small M crops

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 ...

Added by tabs on Tue, 28 Dec 2021 02:09:09 +0200

## UVA1306 The K-League (maximum flow)

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 ...

Added by slapdashgrim on Sun, 31 Oct 2021 16:49:16 +0200