UCF Locals 2017

11 problems from UCF Locals 2017 (contest 102318), difficulty -. 11/11 solutions verified against sample I/O.

11 items

UCF Locals 2017

Special | 11 problems | 11/11 verified | Difficulty - | 54m 8s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Electric Bill				3m 13s	✓
B	Simplified Keyboard				1m 16s	✓
C	Singin' in the Rain				1m 21s	✓
D	Editor Navigation				6m 1s	✓
E	Simple Darts				6m 2s	✓
F	Multimodal Transport				1m	✓
G	Videogame Probability				9m 39s	✓
H	Maximum NOI Subseq				4m	✓
I	Rotating Cards				11m 30s	✓
J	Multiples				3m 30s	✓
K	K-Item Shopping Spree				6m 36s	✓

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318F - Multimodal Transport

We have a transportation network with up to 400 cities. Every city has an associated switching cost. A package can travel between cities using one of four transport modes: AIR, SEA, RAIL, or TRUCK. Each route segment is undirected and belongs to exactly one transport mode.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318C - Singin' in the Rain

The CD contains t tracks numbered from 1 through t, arranged cyclically. Anya specifies a sequence of tracks that must be played in exactly that order. The first requested track is already cued, so no button press is needed for it.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318K - K-Item Shopping Spree

We have a collection of n item types. Item i has a price given to exactly two decimal places, and when constructing a shopping spree we choose exactly k items in sequence.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318J - Multiples

For each query, we have two integers a and b. We look at every integer from 1 through b and count it if it is divisible by at least one integer from 2 through a. The answer is the size of that union of sets of multiples.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318G - Videogame Probability

The game contains several item types. For each type, we know how many copies are required and the probability of obtaining that type on an attempt. We also know the total number of attempts available.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318B - Simplified Keyboard

The problem uses a small custom keyboard containing all 26 lowercase letters. The letters are arranged in three rows: Two words are given for each test case. We must classify the pair into one of three categories.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318I - Rotating Cards

We have a stack containing the cards labeled from 1 through n, appearing in some permutation. The magician must discard the cards in increasing label order, so card 1 must be discarded first, then card 2, and so on. Only the top card can be discarded.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318H - Maximum NOI Subseq

The problem asks us to process an integer array and, for every possible value of (k), determine how many array elements can be selected into a collection of increasing subsequences. Every selected subsequence must contain at least (k) elements.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318E - Simple Darts

We have a dartboard centered at the origin. The board is divided radially into w equal wedges, and it has three concentric scoring regions. The innermost circle of radius b is the bullseye and always gives 50 points.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318D - Editor Navigation

We have a text file consisting of several lines. For each line, only its length matters. A cursor position is described by a line number and a column number, where column 0 is immediately before the first character and column s[i] is immediately after the last character.

Practice › Codeforces Solutions › UCF Locals 2017 ›

CF 102318A - Electric Bill

The problem models two households whose electricity consumptions are positive integers. The electricity company uses a progressive tariff: the first 100 CWh cost 2 Americus each, the next 9,900 cost 3 each, the next 990,000 cost 5 each, and every unit beyond 1,000,000 costs 7.