Template: Network Stream (Dinic algorithm)
1. Maximum network flow Logu P3376 Title Description Gives a network diagram, its source and sink points, and finds the maximum flow of its network. analysis The idea of network flow is to continuously expand on the original basis Based on a greedy idea, first bfs judges if there is an augmentUTF-8...
Posted by Hepp on Sun, 06 Jun 2021 02:39:58 +0930
ffmpeg learning (19) format analysis of file stream and network stream (pure version av_parser_parse2)
Above [ffmpeg learning (17) format analysis of file stream and network stream (using AVIOContext)] Use AVIOContext to specify the input of AVFormat, and read audio and video data from memory data for analysis. When we need to parse the network stream, we usually use socket to receive the data aUTF-8...
Posted by vitch2002 on Sun, 19 Dec 2021 16:03:04 +1030
4682. [GDOI2017 simulation 8.11] biologist
Description After years of efforts, Philipsweng has made outstanding achievements in the fields of biology and computer. He also developed gene recombination technology that can denature cattle and won the Nobel Prize in medicine or physiology in 20XX. Now, Philipsweng has \ (n \) cattle, whichUTF-8...
Posted by tvance929 on Sun, 26 Dec 2021 12:18:21 +1030
1083. [GDOI2006] save Atlantis
Description The Atlanteans angered the gods, and Zeus, the king of the gods, decided to educate them. At this time, a malicious bug demon king saw the opportunity and secretly planned an ambitious plot to level Atlantis under the banner of "educating Atlantis". The kind Zeus did not discover hiUTF-8...
Posted by jawinn on Thu, 20 Jan 2022 09:45:12 +1030
[YBT2022 winter vacation Day5 C] isolated point set (Dilworth theorem) (network flow)
Outlier set Title Link: YBT2022 winter vacation Day5 C General idea of the topic Give you a DAG and ask how many points you can choose at most so that they can't reach each other. Then output one of the schemes and output whether each point is possible to appear in all schemes. thinking First, UTF-8...
Posted by DarkPrince2005 on Fri, 11 Feb 2022 16:36:55 +1030
Graph theory topic - network flow - learning notes: EK solving cost flow
1. Preface Cost flow, fully known as minimum cost maximum flow, is a branch of network flow. The problem of minimum cost and maximum flow is described as follows: Give a network \ (g = < V, E > \), and each edge has two weights: \ (f,v \). \(f \) represents the maximum flow of this side, \ (v UTF-8...
Posted by kikidonc on Sun, 17 Apr 2022 15:37:51 +0930
[network flow question 24] Mars Exploration
Cost flow General idea of the topic Here is a map of $P \times Q $. There are three kinds of terrain on it: $mp[i][j]=0 $, indicating that the $I $row and $j $column of the map are flat terrain, which can be passed at will. $mp[i][j]=1 $, indicating that the $I $row and $j $column of the map arUTF-8...
Posted by TheLoveableMonty on Mon, 18 Apr 2022 07:02:08 +0930