graphs - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	139	P1936C Pokémon Arena data structures graphs greedy implementation shortest paths sortings *2400	0 / 0	9
	106	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	88	P1944A Destroying Bridges graphs greedy math *800	0 / 0	3
	70	P1948C Arrow Path brute force constructive algorithms dfs and similar dp graphs shortest paths *1300	0 / 2	4
	68	P1948E Clique Partition brute force constructive algorithms graphs greedy implementation *2100	0 / 0	7
	59	P1949G Scooter graphs greedy	0 / 0	(无)
	57	P1949I Disks dfs and similar geometry graph matchings graphs	0 / 0	(无)
	56	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(无)
	48	P1950G Shuffling Songs bitmasks dfs and similar dp graphs hashing implementation strings *1900	0 / 0	6
	39	P1951I Growing Trees binary search constructive algorithms flows graphs greedy *3200	0 / 0	10
	8	P1956F Nene and the Passing Game constructive algorithms data structures dsu graphs sortings *3000	0 / 0	10
	9512	P1971H ±1 2-sat dfs and similar graphs *2100	0 / 0	7
	9505	P1973E Cat, Fox and Swaps graphs math sortings *2500	0 / 0	9
	9477	P1977E Tensor constructive algorithms graphs interactive *2600	0 / 0	10
	9471	P1978F Large Graph data structures dfs and similar dsu graphs number theory two pointers *2400	0 / 0	9
	9465	P1979F Kostyanych's Theorem brute force constructive algorithms graphs interactive *2900	0 / 0	10
	9457	P1980G Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs greedy strings trees *2300	0 / 0	8
	9453	P1981D Turtle and Multiplication constructive algorithms dfs and similar graphs number theory *2400	0 / 0	9
	9452	P1981E Turtle and Intersected Segments data structures dsu graphs greedy *2600	0 / 0	10
	9428	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation *1700	0 / 0	5
	9421	P1986F Non-academic Problem dfs and similar graphs	0 / 0	(无)

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