The 16-th BIT Campus Programming Contest - Onsite Round

13 problems from The 16-th BIT Campus Programming Contest - Onsite Round (contest 104025), difficulty -. 10/13 solutions verified against sample I/O.

13 items

The 16-th BIT Campus Programming Contest - Onsite Round

Special | 13 problems | 10/13 verified | Difficulty - | 14m 39s

#	Problem	Time	✓
A	Gifts in box	48s	✓
B	BIT Palindrome	58s	✓
C	Combination	2m 5s
D	ZYW with BIT	47s	✓
E	Equal	43s	✓
F	ZYW with books	37s	✓
G	Get off work	2m 2s
H	Happiness Index	43s	✓
I	String	1m 14s	✓
J	Stones	2m 4s
K	ZYW with tutors	44s	✓
L	Fake Travelling Salesman Problem	1m 6s	✓
M	Counting in Tree	48s	✓

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025M - Counting in Tree

We are given a rooted tree with nodes labeled from 1 to n, where node 1 is the root. Each node i (for i 1) has a parent, so the structure is fixed and the subtree of any node x is well-defined: it consists of x and all nodes in its descendant set.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025J - Stones

Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025L - Fake Travelling Salesman Problem

We are given an $n times m$ grid where each cell is a vertex of an unweighted graph, and edges exist between cells that share a side.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025K - ZYW with tutors

We are given a square matrix of size $n times n$ containing integers. We are allowed to pick exactly one cell in this matrix and replace its value with any real number we want, but this operation can be performed at most once.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025E - Equal

We are given two integers, representing two counters that start at different values. In one move, we are allowed to either increase the first counter by 1 or increase the second counter by 2.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025I - String

We are given a single lowercase string, and we look at all of its substrings as objects. From these substrings we want to form a set $S$ with a restriction: no two different chosen substrings are allowed to stand in a suffix relationship.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025G - Get off work

Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025H - Happiness Index

We are given an array of integers representing the happiness levels of residents along a line. For each test case, we must count how many contiguous subarrays have an average happiness whose floor equals a given integer $k$.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025F - ZYW with books

We are given a sequence of books arranged on a shelf from front to back, each with a numeric value representing how frequently it is used. Smaller values mean higher priority, and the goal is to reorder the books so that these values become non-decreasing from front to back.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025C - Combination

Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025D - ZYW with BIT

We are given a small city modeled as a weighted undirected graph. Each intersection is a node, and each road has a travel time. On top of that, every node has a periodic constraint of length $T$. For each time residue $t in [0, T-1]$, a node is either open or closed.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025B - BIT Palindrome

We are working with strings of length $n$, where each position can be one of three characters: $b$, $i$, or $t$. Among all such strings, we want to count those that are called “lucky”.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Onsite Round ›

CF 104025A - Gifts in box

We start with a rectangular 3D arrangement of unit cubes inside a box whose dimensions are $n times m times h$. Each position $(i, j)$ in an $n times m$ grid describes a vertical stack of cubes with height $A{i,j}$. So initially the structure is a height map over a floor plan.