搜索
Lost_in_wine
QDU创新实验室
展开
-
POJ 3083 Children of the Candy Corn
Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9890 Accepted: 4295DescriptionThe cornfield maze is a popular Halloween treat.原创 2014-10-26 21:07:25 · 391 阅读 · 0 评论 -
1053. Path of Equal Weight (30) DFS
1053. Path of Equal Weight (30)时间限制10 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a non-empty tree with root R, an原创 2015-12-03 09:07:22 · 374 阅读 · 0 评论 -
1034. Head of a Gang (30) (并查集 或者 DFS)
1034. Head of a Gang (30)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueOne way that the police finds the head of a原创 2015-11-30 20:12:30 · 424 阅读 · 0 评论 -
1021. Deepest Root (25) DFS
1021. Deepest Root (25)时间限制1500 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA graph which is connected and acyclic can b原创 2015-11-29 13:30:24 · 272 阅读 · 0 评论 -
1018. Public Bike Management (30) (SPFA + DFS)
1018. Public Bike Management (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThere is a public bike service in H原创 2015-11-29 00:49:32 · 347 阅读 · 0 评论 -
POJ 1330 Nearest Common Ancestors(LCA 可以用ST算法 NlogN 或者简单搜索)
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22747 Accepted: 11884DescriptionA rooted tree is a well-known data structure i原创 2015-11-12 17:54:59 · 435 阅读 · 0 评论 -
2015 南阳理工CCPC Ancient Go
Ancient GoTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld & %lluSubmit Status Practice UESTC 1221DescriptionYu Zhou likes to play Go with Su Lu. From the histor原创 2015-10-27 01:02:51 · 780 阅读 · 0 评论 -
HDOJ 4771 Stealing Harry Potter's Precious(bfs + 状态压缩)
Stealing Harry Potter's PreciousTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2619 Accepted Submission(s): 1195Problem Descriptio原创 2015-10-27 19:31:20 · 371 阅读 · 0 评论 -
2015南阳理工CCPC Sudoku
SudokuTime Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Submit StatusYi Sima was one of the best counselors of Cao Cao. He likes to play a funny原创 2015-10-27 16:37:06 · 703 阅读 · 0 评论 -
1013. Battle Over Cities (25)
1013. Battle Over Cities (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIt is vitally important to have all the原创 2015-10-09 11:39:44 · 326 阅读 · 0 评论 -
N 皇后的两种做法
#include #include const int N = 40;int cnt, n;bool visc[N], visl[N], visr[N];void search(int cur) { if (cur == n) { cnt++; return ; } for (int i = 0; i < n; i++) { if (!visc[i] && !v原创 2015-05-15 16:28:40 · 419 阅读 · 0 评论 -
1049. Counting Ones (30) (搜索)
1049. Counting Ones (30)时间限制10 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe task is simple: given any positive intege原创 2015-12-02 21:15:58 · 369 阅读 · 0 评论