USACO 2015 January Contest, Silver Problem 1. Stampede
原題下載 USACO2015JAN-S1 答案 (Analysis by Mark Gordon) The first observation to make in this problem is that we can transform each cow into a time interval corresponding to the interval that the c...
USACO 2015 January Contest, Silver Problem 2. Cow Routing
原題下載 USACO2015JAN-S2 答案 #include <iostream> #include <vector> #include <cstring> #include <cstdio> using namespace std; #define MAXV 1010 bool vis[MAXV]; pair<long ...
USACO 2015 January Contest, Bronze Problem 4. Meeting Time
原題下載 USACO2015JAN-B4 答案 (Analysis by Nick Wu) For each of Bessie and Elsie, we will simply try all possible paths that they can take to get from field 1 to field N. Because there are only at ...
USACO 2015 January Contest, Bronze Problem 3. It's All About the Base
原題下載 USACO2015JAN-B3 答案 (Analysis by Mark Gordon) This problem gives us two three digit strings and asks us to determine the bases X and Y such that those strings evaluate to the same integer...
USACO 2015 January Contest, Bronze Problem 2. Cow Routing II
原題下載 USACO2015JAN-B2 答案 (Analysis by Mark Gordon) This problem is a harder version of the Cow Routing problem that appeared earlier in the bronze contest. In this problem Bessie may use up to...
USACO 2015 January Contest, Bronze Problem 1. Cow Routing
原題下載 USACO2015JAN-B1 答案 (Analysis by Mark Gordon) This problem asks us to find the minimum cost route that allows us to fly from city A to city B. This is a relatively straightforward problem...
USACO 2014 December Contest, Bronze Problem 4. Learning by Example
原題下載 USACO2014DEC-B4 答案: (Analysis by Jonathan Paulson - jonathanpaulson@gmail.com) The main difficulty here is that?A?and?B?are so large we cannot consider each new cow separately. We have t...
USACO 2014 December Contest, Silver Problem 2. Marathon
原題下載 USACO2014-DEC-S2 答案 (Analysis by Nick Wu) Let's define f(n,k)f(n,k) to be the smallest distance needed to end up at point nn having skipped exactly kk points. Given that we are at a spec...
USACO 2014 December Contest, Gold Problem 3. Cow Jog
原題下載 USACO2014-DEC-G3 答案 (Analysis by Mark Gordon) Two cows must be in different lanes if one cow overtakes the other at some point (or at the very end) in the jog. Viewed this way we can gre...
