随笔分类 -  POJ

摘要：Frame StackingTime Limit:1000MSMemory Limit:10000KTotal Submissions:4034Accepted:1352DescriptionConsider the following 5 picture frames placed on an 9... 阅读全文

摘要：Sorting It All OutTime Limit:1000MSMemory Limit:10000KTotal Submissions:26876Accepted:9271DescriptionAn ascending sorted sequence of distinct values i... 阅读全文

摘要：http://poj.org/problem?id=2935Basic Wall MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:2794Accepted:1271Special JudgeDescriptionIn this pr... 阅读全文

摘要：poj :http://poj.org/problem?id=1523如果无向图中一个点 u 为割点 则u 或者是具有两个及以上子女的深度优先生成树的根，或者虽然不是一个根，但是它有一个子女 w， 使得low[w] >= dfn[u];其中low[u] 是指点 u 通过回边所能达到的 最小深度优先数，dfn[u]是指 点u 当前所处的 深度优先数；low[u] 是在递归回退时计算出来的，dfn[u] 是在递归时直接计算的。low[u] = min{ dfn[u]; min{ low[w] } // w是u的一个子女 min{ dfn[v] } // v与u邻接， 且（u，v）是一条回边. 阅读全文

摘要：题目链接：http://poj.org/problem?id=1002&lang=zh-CN接替思路；先把字符串转换成数字或数字串，第一次写的代码是数字串，调用了stirng，和map 所以花时较长 1500ms，第二次用数字800ms！第一次代码： 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 using namespace std; 8 const int max_n = 1e5+3; 9 10 string str[max_n], str2, str3[max_n];11 map p_... 阅读全文

摘要：POJ 2031 Building a Space StationD -Building a Space StationTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uPOJ 2031DescriptionYou are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a 阅读全文

摘要：J -Agri-NetTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uPOJ 1258DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer John ordered a high speed 阅读全文

摘要：F -Constructing RoadsTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uPOJ 2421DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and 阅读全文

摘要：最小生成树的简单运用E -NetworkingTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uPOJ 1287DescriptionYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connec 阅读全文

摘要：B -NetworkTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uPOJ 1861DescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each wo 阅读全文

摘要：M -Perfect Pth PowersTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionWe say that x is a perfect square if, for some integer b, x = b2. Similarly, x is a perfect cube if, for some integer b, x = b3. More generally, x is a perfect pth power if, for some int 阅读全文

摘要：G -JapanTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <= 1000, N & 阅读全文