Forethought Future Cup - Elimination Round

Solutions for Forethought Future Cup - Elimination Round (contest 1146). 3/8 problems verified against sample I/O. Difficulty range: 800-2900.

8 items

Forethought Future Cup - Elimination Round

Type: Special | Problems: 8 | Verified: 3/8 | Rating range: 800-2900 | Time: 15m 34s

Problem	Name	Rating	Tags	Solve Time	Verified
A	[Love ](https://codeforces.com/problemset/problem/1146/A)	800	implementation, strings	1m 27s	✓
B	[Hate ](https://codeforces.com/problemset/problem/1146/B)	1100	implementation, strings	1m 23s	✓
C	Tree Diameter	1700	bitmasks, graphs, interactive	2m 14s	✗
D	Frog Jumping	2100	dfs-and-similar, math, number-theory	3m 25s	✗
E	Hot is Cold	2400	bitmasks, data-structures, divide-and-conquer	2m 5s	✗
F	Leaf Partition	2500	dp, trees	1m 30s	✗
G	Zoning Restrictions	2700	dp, flows, graphs	1m 19s	✓
H	Satanic Panic	2900	dp, geometry	2m 11s	✗

Practice › Codeforces Solutions › Forethought Future Cup - Elimination Round ›

CF 1146H - Satanic Panic

We are given a set of $n$ points on a 2D plane, with the guarantee that no three points are collinear. From these points, we want to count the number of 5-point subsets that can form a pentagram-a star-shaped configuration where the points are connected in a specific…

Practice › Codeforces Solutions › Forethought Future Cup - Elimination Round ›

CF 1146F - Leaf Partition

We are given a rooted tree with n nodes, where node 1 is the root. Each node other than the root has a parent specified. A leaf is any node without children.

Practice › Codeforces Solutions › Forethought Future Cup - Elimination Round ›

CF 1146G - Zoning Restrictions

We are asked to assign heights to houses along a street in order to maximize total profit. The street has n available positions, each of which can host a house with an integer height between 0 and h. The profit from a house of height a is a^2. There are m city restrictions.

Practice › Codeforces Solutions › Forethought Future Cup - Elimination Round ›

CF 1146D - Frog Jumping

A frog starts at position 0 on a number line. From any position, it can move forward by adding a or move backward by subtracting b. However, during the process of exploring what is reachable, we only allow it to stay within the segment [0, x] when computing f(x).

Practice › Codeforces Solutions › Forethought Future Cup - Elimination Round ›

CF 1146E - Hot is Cold

We are given an array of integers and a series of queries. Each query instructs us to flip the sign of numbers in the array that satisfy a comparison: either all numbers greater than a threshold or all numbers less than a threshold.

Practice › Codeforces Solutions › Forethought Future Cup - Elimination Round ›

CF 1146C - Tree Diameter

We are asked to determine the diameter of an unknown weighted tree. The tree has n nodes connected by n-1 edges, each with a positive integer weight at most 100. We do not have direct access to the edges.