(Aleppo + HAIST + SVU + Private) CPC 2022

13 problems from (Aleppo + HAIST + SVU + Private) CPC 2022 (contest 103821), difficulty -. 10/13 solutions verified against sample I/O.

13 items

(Aleppo + HAIST + SVU + Private) CPC 2022

Special | 13 problems | 10/13 verified | Difficulty - | 15m 19s

#	Problem	Time	✓
A	Laser Tag	52s	✓
B	Bored of Board Games	48s	✓
C	Perfect Seating	2m 8s
D	Fairplay	1m 6s	✓
E	Robovac	51s	✓
F	A + B (Harder version)	44s	✓
G	Angry Bsher	1m 8s	✓
H	FAT Sequences	2m 7s
I	Retirement	1m 3s	✓
J	Nour's Balls	51s	✓
K	Movie Planning	47s	✓
L	ResliPhobia	2m 7s
M	Permutations Score	47s	✓

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821L - ResliPhobia

Let $w(x1,ldots,xn)$ denote the contribution of a minterm $$(1-p1)^{1-x1}p1^{x1}cdots (1-pn)^{1-xn}pn^{xn}.$$ Maximizing this quantity over all assignments satisfying $f(x1,ldots,xn)=1$ is equivalent to maximizing a product of independent local factors along a path in the BDD…

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821M - Permutations Score

We are given a permutation of the numbers from 1 to N, and we define a score by scanning the permutation from left to right. Every time we place a value P[i], we look at all earlier values P[j] and add 1 if P[j] divides P[i].

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821K - Movie Planning

We are given a timeline from moment 1 to moment M and a collection of movies, each represented by a closed interval [L, R], meaning the movie starts at time L and finishes at time R.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821J - Nour's Balls

We are given a collection of balls where each ball has a color, so the input is essentially a multiset over colors. Alongside this, we are asked to distribute all balls into exactly K boxes.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821H - FAT Sequences

Let $f$ be represented by a reduced ordered binary decision diagram, and let $F(p)$ denote the reliability polynomial under the specialization $p1=cdots=pn=p$.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821I - Retirement

We are given a set of points on a plane. Each point represents a tree placed at a fixed coordinate, and each tree independently “survives” with a given probability. If a tree survives, it becomes part of the final active set.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821G - Angry Bsher

We are given a grid of digits where equal digits that touch by edges form connected components, exactly like standard 4-direction flood-fill regions.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821F - A + B (Harder version)

Each test case describes one week of planning. For every week, we are given seven small integers, each representing how many jokes are told on a specific day from Saturday through Friday.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821C - Perfect Seating

Let $f$ be represented by a reduced ordered binary decision diagram, and let $F(p)$ denote the reliability polynomial under the specialization $p1=cdots=pn=p$.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821D - Fairplay

We are given two teams of size $N$. Team A starts with strengths $1, 2, 3, dots, N$, while team B starts with strengths $2, 3, 4, dots, N+1$. So the two teams are identical sequences shifted by one.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821E - Robovac

We are given a one-dimensional corridor of $N$ cells arranged in a line. A robot starts in the middle cell, specifically at index $lceil N/2 rceil$, and initially faces to the right.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821A - Laser Tag

We are given two horizontal rows of points on a grid. One team stands on the bottom edge at positions $(1,0)$ through $(n,0)$, and the other team stands directly above at $(1,n)$ through $(n,n)$.

Practice › Codeforces Solutions › (Aleppo + HAIST + SVU + Private) CPC 2022 ›

CF 103821B - Bored of Board Games

We are given a rectangular grid of integers. Before the game starts, we are allowed to flip signs of entire rows and entire columns any number of times, where flipping a row or column multiplies every value in it by -1. After all flips are chosen, the board is revealed.