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): 196 Problem Description 若一个正整数A，相邻位总是满足低位大于等于高位，

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 28704   Accepted: 11898   Special Judge Description Given a positive integer n, write a

Fliptile Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 8632   Accepted: 3230 Description Farmer John knows that an intellectually satisfied cow is a happ

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

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

N皇后问题 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21710    Accepted Submission(s): 9709 Problem 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): 6204 Problem Description 　　给定一个m × n (m行, n列)

C. Andryusha and Colored Balloons time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Andryusha goes through a

The Pilots Brothers' refrigerator Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 24732   Accepted: 9535   Special Judge Description The game “The Pilo

Flip Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 41219   Accepted: 17896 Description Flip 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 Counting Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 30099   Accepted: 15044 Description Due to recent rains, water has pooled in various places i

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

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

Description The 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): 9378 Problem Description 有N个比赛队（1

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

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

Shredding Company Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 5657   Accepted: 3175 Description You 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则单组。 本来网上写做这题要有八境界，把代码写八遍