AlgoChief Sprint Round 2

4 problems from AlgoChief Sprint Round 2 (contest 105687), difficulty -. 3/4 solutions verified against sample I/O.

4 items

AlgoChief Sprint Round 2

Special | 4 problems | 3/4 verified | Difficulty - | 2m 51s

#	Problem	Time	✓
A	Penalty Kick	43s	✓
B	Card Game	43s	✓
C	Fat Burner II	35s
D	Matchmaker	50s	✓

Practice › Codeforces Solutions › AlgoChief Sprint Round 2 ›

CF 105687D - Matchmaker

We are given a lowercase string and many substring queries. For each query interval $[l, r]$, we look only at that substring. Two equal letters can form a match, and every character can belong to at most one match.

Practice › Codeforces Solutions › AlgoChief Sprint Round 2 ›

CF 105687A - Penalty Kick

We have two football teams, each with n players. Team A shoots against Team B's goalkeeper, whose height is k. Team B shoots against Team A's goalkeeper, whose height is m. A player scores if their shooting power is at least half of the opposing goalkeeper's height.

Practice › Codeforces Solutions › AlgoChief Sprint Round 2 ›

CF 105687C - Fat Burner II

I’m missing the actual problem statement for Codeforces 105687C - Fat Burner II in your prompt (the “Problem / Input / Output” sections are empty).

Practice › Codeforces Solutions › AlgoChief Sprint Round 2 ›

CF 105687B - Card Game

We are given several independent test cases. In each test case there is an array of card values and a parameter $k$.