UCF Locals 2014

12 problems from UCF Locals 2014 (contest 102323), difficulty -. 12/12 solutions verified against sample I/O.

12 items

UCF Locals 2014

Special | 12 problems | 12/12 verified | Difficulty - | 43m 4s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Vowel Count				47s	✓
B	Soccer Standings				1m	✓
C	Jumping Frog				13m 47s	✓
D	Fujiyama Thursday				8m 15s	✓
E	Chain Email				1m 17s	✓
F	Faster Microwaving				1m 6s	✓
G	Dirty Plates				4m 8s	✓
H	Chocolate Fix				1m 25s	✓
I	Shopping Spree				48s	✓
J	Factorial Products				1m 10s	✓
K	Super Lucky Palindromes				3m 17s	✓
L	Under Construction Forever				6m 4s	✓

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323F - Faster Microwaving

We are given a recommended microwave cooking time in MM:SS form and a percentage p. Chris is allowed to choose any integer number of seconds whose distance from the recommended time is at most p percent of that recommended time.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323C - Jumping Frog

We have a circular arena with (N) positions numbered from (0) to (N-1). Every position is either a rock, written as R, or a pond, written as P. The frog may start at any rock. After choosing a jump length (K), every jump moves the frog from position (i) to [ (i+K)bmod N.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323G - Dirty Plates

We have three stacks. The dirty stack initially contains a permutation of 1..n. A type 1 operation removes between 1 and a plates from the top of the dirty stack and places them, without changing their internal order, on the intermediate stack.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323B - Soccer Standings

We are given several independent soccer groups. Each group contains a set of uniquely named teams and a collection of already played matches. For every match, we know both teams and their final scores. From those results, we must build the complete standings table.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323L - Under Construction Forever

We have a connected undirected graph whose vertices represent buildings and whose vertex weights represent the cost of choosing that building for reconstruction. On one day, we choose a building (v).

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323K - Super Lucky Palindromes

A lucky number is a positive decimal number whose digits are only 4 and 7. A super lucky number has two additional restrictions: its total number of digits must itself be lucky, and the number of 4 digits or the number of 7 digits must itself be lucky.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323J - Factorial Products

For each test case, we are given three lists of non-negative integers, called A, B, and C. For a list such as A = [a1, a2, ..., ak], define its score as [ P(A)=a1!cdot a2!cdots ak!. ] The task is to determine which of the three lists has the largest score.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323I - Shopping Spree

We have several shopping sprees. For each spree, the items appear in a fixed order, with value a 1 ,a 2 ,…,a s . We want to choose a subset of these items with maximum total value. The restriction is about every prefix of the array.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323H - Chocolate Fix

The puzzle uses exactly nine truffles. Each truffle has one of three shapes, square, round, or triangle, and one of three flavors, vanilla, strawberry, or chocolate. Since every combination occurs exactly once, the nine physical truffles are all distinct.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323E - Chain Email

The email network is a directed graph. Each person is a vertex, and an entry saying that person u has person v as a contact creates a directed edge u - v. The starting person receives the first email and forwards it to every contact, and every recipient does the same forever.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323D - Fujiyama Thursday

We have several trips to Fujiyama Sushi. On each trip there are c cars, and every car carries exactly four people, so there are 4c family members in total. Each car has its own arrival time, measured from the beginning of the trip. Each person has an eating time.

Practice › Codeforces Solutions › UCF Locals 2014 ›

CF 102323A - Vowel Count

The task is to examine several names and decide whether each name contains more vowels than consonants. The only vowels are the five lowercase letters a, e, i, o, and u. Every other lowercase letter is a consonant.