USACO 2015 February Contest, Bronze Problem 2. COW
原题下载 USACO2015FEB-B2 答案 #include <iostream> #include <vector> using namespace std; int main() { freopen("cow.in", "r", stdin); freopen("cow.out", "w", stdout); int N; string S; ci...
USACO 2015 February Contest, Bronze Problem 1. Censoring (Bronze)
原题下载 USACO2015FEB-B1 答案 (Analysis by Mark Gordon) This problem asks us to repeatedly delete the first occurrence of the string T from a larger string S until T no longer appears in S. The lit...
USACO 2015 January Contest, Gold Problem 1. Cow Rectangles
原题下载 USACO2015JAN-G1 答案 (Analysis by Nick Wu and Brian Dean) The critical observation for this problem is that an optimal rectangle must have a Holstein on each of its four sides. This motiva...
USACO 2015 January Contest, Gold Problem 3. Grass Cownoisseur
原题下载 USACO2015JAN-G3 答案 (Analysis by Mark Gordon) This problem asks us to find the largest cycle in a directed graph going through node 1 where one of the edges may be traversed backwards. Su...
USACO 2015 January Contest, Gold Problem 2. Moovie Mooving
原题下载 USACO2015JAN-G2 答案 (Analysis by Steven Hao) Because the bounds on N are small, a solution with exponential runtime will be fast enough. Following this train of thought, we naturally come...
USACO 2015 January Contest, Silver Problem 3. Meeting Time
原题下载 USACO2015JAN-S3 答案 import java.io.*; import java.util.*; public class meetingS { static int[][] bessieGrid; static int[][] elsieGrid; static int n; public static void main(String[] args)...
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 ...
