随笔分类 -  ACM解题报告(POJ)

上一页 1 2 3 4 5 6 ··· 11 下一页

POJ题目
POJ 3680 Intervals(费用流)
摘要:IntervalsTime Limit:5000MSMemory Limit:65536KTotal Submissions:5762Accepted:2288DescriptionYou are givenNweighted open intervals. Theith interval covers (ai,bi) and weighswi. Your task is to pick some of the intervals to maximize the total weights under the limit that no point in the real axis is co 阅读全文

posted @ 2013-08-04 11:00 kuangbin 阅读(1235) 评论(0) 推荐(0)

POJ 3422 Kaka's Matrix Travels(费用流)
摘要:Kaka's Matrix TravelsTime Limit:1000MSMemory Limit:65536KTotal Submissions:6792Accepted:2679DescriptionOn anN×Nchessboard with a non-negative number in each grid, Kaka starts his matrix travels withSUM= 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bottom one 阅读全文

posted @ 2013-08-04 10:40 kuangbin 阅读(1171) 评论(0) 推荐(0)

POJ 2019 Cornfields (二维RMQ)
摘要:CornfieldsTime Limit:1000MSMemory Limit:30000KTotal Submissions:4911Accepted:2392DescriptionFJ has decided to grow his own corn hybrid in order to help the cows make the best possible milk. To that end, he's looking to build the cornfield on the flattest piece of land he can find.FJ has, at grea 阅读全文

posted @ 2013-07-31 11:41 kuangbin 阅读(2352) 评论(0) 推荐(0)

POJ 3368 Frequent values (RMQ)
摘要:Frequent valuesTime Limit:2000MSMemory Limit:65536KTotal Submissions:11540Accepted:4206DescriptionYou are given a sequence ofnintegersa1, a2, ... , anin non-decreasing order. In addition to that, you are given several queries consisting of indicesiandj(1 ≤ i ≤ j ≤ n). For each query, determine the m 阅读全文

posted @ 2013-07-31 00:38 kuangbin 阅读(665) 评论(0) 推荐(0)

POJ 3608 Bridge Across Islands(旋转卡壳,两凸包最短距离)
摘要:Bridge Across IslandsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7202Accepted:2113Special JudgeDescriptionThousands of thousands years ago there was a small kingdom located in the middle of the Pacific Ocean. The territory of the kingdom consists two separated islands. Due to the impact of 阅读全文

posted @ 2013-07-28 22:05 kuangbin 阅读(1260) 评论(0) 推荐(0)

POJ 2079 Triangle(凸包+旋转卡壳,求最大三角形面积)
摘要:TriangleTime Limit:3000MSMemory Limit:30000KTotal Submissions:7625Accepted:2234DescriptionGiven n distinct points on a plane, your task is to find the triangle that have the maximum area, whose vertices are from the given points.InputThe input consists of several test cases. The first line of each t 阅读全文

posted @ 2013-07-28 18:51 kuangbin 阅读(1227) 评论(0) 推荐(0)

POJ 2187 Beauty Contest (求最远点对,凸包+旋转卡壳)
摘要:Beauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:24283Accepted:7420DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 #include #include #inclu 阅读全文

posted @ 2013-07-28 17:46 kuangbin 阅读(1432) 评论(0) 推荐(0)

POJ 2888 Magic Bracelet(Burnside引理,矩阵优化)
摘要:Magic BraceletTime Limit:2000MSMemory Limit:131072KTotal Submissions:3731Accepted:1227DescriptionGinny’s birthday is coming soon. Harry Potter is preparing a birthday present for his new girlfriend. The present is a magic bracelet which consists ofnmagic beads. The aremkinds of different magic beads 阅读全文

posted @ 2013-07-22 22:17 kuangbin 阅读(1578) 评论(0) 推荐(0)

POJ 1584 A Round Peg in a Ground Hole(判断凸多边形,点到线段距离,点在多边形内)
摘要:A Round Peg in a Ground HoleTime Limit:1000MSMemory Limit:10000KTotal Submissions:4438Accepted:1362DescriptionThe DIY Furniture company specializes in assemble-it-yourself furniture kits. Typically, the pieces of wood are attached to one another using a wooden peg that fits into pre-cut holes in eac 阅读全文

