graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2097	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	(None)
	2090	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	0 / 0	(None)
	2070	P1250E The Coronation graphs implementation *2300	0 / 0	(None)
	2064	P1250K Projectors flows graphs *3100	0 / 0	(None)
	2061	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	(None)
	2042	P1252L Road Construction flows graphs *2300	0 / 0	(None)
	2038	P1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	(None)
	2036	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	(None)
	2028	P1255B Fridge Lockers graphs implementation *1100	0 / 0	(None)
	2003	P1263D Secret Passwords dfs and similar dsu graphs *1500	0 / 0	(None)
	2001	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	(None)
	1987	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	(None)
	1985	P1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	(None)
	1983	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	(None)
	1967	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(None)
	1957	P1270G Subset with Zero Sum constructive algorithms dfs and similar graphs math *2700	0 / 0	(None)
	1944	P1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	(None)
	1933	P1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	(None)
	1922	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	(None)
	1911	P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.