2015年10月_PoemK

原创 hdu 1711 拒绝模板，手搓+yy kmp，新的突破

Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16488 Accepted Submission(s): 7264Problem DescriptionGiven tw

2015-10-31 21:48:24 419

原创 hdu 4662 MU Puzzle 余数

MU PuzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1468 Accepted Submission(s): 606Problem DescriptionSuppose there are

2015-10-31 18:02:06 464

原创 hdu 5221 Meeting 建图+迪杰斯特拉

MeetingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 30 Accepted Submission(s): 7Problem DescriptionBessie and her frien

2015-10-31 17:54:06 662

原创 hdu 4704 Sum 指数循环节

SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1946 Accepted Submission(s): 813Problem Description Sample I

2015-10-30 19:33:34 418

原创 poj 1176 Party Lamps 搜索

Party LampsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4119 Accepted: 1415DescriptionTo brighten up the gala dinner of the IOI'98 we have a set of N

2015-10-29 23:42:43 503

原创 hdu 4472 Count 动态规划

CountTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2141 Accepted Submission(s): 1416Problem DescriptionProf. Tigris is the

2015-10-29 18:12:14 441

原创 hdu 4474 Yet Another Multiple Problem BFS+同余判重 ★★★★

Yet Another Multiple ProblemTime Limit: 40000/20000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4947 Accepted Submission(s): 1082Problem Descriptio

2015-10-29 14:38:30 530

原创 poj 1164 The Castle 位运算+并查集/搜索

The CastleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6907 Accepted: 3877Description 1 2 3 4 5 6 7 #########################

2015-10-27 20:55:37 442

原创 poj 2023 Choose Your Own Adventure 树形结构的搜索

Choose Your Own AdventureTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1733 Accepted: 706DescriptionAfter reading the book Tim and Marc Kill Kenny abo

2015-10-27 12:23:04 496

原创 hdu 1002 高精度加法

A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 276647 Accepted Submission(s): 53400Problem DescriptionI have

2015-10-27 00:13:56 352

原创 poj 1018 Communication System 动态规划

Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25393 Accepted: 9054DescriptionWe have received an order from Pizoor Communications

2015-10-26 13:01:26 564

原创 poj 1166 The Clocks 暴力搜索

The ClocksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15336 Accepted: 6219Description|-------| |-------| |-------|| | | |

2015-10-26 07:49:25 462

原创 uva 10047 The Monocycle BFS

题目：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=988题意：走m*n迷宫，从S到T,'#'是墙，'.'可走，不能出界，走一步花费1s，站着转90度花费1s，要求走过的步数是5的倍数。一开始面朝北。求最少时间。不同于一般的水题，把轮子的

2015-10-26 05:18:26 448

原创 hdu 1025 Constructing Roads In JGShining's Kingdom 最长上升子序列

Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19839 Accepted Submission(s): 5610Proble

2015-10-26 05:04:00 316

原创 poj 1182 食物链并查集

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55072 Accepted: 16149Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都

2015-10-25 15:04:56 381

原创 poj 2021 Relative Relatives

Relative RelativesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3550 Accepted: 1561DescriptionToday is Ted's 100th birthday. A few weeks ago, you were

2015-10-24 22:05:19 388

原创 poj 1656 Counting Black 水题

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55050 Accepted: 16140Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都

2015-10-24 18:15:57 284

原创 hdu 4764 Stone

StoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1156 Accepted Submission(s): 807Problem DescriptionTang and Jiang are go

2015-10-22 12:16:57 401

原创 hdu 4768 Flyer 二分

FlyerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2159 Accepted Submission(s): 792Problem DescriptionThe new semester begi

2015-10-22 00:00:29 296

原创 poj 2154 Color 波利亚定理欧拉函数快速幂线性筛

ColorTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8789 Accepted: 2860DescriptionBeads of N colors are connected together into a circular necklace of

2015-10-18 23:48:03 360

原创 poj 2409 Let it Bead Polya波利亚定理

Let it BeadTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5054 Accepted: 3362Description"Let it Bead" company is located upstairs at 700 Cannery Row in

2015-10-18 00:11:33 421

原创 poj 1721 CARDS 洗牌机

CARDSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1684 Accepted: 877DescriptionAlice and Bob have a set of N cards labelled with numbers 1 ... N (so

2015-10-17 10:14:40 365

原创 POJ 1026 Cipher 置换群

CipherTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20540 Accepted: 5604DescriptionBob and Alice started to use a brand-new encoding scheme. Surprisin

2015-10-15 12:43:18 305

原创 POJ 2369 Permutations 置换群

PermutationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2834 Accepted: 1505DescriptionWe remind that the permutation of some final set is a one-to-o

2015-10-13 09:26:14 367

原创中国剩余定理 /孙子定理

1.若gcd(m,M)=1,则存在整数t，使得 t*M≡1(mod m) 存在t使得 t*M=1(mod m) 等价于 X*M+m*Y=1 有解这个在我写的拓展欧几里德里面已经详细证明过。2. 方程组 X=a[i](mod m[i]) (且对于i!=j，gcd(m[i],m[j])=1)的解为 X=∑a[i]*t[i]*M[i]+k*M(k∈Z)

2015-10-10 23:52:33 1435

原创拓展欧几里德

写这个也是为了自己更好的学习数学专题1.欧几里德算法作用：求两个数a和b的最大公约数。gcd(a,b)=gcd(b,a%b)我们可以看到,上式是将原来函数的第二个参数放到了第一个参数的位置，然后第二个参数的位置放上原来的第一个参数%原来第二参数。高中时学过一个辗转相除法。我们可以举个例子。求24和10的最大公约数：24 ÷ 10 = 2 ……4

2015-10-06 22:19:18 760

原创 uva 11754 Code Feat 中国剩余定理

题目：https://uva.onlinejudge.org/external/117/11754.pdf中国剩余定理和拓展欧几里德感觉还没弄清楚，只能套模板。这题这是照着书上的代码写的：#include#include#include#include#include#include#include#include#include#include#inclu

2015-10-02 00:25:34 437

原创 SEERC 2006 Subsequence，高效算法设计，LA 2678

题目：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=679详见注释：#include#include#include#include#include#include#include#include#inclu

2015-10-01 09:44:46 408

便纵有千种风情