Bzoj-usaco Abused by the mind

Bzoj on the Usaco topic is still very good (I was badly abused.)

It is necessary to summarize and tidy up.

3889: [Usaco2015 jan]cow Routing double bond value shortest way, pre-processing the cost to run the shortest way.

★3890: [Usaco2015 jan]meeting Time maintains a small Gan, keeps the edges plugged in, and then maintains an ans, if ans>q.top (). T and two edges all go to n, the answer is directly output. Otherwise the answer may be greater than the current answer.

3891: [Usaco2014 dec]piggy back to do 3 times the shortest way, and then enumerate the points of encounter.

3892: [Usaco2014 Dec]marathon maintains a n^2 DP

3893: [Usaco2014 dec]cow Jog to sweep from the back, update the answer.

★3940: [Usaco2015 feb]censoring build an AC automaton and run it again, recording the transfer when the condition is met.

3942: [Usaco2015 feb]censoring a single insert, maintain a hash on it (why the seeds take 31 to blow up and take 29 does not.)

3943: [Usaco2015 feb]superbull this MST is OK.

4096: [Usaco2013 dec]milk Scheduling maintenance of heaps

4097: [Usaco2013 dec]vacation planning n^3 nude floyed

4100: [Usaco2015 open]bessie Goes Moo answer is to divide 7, so each number up to 7 possible, then 7^7 mess up.

★4101: [Usaco2015 open]trapped in the haybales because only one can be specified, so it is possible to consider two directions, for example to the left it must be as far as possible to the right to go to the left side of the point, so you can update the answer, right side walk is also so.

4102: [Usaco2015 Open]bessie n<=1000, so it's good to preprocess the distance and then make a n^2 dp.

Bzoj-usaco Abused by the mind