CF1366G-Construct the String 题目: 题目描述: Let’s denote the function $ f(s) $ that takes a string $ s $ consisting of lowercase Latin letters and dots, and returns a string consisting of lowercase Latin letters as follows: let $ r $ be an empty string; process the characters of $ s $ from left to right. For each character $ c $ , do
CF1312G-Autocompletion 题目: 题目描述: You are given a set of strings $ S $ . Each string consists of lowercase Latin letters. For each string in this set, you want to calculate the minimum number of seconds required to type this string. To type a string, you have to start with an empty string and transform it into the string you want to type using
CF1366F-Jog Around The Graph 题目: 题目描述: You are given a simple weighted connected undirected graph, consisting of $ n $ vertices and $ m $ edges. A path in the graph of length $ k $ is a sequence of $ k+1 $ vertices $ v_1, v_2, \dots, v_{k+1} $ such that for each $ i $ $ (1 \le i \le k) $
CF437D-The Child and Zoo 题目: 题目描述: Of course our child likes walking in a zoo. The zoo has $ n $ areas, that are numbered from $ 1 $ to $ n $ . The $ i $ -th area contains $ a_{i} $ animals in it. Also there are $ m $ roads in the zoo, and each road connects two distinct areas.
P1550-[USACO08OCT]Watering Hole G 题目: 题目描述: Farmer John 的农场缺水了。 他决定将水引入到他的 $n$（$1 \leq n \leq 300$）个牧场。他准备通过挖若干井，并在各块田中修筑水道来连
P4208-[JSOI2008]最小生成树计数 题目: 题目描述: 现在给出了一个简单无向加权图。你不满足于求出这个图的最小生成树，而希望知道这个
