2014年04月_码代码的猿猿的AC之路

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 HDOJ 3062 Party

2set的tarjan写法.....PartyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3841 Accepted Submission(s): 1244Problem Description

2014-04-30 17:44:41 1188

原创 HDOJ 1814 Peaceful Commission

经典2sat裸题,dfs的2sat可以方便输出字典序最小的解...Peaceful CommissionTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1578 Accepted Submission(s): 4

2014-04-30 14:32:58 1856 3

原创 HDOJ 4614 Vases and Flowers

线段树+二分区间用线段树维护某一段内还有多少个花瓶可以用,二分确定插入的左右界.....Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1782 Accepted Submis

2014-04-29 19:15:36 1146

原创 CSU 1414: Query on a Tree

预处理每个结点的子结点的个数sons , 则对x的询问可由sons[x]- sigma( sons[v] ) (v是到x距离为d的点)得到怎么快速的找到这些v呢? 注意到距离x为d的点肯定在树的同一层....可以对树进行dfs时记录每个结点时间戳的同时把每一层的结点保存下来,然后对每一层维护一个前缀和如果v是x下面子结点那么v的时间戳肯定在x的范围内,这样就可以二分確定出前缀和的范围了.

2014-04-28 01:25:55 1490

原创 CSU 1411: Longest Consecutive Ones

关键是通过预处理吧每个区间内的一移动到一起的最少步骤算出来....1411: Longest Consecutive OnesTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 185 Solved: 40[Submit][Status][Web Board]DescriptionGiven a

2014-04-27 20:49:11 1470

原创 HDOJ 4619 Warm up 2

留下的数目 = 连通的木块的数目 - 连通的木块的数目/2.....并查集维护即可......Warm up 2Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1635 Accepted Submiss

2014-04-26 23:01:49 979

原创 HDOJ 4612 Warm up

缩点+树的直径+扩栈Warm upTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3140 Accepted Submission(s): 715Problem Description　　

2014-04-26 21:13:27 1153

原创 BZOJ 1507 Editor

真是一个牛b的头文件......EditorTime Limit: 5000MS Memory Limit: 165888KB 64bit IO Format: %lld & %lluDescriptionInput输入文件editor.in的第一行是指令条数t，以下是需要执行的t个

2014-04-26 18:54:27 1229

原创 UVA 12538 Version Controlled IDE

ext/rope 真是持久化字符串处理神器......UVA - 12538VersionControlled IDETime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu12538 Ve

2014-04-26 16:10:30 1261

原创 Codeforces 424 C. Magic Formulas

xor是满足交换律的,展开后发现只要能快速求出 [1mod1....1modn],....,[nmod1...nmodn]的矩阵的xor就行了....然后找个规律C. Magic Formulastime limit per test2 secondsmemory limit per test256 megabytesin

2014-04-26 13:39:40 1464

原创 POJ 3580 SuperMemo

裸Splay区间操作: 内存池+区间加减+区间翻转+插入+删除+维护最值SuperMemoTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8552 Accepted: 2801Case Time Limit: 2000MS

2014-04-25 21:42:49 1451

原创 HDOJ 1890 Robotic Sort

Splay.... 每次把第i大的数旋转到根结点。删除这个点然后旋转左区间Robotic SortTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2050 Accepted Submission(s):

2014-04-24 23:06:47 1567

原创 Codeforces 420 C. Bug in Code

C. Bug in Codetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently a serious bug has been found in the

2014-04-23 16:02:07 1585

原创 Codeforces 420 B. Online Meeting

B. Online Meetingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNearly each project of the F company has a

2014-04-23 10:12:11 1550

原创 POJ 2942 Knights of the Round Table

缩块找奇环.....Knights of the Round TableTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 9128 Accepted: 2943DescriptionBeing a knight is a very

2014-04-22 14:13:49 1260

原创 HDOJ 2243 考研路茫茫——单词情结

AC自动机+矩阵快速幂+递归求和.....从反面考虑,不含有任何词根的单词数可以用AC自动机构建矩阵求出.....所有单词数-不含有任何词根的单词数就是答案.考研路茫茫——单词情结Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submissio

2014-04-21 19:57:46 1279

原创 Codeforces 417 D. Cunning Gena

按monitor排序，然后状压DP。。。。D. Cunning Genatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA boy n

2014-04-18 10:45:41 2489 2

原创 RCC 2014 Warmup (Div. 2) A~C

最近CF的pretext真是一场比一场弱，第一次在CF上被卡cin，cout。。。。A. Eliminationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstanda

2014-04-18 02:27:57 1627

原创 HDOJ 2586 How far away ？

tarjanLCA求树上任意两点间的距离。。。。任意选一个点当根节点，dist[a,b]= dist[a] +dist[b] -2* lca[a,b]How far away ？Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submissi

2014-04-16 19:38:29 1045

原创 POJ 1470 Closest Common Ancestors

裸的tarjianLCA。。。。Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 14328 Accepted: 4609DescriptionWrite a program

2014-04-16 16:45:40 955

原创 CSU 1391 Boiling Vegetables

