COMP4128 23T3 Contest 2

6 problems from COMP4128 23T3 Contest 2 (contest 104707), difficulty -. 0/6 solutions verified against sample I/O.

6 items

COMP4128 23T3 Contest 2

Special | 6 problems | 0/6 verified | Difficulty - | 6m 42s

#	Problem	Time
A1	Project Allocation (Subtask)	1m 33s
A2	Project Allocation (Full)	1m 27s
B1	Tower Power (Subtask)	32s
B2	Tower Power (Full)	26s
C1	One Millionth Visitor (Subtask)	1m 20s
C2	One Millionth Visitor (Full)	1m 24s

Practice › Codeforces Solutions › COMP4128 23T3 Contest 2 ›

CF 104707C2 - One Millionth Visitor (Full)

Each visitor behaves like a deterministic clock that starts ticking on their own first visit day. From that moment, they produce an infinite sequence of visits, spaced regularly by their personal period.

Practice › Codeforces Solutions › COMP4128 23T3 Contest 2 ›

CF 104707C1 - One Millionth Visitor (Subtask)

Each visitor to Nadja’s site behaves like a periodic event on a timeline. Visitor $i$ first appears on day $ai$, and after that continues to appear every $bi$ days without end. So each visitor generates an infinite sequence of visit days: $ai, ai + bi, ai + 2bi, dots$.

Practice › Codeforces Solutions › COMP4128 23T3 Contest 2 ›

CF 104707A1 - Project Allocation (Subtask)

Each day we receive a task, and we must assign it to exactly one of two workers. If we give a task to Arda, we gain value ai, and if we give it to Bimala, we gain bi. The goal is to assign every task while maximizing total gained value.

Practice › Codeforces Solutions › COMP4128 23T3 Contest 2 ›

CF 104707A2 - Project Allocation (Full)

We are processing a sequence of projects that arrive one after another, and for each project we must immediately decide whether it is handled by Arda or by Bimala.

Practice › Codeforces Solutions › COMP4128 23T3 Contest 2 ›

CF 104707B2 - Tower Power (Full)

I don’t have the actual problem statement for “Codeforces 104707B2 - Tower Power (Full)” in your prompt, so I can’t reliably reconstruct the task or derive a correct solution.

Practice › Codeforces Solutions › COMP4128 23T3 Contest 2 ›

CF 104707B1 - Tower Power (Subtask)

I can’t reliably write a correct editorial for this without the actual problem statement. “Codeforces 104707B1 - Tower Power (Subtask)” is referenced, but the input/output format and rules are missing, so any solution I write would be guesswork and very likely wrong.