02 2014 档案

HDU 4818 RP problem (高斯消元, 2013年长春区域赛F题)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4818深深地补一个坑~~~现场赛坑在这题了,TAT。。。。今天把代码改了下,过掉了,TAT很明显的高斯消元的模型。现场一开始想的也大概是对的。根据度可以得到n个方程,加起来为1是一个方程,有一个是多余的。 加起来就是n个方程。只可能是无穷解和唯一解的情况。现场是先求解一遍,然后枚举所有可以加的,不停做高斯消元。但是因为高斯消元是O(n^3) 的, 再枚举的话就是n^4了。。。。这样做明显应该超时的,HDU交了这样做也是TLE,,,现场被坑死,一直返回WA, 然后程序就改得不成样子了。。。其实枚举那个 阅读全文

posted @ 2014-02-26 00:01 kuangbin 阅读(3157) 评论(2) 推荐(0)

SGU 104. Little shop of flowers (DP)
摘要:104. Little shop of flowerstime limit per test: 0.25 sec.memory limit per test: 4096 KBPROBLEMYou want to arrange the window of your flower shop in a most pleasant way. You haveFbunches of flowers, each being of a different kind, and at least as many vases ordered in a row. The vases are glued onto 阅读全文

posted @ 2014-02-08 14:47 kuangbin 阅读(1234) 评论(0) 推荐(0)

HDU 3472 HS BDC (混合图的欧拉路径判断)
摘要:HS BDCTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 748Accepted Submission(s): 290Problem DescriptionIELTS is around the corner! love8909 has registered for the exam, but he still hasn’t got prepared. Now he decides to take actions. But when he t 阅读全文

posted @ 2014-02-03 16:58 kuangbin 阅读(1246) 评论(0) 推荐(0)

POJ 1386 Play on Words (有向图欧拉路径判定)
摘要:Play on WordsTime Limit:1000MSMemory Limit:10000KTotal Submissions:8768Accepted:3065DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important 阅读全文

posted @ 2014-02-03 14:41 kuangbin 阅读(727) 评论(0) 推荐(0)

POJ 2337 Catenyms (有向图欧拉路径,求字典序最小的解)
摘要:CatenymsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8756Accepted:2306DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms:dog.gophergopher.ratrat.tiger 阅读全文

posted @ 2014-02-03 13:51 kuangbin 阅读(2801) 评论(0) 推荐(0)

POJ 1637 Sightseeing tour (混合图欧拉路判定)
摘要:Sightseeing tourTime Limit:1000MSMemory Limit:10000KTotal Submissions:6986Accepted:2901DescriptionThe city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautiful city. They want to construct the tour so that every street i 阅读全文

posted @ 2014-02-03 12:41 kuangbin 阅读(3542) 评论(2) 推荐(0)

SGU 101 Domino (输出欧拉路径)
摘要:101. Dominotime limit per test: 0.25 sec.memory limit per test: 4096 KBDominoes – game played with small, rectangular blocks of wood or other material, each identified by a number of dots, or pips, on its face. The blocks usually are called bones, dominoes, or pieces and sometimes men, stones, or ev 阅读全文

posted @ 2014-02-03 11:18 kuangbin 阅读(1242) 评论(0) 推荐(0)

导航

JAVASCRIPT: