graphs - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2752	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2746	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	10
	2729	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2721	P1482F Useful Edges graphs shortest paths *2400	0 / 0	9
	2715	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	8
	2707	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2703	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	5
	2701	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2675	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	10
	2657	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	9
	2656	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	10
	2653	P1495C Garden of the Sun constructive algorithms graphs *2300	0 / 0	8
	2652	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	10
	2650	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	10
	2643	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	9
	2637	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	8
	2636	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	2628	P1499G Graph Coloring data structures graphs interactive *3100	0 / 0	10
	2614	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	10
	2597	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2593	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2585	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	10
	2584	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	10
	2576	P1510K King's Task brute force graphs implementation *1200	0 / 0	4
	2572	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	5
	2558	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	2551	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	10
	2545	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	10
	2544	P1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	10
	2538	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	2533	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	6
	2530	P1517G Starry Night Camping constructive algorithms flows graphs *3300	0 / 0	10
	2524	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	10
	2515	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	2479	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	9
	2471	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2454	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(无)
	2452	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(无)
	2448	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	4
	2446	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	8
	2445	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	9
	2444	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	10
	2442	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	10
	2431	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	8
	2423	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	2409	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	4
	2408	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	8
	2390	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	2387	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	2374	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	7
	2373	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	4
	2368	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	10
	2366	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	2360	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	2350	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	5
	2348	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	2338	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	2336	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	2323	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	10
	2317	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	9
	2315	P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	10
	2305	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	2301	P1559C Mocha and Hiking constructive algorithms graphs *1200	0 / 0	4
	2300	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	4
	2299	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	9
	2273	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	10
	2266	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	10
	2260	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	10
	2249	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	2246	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	2238	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	2236	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	10
	2221	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	10
	2211	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	10
	2205	P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	4
	2202	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	5
	2196	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	10
	2193	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	4
	2180	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	2171	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	10
	2163	P1585G Poachers dp games graphs trees *2500	0 / 0	9
	2161	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	10
	2158	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	5
	2142	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	5
	2123	P1599I Desert data structures graphs *2700	0 / 0	10
	2117	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	6
	2085	P1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	8
	2080	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	5
	2079	P1608D Dominoes combinatorics fft graphs math number theory *2400	0 / 0	9
	2072	P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	5
	2062	P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	10
	2039	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	7
	2029	P1615C Menorah brute force graphs greedy math *1600	0 / 0	5
	2028	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	2027	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	9
	2024	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	2018	P1616F Tricolor Triangles brute force graphs math matrices *2900	0 / 0	10
	2017	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	10
	2010	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1980	P1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	10

根据当前过滤条件随机选择一道题