原题下载 USACO2016-FEB-P2 答案 (Analysis by Nathan Pinsker) This problem can be thought of as finding the minimum spanning tree on an (n+1)×(m+1)(n+1)×(m+1) grid of vertices representing the interi...
原题下载 USACO2016-FEB-P1 答案 (Analysis by Nathan Pinsker) The most immediately obvious solution is to try all possible locations for one gate (let's arbitrarily assume the north-south gate), then...
原题下载 USACO2016-FEB-G3 答案 (Analysis by Nathan Pinsker) For this problem, we're given a grid and want to connect all the interiors to each other. If we think of each interior region as a point ...
原题下载 USACO2016-FEB-G2 答案 (Analysis by Nathan Pinsker) Although kk is rather small, trying all possible positions for the doors is O((nk))O((nk)) and is still way too slow. Sometimes it's help...
原题下载 USACO2016-FEB-G1 答案 (Analysis by Nathan Pinsker) The first solution to this problem that people will likely come up with is something like the following: process each of the cows in some...
原题下载 USACO2016-FEB-S3 答案 (Analysis by Nick Wu) In this problem, we have two buckets and we can either fill them, empty them, or pour one into the other until we fill a bucket or empty one. We...
原题下载 答案 (Analysis by Nick Wu) In the bronze version of this problem, we naively tried all possible pairs of vertical fences and horizontal fences as long as they were next to a cow. Because t...
原题下载 USACO2016-FEB-S1 答案 (Analysis by Nathan Pinsker) The first solution to this problem that people will likely come up with is something like the following: process each of the cows in some...
原题下载 USACO2016-FEB-B3 答案 (Analysis by Nick Wu) There are a lot of possible fence combinations to consider - if we simply consider every possible even x-coordinate and every possible event y-c...
