思维
文章平均质量分 90
云淡风轻jzl
一路脚踏实地,不忘仰望星空。
展开
-
东北四省赛E-Minimum Spanning Tree-贡献求和
题目描述:In the mathematical discipline of graph theory, the line graph of a simple undirected weighted graph G is another simple undirected weighted graph L(G) that represents the adjacency between every two edges in G.Precisely speaking, for an undirected原创 2021-01-29 16:51:14 · 317 阅读 · 0 评论 -
牛客3006D-牛牛与牛妹的约会-思维
链接:https://ac.nowcoder.com/acm/contest/3006/D来源:牛客网题目描述:牛牛在辛苦的一天的比赛之后,要去找牛妹玩,其实牛妹那天也在比赛。他为了找到牛妹,要尽快的从自己的比赛地到她的比赛地。还记得吗,比赛地都是只在xxx轴上的,所以两个人的坐标都满足y=0。牛牛除了可以以111单位距离/单位时间的速度移动任意时间以外,还可以花费1单位时间进行闪现。每次...原创 2020-02-13 19:39:29 · 1581 阅读 · 2 评论 -
CF1288B-Yet Another Meme Problem
DescriptionTry guessing the statement from this picture http://tiny.cc/ogyoiz.You are given two integers A and B, calculate the number of pairs (a,b) such that 1≤a≤A, 1≤b≤B, and the equation a⋅b+a+b...原创 2020-01-15 09:41:49 · 673 阅读 · 0 评论 -
牛客3402F-参赛-思维
链接:https://ac.nowcoder.com/acm/contest/3402/F来源:牛客网题目描述:jx队长半夜@小胖:你快出一道签到题呀,简单点的,不行打你啊。小胖吓得赶紧下床想题,边想边和jx队长吹水,想起了参加acm的种种经历。有感而发和jx队长说了想法之后,jx队长:你这什么题意,不行啊太难了,我来改。一顿争辩之后小胖折服了,内心:jx队长牛逼。jx队长:睡吧睡吧,找时间...原创 2019-12-29 17:52:12 · 202 阅读 · 0 评论 -
牛客3402D-米多立亚-思维
题目描述:链接:https://ac.nowcoder.com/acm/contest/3402/D来源:牛客网米多立亚少年此时正在学习one for all全覆盖5%,但是他不想努力了,于是哆啦A梦拿出神奇道具帮助米多立亚少年,让他可以1分钟学会全覆盖。当米多立亚少年使用这个道具的时候,道具的屏幕上会出现一个字符串(只由’0’ , ‘1’ , ‘2’ 三种字符构成) 。这些字符串有如下的...原创 2019-12-29 17:36:23 · 162 阅读 · 0 评论 -
QDU 6-GZS and String-字符串匹配的思维题
DescriptionGZS has two strings s and t.In each step, GZS can select arbitrary character c of s and insert any character d (d ≠ c) just after it.GZS wants to convert s to t. But is it possible?Inpu...原创 2019-10-07 17:30:03 · 231 阅读 · 0 评论 -
HDU 6630-permutation 2-思维+dp
DescriptionYou are given three positive integers N,x,y.Please calculate how many permutations of 1∼N satisfies the following conditions (We denote the i-th number of a permutation by pi):p1=xp...原创 2019-08-07 09:49:06 · 302 阅读 · 0 评论 -
CF 1189D1和1189D2-树的边权-思维+搜索
第一问:D1. Add on a Tree(传送门)Note that this is the first problem of the two similar problems. You can hack this problem only if you solve both problems.You are given a tree with n nodes. In the beginni...原创 2019-08-02 11:59:28 · 374 阅读 · 0 评论