2019 ICPC Universidad Nacional de Colombia Programming Contest

12 problems from 2019 ICPC Universidad Nacional de Colombia Programming Contest (contest 102307), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2019 ICPC Universidad Nacional de Colombia Programming Contest

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 31m 10s

#	Problem	Time	✓
A	Amazon	1m 6s	✓
B	Boring Non-Palindrome	6m 4s	✓
C	Common Subsequence	2m 35s	✓
D	Do Not Try This Problem	4m 31s	✓
E	Extreme Image	1m 20s	✓
F	Fraction Formula	3m 7s	✓
G	Graduation	1m 51s	✓
H	Hardest Challenge	3m 13s	✓
I	Integer Prefix	1m 5s	✓
J	Jail Destruction	1m 46s	✓
K	Kernel Of Love	1m 19s	✓
L	Liquid X	3m 13s	✓

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307E - Extreme Image

We have (n) luminous bodies, each described by its distance from Earth and its angular position around Earth. The observatory can choose any radial interval of length (d), written as ([x,x+d]), and any angular interval of length (alpha), written as ([omega,omega+alpha]).

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307C - Common Subsequence

We have two DNA strings A and B, both of length n. The only characters that can appear are A, T, G, and C. We do not need to construct the common subsequence. We only need to decide whether its maximum possible length is at least 0.99n.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307F - Fraction Formula

Each input line is an arithmetic expression built from fractions, addition, subtraction, and parentheses. A fraction appearing in the expression has a numerator from 0 through 100 and a positive denominator from 1 through 20.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307A - Amazon

We are given several pairs of points. Each pair determines an infinite straight subway line through those two points. The actual segment between the points is irrelevant because the subway line extends indefinitely.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307L - Liquid X

This is an interactive search problem disguised as a coin-change problem. There is an unknown positive integer quantity (X), with (1 le X le 10^6). We have (n) droppers, and using dropper (i) once adds (ai) units of liquid.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307K - Kernel Of Love

We have the Fibonacci sequence indexed from 1, with (F1=F2=1) and (F{k+2}=F{k+1}+Fk). For a given (n), the available humans correspond to the first (n) indexed Fibonacci values.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307J - Jail Destruction

We have an array of (n) wall heights. A destruction operation chooses an interval ([a,b]) and removes exactly (s) meters from every wall in that interval, except that a wall cannot become negative. In other words, every affected height changes from (hi) to (max(0,hi-s)).

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307I - Integer Prefix

We are given one text string with no spaces. The task is to find the longest prefix of that string whose characters are all decimal digits. The prefix must be non-empty. If the very first character is not a digit, then no valid prefix exists and we print -1.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307H - Hardest Challenge

Each team has three strings of its own length. At every position, the team may choose the character from any one of its three members, independently of every other position. Thus a team with strings (P,Q,R) can construct up to (3^n) different strings.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307G - Graduation

Each course is a vertex in a directed graph. If a[i] = j, then course i must be completed before course j. A course with a[i] = 0 has no course after it in this prerequisite relation.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307D - Do Not Try This Problem

We have a string of length (n), indexed from 1 to (n), and (q) updates. An update chooses a starting position (i), a step (a), a number of steps (k), and a character (c). The affected positions form one arithmetic progression: [ i, i+a, i+2a, ldots, i+ka.

Practice › Codeforces Solutions › 2019 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102307B - Boring Non-Palindrome

We have one non-empty string s. The only allowed operation is appending characters to its right end. The goal is to append as few characters as possible so that the entire resulting string becomes a palindrome.