Codeforces - 随笔分类(第2页) - onlyblues

D. The Omnipotent Monster Killer

摘要：D. The Omnipotent Monster Killer You, the monster killer, want to kill a group of monsters. The monsters are on a tree with

n

$n$ vertices. On vertex wi 阅读全文

posted @ 2024-07-16 21:11 onlyblues 阅读(54) 评论(0) 推荐(0) 编辑

G2. Permutation Problem (Hard Version)

摘要：G2. Permutation Problem (Hard Version) This is the hard version of the problem. The only difference is that in this version

n \leq 5 \cdot 10^{5}

$n \leq 5 \cdot 10^5$ and 阅读全文

posted @ 2024-06-26 20:50 onlyblues 阅读(50) 评论(0) 推荐(0) 编辑

C2. Magnitude (Hard Version)

摘要：C2. Magnitude (Hard Version) The two versions of the problem are different. You may want to read both versions. You can make hacks only if both versio 阅读全文

posted @ 2024-06-13 19:29 onlyblues 阅读(42) 评论(0) 推荐(0) 编辑

G. Yasya and the Mysterious Tree

摘要：G. Yasya and the Mysterious Tree Yasya was walking in the forest and accidentally found a tree with

n

$n$ vertices. A tree is a connected undirected gra 阅读全文

posted @ 2024-06-05 19:46 onlyblues 阅读(18) 评论(0) 推荐(0) 编辑

D. Invertible Bracket Sequences

摘要：D. Invertible Bracket Sequences A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inser 阅读全文

posted @ 2024-05-31 15:43 onlyblues 阅读(165) 评论(0) 推荐(0) 编辑

D. XORificator

摘要：D. XORificator You are given a binary (consisting only of 0s and 1s)

n \times m

$n \times m$ matrix. You are also given a XORificator, using which you can invert 阅读全文

posted @ 2024-05-30 21:25 onlyblues 阅读(82) 评论(0) 推荐(0) 编辑

E. Chain Queries

摘要：E. Chain Queries You are given a tree of

n

$n$ vertices numbered from

1

$1$ to

n

$n$ . Initially, all vertices are colored white or black. You are asked to p 阅读全文

posted @ 2024-05-29 21:27 onlyblues 阅读(67) 评论(0) 推荐(0) 编辑

F. Cutting Game

摘要：F. Cutting Game Alice and Bob were playing a game again. They have a grid of size

a \times b

$a \times b$ (

1 \leq a, b \leq 10^{9}

$1 \le a, b \le 10^9$ ), on which there are

n

$n$ chips, 阅读全文

posted @ 2024-05-21 15:28 onlyblues 阅读(86) 评论(0) 推荐(0) 编辑

E. Unique Array

摘要：E. Unique Array You are given an integer array

a

$a$ of length

n

$n$ . A subarray of

a

$a$ is one of its contiguous subsequences (i. e. an array $[a_l, a_{l+ 阅读全文

posted @ 2024-05-08 21:17 onlyblues 阅读(44) 评论(0) 推荐(0) 编辑

G2. Division + LCP (hard version)

摘要：G2. Division + LCP (hard version) This is the hard version of the problem. In this version

l \leq r

$l\le r$ . You are given a string

s

$s$ . For a fixed

k

$k$ , cons 阅读全文

posted @ 2024-05-03 20:10 onlyblues 阅读(93) 评论(0) 推荐(0) 编辑

D2. Reverse Card (Hard Version)

摘要：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 阅读全文

posted @ 2024-05-02 18:57 onlyblues 阅读(128) 评论(0) 推荐(0) 编辑

H. The Most Reckless Defense

摘要：H. The Most Reckless Defense You are playing a very popular Tower Defense game called "Runnerfield 2". In this game, the player sets up defensive towe 阅读全文

posted @ 2024-04-16 21:45 onlyblues 阅读(21) 评论(0) 推荐(0) 编辑

G. GCD on a grid

摘要：G. GCD on a grid Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common divisor of two numbers. The greatest common 阅读全文

posted @ 2024-04-13 17:40 onlyblues 阅读(81) 评论(0) 推荐(0) 编辑

D. Colored Balls

摘要：D. Colored Balls There are balls of

n

$n$ different colors; the number of balls of the

i

$i$ -th color is

a_{i}

$a_i$ . The balls can be combined into groups. Eac 阅读全文

posted @ 2024-04-13 16:00 onlyblues 阅读(212) 评论(4) 推荐(1) 编辑

D. Buying Jewels

摘要：D. Buying Jewels Alice has

n

$n$ coins and wants to shop at Bob's jewelry store. Today, although Bob has not set up the store yet, Bob wants to make sur 阅读全文

posted @ 2024-04-12 20:37 onlyblues 阅读(27) 评论(0) 推荐(0) 编辑

C. Ticket Hoarding

摘要：C. Ticket Hoarding As the CEO of a startup company, you want to reward each of your

k

$k$ employees with a ticket to the upcoming concert. The tickets w 阅读全文

posted @ 2024-04-09 16:42 onlyblues 阅读(60) 评论(0) 推荐(0) 编辑

F. New Year Tree

摘要：F. New Year Tree You are a programmer and you have a New Year Tree (not the traditional fur tree, though) — a tree of four vertices: one vertex of deg 阅读全文

posted @ 2024-04-08 16:32 onlyblues 阅读(15) 评论(0) 推荐(0) 编辑

D. Non-Palindromic Substring

摘要：D. Non-Palindromic Substring A string

t

$t$ is said to be

k

$k$ -good if there exists at least one substring

^{†}

$^\dagger$ of length

k

$k$ which is not a palindr 阅读全文

posted @ 2024-04-04 19:50 onlyblues 阅读(63) 评论(0) 推荐(0) 编辑

G. Shuffling Songs

摘要：G. Shuffling Songs Vladislav has a playlist consisting of

n

$n$ songs, numbered from

1

$1$ to

n

$n$ . Song

i

$i$ has genre

g_{i}

$g_i$ and writer

w_{i}

$w_i$ . He wants to 阅读全文

posted @ 2024-04-01 23:30 onlyblues 阅读(42) 评论(0) 推荐(0) 编辑

D. Exam in MAC

摘要：D. Exam in MAC The Master's Assistance Center has announced an entrance exam, which consists of the following. The candidate is given a set

s

$s$ of siz 阅读全文

posted @ 2024-03-06 16:33 onlyblues 阅读(15) 评论(0) 推荐(0) 编辑

onlyblues

随笔分类 - Codeforces

公告

搜索

常用链接

随笔分类

随笔档案

阅读排行榜

推荐排行榜

最新评论