05 2024 档案
摘要:D. Invertible Bracket Sequences A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inser
阅读全文
摘要:D. XORificator You are given a binary (consisting only of 0s and 1s) $n \times m$ matrix. You are also given a XORificator, using which you can invert
阅读全文
摘要:E. Chain Queries You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices are colored white or black. You are asked to p
阅读全文
摘要:F - MST Query Problem Statement You are given a weighted undirected connected graph $G$ with $N$ vertices and $N-1$ edges, where vertices are numbered
阅读全文
摘要:[USACO13DEC] Optimal Milking G 题目描述 Farmer John has recently purchased a new barn containing N milking machines (1 <= N <= 40,000), conveniently numbe
阅读全文
摘要:F. Cutting Game Alice and Bob were playing a game again. They have a grid of size $a \times b$ ($1 \le a, b \le 10^9$), on which there are $n$ chips,
阅读全文
摘要:Find Products of Elements of Big Array A powerful array for an integer x is the shortest sorted array of powers of two that sum up to x. For example,
阅读全文
摘要:E. Unique Array You are given an integer array $a$ of length $n$. A subarray of $a$ is one of its contiguous subsequences (i. e. an array $[a_l, a_{l+
阅读全文
摘要:G - Mediator Problem Statement Beware the special input format and the smaller memory limit than usual. There is an undirected graph with vertices $1,
阅读全文
摘要:G2. Division + LCP (hard version) This is the hard version of the problem. In this version $l\le r$. You are given a string $s$. For a fixed $k$, cons
阅读全文
摘要:D2. Reverse Card (Hard Version) The two versions are different problems. You may want to read both versions. You can make hacks only if both versions
阅读全文