Replay of Ostad Presents Intra KUET Programming Contest 2023

13 problems from Replay of Ostad Presents Intra KUET Programming Contest 2023 (contest 104663), difficulty -. 10/13 solutions verified against sample I/O.

13 items

Replay of Ostad Presents Intra KUET Programming Contest 2023

Special | 13 problems | 10/13 verified | Difficulty - | 17m 29s

#	Problem	Time	✓
A	Counting Subarrays	1m 39s	✓
B	Digit occurrence Sum	1m 34s	✓
C	Don't Let Them Pass	39s
D	Eating Honey Nuts	1m 56s
E	Fruit Seller of KUETLand	1m 34s	✓
F	Lazy KUETian	1m 17s	✓
G	Not So Easy	36s	✓
H	Rotated Image	1m 51s	✓
I	Semi-Palindromic Tree	1m 30s	✓
J	Strange Metro Rail	1m 8s	✓
K	Divisible by three	1m 17s	✓
L	Not-Incomplete	1m 13s	✓
M	Banana Monitor	1m 15s

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663A - Counting Subarrays

We are working with an array of length $N$, but the array values themselves are irrelevant. What matters is only the index line from 1 to $N$. On this line, we are given $M$ special segments $[li, ri]$. These segments represent constraints on what makes a subarray “bad”.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663B - Digit occurrence Sum

We maintain a dynamic set of non-negative integers. Over time, this set changes: numbers can be inserted or removed, and we may also delete the element that currently ranks at a specific position when the set is sorted in descending order.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663C - Don't Let Them Pass

I can't write a correct editorial and solution for this problem from the statement alone because a crucial piece of information is missing: the official problem statement does not specify whether a block may be moved beyond the grid boundaries or whether every move must keep…

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663M - Banana Monitor

We are simulating a monitoring system that watches a stream of minute-by-minute traffic values. At each minute, we compare the current traffic against a fixed capacity threshold. The system does not react immediately to a single violation or a single safe reading.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663L - Not-Incomplete

The semester has a fixed number of weeks, and each week contains a limited number of classes. Some weeks have already passed, and you have already attended a certain number of classes during those completed weeks.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663K - Divisible by three

We are given a decimal string representing a positive integer. From this string we consider every possible contiguous substring, interpret it as a number, and count how many of these substring numbers are divisible by 3.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663H - Rotated Image

We are given a fixed rectangle representing an image with side lengths $a$ and $b$. We also have a canvas that is not freely shaped: its height and width must always follow a fixed ratio $m:n$, but its overall scale is not fixed.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663I - Semi-Palindromic Tree

We are given an undirected tree, and we must assign a lowercase letter to every node. After labeling, every simple path in the tree corresponds to a string formed by reading node labels along that path. Two global constraints must hold simultaneously.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663J - Strange Metro Rail

The metro line runs through stations from $L$ to $R$, and every station behaves like a bottleneck where people can enter the train. The important restriction is that passengers can only board at intermediate stations, but everyone must ultimately exit at station $R$.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663E - Fruit Seller of KUETLand

We are given a rooted tree where each node represents a fruit with two attributes: a cost and a nutritional value.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663F - Lazy KUETian

We are working with a directed weighted graph representing buildings in a university. One special building is the hall, and from there we want to travel to many different destination departments.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663G - Not So Easy

This problem removes all algorithmic structure and leaves only a decision disguised as a question. There is no input, so the program never has to process data or react to varying conditions.

Practice › Codeforces Solutions › Replay of Ostad Presents Intra KUET Programming Contest 2023 ›

CF 104663D - Eating Honey Nuts

We start with a set containing integers from $1$ to $N$. Each day consists of $K$ independent random draws, where every draw picks a value uniformly from $1$ to $N$. If the drawn value is still present in the set, it gets removed; otherwise nothing happens.