graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8597	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	8592	P1860E Fast Travel Text Editor data structures dfs and similar graphs shortest paths	0 / 0	(None)
	8693	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers	0 / 0	(None)
	8691	P1863G Swaps combinatorics dp graphs math	0 / 0	(None)
	8637	P1864I Future Dominators graphs greedy	0 / 0	(None)
	8686	P1866C Completely Searching for Inversions dfs and similar dp graphs	0 / 0	(None)
	8678	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees	0 / 0	(None)
	8672	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation	0 / 0	(None)
	8667	P1868B1 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math	0 / 0	(None)
	8664	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees	0 / 0	(None)
	8741	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	8654	P1872F Selling a Menagerie dfs and similar dsu graphs implementation math	0 / 0	(None)
	8733	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	8731	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths	0 / 0	(None)
	8730	P1874C Jellyfish and EVA dp graphs greedy math probabilities	0 / 0	(None)
	8768	P1876C Autosynthesis constructive algorithms dfs and similar graphs greedy sortings	0 / 0	(None)
	8767	P1876D Lexichromatography combinatorics dfs and similar dsu graphs two pointers	0 / 0	(None)
	8765	P1876F Indefinite Clownfish binary search graphs	0 / 0	(None)
	8711	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive trees *2400	0 / 0	9
	8756	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees	0 / 0	(None)

Pick a problem randomly based on the current filter.