05 2016 档案
摘要:Constellations Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 5923 Accepted: 1164 Description The starry sky in the summer night is one of
阅读全文
摘要:D. Theseus and labyrinth time limit per test 3 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard in
阅读全文
摘要:B. Pyramid of Glasses time limit per test 1 second time limit per test memory limit per test 256 megabytes memory limit per test input standard input
阅读全文
摘要:D. Robin Hood time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output We all know the impressive
阅读全文
摘要:C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It was recycling da
阅读全文
摘要:题意:给你n个数字,第一个点作为根节点,然后每次插入一个节点,构建一棵平衡二叉树,并输出插入节点后该节点的父节点的值 先前写的爆内存了,,因为最多可以2^1e5,,所以应该改成map,,不过用set模拟BST不太懂啊、、。。链接
阅读全文
摘要:Gym Class Time Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 437 Accepted Submission(s): 157 Problem
阅读全文
摘要:C. Money Transfers time limit per test 1 second time limit per test memory limit per test 256 megabytes memory limit per test input standard input inp
阅读全文
摘要:Task Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6802 Accepted Submission(s): 2124 P
阅读全文
摘要:Road constructions Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1590 Accepted Submission(s): 5
阅读全文
摘要:A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15597 Accepted: 5308 Description You are in charge of setting up the press
阅读全文
摘要:PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19575 Accepted: 8948 Description Mirko works on a pig farm that consists of M locked p
阅读全文
摘要:Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 15682 Accepted: 5597 Case Time Limit: 1000MS Description FJ has moved his K
阅读全文
摘要:Muddy Fields Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9754 Accepted: 3618 Description Rain has pummeled the cows' field, a rectangul
阅读全文
摘要:Purifying Machine Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5004 Accepted: 1444 Description Mike is the owner of a cheese factory. He
阅读全文
摘要:Kindergarten Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6191 Accepted: 3052 Description In a kindergarten, there are a lot of kids. Al
阅读全文
摘要:Girls and Boys Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 11694 Accepted: 5230 Description In the second year of the university somebo
阅读全文
摘要:Kaka's Matrix Travels Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9153 Accepted: 3696 Description On an N × N chessboard with a non-neg
阅读全文
摘要:Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21010 Accepted: 10614 Description On a grid map there are n little men and n hou
阅读全文
摘要:"Shortest" pair of paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1215 Accepted: 491 Description A chemical company has an unusual s
阅读全文
摘要:Building roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7019 Accepted: 2387 Description Farmer John's farm has N barns, and there ar
阅读全文
摘要:Problem D Accepts: 2806 Submissions: 8458 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem D Accepts: 2806 Sub
阅读全文
摘要:题意:意思是有若干个飞行员,需要在扫帚上练习飞行,每个飞行员具有不同的等级,且等级高的飞行员可以当等级低的飞行员的老师,且每个飞行员至多有且只有一个老师和学生。具有老师和学生关系的飞行员可以在同一把扫帚上练习,并且这个性质具有传递性。即比如有A,B,C,D,E五个飞行员,且等级是A>B>C>D>E,
阅读全文
摘要:题意:一个小镇里面只有一个牧师,现在有些新人要结婚,需要牧师分别去主持一个仪式,给出每对新人婚礼的开始时间 s 和结束时间 t ,还有他们俩的这个仪式需要的时间(每对新人需要的时间长短可能不同) d ,牧师可以在婚礼开始的时间 d 内(s 到 s+d)或者是结束前的时间 d 内(t - d 到 t)
阅读全文
摘要:Get Luffy Out Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8211 Accepted: 3162 Description Ratish is a young man who always dreams of be
阅读全文
摘要:Katu Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9129 Accepted: 3391 Description Katu Puzzle is presented as a directed graph G(
阅读全文
摘要:题意描述: 网络中有一些学校,每个学校可以分发软件给其他学校。可以向哪个分发取决于他们各自维护的一个清单。 两个问题 1:至少要copy多少份新软件给那些学校, 才能使得每个学校都能得到。 2:要在所有的学校的清单里面至少一共增加几项才能 使得把软件给任意一个学校,所有的学校都能收得到。 分析:很好
阅读全文
摘要:题意:一群牛被有向的绳子拴起来,如果有一些牛(>=2)的绳子是同向的,他们就能跳跃。求能够跳跃的组数。 分析:牛能一起跳舞那么他们的绳子朝向就一定是一致的,也就是形成了一个环,即一个强连通分量, 所以只要统计好整个图中元素个数>=2的强连通分量个数就好
阅读全文
摘要:题意:n头奶牛,给出若干个欢迎关系a b,表示a欢迎b,欢迎关系是单向的,但是是可以传递的,如:a欢迎b,b欢迎c,那么a欢迎c 。另外每个奶牛都是欢迎他自己的。求出被所有的奶牛欢迎的奶牛的数目.#include <iostream>#include <cstdio> 分析:强连通分量裸题,缩点成D
阅读全文
摘要:题意:在通讯录中有N个人,每个人能可能属于多个group,现要将这些人分组m组,设各组中的最大人数为max,求出该最小的最大值 下面用的是朴素的查找,核心代码find_path复杂度是VE的,不过据说可以用DINIC跑二分图可以得到sqrt(v)*E的
阅读全文
摘要:E. Breaking Good time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Breaking Good is a new
阅读全文
摘要:E. Table Compression time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Little Petya is now
阅读全文
摘要:链接: How far away ? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11204 Accepted Submission(s):
阅读全文
摘要:E. Paths and Trees time limit per test 3 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard input in
阅读全文
摘要:题意:给一个有根树,一个查询节点(u,v)的最近公共祖先; 分析:最基础的LCA
阅读全文
摘要:题目:有n个城镇,m条边权为1的双向边让你破坏最多的道路,使得从s1到t1,从s2到t2的距离分别不超过d1和d2。 分析: 1.反过来思考,转换为求s1到t1和s2到t2的最短路。 2.假如上述两条最短路没有公共边,那么显然能删除的边就是除这两条路以外的所有的边; 但是假如有重合的边呢?那么我们只
阅读全文
摘要:题意:牛之间有绝对的强弱,给出一些胜负关系,问有多少头牛可以确定其绝对排名。 分析: 1.一头牛的排名能确定的话,那么肯定他跟其余的n-1头牛的胜负关系都已经(直接或间接)确定好了,因此,只需判断这头牛是否与其他牛的胜负关系确定了没有。 2.A输给了B,B输给了C,那么A肯定会输给C,要确定任意两头
阅读全文
摘要:题目链接 A - 秋实大哥与连锁快餐店 Time Limit:3000MS Memory Limit:65535KB 64bit IO Format:%lld & %llu Submit Status Practice UESTC 1146 题目链接 A - 秋实大哥与连锁快餐店 Submit St
阅读全文