XXII Spain Olympiad in Informatics, Online Qualifier 1

4 problems from XXII Spain Olympiad in Informatics, Online Qualifier 1 (contest 105477), difficulty -. 3/4 solutions verified against sample I/O.

4 items

XXII Spain Olympiad in Informatics, Online Qualifier 1

Special | 4 problems | 3/4 verified | Difficulty - | 7m 50s

#	Problem	Time	✓
A	Coins	1m 8s	✓
B	Russian Roller Coasters	1m 40s	✓
C	Decoding Permutations	2m 55s
D	Girona Flower Time	2m 7s	✓

Practice › Codeforces Solutions › XXII Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105477D - Girona Flower Time

The city can be modeled as a directed complete graph where every location is a node and every ordered pair of nodes has a travel time. Each node also has a non-negative value representing how many tourists stand there.

Practice › Codeforces Solutions › XXII Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105477A - Coins

We are given several independent scenarios. In each scenario, Baq owns a collection of coins, each coin having a positive integer value. Using any number of these coins, he can form sums by choosing a subset and adding their values.

Practice › Codeforces Solutions › XXII Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105477C - Decoding Permutations

We are given a sequence of constraints that come from a hidden permutation of the numbers from 1 to n. Instead of the permutation itself, we receive, for each position i, a value ci that counts how many earlier positions contain values smaller than the value placed at position i.

Practice › Codeforces Solutions › XXII Spain Olympiad in Informatics, Online Qualifier 1 ›

CF 105477B - Russian Roller Coasters

We are asked to count how many valid “roller coasters” can be formed from a fixed number of segments, where each segment moves one unit horizontally and either goes up or down by one unit vertically.