trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8534	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	8526	P1844G Tree Weights bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees	0 / 0	(None)
	8508	P1847C Vampiric Powers, anyone? bitmasks brute force data structures dp greedy trees	0 / 0	(None)
	8631	P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy trees *2700	0 / 0	10
	8571	P1851F Lisa and the Martians bitmasks data structures greedy math sortings strings trees	0 / 0	(None)
	8570	P1851G Vlad and the Mountains data structures dsu graphs implementation sortings trees two pointers	0 / 0	(None)
	8626	P1854D Michael and Hotel binary search interactive trees *3000	0 / 0	10
	8617	P1856E1 PermuTree (easy version) dfs and similar dp trees *1800	0 / 0	6
	8616	P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	10
	8612	P1857D Strong Vertices math sortings trees *1300	0 / 0	4
	8609	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	8604	P1858E1 Rollbacks (Easy Version) brute force data structures dfs and similar trees *2500	0 / 0	9
	8603	P1858E2 Rollbacks (Hard Version) data structures interactive trees *2600	0 / 0	10
	8597	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	8701	P1861C Queries for the Array data structures dfs and similar implementation strings trees	0 / 0	(None)
	8690	P1863H Goldberg Machine 3 dp trees	0 / 0	(None)
	8689	P1863I Redundant Routes constructive algorithms dp trees	0 / 0	(None)
	8641	P1864E Guess Game bitmasks constructive algorithms data structures games math strings trees	0 / 0	(None)
	8678	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees	0 / 0	(None)
	8665	P1868C Travel Plan combinatorics dp implementation math trees	0 / 0	(None)

Pick a problem randomly based on the current filter.