Some Basic graph and backtracking problems on CF

Правка en12, от AlRntn, 2024-07-02 18:50:24

Here are Some easy to intermediate codeforces graph and backtracking problems this problems normally only use some basic knowledge of graphs/trees + basic algorithms , I hope it helps

1944A - Destroying Bridges rate : 800 -> basic of graphs [Very Simple]

1598A - Computer Game rate : 800 -> not so much graph [Very Simple]

1797A - Li Hua and Maze rate : 800 -> not so much graph + edge cases [Very Simple]

1843C - Sum in Binary Tree rate : 800 -> not so much graph or tree [Very Simple]

939A - Love Triangle rate : 800 -> can be solved with graph or not [Very Simple]

115A - Party and 116C - Party rate : 900 -> bfs [Simple]

500A - New Year Transportation rate : 1000 -> dfs [Simple]

727A - Transformation: from A to B rate : 1000 -> backtracking / dfs [Simple]

476A - Dreamoon and Stairs rate : 1000 -> backtracking + some optimization [Simple]

1020B - Badge rate : 1000 -> dfs [Simple]

122A - Lucky Division rate : 1000 -> backtracking [Simple]

1324C - Frog Jumps rate : 1100 -> not so much graph but can be solved with dfs [Very Simple]

445A - DZY Loves Chessboard rate : 1200 -> can be solved with dfs [Simple(simpler than it's rating)]

217A - Ice Skating rate : 1200 -> dfs [Simple/Intermediate]

893C - Rumor rate : 1300 -> dfs [Simple]

476B - Dreamoon and WiFi rate : 1300 -> backtracking [Simple]

1638C - Inversion Graph rate : 1300 -> creativity [Simple/Intermediate]

1970C1 - Game on Tree (Easy) rate : 1300 -> trees + dfs/bfs [Simple/Intermediate]

96B - Lucky Numbers (easy) rate : 1300 -> backtracking [Simple]

1143C - Queen rate : 1400 -> trees + you can use dfs/bfs [Simple]

520B - Two Buttons rate : 1400 -> bfs [Simple/Intermediate]

580C - Kefa and Park rate : 1500 -> trees + dfs/bfs [Intermediate]

977E - Cyclic Components rate : 1500 -> dfs [Intermediate]

377A - Maze rate : 1600 -> bfs [Intermediate]

601A - The Two Routes rate : 1600 -> bfs / matrix [Intermediate/Hard]

1363C - Game On Leaves rate : 1600 -> trees / some edge cases only [Simple/Intermediate]

1144F - Graph Without Long Directed Paths rate : 1700 -> bipartite graphs [Intermediate/Hard]

28- 1093D - Beautiful Graph rate : 1700 -> bipartite graphs [Intermediate/Hard]

29- 1970C2 - Game on Tree (Medium) rate : 1700 -> a little hard + dfs/bfs [Intermediate/Hard]

Теги graphs, dfs/bfs, backtracking, #backtracking, #graph, #dfs

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en13 Английский AlRntn 2024-07-03 19:36:45 8
en12 Английский AlRntn 2024-07-02 18:50:24 165
en11 Английский AlRntn 2024-06-30 14:10:11 93
en10 Английский AlRntn 2024-06-29 20:25:49 93
en9 Английский AlRntn 2024-06-29 11:25:00 76 just added a backtracking problem 96B (rating 1300)
en8 Английский AlRntn 2024-06-27 08:12:30 0 (published)
en7 Английский AlRntn 2024-06-26 20:56:01 12 Tiny change: 'rces graph/backtracki' -> 'rces graph and backtracki'
en6 Английский AlRntn 2024-06-26 20:54:03 2 Tiny change: '[problem:416B] rate :' -> '[problem:476B] rate :'
en5 Английский AlRntn 2024-06-26 20:52:58 12 Tiny change: ')]\n\n13- Ice Skating [problem:' -> ')]\n\n13- [problem:'
en4 Английский AlRntn 2024-06-26 20:51:27 410
en3 Английский AlRntn 2024-06-26 20:48:44 104
en2 Английский AlRntn 2024-06-26 20:47:50 57 (saved to drafts)
en1 Английский AlRntn 2024-06-26 20:46:48 2312 Initial revision (published)