![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
搜索
sigh_
这个作者很懒,什么都没留下…
展开
-
CodeForces_590C Three States(BFS)
Three States time limit per test:5 seconds memory limit per test:512 megabytes Problem Description The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all me原创 2020-08-10 16:37:31 · 116 阅读 · 0 评论 -
POJ_1011 Sticks(搜索)
Sticks Time Limit: 1000MS Memory Limit: 10000K Problem Description George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many stick原创 2020-07-30 20:08:53 · 124 阅读 · 0 评论 -
CodeForces_1354E Graph Coloring(DFS+动态规划)
Graph Coloring time limit per test:2 seconds memory limit per test:256 megabytes Problem Description You are given an undirected graph without self-loops or multiple edges which consists of n vertices and m edges. Also you are given three integers n1n_1n1原创 2020-05-18 11:08:22 · 358 阅读 · 0 评论 -
SGU_142 Keyword(hash)
Keyword Time limit per test: 0.5 sec. Memory limit: 16384 KB Problem Description Kevin has invented a new algorithm to crypt and decrypt messages, which he thinks is unbeatable. The algorithm uses a ...原创 2020-04-24 10:15:51 · 143 阅读 · 0 评论 -
UVA_10748 Knights Roaming(搜索)
题意 有n个棋子,棋子在(x,y)(x,y)(x,y)时可以移动至(x±2,y±1)(x\pm2,y\pm1)(x±2,y±1)或(x±1,y±2)(x\pm1,y\pm2)(x±1,y±2)。棋盘无限大,每个棋子允许移动的步数不同,第i个棋子允许移动ki步,棋盘上共有多少个不同的位置能被棋子到达。 题解: n≤30,ki≤50n\le30,k_i\le50n≤30,ki≤50,每个棋子允许移动...原创 2020-04-14 12:44:11 · 74 阅读 · 0 评论