posted @ 2013-07-16 23:12 kuangbin 阅读(1452) 评论(0) 推荐(0)

POJ 3449 Geometric Shapes(判断几个不同图形的相交,线段相交判断)
摘要:Geometric ShapesTime Limit:2000MSMemory Limit:65536KTotal Submissions:1243Accepted:524DescriptionWhile creating a customer logo, ACM uses graphical utilities to draw a picture that can later be cut into special fluorescent materials. To ensure proper processing, the shapes in the picture cannot inte 阅读全文

posted @ 2013-07-16 21:12 kuangbin 阅读(1694) 评论(1) 推荐(0)

POJ 1039 Pipe(直线和线段相交判断,求交点)
摘要:PipeTime Limit:1000MSMemory Limit:10000KTotal Submissions:8280Accepted:2483DescriptionThe GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of determining how far the light 阅读全文

posted @ 2013-07-16 08:38 kuangbin 阅读(3021) 评论(1) 推荐(0)

POJ 2826 An Easy Problem?!
摘要:An Easy Problem?!Time Limit:1000MSMemory Limit:65536KTotal Submissions:7837Accepted:1145DescriptionIt's raining outside. Farmer Johnson's bull Ben wants some rain to water his flowers. Ben nails two wooden boards on the wall of his barn. Shown in the pictures below, the two boards on the wal 阅读全文

posted @ 2013-07-16 01:12 kuangbin 阅读(2810) 评论(0) 推荐(0)

POJ 3347 Kadj Squares
摘要:Kadj SquaresTime Limit:2000MSMemory Limit:65536KTotal Submissions:2132Accepted:843DescriptionIn this problem, you are given a sequenceS1,S2, ...,Snof squares of different sizes. The sides of the squares are integer numbers. We locate the squares on the positivex-yquarter of the plane, such that thei 阅读全文

posted @ 2013-07-16 00:12 kuangbin 阅读(1207) 评论(0) 推荐(0)

POJ 1696 Space Ant(极角排序)
摘要:Space AntTime Limit:1000MSMemory Limit:10000KTotal Submissions:2489Accepted:1567DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye on the left side of it 阅读全文

posted @ 2013-07-15 22:18 kuangbin 阅读(2640) 评论(0) 推荐(0)

POJ 1410 Intersection(判断线段交和点在矩形内)
摘要:IntersectionTime Limit:1000MSMemory Limit:10000KTotal Submissions:9996Accepted:2632DescriptionYou are to write a program that has to decide whether a given line segment intersects a given rectangle.An example:line: start point: (4,9)end point: (11,2)rectangle: left-top: (1,5)right-bottom: (7,1)Figur 阅读全文

posted @ 2013-07-15 21:16 kuangbin 阅读(2302) 评论(0) 推荐(0)

POJ 1066 Treasure Hunt(线段相交判断)
摘要:Treasure HuntTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4797Accepted: 1998DescriptionArcheologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-Ops. Using state-of-the-art technology they are able to determine that the lower floor 阅读全文

posted @ 2013-07-14 23:55 kuangbin 阅读(1665) 评论(0) 推荐(0)

POJ 2653 Pick-up sticks(判断线段相交)
摘要:Pick-up sticksTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 7699Accepted: 2843DescriptionStan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no 阅读全文

posted @ 2013-07-14 18:38 kuangbin 阅读(3108) 评论(0) 推荐(0)

POJ 1556 The Doors(线段交+最短路)
摘要:The DoorsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5210Accepted: 2124DescriptionYou are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and final points of the p 阅读全文

posted @ 2013-07-14 12:58 kuangbin 阅读(2618) 评论(0) 推荐(0)

POJ 1269 Intersecting Lines(直线相交判断,求交点)
摘要:Intersecting LinesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8342Accepted: 3789DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) inter 阅读全文

posted @ 2013-07-14 09:49 kuangbin 阅读(2725) 评论(2) 推荐(1)

POJ 3304 Segments (直线和线段相交判断)
摘要:SegmentsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7739Accepted: 2316DescriptionGiven n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at least one point in com 阅读全文

posted @ 2013-07-14 00:09 kuangbin 阅读(4514) 评论(4) 推荐(1)

上一页 1 2 3 4 5 6 ··· 11 下一页

导航

JAVASCRIPT: