TSEC Round 1 (Div. 4)

5 problems from TSEC Round 1 (Div. 4) (contest 105380), difficulty -. 4/5 solutions verified against sample I/O.

5 items

TSEC Round 1 (Div. 4)

Div. 4 | 5 problems | 4/5 verified | Difficulty - | 7m 31s

#	Problem	Time	✓
A	Who Hates Abhishek?	1m 4s	✓
C	Dhrumil The Pados Wali Aunty	2m 34s
D	Make It Good	1m 11s	✓
E	String Palindrome Game	1m 40s	✓
F	Inversion Sum	1m 2s	✓

Practice › Codeforces Solutions › TSEC Round 1 (Div. 4) ›

CF 105380C - Dhrumil The Pados Wali Aunty

We are given an array of size $2n$ representing fighting strengths of $2n$ friends. The task is to split them into two disjoint teams so that every person belongs to exactly one team, and both teams must contain an odd number of members.

Practice › Codeforces Solutions › TSEC Round 1 (Div. 4) ›

CF 105380F - Inversion Sum

We are asked to look at every permutation of numbers from 1 to n, compute how many inversions each permutation contains, and then sum those inversion counts over all permutations.

Practice › Codeforces Solutions › TSEC Round 1 (Div. 4) ›

CF 105380E - String Palindrome Game

We are given a string and multiple independent queries. Each query specifies a segment of the string, and we are only allowed to look inside that segment.

Practice › Codeforces Solutions › TSEC Round 1 (Div. 4) ›

CF 105380A - Who Hates Abhishek?

We are asked to construct a special kind of permutation of size n. A permutation here means we arrange the numbers from 1 to n exactly once each. The twist is that the permutation must behave like an involution without fixed points.

Practice › Codeforces Solutions › TSEC Round 1 (Div. 4) ›

CF 105380D - Make It Good

We are given an array and we only care about its prefixes. For each prefix, we must decide whether it has a special property called “good”.