原题下载 USACO2016-JAN-P1 答案: (Analysis by Nathan Pinsker) This problem suggests a DP approach, and the bounds suggest that O(n3)O(n3) is a comfortable target to aim for. There are several ways t...
答案: (Analysis by Mark Gordon) This problem asks us to simulate Bessie tracing the barn clockwise until she knows where she is. One way to think about this is to abstract away the polygon aspect o...
原题下载 USACO2016-JAN-S3 答案: (First Solution Analysis by Nick Wu) In this problem, Farmer John is building a fence on a 2D grid. He wants to count the number of gates he needs to build in order ...
原题下载 USACO2016-JAN-B1 答案: (Analysis by Nick Wu) In this problem, we have the counts of how many participants are bronze, silver, gold, and platinum before a contest and how many are in each d...
原题下载 USACO2016-JAN-G2 答案: (Analysis by Mark Gordon) This problem is actually a veiled Dynamic Time Warping problem where the error function is the squared distance between FJ and Bessie. Ther...
原题下载 USACO2016-FEB-P3 答案 (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-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 ...
