Codeforces
LPA20020220
Keep on fighting till the end!
展开
-
[Educational Codeforces Round 2 -E] Lomsat gelral
Codeforces传送门题目大意一棵以111为根的树有nnn个结点,每个结点都是一种颜色,每个颜色有一个编号ci(c∈[0,105])ci(c∈[0,105])c_i(c\in [0,10^5]),求树中以每个点作为根的子树中的最多的颜色编号的和。 (可能不止一种颜色,这时需要把这些颜色的编号加起来)输入输出格式输入格式第一行一个正整数nnn。第二行nnn个正...原创 2018-07-26 17:11:37 · 171 阅读 · 0 评论 -
Educational Codeforces Round 47 (Rated for Div. 2) -G Allowed Letters
洛谷传送门Codeforces传送门题意翻译给定一个长为nnn的串SSS,字符集a~f。你可以重排这个串,满足指定mmm个位置上只能放特定的字符,mmm个位置以及相应的字符集会给出,求字典序最小的串输入输出格式输入格式第一行一个串SSS。第二行一个整数mmm。以下mmm行, 每行一个数字posipos_iposi和一个字符串sss, 表示posipos_iposi处只能填sss...原创 2019-01-19 11:06:32 · 1044 阅读 · 0 评论 -
Educational Codeforces Round 47 (Rated for Div. 2) -F Dominant Indices
洛谷传送门Codeforces传送门题意翻译给出一棵有根树,对于每个节点xxx,定义一个无穷序列ddd,其中d(x,i)d(x,i)d(x,i)表示以xxx为根节点的子树中到xxx的距离恰好为iii的点的个数,i=0∼∞i=0\sim \infini=0∼∞,现在对每个点xxx,希望求出一个值jjj,使得对于任意k<jk<jk<j,d(x,k)&lt...原创 2019-01-15 12:58:11 · 183 阅读 · 0 评论 -
[Codeforces 1045] Bubble Cup 11 - Finals [Online Mirror, Div. 1] -H Self-exploration
洛谷传送门Codeforces传送门题目大意求在[l,r][l,r][l,r]区间内有多少数满足在二进制下:子串000000的个数为C00C00C00。子串010101的个数为C01C01C01。子串101010的个数为C10C10C10。子串111111的个数为C11C11C11。 答案对109+710^9+7109+7取模。l,r≤2100 000\large l...原创 2019-01-15 12:39:59 · 300 阅读 · 0 评论 -
Codeforces Round #359 (Div. 1) -B Kay and Snowflake
洛谷传送门BZOJ传送门题目大意给你一棵有nnn个节点、111号节点为根的无根树, qqq组询问, 每次询问一个点xxx的子树内的重心是哪一个点。输入输出格式输入格式第一行两个正整数n,qn,qn,q。第二行n−1n-1n−1个正整数fif_ifi, 表示i+1i+1i+1号点与iii号点有边。以下qqq行, 每行一个正整数xxx, 表示一组询问。输出格式共qqq行, 每行一...原创 2019-01-15 16:06:56 · 164 阅读 · 0 评论 -
[Codeforces Round #288 (Div. 2)] -E Arthur and Brackets
洛谷传送门Codeforces传送门题意翻译一个长为2n2n2n的括号序列,左括号和右括号都是nnn个。对于从左到右的第iii个左括号,对与其配对的右括号有如下限制:与其配对的右括号和这个左括号之间的距离需要在 [Li,Ri][ L_i , R_i ][Li,Ri] 之间。输入的第一行给出n(1≤n≤600)n(1\le n\le 600)n(1≤n≤600)。之后的nnn行,给...原创 2019-02-17 21:59:59 · 142 阅读 · 0 评论 -
[Codeforces Round #394 (Div. 2)] - F Dasha and Photos
洛谷传送门Codeforces传送门题目大意给你一个n×mn\times mn×m的方格, 每个格子里有一个小写英文字母。现在你有kkk个n×mn\times mn×m的方格, 这些方格都是在给出方格的基础上将一个矩形区域的方格中的字母全部变成一种得到的。定义两个方格的距离为所有格子中字母在字母表中位置的差。 你要找到kkk个方格中的一个方格, 满足它到其他k−1k-1k−1个矩阵的距离...原创 2019-02-26 08:23:31 · 155 阅读 · 0 评论 -
[Codeforces Round #395 (Div. 1)] - D Timofey and a flat tree
洛谷传送门Codeforces传送门题目大意给你一棵nnn个节点的无根树, 现在要你定一个根节点, 满足其不同构的子树的数量最大。输入输出格式输入格式第一行一个正整数nnn。以下n−1n-1n−1行, 每行两个正整数ai,bia_i,b_iai,bi, 描述一组树上的边。输出格式一行一个正整数, 表示选定的根节点。 如果有多解输出一个即可。输入输出样例输入样例#1:3...原创 2019-02-26 10:49:04 · 142 阅读 · 0 评论 -
[Codeforces Round #335 (Div. 1)] - C Freelancer's Dreams
洛谷传送门Codeforces传送门题目大意给你nnn种工作, 第iii种每天能给你aia_iai点aaa值, bib_ibi点bbb值, 每种工作可以做任意时间, 求要达到ppp点aaa值和qqq点bbb值至少需要多少天。解题分析很明显, 把(ai,bi)(a_i,b_i)(ai,bi)放在图上, 我们每天可以得到的能力值一定在这些点形成的凸包里面, 于是二分答案就好了。代码...原创 2019-03-14 18:43:42 · 231 阅读 · 0 评论 -
[Educational Codeforces Round 4] - E Square Root of Permutation
洛谷传送门Codeforces传送门题目大意给定一个nnn的排列pip_ipi, 求一个排列qiq_iqi, 满足对于∀i∈[1,n]\forall i\in[1,n]∀i∈[1,n], qqi=piq_{q_i}=p_iqqi=pi。解题分析神奇的规律题…先尝试着正着推, 从iii向pip_ipi连一条边, 会构成很多的环。然后我们发现, 如果设ki=ppik_i...原创 2019-03-14 20:05:44 · 264 阅读 · 0 评论 -
[Codeforces Round #339 (Div. 1)] - C Necklace
洛谷传送门Codeforces传送门题目大意你有一个n(n≤26)n(n\le 26)n(n≤26)种颜色的珠子, 现在你想要将它们串成手链, 手链的美观度定义为从某个位置切开后, 形成的颜色序列为回文串的方案数。 你要求出最大的可能的美观度。解题分析显然我们要构造尽量多的小回文串来构成大的回文串。如果有两个颜色的珠子数量都为奇数, 显然无解。如果有一种颜色的珠子数量为奇数, 那么方...原创 2019-03-14 20:21:30 · 201 阅读 · 0 评论 -
[Wunder Fund Round 2016 (Div. 1 + Div. 2 combined)] - E Robot Arm
洛谷传送门Codeforces传送门题目大意给你一个有nnn段的机械臂, 给出mmm个操作, 每次将一截机械臂伸长lil_ili或顺时针旋转lll°。 在每次操作后你需要回答一开始最靠右点当前的位置。解题分析很好的一道线段树题, 假设[l−1,l][l-1,l][l−1,l]是水平的, 维护[l,r][l, r][l,r]相对于lll的位置和最右端机械臂的角度, 然后就可以用线段树合并...原创 2019-03-14 21:46:30 · 256 阅读 · 0 评论 -
[Educational Codeforces Round 32] - G Xor-MST
洛谷传送门Codeforces传送门题意翻译已知一个nnn个节点的无向完全图,第iii个节点的权值为aia_iai,iii与jjj的边的权值是KaTeX parse error: Expected '}', got '^' at position 10: a_i\text{^̲}a_j,求该图的MST的权值解题分析贪心地想, 从高位往低位考虑, 我们一定是先考虑在这一位都为111或都为...原创 2019-03-20 16:48:15 · 164 阅读 · 0 评论 -
Codeforces Round #397 (Div. 1 + Div. 2 combined) F.Souvenir
Codeforces传送门洛谷传送门题目描述Artsem is on vacation and wants to buy souvenirs for his two teammates. There are nnn souvenir shops along the street. In i−thi -thi−th shop Artsem can buy one souvenir for ai...原创 2018-10-22 14:31:42 · 192 阅读 · 0 评论 -
2018-2019 NEERC Finals M. Minegraphed
Codeforces传送门Marika is developing a game called “Minegraphed” that involves moving around a 3D3D3D rectangular world.Each cell of a parallelepiped game field is either an empty cell or an obstacle c...原创 2018-12-04 09:12:41 · 287 阅读 · 0 评论 -
2018-2019 NEERC Finals F. Fractions
Codeforces传送门You are given a positive integer nnn.Find a sequence of fractions aibi,i=1…k\frac{a_i}{b_i}, i=1…kbiai,i=1…k(where aia_iai and bib_ibi are positive integers) for some kkk such that...原创 2018-12-04 08:16:51 · 554 阅读 · 0 评论 -
Codeforces Round #523 (Div. 2) E.Politics
Codeforces传送门洛谷传送门题目描述There are nnn cities in the country.Two candidates are fighting for the post of the President. The elections are set in the future, and both candidates have already planned h...原创 2018-12-04 07:59:54 · 158 阅读 · 0 评论 -
[Codeforces Round #250 (Div. 1) -D] The Child and Sequence
Codeforces传送门洛谷传送门题意翻译给定数列,区间查询和,区间取模,单点修改。n,m≤105n,m≤105n,m\le 10^5题目描述At the children’s day, the child came to Picks’s house, and messed his house up. Picks was angry at him. A lot...原创 2018-07-23 22:10:27 · 193 阅读 · 0 评论 -
[Codeforces Round #260 (Div. 1)] -C Civilization
洛谷传送门Codeforces传送门题目大意给你一个有NNN个点的图。 一开始你已经有MMM条边连接其中的一些点, 保证连接的点之间不会有环。 现在要求你支持两种操作:1 A1 A1\ A询问A所在联通块的直径是多少。2 A B2 A B2\ A\ B将A、BA、BA、B所在联通块之间任意连一条边使之成为一个联...原创 2018-07-20 16:13:26 · 134 阅读 · 0 评论 -
[Codeforces Round #268 (Div. 1) -A] 24 Game
Codeforces传送门洛谷传送门题目描述小X一直很喜欢一个纸牌游戏:“242424点”,但最近他发现这个游戏太简单了,所以他发明了一个新游戏。你有一个整数序列,包括nnn个整数:111,222,333,…,nnn。步骤很简单,你可以从其中拿出两个数,我们假设它们是aaa和bbb,将这两个数从序列中删除,并将a+ba+ba+b、a−ba−ba-b或a×ba×ba×b放入这...原创 2018-07-30 20:42:33 · 134 阅读 · 0 评论 -
Codeforces Round #268 (Div. 1) -C Hack it
Codeforces传送门洛谷传送门题目描述Little X has met the following problem recently.Let’s define f(x)f(x)f(x) as the sum of digits in decimal representation of number xxx (for example, f(1234)=1+2+3+4f(...原创 2018-07-31 16:46:32 · 221 阅读 · 0 评论 -
[Codeforces Round #509 (Div. 2)] 解题分析
Codeforces传送门A. Heist题目描述There was an electronic store heist last night.All keyboards which were in the store yesterday were numbered in ascending order from some integer number xxx. For e...原创 2018-09-17 10:27:40 · 598 阅读 · 0 评论 -
[Codeforces Round #491 (Div. 2) E] Bus Number
洛谷传送门Codeforces传送门题目描述This night wasn’t easy on Vasya. His favorite team lost, and he didn’t find himself victorious either — although he played perfectly, his teammates let him down every t...原创 2018-09-11 23:07:20 · 230 阅读 · 0 评论 -
[Codeforces 1038D] Slime
洛谷传送门Codeforces传送门题目描述There are nnn slimes in a row. Each slime has an integer value (possibly negative or zero) associated with it.Any slime can eat its adjacent slime (the closest slime ...原创 2018-09-10 14:42:06 · 409 阅读 · 0 评论 -
[Codeforces Round #483 (Div. 1) -B] XOR-pyramid
洛谷传送门Codeforces传送门题目描述For an array bbb of length mmm we define the function fff as f(b)={b[1]f(b[1]⊕b[2],b[2]⊕b[3],…,b[m−1]⊕b[m])if m=1otherwise,f(b)={b[1]if m=1f(b[1]⊕b[2],b[2]⊕b[...原创 2018-09-14 12:11:19 · 210 阅读 · 0 评论 -
Educational Codeforces Round 51 (Rated for Div. 2) -D Bicolorings
Codeforces传送门洛谷传送门题目描述You are given a grid, consisting of 222 rows and nnn columns. Each cell of this grid should be colored either black or white.Two cells are considered neighbours if they have ...原创 2018-09-25 10:49:56 · 183 阅读 · 0 评论 -
[Codeforces Round #122 (Div. 1)] -D Two segments
洛谷传送门Codeforces传送门题目描述Nick has some permutation consisting of ppp integers from 111 to nnn . A segment [l,r][l,r][l,r] ( l≤rl\le rl≤r ) is a set of elements pip_{i}pi satisfying l≤i≤rl\le i\le rl...原创 2018-10-03 09:17:08 · 173 阅读 · 0 评论 -
[Codeforces Round #514 (Div. 2)] 解题分析
Codeforces传送门A.Cashier题目描述Vasya has recently got a job as a cashier at a local store. His day at work is LLL minutes long. Vasya has already memorized nnn regular customers, the i−thi-thi−th of whi...原创 2018-10-07 23:07:44 · 329 阅读 · 0 评论 -
Codeforces Round #434 (Div. 1) -E Arkady and a Nobody-men
Codeforces传送门洛谷传送门题目描述Arkady words in a large company. There are nn employees working in a system of a strict hierarchy. Namely, each employee, with an exception of the CEO, has exactly one immedia...原创 2018-11-17 20:58:38 · 237 阅读 · 0 评论 -
[Codeforces Beta Round #39] E. Number Table
洛谷传送门Codeforces传送门题意翻译有一个 nnn 行 mmm 列的棋盘,现在棋盘上的每个位置需要填上 111 或 −1-1−1 。 其中有 kkk 个位置已经填上了数,而其它的位置则是空的。 定义一个棋盘是好的当且仅当其每一行、每一列都满足所有数的乘积是 −1−1−1 。 你需要计算有多少种填数的方案是好的,答案对 ppp 取模。 0 ≤ k &...原创 2018-12-13 08:07:56 · 172 阅读 · 0 评论 -
[Codeforces Beta Round #9] D How many trees
洛谷传送门Codeforces传送门题意翻译用nnn个点组成二叉树,问高度大于等于hhh的有多少个。1≤h≤351\le h\le 351≤h≤35。解题分析设dp[i][h]dp[i][h]dp[i][h]表示iii个节点, 树高为hhh的方案数, 那么显然可以通过在根节点拼两棵子树得到新的树。分开枚举高为h−1h-1h−1的子树在哪边, 那么有:dp[i][h]=∑j=h−1i...原创 2018-12-13 08:32:16 · 177 阅读 · 0 评论 -
[VK Cup 2016 - Round 3] - D Bearish Fanpages
洛谷传送门Codeforces传送门题目描述There is a social website with nnn fanpages, numbered 111 through nnn . There are also nnn companies, and the iii-th company owns the iii -th fanpage.Recently, the website cr...原创 2019-03-18 18:26:53 · 318 阅读 · 0 评论