USACO (71) 썸네일형 리스트형 백준 11974 Subsequences Summing to Sevens (USACO January 2016 Silver 2번) 문제 링크: https://www.acmicpc.net/problem/11974 11974번: Subsequences Summing to Sevens Farmer John's \(N\) cows are standing in a row, as they have a tendency to do from time to time. Each cow is labeled with a distinct integer ID number so FJ can tell them apart. FJ would like to take a photo of a contiguous group of cows but, due to a trau www.acmicpc.net Prefix Sum 문제 예시를 보면, 3 5 1 6 2 14 10이라는 .. 백준 15751 Teleportation (USACO February 2018 Bronze 1번) 문제 링크: https://www.acmicpc.net/problem/15751 15751번: Teleportation The first and only line of input contains four space-separated integers: $a$ and $b$, describing the start and end locations, followed by $x$ and $y$, describing the teleporter. All positions are integers in the range $0 \ldots 100$, and they are not neces www.acmicpc.net 세가지 방법중 최소값이 답임. 1. 시작점에서 도착점으로 순간이동 없이 바로 가는것. 2. 시작점에서 x.. 백준 15594 Out of Place (USACO January 2018 Bronze 3번) 문제 링크: https://www.acmicpc.net/problem/15594 15594번: Out of Place The first line of input contains $N$ ($2 \leq N \leq 100$). The next $N$ lines describe the heights of the cows as they are lined up after Bessie makes her move. Each cow height is an integer in the range $1 \ldots 1,000,000$. Cows may have the same height www.acmicpc.net 먼저 숫자들을 bef, aft 두 배열에 입력받은후, aft 배열만 sort함으로써, bef 배열을 aft.. 백준 15593 Lifeguards (USACO January 2018 Bronze 2번) 문제 링크: https://www.acmicpc.net/problem/15593 15593번: Lifeguards (Bronze) The first line of input contains $N$ ($1 \leq N \leq 100$). Each of the next $N$ lines describes a lifeguard in terms of two integers in the range $0 \ldots 1000$, giving the starting and ending point of a lifeguard's shift. All such endpoints are distinct www.acmicpc.net 한명씩 차례대로 뺀 상태에서 커버되는 시간을 구하고, 그 값들의 최대값을 구하면 됨. 1 2 .. 백준 11973 Angry Cows (USACO January 2016 Silver 1번) 문제 링크: https://www.acmicpc.net/problem/11973 11973번: Angry Cows (Silver) The first line of input contains \(N\) (\(1 \leq N \leq 50,000\)) and \(K\) (\(1 \leq K \leq 10\)). The remaining \(N\) lines all contain integers \(x_1 \ldots x_N\) (each in the range \(0 \ldots 1,000,000,000\)). www.acmicpc.net Binary Search 폭발 반경 R을 기준으로 모든 hay bales 를 다 터뜨리기 위해 발사해야 할 소의 갯수가 K보다 작거나 같으면 hi를 낮추고, K보다 크면 .. 백준 11969 Breed Counting (USACO December 2015 Silver 3번) 문제 링크: https://www.acmicpc.net/problem/11969 11969번: Breed Counting Farmer John's \(N\) cows, conveniently numbered \(1 \ldots N\), are all standing in a row (they seem to do so often that it now takes very little prompting from Farmer John to line them up). Each cow has a breed ID: 1 for Holsteins, 2 for Guernseys, and 3 www.acmicpc.net Prefix Sum 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19.. 백준 15592 Blocked Billboard II (USACO January 2018 Bronze 1번) 문제 링크: https://www.acmicpc.net/problem/15592 15592번: Blocked Billboard II The first line of input contains four space-separated integers: $x_1$ $y_1$ $x_2$ $y_2$, where $(x_1, y_1)$ and $(x_2, y_2)$ are the coordinates of the lower-left and upper-right corners of the lawnmower billboard in Bessie's 2D field of view. The next lin www.acmicpc.net 처음 입력받은 직사각형을 먼저 1로 배열에 입력받고, 다음 직사각형을 2로 같은 배열에 입력.. 백준 11968 High Card Wins (USACO December 2015 Silver 2번) 문제 링크: https://www.acmicpc.net/problem/11968 11968번: High Card Wins Bessie the cow is a huge fan of card games, which is quite surprising, given her lack of opposable thumbs. Unfortunately, none of the other cows in the herd are good opponents. They are so bad, in fact, that they always play in a completely predictable fas www.acmicpc.net E: 1 2 5 8 10 B: 3 4 6 7 9 처음 세판은 B 가 이긴다(3 > 1, 4 > 2, 6.. 이전 1 ··· 3 4 5 6 7 8 9 다음