Programmer Group

The 45th international undergraduate Programming Competition (ICPC) Asian regional competition (Kunming) We only did H, water.. Author's evaluation and partial solution How to evaluate the ICPC Kunming division in 2021? Partial solution ICPC Kunming travel notes (2021.4.3) B Chessboard upper and lower bounds minimum cost maximum flow ...

[Title Description] John's farm has a lot of chores to complete before milking the cows. Each chore takes a certain amount of time to complete it. For example, they have to gather the cows, drive them into the barn, wash their breasts and do some other work. It is necessary to finish all the chores as soon as possible, because there is more tim ...

[joint examination of noip improvement group on November 11, 2021] happy bean problem solution Description See for yourself Solution Think about the partial score of m=0 first Find the shortest path from each point to all other points a x ...

Chapter III Search and Graph Theory 1. Depth-first search (dfs) Search down from start to finish, find the bottom and backtrace down to finish, use stack to store data, have two concepts of backtrace and pruning, do not have the shortest Array Array (Violent Search, Full Array) To restore the state to its original state after backtracking ...

No link is provided for this question Title Description Given a tree. We think one x → y x\rightarrow y Simple path of x → y( x ≠ ...

Catalog B - Wave C - String D - Traffic F - Budget G - Worker H - Class B - Wave Topic: Given a sequence of n integers ranging from 1 to c, find a subsequence that has the same number on even digits, the same number on odd digits, and different numbers on even and odd digits. Output the length of the longest subsequence that meets ...

>Link ybtoj running in trees >Description Xiao A will run on A rooted tree with 1 as the root and N nodes every day. At the beginning, each node has an obstacle. Each obstacle will move periodically in the subtree with the initial point as the root according to the order of depth first, and only one edge will be moved per unit time. ...

Template EK #include<iostream> #include<cstdio> #include<cstring> #include<queue> using namespace std; inline int read() { int x=0,f=1; char ch=getchar(); while(ch<'0'||ch>'9'){ if(ch=='-') f=-1;ch=getchar(); } while(ch>='0'&&ch<='9'){ x=(x<<1)+(x<<3)+(ch^48);ch=getchar(); } ret ...

1, Basic concept of graph   Graph - graph G is composed of two sets V(G) and E(G), marked as G=(V,E), where V(G) is a non empty finite set of vertices,   E(G) is a finite set of edges, and edges are disordered or ordered pairs of vertices. Graph cannot be empty 1. Terms and definitions of drawings 1) Directed graph If E is a finite s ...

Some pre cheese you may need: Linear programming problem linear programming problem is the following problem: There are \ (n \) non negative variables \ (x \) and \ (m \) constraints, such as: \[\sum_j a_{i,j}x_j\leq b_i \]It is required to maximize the value of \ (\ sum_i c_ix_i \), as follows: \[\max c^{\mathsf T} x\\ s.t.\\ Ax\leq b\\ x\geq ...