04 2017 档案

2016-2017 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2016) D.Dinner Bet 概率DP+排列组合
摘要：题目链接：点这里 题意： 1~N标号的球 现在A有C个，B有C个 每次可以随机得到D个不同的球(1~N);问你A或B中的C个球都出现一次的 期望次数 题解： dp[i][j][k]表示 随机出现了i个仅仅属于A的球的个数，仅仅属于B的球的个数，同时属于A,B的球的个数 阅读全文
posted @ 2017-04-23 20:09 meekyan 阅读(619) 评论(0) 推荐(0)
2016-2017 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2016) E.Passwords AC自动机+dp
摘要：题目链接：点这里 题意： 让你构造一个长度范围在[A,B]之间 字符串(大小写字母，数字)，问你有多少种方案 需要满足条件一下： 1:构成串中至少包含一个数字，一个大写字母，一个小写字母； 2:不能包含给定的N个病毒串 3:遵循一堆映射规则 题解： 将病毒串建立AC自动机 设定dp[i][j] [0 阅读全文
posted @ 2017-04-23 18:59 meekyan 阅读(377) 评论(0) 推荐(0)
ZOJ 3962 E.Seven Segment Display / The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple E.数位dp
摘要：A seven segment display, or seven segment indicator, is a form of electronic display device for displaying decimal numerals that is an alternative to 阅读全文
posted @ 2017-04-22 20:29 meekyan 阅读(723) 评论(0) 推荐(0)
11
摘要：s'da 阅读全文
posted @ 2017-04-18 20:57 meekyan 阅读(128) 评论(0) 推荐(0)
HDU 5044 Tree 树链剖分+区间标记
摘要：Tree Problem Description You are given a tree (an acyclic undirected connected graph) with N nodes. The tree nodes are numbered from 1 to NThere are N 阅读全文
posted @ 2017-04-13 20:47 meekyan 阅读(431) 评论(0) 推荐(0)
HDU 4897 Little Devil I 树链剖分+线段树
摘要：Little Devil I Problem Description There is an old country and the king fell in love with a devil. The devil always asks the king to do some crazy thi 阅读全文
posted @ 2017-04-13 17:05 meekyan 阅读(314) 评论(0) 推荐(0)
HDU 5405 Sometimes Naive 树链剖分+bit*****
摘要：Sometimes Naive Problem Description Rhason Cheung had a naive problem, and asked Teacher Mai for help. But Teacher Mai thought this problem was too si 阅读全文
posted @ 2017-04-10 20:17 meekyan 阅读(396) 评论(0) 推荐(0)
HDU 5274 Dylans loves tree 树链剖分+线段树
摘要：Dylans loves tree Problem Description Dylans is given a tree with N nodes.All nodes have a value A[i].Nodes on tree is numbered by 1∼N.Then he is give 阅读全文
posted @ 2017-04-10 15:01 meekyan 阅读(221) 评论(0) 推荐(0)
BZOJ 2243: [SDOI2011]染色 树链剖分+线段树区间合并
摘要：2243: [SDOI2011]染色 Description 给定一棵有n个节点的无根树和m个操作，操作有2类： 1、将节点a到节点b路径上所有点都染成颜色c； 2、询问节点a到节点b路径上的颜色段数量（连续相同颜色被认为是同一段），如“112221”由3段组成：“11”、“222”和“1”。 请你 阅读全文
posted @ 2017-04-10 14:02 meekyan 阅读(238) 评论(0) 推荐(0)
HDU 5544 Ba Gua Zhen dfs+高斯消元
摘要：Ba Gua Zhen Problem Description During the Three-Kingdom period, there was a general named Xun Lu who belonged to Kingdom Wu. Once his troop were chas 阅读全文
posted @ 2017-04-06 19:19 meekyan 阅读(596) 评论(0) 推荐(0)
HDU 3949 XOR 线性基
摘要：XOR Problem Description XOR is a kind of bit operator, we define that as follow: for two binary base number A and B, let C=A XOR B, then for each bit 阅读全文
posted @ 2017-04-06 17:16 meekyan 阅读(216) 评论(0) 推荐(0)
BZOJ 2460: [BeiJing2011]元素 线性基
摘要：2460: [BeiJing2011]元素 Description 相传，在远古时期，位于西方大陆的 Magic Land 上，人们已经掌握了用魔法矿石炼制法杖的技术。那时人们就认识到，一个法杖的法力取决于使用的矿石。一般地，矿石越多则法力越强，但物极必反：有时，人们为了获取更强的法力而使用了很多矿 阅读全文
posted @ 2017-04-06 16:33 meekyan 阅读(179) 评论(0) 推荐(0)