kyoma的博客

#include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;const int N = 1000;int zx[N], zy[N];int gx[N]

奶奶的有一天mirror58229提起一道dfs题 还是我们学校oj的，她说写的很麻烦 我就凑过去看，啊！这么标准的dfs究竟哪里会麻烦了呢？ 。 。 。 。 于是就自己写了。。。 真的好麻烦啊！！！ TLE到WA到TLE。。。。 去网上搜题解都说要dfs走一步bfs一下，奶奶的好麻烦啊！！ 我就是不想写bfs啊！！！ 另外一个方法（当前结果已为最长，若此时搜索的第一个字比当

问题 A: Unhappy sion时间限制: 1 Sec  内存限制: 128 MB提交: 335  解决: 153[提交][状态][讨论版]题目描述After 2rd ccpc,UNCLE RAN give sion a task,sion have to set 10 questions for this contest.But as a acm fan,

递增数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 921    Accepted Submission(s): 196Problem Description若一个正整数A，相邻位总是满足低位大于等于高位，

Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28704 Accepted: 11898 Special JudgeDescriptionGiven a positive integer n, write a

FliptileTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8632 Accepted: 3230DescriptionFarmer John knows that an intellectually satisfied cow is a happ

Shredding CompanyTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 679    Accepted Submission(s): 222Problem DescriptionYou have j

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 116519    Accepted Submission(s): 31594Problem DescriptionThe

N皇后问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21710    Accepted Submission(s): 9709Problem Description在N*N的方格棋盘放置了N个皇后，使得

逃离迷宫Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25424    Accepted Submission(s): 6204Problem Description　　给定一个m × n (m行, n列)

C. Andryusha and Colored Balloonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha goes through a

The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24732 Accepted: 9535 Special JudgeDescriptionThe game “The Pilo

Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41219 Accepted: 17896DescriptionFlip game is played on a rectangular 4x4 field with two-sided

问题 D: LCM and Walk时间限制: 1 Sec 内存限制: 128 MB提交: 7 解决: 4[提交][状态][讨论版]题目描述Jerry has just learned some number theory, and can't wait to show his ability to Tom.Now Jerry is sitting on a grid

Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30099 Accepted: 15044DescriptionDue to recent rains, water has pooled in various places i

/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃＼○／ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include #include #include #include #include #include

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 36938 Accepted: 18203Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编

DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid

确定比赛名次Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23153    Accepted Submission(s): 9378Problem Description有N个比赛队（1

/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃＼○／ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include #include #include #include #include #include

Ancient GoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1660    Accepted Submission(s): 528Problem DescriptionYu Zhou likes to

Shredding CompanyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5657 Accepted: 3175DescriptionYou have just been put in charge of developing a new sh

用了dfs模版写居然wa了。。。抓狂。。。。两道拓扑排序都和我有仇。。。还以为自己写错了。。。。看了好几遍还是没啥问题。。。结果居然。。。这题的m可能等于0.。。。。我的判断是m＝＝0的话就停止输入。。。呵呵。。。代码：#include #include #include #include #include #include #include #inclu

专题链接A:Eight经典的八数码问题，这题直接bfs是不行的，时限不够，主要是在每个状态判重的时候使用map，在这里的复杂度可以通过康托展开来达到查重O（1），那么！什么是康托展开呢？！ 我觉得这个博客写的很好，总之康托展开用来看当前状态中在全排列中是第几个，可以把问题的全部状态不用map来表示 这题hdu是多组样例输入，poj则单组。 本来网上写做这题要有八境界，把代码写八遍