joj acm_图论
kongming_acm
kongming_acm
展开
-
1002: Stockbroker Grapevine
<br />1002: Stockbroker GrapevineResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K2595774Standard<br />Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers原创 2010-07-10 22:09:00 · 433 阅读 · 0 评论 -
1905: Freckles prim
<br /> 1905: FrecklesResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K248101StandardIn an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turn原创 2010-07-10 22:14:00 · 451 阅读 · 0 评论 -
2235: Hero Pedigree
2235: Hero Pedigree--------------------------------------------------------------------------------Result TIME Limit MEMORY Limit Run Times AC Times JUDGE 5s 8192K 338 131 Standard 欢迎大家来到skywind的英雄世界. 在这一系列题目中, 我们将和英雄们一起去冒险在我们的世界中有很多英雄, 他们原创 2010-07-10 22:16:00 · 446 阅读 · 0 评论 -
2347: Transport Gate 最大团
<br />2347: Transport GateResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s16384K10337Standard<br />In ACM (A Country of Magic) world, there are many city. One can travel to another city through Transport Gate. It is very expensive to build one Transpor原创 2010-07-10 22:18:00 · 469 阅读 · 0 评论 -
2568: Think I will Buy Me a Football Team
<br />2568: Think I will Buy Me a Football TeamResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s65536K12053Standard<br />Problem 2562 to 2571 are of a same set. The set of problem is a PDF file. You can download it here.<br />Problem Pdf File, Click he原创 2010-07-10 22:20:00 · 501 阅读 · 0 评论 -
JOJ2035: Leaf Nodes 二叉树
<br />//借鉴达哥的程序<br />2035: Leaf Nodes<br /><br />--------------------------------------------------------------------------------<br />Status In/Out TIME Limit MEMORY Limit Submit Times Solved Users JUDGE TYPE <br /> stdin/stdout 1s 10240K 224 104 Standard原创 2010-08-12 10:28:00 · 779 阅读 · 0 评论 -
Road Networks 强连通分量的个数 tarjan
<br />4262 - Road Networks<br />Asia - Taipei - 2008/2009 <br />PDF Submit Ranking <br /> <br /> <br />There is a road network comprised by M roads and N cities. For convenience, we use {1, 2,..., N} to denote the N cities. Each road between two cities原创 2010-08-15 21:57:00 · 698 阅读 · 0 评论 -
joj 2607: Last time see you again 求1->n路上的必经之地(点)
大学的时光是值得怀念的,有多少事情珍藏在我们的记忆里,又有多少人我们一辈子都忘不掉。 123abc是一个不起眼的小男孩,他曾经在很多方面努力过,也经历了很多失败,在这些努力和失败中,他收获了自己的人生。 whx是123abc认识的一个女生,123abc很喜欢她,总是用各种方法想见原创 2011-07-18 13:57:48 · 919 阅读 · 0 评论 -
joj 2737 狼与羊的故事 求任意两点之间的必经之路
村长要召开羊族大会,讨论羊族未来的发展,要求羊羊们到指定地点集合。小羊们收到通知后从家里出发到达指定地点。每个羊的家都是与其他羊的家连通的,可以互相访问。 比如说可以从1到3,同样也可以从3到1 。灰太郎听到这个消息后,准备有所行动(你懂的)。但他不知道应该在哪条路上等羊。但他知原创 2011-07-14 15:18:56 · 907 阅读 · 0 评论 -
1169: Super Market 网络流 EK
1169: Super MarketResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K478133Standard1st原创 2010-07-21 07:59:00 · 454 阅读 · 0 评论 -
1224: Arbitrage (II)
<br />1224: Arbitrage (II)ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K26597Standard<br />Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For exa原创 2010-07-10 22:12:00 · 545 阅读 · 0 评论 -
1016: Degrees of separation
<br />1016: Degrees of separationResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1088438Standard<br />Find out how many people separate one person from another.<br />The number of people will be no more than 20.<br />Input<br /> <br />A positive i原创 2010-07-10 22:10:00 · 333 阅读 · 0 评论 -
2163: The Matrix
<br /> 2163: The MatrixResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K390166StandardConsider this method to describe a binary tree: We name the root node 'A',that means All other's parent. If a node's name is s (s is a string), its left child n原创 2010-07-10 22:15:00 · 414 阅读 · 0 评论 -
2436: Next Generation Network
<br />2436: Next Generation NetworkResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE5s32768K1186153Standard<br />There are many citys in island A. In the old days, they communicate with each other using telephone. A telephone line connect two citys. There原创 2010-07-10 22:19:00 · 434 阅读 · 0 评论 -
2535: Train Ticket floyd
2535: Train Ticket -------------------------------------------------------------------------------- Result TIME Limit MEMORY Limit Run Times AC Times JUDGE 3s 65536K 196 73 Standard 每次出外比赛,火车票的问题就出现了。太多的火车路线使acm的教练Coach Li很迷惘,当然,他总是努力使得总起来的火车票价最少。你能帮助他一下吗?原创 2010-07-10 22:19:00 · 431 阅读 · 0 评论 -
2624: Big Campus floyd
2624: Big CampusResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K9918StandardJLU is a big university consists of six campus. Since it is so big, there are school buses running in it. School bus only stops at bus station. There are n bus stations in原创 2010-07-10 22:21:00 · 979 阅读 · 2 评论 -
1170: Wire Is So Expensive
<br />1170: Wire Is So ExpensiveResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K620259Standard<br />1st Jilin University ACM International Collegiate Programming Contest<br />Assume you are working for ACM(Andrew Communication Management) company.原创 2010-07-10 22:11:00 · 350 阅读 · 0 评论 -
1198: Risk dijkstra
1198: RiskResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K457238StandardRisk is a board game in which several opposing players attempt to conquer the world. The gameboard consists of a world map broken up into hypothetical countries. During a play原创 2010-07-10 22:11:00 · 319 阅读 · 0 评论 -
1241: Graph Connectivity
<br /> 1241: Graph ConnectivityResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K551201Standard<br />Consider a graph G formed from a large number of nodes connected by edges. G is said to be connected if a path can be found in 0 or more steps betwe原创 2010-07-10 22:13:00 · 535 阅读 · 0 评论 -
1509: Hamiltonian Cycle
<br /> 1509: Hamiltonian CycleResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K40088Standard<br />A few definitions first: Definition 1A graph G = (V, E) is called ``dense'' if for each pair of non-adjacent vertices u and v, where n = |V| and den原创 2010-07-10 22:14:00 · 959 阅读 · 0 评论 -
2237: Hero Ranklist 拓扑排序
<br />2237: Hero RanklistResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE5s8192K248111Standard<br />Arthur想要将手下的战士按照能力进行排名, 选择出得力的助手进行冒险. 他收集了很多人之间比武的胜负情况,如A战胜了B,B战胜了C等。他发现,这些胜负关系之间彼此互不矛盾,也就是不能出现C又战胜了A这种情况,但很多人之间并没有比武, 也就无法衡量谁更强。在这种情况下,Arthur想把所有可能的排行榜都列原创 2010-07-10 22:17:00 · 474 阅读 · 0 评论 -
2414: Sightseeing tour 混合图欧拉回路+网络流
The city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautifu原创 2011-03-24 20:19:00 · 566 阅读 · 0 评论