2015年07月_kalilili

原创 Codeforces Round #191 (Div. 2) E. Axis Walking (状态压缩+lowbit应用)

E. Axis Walkingtime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputIahub wants to meet his girlfriend Iahubina

2015-07-30 10:41:00 819

原创 ZOJ - 3890 Wumpus（BFS基础题）

WumpusTime Limit: 2 Seconds Memory Limit: 65536 KBOne day Leon finds a very classic game called Wumpus.The game is as follow.Once an agent fell into a cave. The legend said that in th

2015-07-27 19:26:33 832

原创 HDU 5313 Bipartite Graph（二分图染色+01背包水过）

Problem DescriptionSoda has a bipartite graph with n vertices and m undirected edges. Now he wants to make the graph become a complete bipartite graph with most edges by adding some extra edge

2015-07-26 11:30:05 1091

原创 Codeforces Round #313 (Div. 1) C. Gerald and Giant Chess（DP+组合数取模）（好题）

C. Gerald and Giant Chesstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiant chess is quite common in Ge

2015-07-23 21:55:05 696

原创 HDU 5274 Dylans loves tree（LCA+dfs时间戳+成段更新 OR 树链剖分+单点更新）

Problem DescriptionDylans 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 given Q questions like that:①0 x y：change node x′

2015-07-22 10:27:46 2533

原创 Codeforces Round #143 (Div. 2) E. Cactus（LCA+无向图缩点）

E. Cactustime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA connected undirected graph is called a vertex c

2015-07-20 22:29:22 760

原创 HDU 5285 wyh2000 and pupil(dfs或种类并查集)

wyh2000 and pupilTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 755 Accepted Submission(s): 251Problem DescriptionYoung theoret

2015-07-20 11:27:05 1515

原创 Codeforces Round #252 (Div. 2) D. Valera and Swaps（神奇的置换群）（好题）

D. Valera and Swapstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation p of length n is a seque

2015-07-12 21:53:54 897

原创 Codeforces Round #141 (Div. 2) C. Fractal Detector（神奇的状压DP）（好题）

C. Fractal Detectortime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Vasya likes painting fractals ve

2015-07-09 21:10:10 736

原创 CodeForces 228D. Zigzag（线段树暴力）

D. Zigzagtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe court wizard Zigzag wants to become a famous

2015-07-09 15:30:10 837

原创 CodeForces 228E The Road to Berland is Paved With Good Intentions (2-Sat)

题目地址： http://codeforces.com/problemset/problem/228/E E. The Road to Berland is Paved With Good Intentionstime limit per test1 secondmemory limit per test256 meg

2015-07-09 00:25:37 1090

原创 Codeforces Round #311 (Div. 2) E - Ann and Half-Palindrome（字典树+dp）

E. Ann and Half-Palindrometime limit per test1.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputTomorrow Ann takes the hardest

2015-07-08 13:18:30 1082

原创 SPOJ 375 Query on a tree（初学树链剖分）

QTREE - Query on a treeno tags You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instructions

2015-07-07 23:12:21 1311

原创 HDU 5266 pog loves szh III （LAC）

问题描述pog在与szh玩游戏，首先pog在纸上画了一棵有根树，这里我们定义1为这棵树的根，然后szh在这棵树中选了若干个点，想让pog帮忙找找这些点的最近公共祖先在哪里，一个点为S的最近公共祖先当且仅当以该点为根的子树包含S中的所有点，且该点深度最大。然而，这个问题是十分困难的，出于szh对pog的爱，他决定只找编号连续的点，即l i ~r i 。输入描述若干组数据(不超

2015-07-07 20:25:07 967

原创 HDU 2586 How far away ？（初学LCA）

How far away ？Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7739 Accepted Submission(s): 2769Problem DescriptionThere are n hou

2015-07-07 20:01:14 736

原创 POJ 2785 4 Values whose Sum is 0（折半枚举）

4 Values whose Sum is 0Time Limit: 15000MS Memory Limit: 228000KTotal Submissions: 17088 Accepted: 4998Case Time Limit: 5000MSDescriptionThe SUM problem c

2015-07-06 20:27:46 853

原创 51nod round3# 序列分解（折半枚举+字典树）

小刀和大刀是双胞胎兄弟。今天他们玩一个有意思的游戏。大刀给小刀准备了一个长度为n的整数序列。小刀试着把这个序列分解成两个长度为n/2的子序列。这两个子序列必须满足以下两个条件：1.他们不能相互重叠。2.他们要完全一样。如果小刀可以分解成功，大刀会给小刀一些糖果。然而这个问题对于小刀来说太难了。他想请你来帮忙。Input第一行

2015-07-06 20:23:53 716

原创 HDU5277 YJC counts stars （图论知识平面图）

题意：给定一个平面图求最大团的个数和最大团内的顶点数数据范围：数据组数T思路：这是bc的一道题，中文题面语句太随便了，没看明白，看了英文后才看懂原来是一个平面图定义：一个图G，若可以将它画在平面上,使它的边仅在顶点上才能相交，则称图G为可平面图在纸上画画便可知最大团的最大为4，而且每添一个顶点极大平面图的边数只能增加3，而且的确有这个公式：m而且答案为4的最大团

2015-07-05 15:25:41 930

kalilili的专栏