Template
文章平均质量分 91
nike0good
这个作者很懒,什么都没留下…
展开
-
POJ 3281(Dining-网络流拆点)[Template:网络流dinic]
Language:DefaultDiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9631 Accepted: 4446DescriptionCows are such finicky eaters. Each cow has a p原创 2014-10-23 13:09:04 · 1211 阅读 · 0 评论 -
BZOJ 2648/2716(SJY摆棋子-KD_Tree)[Template:KD_Tree]
2648: SJY摆棋子Time Limit: 20 Sec Memory Limit: 128 MBSubmit: 1180 Solved: 391[Submit][Status][Discuss]Description这天,SJY显得无聊。在家自己玩。在一个棋盘上,有N个黑色棋子。他每次要么放到棋盘上一个黑色棋子,要么放上一个白色棋子,如果是白色棋子,他会找出距离这原创 2015-06-07 23:04:42 · 1259 阅读 · 0 评论 -
BC 2015百度之星程序设计大赛 - 热身赛(仅供熟悉比赛环境)(Harry and Magical Computer-topsort)[Template:topsort]
Harry and Magical ComputerAccepts: 402Submissions: 1588Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)问题描述作为年度优秀魔法学员的奖赏,哈利得到了一台具有魔力的计算机。这台计算原创 2015-05-19 23:39:07 · 1439 阅读 · 2 评论 -
POJ 2417/BZOJ 3239(Discrete Logging-BSGS)[Template:数论]
Discrete LoggingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4236 Accepted: 1948DescriptionGiven a prime P, 2 31, an integer B, 2 BL == N (mod原创 2015-07-28 00:21:40 · 1206 阅读 · 0 评论 -
BZOJ 3884(上帝与集合的正确用法-欧拉函数递推找极限)[Template:数论 V2]
3884: 上帝与集合的正确用法Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 523 Solved: 237[Submit][Status][Discuss]Description根据一些书上的记载,上帝的一次失败的创世经历是这样的:第一天,上帝创造了一个世界的基本元素,称做“元”。第二天,上帝创造了一个原创 2015-08-09 00:06:57 · 1726 阅读 · 0 评论 -
HDU 3487(Play with Chain-Splay)[template:Splay]
Play with ChainTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4679 Accepted Submission(s): 1892Problem DescriptionYaoYao is fond原创 2015-08-07 00:01:54 · 1034 阅读 · 0 评论 -
POJ 3580(SuperMemo-Splay区间加)[template:Splay V2]
SuperMemoTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 11384 Accepted: 3572Case Time Limit: 2000MSDescriptionYour friend, Jackson is invited to原创 2015-08-08 00:42:52 · 1527 阅读 · 0 评论 -
HDU 5343(MZL's Circle Zhou-SAM)[Template:SAM]
MZL's Circle ZhouTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 236 Accepted Submission(s): 80Problem DescriptionMZL's Circle原创 2015-08-23 19:27:04 · 1305 阅读 · 0 评论 -
BZOJ 4003([JLOI2015]城池攻占-带标记可合并堆)[Template:带标记可合并堆]
4003: [JLOI2015]城池攻占Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 490 Solved: 181[Submit][Status][Discuss]Description小铭铭最近获得了一副新的桌游,游戏中需要用 m 个骑士攻占 n 个城池。这 n 个城池用 1 到 n 的整数表示。除 1 号城池外,原创 2015-08-29 14:48:58 · 1327 阅读 · 0 评论 -
HDU 5294(Tricks Device-最短路最小割)[Template:SPFA]
Tricks DeviceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2389 Accepted Submission(s): 635Problem DescriptionInnocent Wu follo原创 2015-08-15 14:38:50 · 840 阅读 · 0 评论 -
BZOJ 2049([Sdoi2008]Cave 洞穴勘测-LCT)[Template:LCT]
2049: [Sdoi2008]Cave 洞穴勘测Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 4809 Solved: 2141[Submit][Status][Discuss]Description辉辉热衷于洞穴勘测。某天,他按照地图来到了一片被标记为JSZX的洞穴群地区。经过初步勘测,辉辉发现这片区域由n个洞穴(分别原创 2015-08-29 20:33:15 · 648 阅读 · 0 评论 -
HDU 5318(The Goddess Of The Moon-矩阵乘法)[Template:矩阵]
The Goddess Of The MoonTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1086 Accepted Submission(s): 489Problem DescriptionChang’e原创 2015-08-19 15:41:57 · 975 阅读 · 0 评论 -
HDU 5304(Eastest Magical Day Seep Group's Summer-环加外向树生成树计数)[Template:Kirchhoff矩阵]
Eastest Magical Day Seep Group's SummerTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 308 Accepted Submission(s): 83Problem Descr原创 2015-08-19 19:59:59 · 1905 阅读 · 0 评论 -
UVA 11992(Fast Matrix Operations-线段树区间加&改)[Template:SegmentTree]
There is a matrix containing at most 106elements divided into r rows and c columns. Each elementhas a location (x; y) where 1 x r, 1 y c. Initially, all the elements are zero. You need to原创 2015-05-13 22:06:46 · 935 阅读 · 0 评论 -
HDU 3068(最长回文-manacher)[Template:manacher]
最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9660 Accepted Submission(s): 3353Problem Description给出一个只由小写英文字符a,b,c...y,z组成原创 2015-04-06 19:27:42 · 957 阅读 · 0 评论 -
POJ 3469(Dual Core CPU-最小割)[Template:网络流dinic V2]
Language:DefaultDual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 19321 Accepted: 8372Case Time Limit: 5000MSDescriptionAs more原创 2014-10-29 23:27:47 · 1252 阅读 · 0 评论 -
HDU 5045(Contest-费用流)[template:费用流]
ContestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 766 Accepted Submission(s): 341Problem DescriptionIn the ACM International Colle原创 2014-10-15 09:49:29 · 1003 阅读 · 0 评论 -
POJ 3683(Priest John's Busiest Day-强连通分量解决2-SAT)[Template:2-SAT]
Priest John's Busiest DayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8144 Accepted: 2769 Special JudgeDescriptionJohn is the only priest in his原创 2014-10-16 21:39:18 · 1408 阅读 · 0 评论 -
POJ 2135(Farm Tour-费用流)[Template:费用流 V2]
Language:DefaultFarm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11916 Accepted: 4454DescriptionWhen FJ's friends visit him on the farm, h原创 2014-11-05 18:23:02 · 1129 阅读 · 0 评论 -
POJ 1182(食物链-另类做法【拆点】)[Template:并查集]
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46039 Accepted: 13400Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动原创 2014-10-19 22:45:32 · 1420 阅读 · 0 评论 -
POJ 2186(有向图的强连通分量)[改][Template:SSC/缩点]
题目大意:给有向图G,求图G中有多少点能从所有起点到达暴搜必T,故本题需要用Tarjen求有向图的强连通分量。缩点后得DAG(若有环则属同一强连通分量)由于无环,故这图为树或树的森林先判断图是否连通,若为森林则无解否则,判定每个SSC是否有连出的边(由于图无环,故连出的边上的点无法回去)答案即为出度为0的连通分量上的点如果不止一个这样的点,则不同的点无法互相到达原创 2012-08-27 16:08:36 · 2274 阅读 · 0 评论 -
LA 4513(Stammering Aliens-Hash求LCP)[Template:hash求LCP]
4513 - Stammering AliensDr. Ellie Arroway has established contact with an extraterrestrial civilization. However, all efforts to decode their messages have failed so far because, as luck would have原创 2015-03-25 16:33:49 · 1343 阅读 · 0 评论 -
LA 3942(Remember the Word-Trie)[Template:Trie]
3942 - Remember the WordTime limit: 3.000 seconds Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory an原创 2015-03-03 18:06:16 · 1167 阅读 · 0 评论 -
UVA 11732("strcmp()" Anyone?-Trie与左兄弟右儿子)
“strcmp()” Anyone?strcmp() is a library function in C/C++ which compares two strings. It takes two strings as input parameter and decides which one is lexicographically larger or smaller: If t原创 2015-03-04 18:40:04 · 1088 阅读 · 0 评论 -
LA 3026(Period-MP算法)[Template:KMP]
3026 - PeriodTime limit: 3.000 seconds For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefi原创 2015-03-05 21:45:34 · 1030 阅读 · 0 评论 -
UVA 11468(Substring-AC自动机上dp)[Template:AC自动机]
SubstringGiven a set of pattern strings, and a text, you have to find, if any of the pattern is a substring of the text. If any of the pattern string can be found in text, then print “yes”, othe原创 2015-03-08 15:23:28 · 937 阅读 · 0 评论 -
UVA 11019(Matrix Matcher-vector从迭代器中取值,AC自动机匹配字符矩阵)
Problem HMatrix MatcherInput: Standard InputOutput: Standard Output Given an N * M matrix, your task is to find the number of occurences of an X * Y pattern. InputThe first line contai原创 2015-03-09 22:00:07 · 1108 阅读 · 0 评论 -
HDU 4966(GGS-DDU-最小树形图)[Template:最小树形图]
GGS-DDUTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 588 Accepted Submission(s): 285Problem DescriptionDo you think this is a原创 2015-09-06 16:44:18 · 1004 阅读 · 0 评论