Others

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2222 Standard AC automatic question. ACCode: # Include # include # include # include # include # include # include # include # include # include # include #

Wa is terrible because of incorrect graph creation. Let's talk about creating a graph, and then it is the largest stream. Note that all edges in the question are directed edges. Source point S sink point t Each city I is connected to the

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4546 Question: Give You n numbers and ask the sum of N numbers, which is smaller than M. Analysis: Obviously, we need to sort the initial sequence (I forgot to sort the sequence

Asteroids! Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 2599 accepted submission (s): 1745 Problem descriptionyou're in space. You want to get home. There are asteroids. You don't have want

King Arthur's knights Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1518 accepted submission (s): 645Special Judge Problem descriptioni am the bone of my sword. Steel is my body, and the fire

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4633 Typical polyA theorem: Idea: According to the Burnside theorem, the number of equivalence classes is equal to the average value of the number of fixed points in all

Frequent values Time limit:2000 ms   Memory limit:65536 K Total submissions:8555   Accepted:3081 Description You are given a sequenceNIntegersA1, A2,...,In non-decreasing order. In addition to

The merchant Time limit:3000 Ms   Memory limit:65536 K Total submissions:1520   Accepted:434 Description There areNCities in a country, and there is one and only one simple path between each pair

Cornfields Time limit:1000 ms   Memory limit:30000 K Total submissions:3842   Accepted:1823 DescriptionFJ has decided to grow his own Corn Hybrid in order to help the cows make the best possible milk. to that end,

Tour in the castle Time Limit: 5 seconds memory limit: 32768 KB After the final boss is defeated, the hero found that the whole castle is collapsing (Very Familiar scene, isn' t it ). escape from the castle is easy, just need to cross a few

Flip game Time limit:1000 ms   Memory limit:65536 K Total submissions:25323   Accepted:10927 DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. one

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4569 Question: Here is a polynomial with a maximum power of 4. Let you find an X to make the result p * P 0. Question: F (x) % (P * P) = 0, f (x) % P = 0, f (x) % P = 0 then f (x + p)

Oil Deposits Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 7813 accepted submission (s): 4583Problem descriptionthe specified geologic survey company is responsible for detecting underground

Travel in time Time Limit: 8000/4000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 971 accepted submission (s): 196Problem description Bob gets tired of playing games, leaves Alice, and travels to Changsha alone.

A star not a tree? Time limit:1000 ms   Memory limit:65536 K Total submissions:2519   Accepted:1332 DescriptionLuke wants to upgrade his home computer network

Network Time limit:5000 Ms   Memory limit:65536 K Total submissions:3868   Accepted:1321 Description A network administrator manages a large network. the network consists of n computers and m links between pairs

-> Question, click here Give a n * m maze with a person in the position of P, a bean in the position of B, maybe a baby in the position of S, the other is either obstacle X or open space ., now people want to eat beans. People can only move up or

This is a tree-like DP backpack problem. After a long time of struggle, WA finally fell down today and burst into tears ...... It turns out that it is too bad to handle the details. I found a one-day error and found a small condition. The general

I feel that graph theory requires powerful YY capabilities... It is difficult to create a graph because this question is followed by a minimal cut process. 1: The room we want to protect in the question is the sink point T, and then we need to add

First, let's take a look at the question of lower-bound network streams. In addition to the capacity of each arc, the upstream and downstream network flow problem also specifies a lower limit, the traffic on the arc should not be less than the lower