POJ
文章平均质量分 84
Jonariguez
这个作者很懒,什么都没留下…
展开
-
带权并查集 POJ1988 POJ2492
单纯的并查集很简单,带权并查集还能解决更多的问题,才更好玩,来个题热身。对于下面的知识,现在就当你已经熟练掌握了递归和并查集的路径压缩。POJ1988:题目链接 http://poj.org/problem?id=1988题目大意:有N(N M x y : 表示把方块x所在的堆,拿起来叠放到y所在的堆上。 C x : 问方块x下面有多少个方块。 操作最多有 P (P原创 2015-08-04 18:26:50 · 645 阅读 · 0 评论 -
POJ 3126 Prime Path( 广搜 )
Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12974 Accepted: 7342DescriptionThe ministers of the cabinet were quite upset by the message fr原创 2015-05-04 22:24:05 · 441 阅读 · 0 评论 -
POJ 3087 Shuffle'm Up
Shuffle'm UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6625 Accepted: 3105DescriptionA common pastime for poker players at a poker table is to shuf原创 2015-05-04 22:12:10 · 419 阅读 · 0 评论 -
POJ 2251 Dungeon Master (广搜)
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18773 Accepted: 7285DescriptionYou are trapped in a 3D dungeon and need to find the quicke原创 2015-05-04 21:44:49 · 422 阅读 · 0 评论 -
POJ 1284 Primitive Roots (原根)
Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3219 Accepted: 1858DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is equa原创 2015-04-25 11:56:21 · 622 阅读 · 0 评论 -
POJ 2480 Longge's problem (欧拉函数+乘性函数)
Longge's problemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7343 Accepted: 2422DescriptionLongge is good at mathematics and he likes to think about原创 2015-04-25 10:37:27 · 1201 阅读 · 0 评论 -
POJ 2407 Relatives(欧拉函数)
RelativesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11801 Accepted: 5780DescriptionGiven n, a positive integer, how many positive integers less tha原创 2015-04-25 11:53:21 · 914 阅读 · 0 评论 -
POJ 2499 Binary Tree
Binary TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6268 Accepted: 2887DescriptionBackground Binary trees are a common data structure in comput原创 2015-04-25 12:34:02 · 477 阅读 · 0 评论 -
POJ 1845 Sumdiv (因子和)
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15404 Accepted: 3800DescriptionConsider two natural numbers A and B. Let S be the sum of all natur原创 2015-04-25 00:00:32 · 902 阅读 · 0 评论 -
POJ 2769 Reduced ID Numbers (同余)
Reduced ID NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9153 Accepted: 3675DescriptionT. Chur teaches various groups of students at university原创 2015-04-21 21:00:41 · 582 阅读 · 0 评论 -
POJ 2115 C Looooops (线性同余方程)
C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19141 Accepted: 5049DescriptionA Compiler Mystery: We are given a C-language style for loop of原创 2015-04-21 21:43:51 · 518 阅读 · 0 评论 -
POJ 2418 Hardwood Species(字典树)
Hardwood SpeciesTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 20085 Accepted: 7911DescriptionHardwoods are the botanical group of trees that have bro原创 2015-05-04 21:53:33 · 495 阅读 · 0 评论 -
POJ 3258 River Hopscotch (二分)
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8423 Accepted: 3620DescriptionEvery year the cows hold an event featuring a peculiar vers原创 2015-05-13 19:54:13 · 354 阅读 · 0 评论 -
POJ 1426 Find The Multiple (广搜)
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20235 Accepted: 8203 Special JudgeDescriptionGiven a positive integer n, write a pr原创 2015-05-06 22:38:58 · 496 阅读 · 0 评论 -
POJ3264 Balanced Lineup 线段树|ST表
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 39453 Accepted: 18511Case Time Limit: 2000MSDescriptionFor the daily milking, Farme原创 2015-08-03 10:09:19 · 440 阅读 · 0 评论 -
POJ2528 Mayor's posters 线段树
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 49723 Accepted: 14419DescriptionThe citizens of Bytetown, AB, could not stand that the ca原创 2015-08-03 14:58:32 · 450 阅读 · 0 评论 -
POJ3468 A Simple Problem with Integers 线段树|树状数组BIT(区间增减,求和)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 75499 Accepted: 23268Case Time Limit: 2000MSDescriptionYou have N i原创 2015-08-03 10:37:55 · 904 阅读 · 0 评论 -
POJ2255 Tree Recovery 二叉树遍历
Tree RecoveryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12523 Accepted: 7836DescriptionLittle Valentine liked playing with binary trees very much.原创 2015-08-01 09:34:58 · 1096 阅读 · 0 评论 -
POJ 3101 Astronomy (大数+LCM)
AstronomyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5167 Accepted: 1127DescriptionThere are n planets in the planetary system of star X. They orbit原创 2015-05-08 10:36:11 · 699 阅读 · 0 评论 -
POJ 3111 K Best (01分数规划+二分)
K BestTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 6658 Accepted: 1756Case Time Limit: 2000MS Special JudgeDescriptionDemy has n jewels.原创 2015-05-16 11:26:37 · 451 阅读 · 0 评论 -
POJ3045 Cow Acrobats (贪心)
Cow AcrobatsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3207 Accepted: 1264DescriptionFarmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are pl原创 2015-05-16 10:40:53 · 611 阅读 · 0 评论 -
POJ 3104 Drying (二分)
DryingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10098 Accepted: 2589DescriptionIt is very hard to wash and especially to dry clothes in winter. Bu原创 2015-05-16 10:12:05 · 543 阅读 · 0 评论 -
POJ 2976 Dropping tests (01分数规划+二分)
Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7360 Accepted: 2558DescriptionIn a certain course, you take n tests. If you get ai out of原创 2015-05-16 09:27:44 · 751 阅读 · 2 评论 -
POJ 3273 Monthly Expense(二分)
Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16813 Accepted: 6666DescriptionFarmer John is an astounding accounting wizard and has rea原创 2015-05-16 09:13:15 · 666 阅读 · 0 评论 -
POJ 2992 Divisors (因子个数)
DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10784 Accepted: 3193DescriptionYour task in this problem is to determine the number of divisors原创 2015-04-24 20:16:59 · 458 阅读 · 0 评论 -
POJ 1611 The Suspects (并查集)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 24633 Accepted: 12072DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumo原创 2015-04-14 22:24:47 · 415 阅读 · 0 评论 -
POJ 1552 Doubles
DoublesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19859 Accepted: 11492DescriptionAs part of an arithmetic competency program, your students will b原创 2015-04-14 22:16:52 · 424 阅读 · 0 评论 -
POJ 1207 The 3n + 1 problem (数学)
The 3n + 1 problemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 53448 Accepted: 16999DescriptionProblems in Computer Science are often classified as b原创 2015-04-14 21:07:42 · 414 阅读 · 0 评论 -
POJ 2524 Ubiquitous Religions(并查集)
我看计划的时候它是说分治,不过我一看这就是用并查集搞啊,我在怀疑是不是计划上的分类弄错了,然后我去网上看看博客,大家都是用并查集做的,也没有什么分治啊~知道用并查集,思路就很简单了:初始化f[]数组,如果两个人信仰的宗教一样就把他们合并,最后遍历f[]数组看看还有几个没合并的就是答案。(不过这里到最后也可以不用遍历f[]数组,可以在每合并一次,总学生数就n--,最后的n就是答案了,这样应该可能会快一点吧~)还有就是我这里把m定义成了64位的,怕溢出,不知道这里会不会爆int,没试,大家如果知道的话可以给原创 2015-01-29 10:04:22 · 560 阅读 · 0 评论 -
poj3735,矩阵快速幂
Training little catsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9815 Accepted: 2346DescriptionFacer's pet cat just gave birth to a brood of little c原创 2014-07-29 16:07:25 · 573 阅读 · 0 评论 -
POJ 3664 Election Time
Election TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7845 Accepted: 4176DescriptionThe cows are having their first election after overthrowing t原创 2015-04-10 19:30:10 · 406 阅读 · 0 评论 -
POJ 3090 Visible Lattice Points 布雷级数
Visible Lattice PointsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5779 Accepted: 3409DescriptionA lattice point (x, y) in the first quadrant (x an原创 2015-03-20 23:10:53 · 533 阅读 · 0 评论 -
POJ 1321 棋盘问题 深搜+回溯
棋盘问题Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 24958Accepted: 12333Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求原创 2015-03-20 21:39:00 · 482 阅读 · 0 评论 -
poj3735,,矩阵快速幂
这题题意如下,有n 只猫咪,三种关于花生的命令 ( 得花生,吃花生,交换花生 ) ,给出一套命令,重复 n 次,问最后每只猫咪得到多少花生。M那么大,毫无疑问,矩阵快速幂。先构造一个单位矩阵,因为只需在单位矩阵上进行操作,然后用操作完之后得到的矩阵乘以初始的状态就得到最终的状态。原创 2014-08-03 09:23:11 · 1129 阅读 · 0 评论 -
POJ1014 Dividing 母函数
题目大意:每行给出6个数,第 i 个数代表价值为 i 的石头的个数,问这么多个石头两个人能不能平均分。就是一道简单的母函数,首先可先把石头的总价值sum算出来,如果sum是奇数,那么就不能平均分,如果是偶数,利用母函数的知识,只需判断指数为 sum/2 的系数是否为零,如果为0,说明没有一种方案可以平均分;如果不为0,则可以。需要说明的是,由于每种价值的石头的个数可能很大,这有一个定理:对于任何一种石头的个数n,如果n大于等于8,则可将n改写成11(n为奇数)或12(n为偶数)。 否则会超时。原创 2014-09-11 16:59:18 · 750 阅读 · 0 评论 -
快速Fibonacci数,矩阵法
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9156 Accepted: 6494DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn原创 2014-07-31 11:01:22 · 601 阅读 · 0 评论 -
快速Fibonacci数列,矩阵法
这个题是要用矩阵的知识解决斐波那契数列,题目中给的公式很简单,直接往上套就行了,那我们就先看除了题目给的方法外的另一个方法,当然还是矩阵。先看下面的公式:不难看出这个式子是把:原创 2014-08-01 16:25:24 · 2489 阅读 · 0 评论 -
POJ 1316 Self Numbers
Self NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21832 Accepted: 12291DescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered a原创 2015-04-14 21:57:58 · 326 阅读 · 0 评论 -
POJ 2769 Reduced ID Numbers 同余定理
Reduced ID NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 8989Accepted: 3610DescriptionT. Chur teaches various groups of students at university U.原创 2014-10-17 20:35:09 · 963 阅读 · 0 评论 -
POJ 1046 Color Me Less
Color Me LessTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31449 Accepted: 15309DescriptionA color reduction is a mapping from a set of discrete color原创 2015-04-10 20:55:00 · 579 阅读 · 0 评论