# USACO Bronze 2019 December - Livestock Lineup

Authors: Benjamin Qi, Kevin Sheng, Melody Yu, Ryan Chou

## Video Solution

By Melody Yu

Video Solution Code

## Implementation

**Time Complexity:** $\mathcal{O}(N)$

C++

#include <bits/stdc++.h>using namespace std;const int RESTRICT_LEN = 6;// list of cows, in alphabetical orderconst vector<string> COWS = {"Beatrice", "Belinda", "Bella", "Bessie","Betsy", "Blue", "Buttercup", "Sue"};vector<vector<string>> orderings;

Python

from typing import List# list of cows, in alphabetical orderCOWS = ["Beatrice", "Belinda", "Bella", "Bessie", "Betsy", "Blue", "Buttercup", "Sue"]orderings = []def build(ordering: List[str]):# finished building permutation

## $\mathcal{O}(N)$ Solution With Graphs

This solution is covered in the Introduction to Graphs module.

### Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!