2016 年 1月随笔档案 - vCoders

HDU2586(LCA应用:在带权树中求任意两点之间的距离)

摘要：How far away ？ Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10412 Accepted Submission(s): 3777 阅读全文

posted @ 2016-01-31 14:10 vCoders 阅读(278) 评论(0) 推荐(0) 编辑

POJ1986(LCA应用:求两结点之间距离)

摘要：Distance Queries Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 11304 Accepted: 3985 Case Time Limit: 1000MS Description Farmer John's cow 阅读全文

posted @ 2016-01-30 23:35 vCoders 阅读(223) 评论(0) 推荐(0) 编辑

POJ(有向图求LCA)

摘要：Closest Common Ancestors Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 18013 Accepted: 5774 Description Write a program that takes as inp 阅读全文

posted @ 2016-01-30 15:47 vCoders 阅读(410) 评论(0) 推荐(0) 编辑

POJ1330(LCA入门题)

摘要：Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23388 Accepted: 12195 Description A rooted tree is a well-known da 阅读全文

posted @ 2016-01-30 12:46 vCoders 阅读(374) 评论(0) 推荐(0) 编辑

HDU1269(有向图缩点模板题)

摘要：迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11070 Accepted Submission(s): 4948 Problem D 阅读全文

posted @ 2016-01-30 10:02 vCoders 阅读(336) 评论(0) 推荐(0) 编辑

POJ2553( 有向图缩点)

摘要：Description Input Output Sample Input Sample Output 下面是kosaraju算法阅读全文

posted @ 2016-01-29 17:16 vCoders 阅读(269) 评论(0) 推荐(0) 编辑

POJ2186(有向图缩点)

摘要：Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 28379 Accepted: 11488 Description Every cow's dream is to become the most popu 阅读全文

posted @ 2016-01-29 00:37 vCoders 阅读(279) 评论(0) 推荐(0) 编辑

POJ3352(连通分量缩点)

摘要：Road Construction Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10352 Accepted: 5140 Description It's almost summer time, and that means 阅读全文

posted @ 2016-01-28 21:48 vCoders 阅读(212) 评论(0) 推荐(0) 编辑

POJ1523(割点所确定的连用分量数目,tarjan算法原理理解)

摘要：SPF Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7406 Accepted: 3363 Description Consider the two networks shown below. Assuming that da 阅读全文

posted @ 2016-01-28 20:51 vCoders 阅读(1275) 评论(0) 推荐(0) 编辑

POJ3694(求割边)

摘要：Network Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 7943 Accepted: 2893 Description A network administrator manages a large network. Th 阅读全文

posted @ 2016-01-28 16:11 vCoders 阅读(319) 评论(0) 推荐(0) 编辑

POJ3177(无向图变双连通图)

