北京大学POJ
文章平均质量分 88
勇敢的炮灰
enjoy the real life ;)
展开
-
poj 1806 Manhattan 2025
点击打开链接#include#includechar map[10][30][30];void printmap(int num, int n){ int i, j; int temp = n * 2 + 1; for(i = 1; i <= temp; i++) { for(j = 1; j <= temp; j++)原创 2013-11-21 20:38:25 · 1277 阅读 · 0 评论 -
poj 3080 Blue Jeans
点击打开链接Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10243 Accepted: 4347DescriptionThe Genographic Project is a research partnership原创 2013-08-28 19:26:48 · 675 阅读 · 0 评论 -
poj 1035 Spell checker
点击打开链接Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16970 Accepted: 6223DescriptionYou, as a member of a development team for a n原创 2013-08-28 18:39:42 · 679 阅读 · 0 评论 -
poj 1016 Numbers That Count
点击打开链接Numbers That CountTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17922 Accepted: 5940Description"Kronecker's Knumbers" is a little compan原创 2013-08-28 18:23:17 · 912 阅读 · 0 评论 -
POJ 2186-Popular Cows:强连通分量问题
点击打开链接Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19665 Accepted: 7970DescriptionEvery cow's dream is to become the most pop原创 2013-07-21 02:02:46 · 1025 阅读 · 0 评论 -
poj 1273 (nyoj 323) Drainage Ditches : 最大流
点击打开链接Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49648 Accepted: 18829DescriptionEvery time it rains on Farmer John's field原创 2013-08-26 16:49:48 · 638 阅读 · 0 评论 -
poj 1002 487-3279
点击打开链接487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 220260 Accepted: 38393DescriptionBusinesses like to have memorable telephone numbe原创 2013-08-26 19:57:05 · 720 阅读 · 0 评论 -
poj 1308 Is It A Tree?
点击打开链接Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18904 Accepted: 6448DescriptionA tree is a well-known data structure that is原创 2013-08-26 17:35:41 · 714 阅读 · 0 评论 -
poj 1459 Power Network : 最大网络流 dinic算法实现
点击打开链接Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 20903 Accepted: 10960DescriptionA power network consists of nodes (power stat原创 2013-08-26 15:14:17 · 1100 阅读 · 0 评论 -
poj 1258 Agri-Net 最小生成树 kruskal
点击打开链接Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33733 Accepted: 13539DescriptionFarmer John has been elected mayor of his town! On原创 2013-08-23 11:54:04 · 775 阅读 · 0 评论 -
poj 1094 Sorting It All Out(nyoj 349)
点击打开链接Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24544 Accepted: 8503DescriptionAn ascending sorted sequence of distinct原创 2013-08-23 12:29:03 · 743 阅读 · 0 评论 -
poj 1936 All in All
点击打开链接All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 25779 Accepted: 10421DescriptionYou have devised a new encryption technique whic原创 2013-08-29 12:28:51 · 693 阅读 · 0 评论 -
poj 2388 Who's in the Middle
点击打开链接Who's in the MiddleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 28324 Accepted: 16396DescriptionFJ is surveying his herd to find the mo原创 2013-08-29 12:48:00 · 671 阅读 · 0 评论 -
poj 1753 Flip Game
点击打开链接Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25674 Accepted: 11093DescriptionFlip game is played on a rectangular 4x4 field wi原创 2013-08-18 11:45:09 · 739 阅读 · 0 评论 -
poj 1328 Radar Installation(nyoj 287 Radar):贪心
点击打开链接Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43490 Accepted: 9640DescriptionAssume the coasting is an infinite straig原创 2013-08-19 11:52:31 · 605 阅读 · 0 评论 -
poj 1003 (nyoj 156) Hangover
点击打开链接题目大意 就是有很多卡片可以沿着桌边向外放,每次可以伸出1/2,1/3,1/4问最少多少卡片才能让一张完成的卡片悬空,题目输入卡片的宽度,输出卡片个数#includeint array[550];int main(){ int i, j; double sum = 0; array[0] = 0; for(i = 1, j = 1; j < 521; i++)原创 2013-09-10 21:24:42 · 808 阅读 · 0 评论 -
poj 1416 (hdu 1539)Shredding Company:剪枝搜索
点击打开链接题目大意是有一个分割机,可以把一串数字分割成若干个数字之后求和,题目输入一个数字上界和待分割的数字,让我们求出分割后数字之和在不超过给定max的情况下的最大值,并且给出分割方案,如果没有分割方案,则输出error,如果有多种方案则输出rejected。这是个搜索题,深搜就可以求解,但是有一些剪枝的方案,题目讨论区说貌似不剪枝也能过,没试过,我一开始就写了有剪枝的,下面说一下一些原创 2013-09-10 20:58:21 · 874 阅读 · 0 评论 -
poj 3083 Children of the Candy Corn
点击打开链接Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8288 Accepted: 3635DescriptionThe cornfield maze is a popular Ha原创 2013-09-01 18:00:43 · 615 阅读 · 0 评论 -
poj 2513 Colored Sticks trie树+欧拉图+并查集
点击打开链接Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 27955 Accepted: 7403DescriptionYou are given a bunch of wooden sticks. Each原创 2013-08-29 17:30:23 · 768 阅读 · 0 评论 -
poj 1804 (nyoj 117)Brainman : 归并排序求逆序数
点击打开链接BrainmanTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7810 Accepted: 4261DescriptionBackground Raymond Babbitt drives his brother Charli原创 2013-08-29 13:33:55 · 1506 阅读 · 0 评论 -
poj 2299 Ultra-QuickSort :归并排序求逆序数
点击打开链接Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 34676 Accepted: 12465DescriptionIn this problem, you have to analyze a partic原创 2013-08-29 13:12:38 · 883 阅读 · 0 评论 -
poj 1007 (nyoj 160) DNA Sorting
点击打开链接DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 75164 Accepted: 30115DescriptionOne measure of ``unsortedness'' in a sequence i原创 2013-08-29 12:43:52 · 736 阅读 · 0 评论 -
poj 2965 The Pilots Brothers' refrigerator
点击打开链接The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15703 Accepted: 5928 Special JudgeDescriptionThe ga原创 2013-08-18 12:16:44 · 680 阅读 · 0 评论 -
poj 1018 Communication System
点击打开链接Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21007 Accepted: 7449DescriptionWe have received an order from Pizoor原创 2013-08-18 16:54:07 · 1723 阅读 · 0 评论 -
poj 3026 Borg Maze 最小生成树 + 广搜
点击打开链接Borg MazeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7097 Accepted: 2389DescriptionThe Borg is an immensely powerful race of enhan原创 2013-08-23 12:11:07 · 787 阅读 · 0 评论 -
poj 2485 Highways 最小生成树
点击打开链接HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19004 Accepted: 8815DescriptionThe island nation of Flatopia is perfectly flat. Un原创 2013-08-22 17:09:16 · 654 阅读 · 0 评论 -
(poj 3041-Asteroids)NYOJ 237-游戏高手的烦恼:二分图匹配
点击打开链接游戏高手的烦恼时间限制:1000 ms | 内存限制:65535 KB难度:5描述有一位传说级游戏高手,在闲暇时间里玩起了一个小游戏,游戏中,一个n*n的方块形区域里有许多敌人,玩家可以使用炸弹炸掉某一行或者某一列的所有敌人。他是种玩什么游戏都想玩得很优秀的人,所以,他决定,使用尽可能少的炸弹炸掉所有的敌人。现在给你一原创 2013-07-27 20:19:21 · 761 阅读 · 0 评论 -
poj 1236-Network of Schools:Tarjan算法实现
点击打开链接Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9214 Accepted: 3654DescriptionA number of schools are connected to a com原创 2013-07-22 20:32:46 · 625 阅读 · 0 评论 -
poj 1002-487-3279
点击打开链接487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 218558 Accepted: 38099DescriptionBusinesses like to have memorable telephone numbe原创 2013-08-02 00:31:46 · 656 阅读 · 0 评论 -
POJ 1062 (nyoj - 510)昂贵的聘礼
点击打开链接昂贵的聘礼时间限制:1000 ms | 内存限制:10000 KB难度:4描述 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8原创 2013-07-25 16:20:52 · 2482 阅读 · 0 评论 -
poj 1679-The Unique MST
点击打开链接The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17364 Accepted: 6012DescriptionGiven a connected undirected graph, tell if i原创 2013-07-23 15:50:12 · 596 阅读 · 0 评论 -
NYOJ 120-校园网络
点击打开链接校园网络时间限制:3000 ms | 内存限制:65535 KB难度:5描述南阳理工学院共有M个系,分别编号1~M,其中各个系之间达成有一定的协议,如果某系有新软件可用时,该系将允许一些其它的系复制并使用该软件。但该允许关系是单向的,即:A系允许B系使用A的软件时,B未必一定允许A使用B的软件。现在,请你写一个程序,根原创 2013-07-23 00:47:58 · 1106 阅读 · 0 评论 -
poj 1088-滑雪;NYOJ 10-skiing
点击打开链接poj点击打开链接NYOJ滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 67229 Accepted: 24704DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑原创 2013-07-18 20:01:02 · 608 阅读 · 0 评论 -
poj 1077-Eight;hdu 1043-Eight
点击打开链接hud点击打开链接pojEightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9141 Accepted Submission(s): 2459Special JudgeP原创 2013-07-19 02:52:40 · 799 阅读 · 0 评论 -
poj 1611-The Suspects:并查集
点击打开链接The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 18348 Accepted: 8867DescriptionSevere acute respiratory syndrome (SARS), an at原创 2013-07-17 20:26:15 · 634 阅读 · 0 评论 -
poj 3468-A Simple Problem with Integers
点击打开链接A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 44887 Accepted: 13148Case Time Limit: 2000MSDescription原创 2013-07-18 00:26:26 · 590 阅读 · 0 评论 -
POJ 1961-Period:KMP
点击打开链接PeriodTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 11163 Accepted: 5162DescriptionFor each prefix of a given string S with N characters原创 2013-08-04 15:42:37 · 666 阅读 · 0 评论 -
POJ 1001-Exponentiation(NYOJ 155 求高精度幂):大数问题
点击打开链接ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 120472 Accepted: 29411DescriptionProblems involving the computation of exact原创 2013-08-01 23:51:06 · 733 阅读 · 0 评论 -
poj 2109 Power of Cryptography
点击打开链接Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16388 Accepted: 8285DescriptionCurrent work in cryptography involves原创 2013-08-19 14:28:46 · 613 阅读 · 0 评论 -
poj 2240 Arbitrage bellman-ford算法
点击打开链接ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13434 Accepted: 5657DescriptionArbitrage is the use of discrepancies in currency原创 2013-08-22 13:03:21 · 714 阅读 · 0 评论