The 11-th BIT Campus Programming Contest for Junior Grade Group

13 problems from The 11-th BIT Campus Programming Contest for Junior Grade Group (contest 104828), difficulty -. 10/13 solutions verified against sample I/O.

13 items

The 11-th BIT Campus Programming Contest for Junior Grade Group

Special | 13 problems | 10/13 verified | Difficulty - | 10m 34s

#	Problem	Rating	Tags	Accepted	Time	✓
A	\u9b54\u6cd5\u7ec3\u4e60				41s	✓
B	\u73a9\u724c				1m 28s	✓
C	\u6570\u4e09\u5143\u56fe				25s
D	\u535a\u5f08				38s
E	Before the deadline				1m	✓
F	\u968f\u673a\u6570\u7834\u89e3\u7a0b\u5e8f				27s
G	\u9cad\u9c7c\u5723\u8005				1m 9s	✓
H	\u56de\u6587\u4e32\u5206\u5272				31s	✓
I	Guess Numbers				49s	✓
J	\u5706\u795e				50s	✓
K	\u6570\u636e\u7ed3\u6784\u57fa\u672c\u529f				1m 4s	✓
L	\u6570\u8def\u5f84				46s	✓
M	\u732b\u732b\u866b\u866b\u866b				46s	✓

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828M - 猫猫虫虫虫

We are given two observed constraints about three consecutive segments on a line. Think of a point $x$ as the start of the first segment.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828K - 数据结构基本功

We are given a rooted tree where each node initially holds a binary value, either 0 or 1. The tree is dynamic in the sense that two types of operations are applied over time. The first operation selects two nodes and treats them as endpoints of a simple path.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828L - 数路径

We are given a rooted binary tree where each node has a color value. Every node has at most two children, and children are explicitly given as left and right pointers (or zero if absent). The root is node 1.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828J - 圆神

We are working in a geometric setting where each enemy is represented by a circle in the plane, and the player is fixed at the origin. From the origin, a hook is fired along a straight ray in some direction.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828G - 鲭鱼圣者

We are given a small battlefield with at most seven identical enemy minions. Each minion starts with a protective shield that blocks the first incoming damage entirely.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828I - Guess Numbers

Two hidden integers are chosen at the start of each test case, and they never change during our interaction. Both numbers lie in a fixed range below $2^{60}$, so they are effectively 60-bit values.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828H - 回文串分割

We are given multiple independent strings, and for each one we need to decide whether it can be decomposed into a sequence of substrings where every piece is a palindrome.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828E - Before the deadline

We are given a metro system where stations are nodes and each metro line is a fixed path through some of these stations. Each line has a travel time for every adjacent pair of stations on the line.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828F - 随机数破解程序

Working

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828B - 玩牌

We are given several stacks of cards. Each stack contains some distinct integers, and globally all card values form a permutation, so every value appears exactly once across all stacks. A game consists of multiple rounds.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828D - 博弈

Working

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828A - 魔法练习

We are given a list of integers and a modulus value. The task is to compute the product of all numbers in the list and then output the remainder when that product is divided by the given modulus.

Practice › Codeforces Solutions › The 11-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104828C - 数三元图

We are given a tournament-style directed graph: every pair of distinct vertices has exactly one directed edge between them. For any two nodes $u$ and $v$, either $u to v$ or $v to u$, never both and never none.