The next topic planning to do is Searching.
There are some basic searching method need to get familiar with.
Breath First Search, Depth First Search
A*, IDA*, Bi-directional BFS
Progress: (1/11)
DFS *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1011
BFS: http://acm.pku.edu.cn/JudgeOnline/problem?id=1324
BFS: http://acm.pku.edu.cn/JudgeOnline/problem?id=2044
BFS: http://acm.pku.edu.cn/JudgeOnline/problem?id=2286
IDA*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1945
A*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2449
Reference: http://acm.pku.edu.cn/JudgeOnline/showcontest?contest_id=1144
DFS + prune: http://acm.pku.edu.cn/JudgeOnline/problem?id=1190
Search: http://acm.pku.edu.cn/JudgeOnline/problem?id=1084
DFS: http://acm.pku.edu.cn/JudgeOnline/problem?id=2989
Search: http://acm.pku.edu.cn/JudgeOnline/problem?id=1167
Search: http://acm.pku.edu.cn/JudgeOnline/problem?id=1069
20070927
20070922
New ACM Season
The new ACM Season has been started.
This is my last time to join this competition, I am trying to forget everything and focus on ACM this semester.
Guys, pray for me. I want to go World Final, once only, but not more.
Here is the list I am planning to finish it this month (still have many other problems need to solve next month).
Progress (11/18)
Euler graph *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2337
Cut Edge: http://acm.pku.edu.cn/JudgeOnline/problem?id=3177
2-connected Component *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2942
Min degree bounded ST: http://acm.pku.edu.cn/JudgeOnline/problem?id=1639
Min Ratio ST *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2728
SP *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=3013
Difference Constraint *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1275
Bellman-Ford *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1252
Network Flow *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1459
Network Flow: http://acm.pku.edu.cn/JudgeOnline/problem?id=2391
Bipartite Matching *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1325
Bipartite Matching *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2226
Weighted Matching *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2195
Weighted Matching: http://acm.pku.edu.cn/JudgeOnline/problem?id=2516
Least Common Ancester: http://acm.pku.edu.cn/JudgeOnline/problem?id=1986
2-SAT *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2723
Reference: http://home.ustc.edu.cn/~zhuhcheng/ACM/2-SAT.PPT
2-SAT: http://acm.pku.edu.cn/JudgeOnline/problem?id=2749
Minimum Spanning Arborescence: http://acm.pku.edu.cn/JudgeOnline/problem?id=3164
Reference: Chu-Liu-Edmonds algorithm
This is my last time to join this competition, I am trying to forget everything and focus on ACM this semester.
Guys, pray for me. I want to go World Final, once only, but not more.
Here is the list I am planning to finish it this month (still have many other problems need to solve next month).
Progress (11/18)
Euler graph *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2337
Cut Edge: http://acm.pku.edu.cn/JudgeOnline/problem?id=3177
2-connected Component *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2942
Min degree bounded ST: http://acm.pku.edu.cn/JudgeOnline/problem?id=1639
Min Ratio ST *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2728
SP *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=3013
Difference Constraint *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1275
Bellman-Ford *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1252
Network Flow *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1459
Network Flow: http://acm.pku.edu.cn/JudgeOnline/problem?id=2391
Bipartite Matching *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=1325
Bipartite Matching *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2226
Weighted Matching *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2195
Weighted Matching: http://acm.pku.edu.cn/JudgeOnline/problem?id=2516
Least Common Ancester: http://acm.pku.edu.cn/JudgeOnline/problem?id=1986
2-SAT *DONE*: http://acm.pku.edu.cn/JudgeOnline/problem?id=2723
Reference: http://home.ustc.edu.cn/~zhuhcheng/ACM/2-SAT.PPT
2-SAT: http://acm.pku.edu.cn/JudgeOnline/problem?id=2749
Minimum Spanning Arborescence: http://acm.pku.edu.cn/JudgeOnline/problem?id=3164
Reference: Chu-Liu-Edmonds algorithm
Subscribe to:
Posts (Atom)