暴力枚举。。。1391: Boiling VegetablesTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 21 Solved: 10[Submit][Status][Web Board]DescriptionInputOutput

2014-04-16 09:54:07 1235

原创 POJ 2778 DNA Sequence

DNA SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10953 Accepted: 4188DescriptionIt's well known that DNA Sequence is a sequence only contains

2014-04-15 00:26:51 1406

原创 Codeforces Round #241 (Div. 2) A~C

全是水题。。。。又在浪费生命。。。。A. Guess a number!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA TV sh

2014-04-14 21:35:55 1138

原创 ZOJ 3780 Paint the Grid Again

Paint the Grid AgainTime Limit: 2 Seconds Memory Limit: 65536 KBLeo has a grid with N × N cells. He wants to paint each cell with a specific color (either black or white).Leo has a ma

2014-04-14 17:31:44 1608

原创 HDOJ 3479 Financial Crisis

并查集+缩块缩块的时候判断块中的点的数量，对于 a ，ba与b不在同一并查集里 zeroa与b在同一并查集里时：a，b不在同一块中, onea，b在同一块中时：块中点数大于2，two否则 one一个u打成v让我找了一个晚上的错。。。。。。Financial CrisisTime Limit: 4000/2000 MS

2014-04-12 21:56:51 1205

原创 Codeforces Round #239 (Div. 2) A~D

A. Line to Cashiertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Vasya went to the supermarket to g

2014-04-11 19:57:49 1253

原创 POJ 1625 Censored!

AC自动机+高精度DP Censored!Time Limit: 5000MS Memory Limit: 10000KTotal Submissions: 7557 Accepted: 2042DescriptionThe alphabet of Freeland consists o

2014-04-11 14:39:50 1185

原创 HDOJ 3394 Railway

tarjan缩块，比较块中点和边的数量关系。。。RailwayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 808 Accepted Submission(s): 332Problem D

2014-04-10 00:40:05 1456

原创 HDOJ 4005 The war

题意：给一个无向图，敌人还可以再随机建一条边，而你可以拆掉一条边并产生一定的花费。问至少要多少花费才能保证拆掉一条边之后图不联通。tarjan缩点。。。。如果最大度否则找最小的某个节点的到子节点的第3小边（第1小，和第2小的边是可能被连到一起的），具体做法：重新构图的时候找到最小的边，然后从最小的边的两个端点分别dfs找第二小的边。。。注意可能出现重边，建图的时候要给每

2014-04-09 16:30:45 1075

原创 HDOJ 3065 病毒侵袭持续中

裸的AC自动机。。。。测模板。。。。病毒侵袭持续中Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5490 Accepted Submission(s): 1940Problem Descripti

2014-04-08 20:27:02 1040

原创 CodeForces 414 C. Mashmokh and Reverse Operation

简易的归并排序处理出每一层可能的逆序数，对于反转q层，相当于q层及以下的数都反转。。。然后求所有的逆序对和。。。。C. Mashmokh and Reverse Operationtime limit per test4 secondsmemory limit per test512 megabytesinputsta

2014-04-07 23:03:02 1595

原创 ZOJ 1484 Minimum Inversion Number

归并排序求逆序数。。。。Minimum Inversion NumberTime Limit: 2 Seconds Memory Limit: 65536 KBThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) t

2014-04-07 21:37:47 956

原创 Codeforces Round #240 (Div. 2) A~D

A. Mashmokh and Lightstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMashmokh works in a factory. At the e

2014-04-07 11:27:02 1409

原创 ZOJ 3772 Calculate the Function

矩阵+线段树。。。Fx 1 Ar 1 A l+2 F lFx-1 = 1 0 * .... * 1 0 * F l+1注意矩阵乘的顺序。。。。Calculate the Function

2014-04-06 22:52:32 1062

原创 ZOJ 3768 Continuous Login

只有1，2，3三种情况，两重for循环一顿乱搞。。。Continuous LoginTime Limit: 2 Seconds Memory Limit: 131072 KB Special JudgePierre is recently obsessed with an online game. To encourage users to

2014-04-06 20:06:10 1487

原创 HDOJ 4649 Professor Tian

按位DP。。。。。Professor TianTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 661 Accepted Submission(s): 360Problem Description

2014-04-05 23:26:19 918

原创 HDOJ 1686 Oulipo

裸的KMP，但是用AC自动机做的。。。。OulipoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4076 Accepted Submission(s): 1618Problem Descript

2014-04-04 22:46:23 925

原创 POJ 2955 Brackets

简单的区间DP。。。BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2518 Accepted: 1300DescriptionWe give the following inductive definition of

2014-04-04 16:24:23 900

原创 POJ 2168 Joke with Turtles

脑子一抽用0初始化DP。。。TLE到爆了。。。。Joke with TurtlesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1203 Accepted: 319 Special JudgeDescriptionTher

2014-04-04 14:18:59 1138

原创 HDOJ 4293 Groups

水DP。。。GroupsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1133 Accepted Submission(s): 440Problem Description　　After

2014-04-03 23:51:27 965