随笔分类 - 数据结构
摘要:Dynamic Rankings Time Limit: 10000MS Memory Limit: 32768KB 64bit IO Format: %lld & %llu Submit Status Description The Company Dynamic Rankings has dev
阅读全文
摘要:Count on a tree Time Limit: 129MS Memory Limit: 1572864KB 64bit IO Format: %lld & %llu Submit Status Description You are given a tree with N nodes.The
阅读全文
摘要:K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 44940 Accepted: 14946 Case Time Limit: 2000MS Description You are working for
阅读全文
摘要:Tree Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 7384 Accepted: 2001 Description You are given a tree with N nodes. The tree’s nodes a
阅读全文
摘要:Cornfields Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 6169 Accepted: 3039 Description FJ has decided to grow his own corn hybrid in or
阅读全文
摘要:Aragorn's Story Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7495 Accepted Submission(s): 19
阅读全文
摘要:Bob’s Race Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3034 Accepted Submission(s): 991 Prob
阅读全文
摘要:A Magic Lamp Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2742 Accepted Submission(s): 1071 P
阅读全文
摘要:Check Corners Time Limit: 2000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2377 Accepted Submission(s): 859
阅读全文
摘要:Frequent values Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1459 Accepted Submission(s): 535
阅读全文
摘要:Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4041 Accepted Submission(s): 1862 Pr
阅读全文
摘要:Minimum Sum Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3611 Accepted Submission(s): 829 Pr
阅读全文
摘要:The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1155 Accepted Submi
阅读全文
摘要:Kth number Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7616 Accepted Submission(s): 2402 Pr
阅读全文
摘要:题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1588 题意: Tiger最近被公司升任为营业部经理,他上任后接受公司交给的第一项任务便是统计并分析公司成立以来的营业情况。 Tiger拿出了公司的账本,账本上记录了公司成立以来每天的营业额。分析
阅读全文
摘要:Input The first line of input contains an integer T indicating the total number of test cases. The first line of each test case is an integer n, indic
阅读全文
摘要:题意:给你n个点,m条边构成无向图。q个询问,每次一个值,求有多少条路,路中的边权都小于这个值 a->b 和 b->a算两种 思路:把权值从小到大排序,询问从小到大排序,如果相连则用并查集相连形成联通块 x个点可以形成:x * (x - 1) 如果新增的路使两个联通块和并则数量 增长了: (num[
阅读全文
摘要:Sample Input 1 5 6 orz sto kirigiri danganronpa ooooo o kyouko dangan ronpa ooooo ooooo 1 5 6 orz sto kirigiri danganronpa ooooo o kyouko dangan ronpa
阅读全文
摘要:Problem Description MZL is a mysterious mathematician, and he proposed a mysterious function at his young age. Stilwell is very confused about this fu
阅读全文
摘要:POJ 2513 有N根木棒,一根木棒有2头,我们把每头涂色(相同或不同),如果2根木棒有相同颜色的一端就可以连接,颜色全部不同就不能连接,现在给你N根木棒以及它们的颜色,问最后能不能链接成1条链。 欧拉回路的问题,判断联通 以及 奇点个个数 输入为字符串,开始并不知道怎么弄,参考了下别人的报告,用
阅读全文

浙公网安备 33010602011771号