Unofficial Div 4 Round #2 by ssense SlavicG

6 problems from Unofficial Div 4 Round #2 by ssense SlavicG (contest 102873), difficulty -. 3/6 solutions verified against sample I/O.

6 items

Unofficial Div 4 Round #2 by ssense SlavicG

Special | 6 problems | 3/6 verified | Difficulty - | 5m 13s

#	Problem	Time	✓
A	Catching the Impostor	47s	✓
B	Rabbit Game	1m 9s	✓
C	Similar Arrays	46s
D	Sanda's Job	39s
E	Count Substrings	54s	✓
F	Game on Grid	58s

Practice › Codeforces Solutions › Unofficial Div 4 Round #2 by ssense SlavicG ›

CF 102873A - Catching the Impostor

The problem describes a group of n players where exactly one player is the hidden impostor. We are given observations of players who were seen completing tasks. A player who appears in the observation list cannot be the impostor.

Practice › Codeforces Solutions › Unofficial Div 4 Round #2 by ssense SlavicG ›

CF 102873F - Game on Grid

Error in message stream

Practice › Codeforces Solutions › Unofficial Div 4 Round #2 by ssense SlavicG ›

CF 102873B - Rabbit Game

We have a row of carrots, where each carrot has a size. Two rabbits begin at opposite ends of this row. A rabbit can continue moving inward only while every next carrot it reaches is at least as large as the carrot it just ate.

Practice › Codeforces Solutions › Unofficial Div 4 Round #2 by ssense SlavicG ›

CF 102873E - Count Substrings

We are given a string s containing lowercase English letters and another string t of length two. The goal is to count how many pairs of positions (L, R) produce a substring s[L..R] that contains t somewhere inside it as a contiguous part.

Practice › Codeforces Solutions › Unofficial Div 4 Round #2 by ssense SlavicG ›

CF 102873D - Sanda's Job

Hmm...something seems to have gone wrong.

Practice › Codeforces Solutions › Unofficial Div 4 Round #2 by ssense SlavicG ›

CF 102873C - Similar Arrays

Hmm...something seems to have gone wrong.