2013年08月_nike0good

原创 BZOJ 2438([中山市选2011]游戏-有向图Tarjen缩点-到点为止)

2438: [中山市选2011]杀人游戏Time Limit:10 SecMemory Limit:128 MBSubmit:446Solved:152[Submit][Status]Description一位冷血的杀手潜入 Na-wiat，并假装成平民。警察希望能在 N 个人里面，查出谁是杀手。警察能够对每一个人进行查证，假如查证的对象是平民，他

2013-08-30 22:02:09 2170

原创 BZOJ 1029([JSOI2007]建筑抢修-贪心+heap+class中cmp的写法)

1029: [JSOI2007]建筑抢修Time Limit: 4 Sec Memory Limit: 162 MBSubmit: 1510 Solved: 611[Submit][Status]Description小刚在玩JSOI提供的一个称之为“建筑抢修”的电脑游戏：经过了一场激烈的战斗，T部落消灭了所有z部落的入侵者。但是T部落的基地里已经有N个建筑设施受到了严

2013-08-28 17:03:08 2170

原创 Wiki 2141(海明距离-异或值中1的个数)

题目描述 Description对于二进制串a，b，他们之间的海明距离是指两个串异或之后串中1的个数。异或的规则为：0 XOR 0 = 01 XOR 0 = 10 XOR 1 = 11 XOR 1 = 0 计算两个串之间的海明距离的时候，他们的长度必须相同。现在我们给出N个不同的二进制串，请计算出这些串两两之间的最短海明距离。

2013-08-26 20:19:20 3548

原创 BZOJ 3240([Noi2013]矩阵游戏-费马小定理【矩阵推论】-%*s-快速读入)

3240: [Noi2013]矩阵游戏Time Limit: 10 Sec Memory Limit: 256 MBSubmit: 123 Solved: 73[Submit][Status]Description婷婷是个喜欢矩阵的小朋友,有一天她想用电脑生成一个巨大的n行m列的矩阵(你不用担心她如何存储)。她生成的这个矩阵满足一个神奇的性质：若用F[i][j]来表示矩

2013-08-25 22:10:36 2744 4

原创 SPOJ LCS2(Longest Common Substring II-后缀自动机向父亲更新)

1812. Longest Common Substring IIProblem code: LCS2A string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowercase letters.

2013-08-23 20:16:57 1534

原创 SPOJ LCS(Longest Common Substring-后缀自动机-结点的Parent包含关系)

1811. Longest Common SubstringProblem code: LCSA string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowercase letters.Su

2013-08-23 17:26:34 1564

原创 SPOJ NSUBSTR(Substrings-后缀自动机统计串出现次数-Right集合&Parent树の暴走)

8222. SubstringsProblem code: NSUBSTRYou are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some stri

2013-08-21 23:22:15 4274

原创 CF 337E(Divisor Tree-枚举树节点的父亲)

E. Divisor Treetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA divisor tree is a rooted tree that meets t

2013-08-18 19:03:04 1927

原创 CF 337D(Book of Evil-distdown[]-distup[])

D. Book of Eviltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPaladin Manao caught the trail of the ancie

2013-08-17 23:19:49 2703

原创 CF 337A(Puzzles-暴力枚举)

A. Puzzlestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe end of the school year is near and Ms. Manana

2013-08-17 11:56:24 1807

原创 CF 337B(Routine Problem-公式题)

B. Routine Problemtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao has a monitor. The screen of the mo

2013-08-17 11:53:13 1670

原创 CF 337C(Quiz-pow2的嵌套)

C. Quiztime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao is taking part in a quiz. The quiz consists of

2013-08-17 10:38:47 1714

原创 CF 336C(Vasily the Bear and Sequence-贪心-不满足单调性)

C. Vasily the Bear and Sequencetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasily the bear has got a s

2013-08-10 14:53:29 1900

原创 CF 336A(Vasily the Bear and Triangle-推公式)

A. Vasily the Bear and Triangletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasily the bear has a favori

2013-08-10 09:50:31 1953

原创 BZOJ 2614(梦的困境-桶排数组Dp)

2614: 梦的困境Time Limit: 3 Sec Memory Limit: 128 MBSubmit: 30 Solved: 16[Submit][Status]Description “每一个OIer上辈子都是折翼的天使……”。 OIer喜欢做梦，尤其是关于OI题目的梦。 TT同学便是折翼天使的典范。在NOI2010 day1的前夜，

2013-08-09 19:29:12 1499

原创 BZOJ 3237([Ahoi2013]连通图-cdq图重构-连通性缩点)

3237: [Ahoi2013]连通图Time Limit: 20 Sec Memory Limit: 512 MBSubmit: 106 Solved: 31[Submit][Status]DescriptionInputOutputSample Input4 51 22 33 44 12 43

2013-08-08 17:51:46 2074

原创 BZOJ 2001([Hnoi2010]City 城市建设-CDQ重构图-动态最小生成树)

2001: [Hnoi2010]City 城市建设Time Limit: 20 Sec Memory Limit: 162 MBSubmit: 217 Solved: 100[Submit][Status]DescriptionPS国是一个拥有诸多城市的大国，国王Louis为城市的交通建设可谓绞尽脑汁。Louis可以在某些城市之间修建道路，在不同的城市之间修建道路需要不

2013-08-07 22:24:26 3501

原创 CF 335A(Banana-贪心-priority_queue是大根堆)

A. Bananatime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPiegirl is buying stickers for a project. Sticker

2013-08-04 16:13:46 1460

nike0good |Oier&ACMer | 熟能生巧