摘要：Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11514 Accepted: 4946 Description In order to get from one of the F (1 <= F 阅读全文

posted @ 2016-01-27 16:01 vCoders 阅读(328) 评论(0) 推荐(0) 编辑

POJ1144(割点入门题)

摘要：Network Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11378 Accepted: 5285 Description A Telephone Line Company (TLC) is establishing a n 阅读全文

posted @ 2016-01-26 17:10 vCoders 阅读(469) 评论(0) 推荐(0) 编辑

蓝桥杯(危险系数)

摘要：问题描述抗日战争时期，冀中平原的地道战曾发挥重要作用。地道的多个站点间有通道连接，形成了庞大的网络。但也有隐患，当敌人发现了某个站点后，其它站点间可能因此会失去联系。我们来定义一个危险系数DF(x,y)：对于两个站点x和y (x != y), 如果能找到一个站点z，当z被敌人破坏后，x和y不连通，那... 阅读全文

posted @ 2016-01-26 12:44 vCoders 阅读(334) 评论(0) 推荐(0) 编辑

HDU1875(最小生成树)

摘要：畅通工程再续Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21693Accepted Submission(s): 6856Problem Des... 阅读全文

posted @ 2016-01-26 00:24 vCoders 阅读(290) 评论(0) 推荐(0) 编辑

POJ2349(求生成树中符合题意的边)

摘要：Arctic NetworkTime Limit:2000MSMemory Limit:65536KTotal Submissions:14977Accepted:4777DescriptionThe Department of National Defence (DND) wishes to co... 阅读全文

posted @ 2016-01-25 23:44 vCoders 阅读(171) 评论(0) 推荐(0) 编辑

POJ1287(最小生成树入门题)

摘要：NetworkingTime Limit:1000MSMemory Limit:10000KTotal Submissions:7753Accepted:4247DescriptionYou are assigned to design network connections between cer... 阅读全文

posted @ 2016-01-24 19:23 vCoders 阅读(1099) 评论(0) 推荐(0) 编辑

POJ3159(最短路)

摘要：CandiesTime Limit:1500MSMemory Limit:131072KTotal Submissions:27051Accepted:7454DescriptionDuring the kindergarten days, flymouse was the monitor of h... 阅读全文

posted @ 2016-01-24 11:38 vCoders 阅读(580) 评论(0) 推荐(0) 编辑

POJ1511(最短路大数据处理)

摘要：Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 23357 Accepted: 7675 Description In the age of television, not many peopl 阅读全文

posted @ 2016-01-23 23:12 vCoders 阅读(266) 评论(0) 推荐(0) 编辑

POJ1502(最短路入门题)

摘要：MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7471 Accepted: 4550 Description BIT has recently taken delivery of their new 阅读全文

posted @ 2016-01-22 21:03 vCoders 阅读(223) 评论(0) 推荐(0) 编辑

POJ3660(foyld闭包问题)

摘要：Cow ContestTime Limit:1000MSMemory Limit:65536KTotal Submissions:8794Accepted:4948DescriptionN(1 ≤N≤ 100) cows, conveniently numbered 1..N, are partic... 阅读全文

posted @ 2016-01-22 10:06 vCoders 阅读(201) 评论(0) 推荐(0) 编辑

POJ3259(ford判环)

摘要：Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 39078 Accepted: 14369 Description While exploring his many farms, Farmer John has 阅读全文

posted @ 2016-01-21 23:04 vCoders 阅读(180) 评论(0) 推荐(0) 编辑

POJ1860(ford判环)

摘要：Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 24243 Accepted: 8813 Description Several currency exchange points are wor 阅读全文

posted @ 2016-01-21 22:25 vCoders 阅读(149) 评论(0) 推荐(0) 编辑

POJ3268(最短路)

摘要：Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16405 Accepted: 7503 Description One cow from each of N farms (1 ≤ N ≤ 100 阅读全文

posted @ 2016-01-21 11:02 vCoders 阅读(260) 评论(0) 推荐(0) 编辑

POJ1797(dijkstra求最短最长边)

摘要：Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 26442 Accepted: 7044 Description Background Hugo Heavy is happy. After 阅读全文

posted @ 2016-01-20 23:05 vCoders 阅读(308) 评论(0) 推荐(0) 编辑

POJ2253(djkstra求最长最短边)

摘要：Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 32257 Accepted: 10396 Description Freddy Frog is sitting on a stone in the middle o 阅读全文

posted @ 2016-01-20 21:44 vCoders 阅读(189) 评论(0) 推荐(0) 编辑

蓝桥杯(道路与航路)

摘要：算法提高道路和航路时间限制：1.0s 内存限制：256.0MB问题描述农夫约翰正在针对一个新区域的牛奶配送合同进行研究。他打算分发牛奶到T个城镇（标号为1..T），这些城镇通过R条标号为（1..R）的道路和P条标号为（1..P）的航路相连。每一条公路i或者航路i表示成连接城镇Ai（1Bi的单向... 阅读全文

posted @ 2016-01-20 20:10 vCoders 阅读(530) 评论(0) 推荐(0) 编辑

POJ2387(最短路入门)

摘要：Til the Cows Come Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 38556 Accepted: 13104 Description Bessie is out in the field and wan 阅读全文

posted @ 2016-01-20 18:10 vCoders 阅读(301) 评论(0) 推荐(0) 编辑

HDU4391(线段树+剪枝)

摘要：Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3114 Accepted Submission(s): 846 阅读全文

posted @ 2016-01-19 16:22 vCoders 阅读(281) 评论(0) 推荐(0) 编辑

POJ2887(块状链表)

摘要：Big StringTime Limit:1000MSMemory Limit:131072KTotal Submissions:6346Accepted:1525DescriptionYou are given a string and supposed to do some string man... 阅读全文

posted @ 2016-01-19 14:35 vCoders 阅读(504) 评论(0) 推荐(0) 编辑

POJ1195(二维树状数组)

摘要：Mobile phonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:17176Accepted:7920DescriptionSuppose that the fourth generation mobile phone base s... 阅读全文

posted @ 2016-01-18 22:18 vCoders 阅读(161) 评论(0) 推荐(0) 编辑

POJ3067(树状数组:统计数字出现个数)

摘要：Japan Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24151 Accepted: 6535 Description Japan plans to welcome the ACM ICPC World Finals and 阅读全文

posted @ 2016-01-18 21:18 vCoders 阅读(331) 评论(0) 推荐(0) 编辑

POJ2481(树状数组:统计数字出现个数)

摘要：CowsTime Limit:3000MSMemory Limit:65536KTotal Submissions:15405Accepted:5133DescriptionFarmer John's cows have discovered that the clover growing alon... 阅读全文

posted @ 2016-01-18 11:07 vCoders 阅读(362) 评论(0) 推荐(0) 编辑

POJ3928(树状数组:统计数字出现个数)

摘要：Ping pong Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2641 Accepted: 978 Description N(3<=N<=20000) ping pong players live along a west 阅读全文

posted @ 2016-01-18 09:06 vCoders 阅读(311) 评论(0) 推荐(0) 编辑

POJ2182(排队问题)

摘要：Lost CowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10695Accepted:6865DescriptionN (2 =0;i--) { int pos=seek(deg[i]+1); ... 阅读全文

posted @ 2016-01-15 14:23 vCoders 阅读(170) 评论(0) 推荐(0) 编辑

POJ2828(插队问题)

摘要：Buy TicketsTime Limit:4000MSMemory Limit:65536KTotal Submissions:17077Accepted:8466DescriptionRailway tickets were difficult to buy around the Lunar N... 阅读全文

posted @ 2016-01-14 16:47 vCoders 阅读(165) 评论(0) 推荐(0) 编辑

HDU4027(线段树单点更新区间)

摘要：Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 11333Accepted Submiss... 阅读全文

posted @ 2016-01-13 17:12 vCoders 阅读(281) 评论(0) 推荐(0) 编辑

HDU3974(dfs+线段树)

摘要：Assign the task Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2008 Accepted Submission(s): 895 阅读全文

posted @ 2016-01-13 09:17 vCoders 阅读(556) 评论(0) 推荐(0) 编辑

HDU1540(线段树统计连续长度)

摘要：---恢复内容开始---Tunnel WarfareTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionDuring the War of Resistance Against Japan, tun... 阅读全文

posted @ 2016-01-12 23:45 vCoders 阅读(167) 评论(0) 推荐(0) 编辑

蓝桥杯Log大侠(线段树单点区间更新)

摘要：标题：Log大侠 atm参加了速算训练班，经过刻苦修炼，对以2为底的对数算得飞快，人称Log大侠。一天，Log大侠的好友 drd 有一些整数序列需要变换，Log大侠正好施展法力... 变换的规则是：对其某个子序列的每个整数变为: [log_2 (x) + 1] 其中 [] 表示向下取整，就是对每阅读全文

posted @ 2016-01-12 19:05 vCoders 阅读(627) 评论(0) 推荐(0) 编辑

HDU4027(线段树单点更新区间)

摘要：Can you answer these queries? Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:65768KB 64bit IO Format:%I64d & %I64uTime Limit:20 阅读全文

posted @ 2016-01-12 17:03 vCoders 阅读(109) 评论(0) 推荐(0) 编辑

POJ3264(线段树入门题)

摘要：Balanced LineupCrawling in process... Crawling failed Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uTime Limit:5000MS Memory Lim... 阅读全文

posted @ 2016-01-12 15:34 vCoders 阅读(230) 评论(0) 推荐(0) 编辑

ZOJ1610(经典线段树涂色问题)

摘要：DescriptionPainting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting... 阅读全文

posted @ 2016-01-12 14:59 vCoders 阅读(276) 评论(0) 推荐(0) 编辑

HDU1698(线段树入门题)

摘要：Just a HookTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionIn the game of DotA, Pudge’s meat hook is actually the most ho... 阅读全文

posted @ 2016-01-11 22:29 vCoders 阅读(254) 评论(0) 推荐(0) 编辑

POJ2528(离散化+线段树区间更新)

摘要：Mayor's posters Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description The citizens of Bytetown, AB, could not stand that th 阅读全文

posted @ 2016-01-11 17:24 vCoders 阅读(163) 评论(0) 推荐(0) 编辑

POJ3630(Trie树)

摘要：Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26385 Accepted: 7957 Description Given a list of phone numbers, determine if it 阅读全文

posted @ 2016-01-11 09:40 vCoders 阅读(206) 评论(0) 推荐(0) 编辑

HDU1251（字典树）

摘要：统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 27876 Accepted Submission(s): 11120 Problem 阅读全文

posted @ 2016-01-11 08:25 vCoders 阅读(138) 评论(0) 推荐(0) 编辑

HDU1247(经典字典树)

摘要：Hat’s Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11894 Accepted Submission(s): 4239 Pr 阅读全文

posted @ 2016-01-10 22:28 vCoders 阅读(315) 评论(0) 推荐(0) 编辑

POJ2513(字典树+图的连通性判断)

摘要：//用map映射TLE,字典树就AC了#include"cstdio"#include"set"using namespace std;const int MAXN=510005;const int N=26;//26个小写英文字母 struct node{ int val;//存放字符串的h... 阅读全文

posted @ 2016-01-10 21:25 vCoders 阅读(514) 评论(0) 推荐(0) 编辑

01 2016 档案

导航

统计

公告