C++

A undirected connected graph with n vertices and m edges. At the beginning, node 1 caught fire and it took one day for the fire to spread to its adjacent vertex. At the beginning, a robot was also located at Node 1, however, when the robot leaves,

Question: A person walks back and forth in a line segment (changes the direction when the line segment endpoint is met). Now he starts from the starting point and has an initial direction, Steps 1, 2, 3... m can be taken each time, which corresponds

The weight and value of n items are w [I] and v [I] respectively, and K items are selected to maximize the value of unit weight. 1 1 The general idea is to sort items by unit value, and then select items by greedy, but this method is incorrect and

  There are several different concentric rings on the ground. some of them may overlap. in Figure 1, there are 3 rings: blue, green and red. the red one is just above the green one. the problem is to remove minimum number of rings so that no two of

A matrix. Some grids are F and some are R. You need to find the largest sub-matrix so that all the matrices are F. Idea: enumerate each sub-Matrix directly, obviously the complexity is O (m ^ 3 n ^ 3), obviously TLE. We can use scanning method: up

Function: Format and output data to a string. Sprintf_s () is a secure version of sprintf (). You can specify the buffer length to avoid the Overflow Risk of sprintf (). Test code: // MatchTest. cpp: defines the entry point of the console

Source: Ultraviolet a HDU   QuestionA tree with n nodes numbered 0 ~ N-1, vertex is 0Each edge has a weight.Alice and Bob start at the vertex and go down to the leaf node.For the first time, Bob chooses the child node to go to, and for the second

#include #include #include #include using namespace std;#define N 20010int s[N], f[N], n, root;vector g[N];void getroot(int now, int fa) { int u; s[now] = 1; f[now] = 0; for (int i=0; i  

# Include using namespace std; # define MAXN 105 int n, m, k, s; int C [MAXN]; int W [MAXN]; int dp [MAXN] [MAXN]; int ans; // dp [I] [j] [k] = max (dp [I-1] [j] [k], dp [I] [J-1] [k-C [I] + W [I]); // dp [j] [k] = max (dp [j] [k], dp [J-1] [k-C [I]

#include #include #include #include #include #include using namespace std; const int N = 5e4+10; const int K = 32; typedef long long LL; struct edge_t { int v, to; }; vector E; int L[N]; void init(int n) { E.clear();

Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 6762 Accepted Submission (s): 4284   Problem DescriptionThere is a rectangular room, covered with square tiles. each tile is colored

PalindromeTime Limit: 3000 MS Memory Limit: 65536 KTotal Submissions: 48269 Accepted: 16570 Description A palindrome is a regular rical string, that is, a string read identically from left to right as well as from right to left. you are to write a

Enter three integers, n, m, and k, indicating that there is a map with n rows and m columns next. A robot enters from column k of the first line. Ask how many steps the robot can take. If a loop occurs The number of steps in the output

Physics teachers in high school often think that problems given as text are more demanding than pure computations. After all, the pupils have to read and understand the problem first! So they don't state a problem like ''U = 10 V, I = 5A, P =? "But

  Use profiteering to enumerate all possible arrangements and find the minimum cost. Use an array to save the input, use an array to generate an arrangement, and use another array to save the arrangement of the current minimum cost.   For (int I = 0;

Maximum Sum   BackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. consider satisfying a boolean expression in conjunctive normal form in which each conjunct consists of

Jill Rides Again Jill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, Jill often uses the excellent public bus system for part of her journey. she has a folding bicycle which she carries with her when

TruckingTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 1473 Accepted Submission (s): 509 Problem DescriptionA certain local trucking company wowould like to transport some goods on a cargo

This is the basic question of the minimum tree structure. I will not go into details about the meaning of the question. When I think about this question, I find it very difficult. Because I often use input optimization when I input them, I usually

The first is the introduction of the minimum tree structure. Read this blog. Minimum Tree Structure I have introduced the question in detail. First, two-dimensional coordinate points are given. These coordinates constitute some Directed Graphs.