dfs and similar - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1208	P1669G Fall Down dfs and similar implementation *1200	0 / 0	4
	1204	P1670C Where is the Pizza? data structures dfs and similar dsu graphs implementation math *1400	0 / 0	4
	1202	P1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	8
	1188	P1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	10
	1172	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
	1166	P1675F Vlad and Unfinished Business dfs and similar dp greedy trees *1800	0 / 0	6
	1158	P1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	4
	1153	P1677C Tokitsukaze and Two Colorful Tapes constructive algorithms dfs and similar graphs greedy *1900	0 / 0	6
	1143	P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	6
	1135	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	10
	1131	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	1129	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	1124	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	1114	P1684H Hard Cut constructive algorithms dfs and similar divide and conquer math *3400	0 / 0	10
	1107	P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	10
	1074	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	1071	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	1057	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	1056	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	1046	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	1032	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1030	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	1029	P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	0 / 0	10
	1019	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	10
	965	P1702E Split Into Two Sets dfs and similar dsu graphs *1600	0 / 0	5
	963	P1702G1 Passable Paths (easy version) dfs and similar trees *1900	0 / 0	6
	962	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	934	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8
	931	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
	930	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	10
	921	P1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	9
	906	P1712F Triameter binary search data structures dfs and similar trees *3200	0 / 0	10
	893	P1714G Path Prefixes binary search data structures dfs and similar trees *1700	0 / 0	5
	882	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	9
	855	P1721D Maximum AND bitmasks dfs and similar divide and conquer greedy sortings *1800	0 / 0	6
	854	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	853	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	847	P1722F L-shapes dfs and similar implementation *1700	0 / 0	5
	829	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	777	P1735C Phase Shift dfs and similar dsu graphs greedy implementation strings *1400	0 / 0	4
	755	P1738D Permutation Addicts constructive algorithms data structures dfs and similar dsu graphs trees *1900	0 / 0	6
	743	P1739D Reset K Edges binary search data structures dfs and similar graphs greedy trees *1900	0 / 0	6
	733	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	725	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees *1300	0 / 0	4
	720	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	673	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	639	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	637	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	612	P1753D The Beach constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	595	P1758E Tick, Tock combinatorics dfs and similar dsu graphs *2500	0 / 0	9
	566	P1760G SlavicG's Favorite Problem bitmasks dfs and similar graphs *1700	0 / 0	5
	561	P1761C Set Construction constructive algorithms dfs and similar graphs greedy *1400	0 / 0	4
	535	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
	525	P1764F Doremy's Experimental Tree brute force constructive algorithms dfs and similar dsu sortings trees *2500	0 / 0	9
	469	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy *1800	0 / 0	6
	458	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	456	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	441	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	413	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	401	P1775D Friendly Spiders dfs and similar graphs math number theory shortest paths *1800	0 / 0	6
	370	P1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees *1900	0 / 0	6
	369	P1777E Edge Reverse binary search dfs and similar graphs trees *2200	0 / 0	8
	360	P1778E The Tree Has Fallen! bitmasks dfs and similar math trees *2500	0 / 0	9
	358	P1778F Maximizing Root dfs and similar dp graphs math number theory trees *2600	0 / 0	10
	315	P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	299	P1787D Game on Axis combinatorics dfs and similar dsu graphs implementation *1900	0 / 0	6
	285	P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	283	P1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees *2500	0 / 0	9
	271	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	269	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	251	P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	9
	222	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	221	P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	213	P1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	9
	206	P1797D Li Hua and Tree brute force data structures dfs and similar dp implementation trees *1900	0 / 0	6
	203	P1797F Li Hua and Path data structures dfs and similar divide and conquer dsu trees *3000	0 / 0	10
	184	P1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math *2300	0 / 0	8
	180	P1799H Tree Cutting bitmasks dfs and similar dp *3200	0 / 0	10
	169	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dfs and similar dsu graphs greedy strings *1500	0 / 0	5
	166	P1800G Symmetree dfs and similar hashing implementation trees *2200	0 / 0	8
	145	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	138	P1805D A Wide, Wide Graph dfs and similar dp graphs greedy trees *1800	0 / 0	6
	137	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	8
	128	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	116	P1807F Bouncy Ball brute force dfs and similar implementation *1700	0 / 0	5
	77	P1810E Monsters brute force data structures dfs and similar dsu graphs greedy *2100	0 / 0	7
	61	P1811F Is It Flower? dfs and similar graphs implementation *2100	0 / 0	7
	45	P1815C Between constructive algorithms dfs and similar graphs greedy *2200	0 / 0	8
	9801	P1817B Fish Graph brute force constructive algorithms dfs and similar graphs *1900	0 / 0	6
	3	P1822F Gardening Friends brute force dfs and similar dp graphs implementation trees	0 / 0	(None)
	9791	P1824C LuoTianyi and XOR-Tree bitmasks data structures dfs and similar dp dsu greedy trees	0 / 0	(None)
	9819	P1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	10
	9818	P1827E Bus Routes binary search constructive algorithms dfs and similar greedy trees *3400	0 / 0	10
	9772	P1829D Gold Rush brute force dfs and similar dp implementation	0 / 0	(None)
	9771	P1829E The Lakes dfs and similar dsu graphs implementation	0 / 0	(None)
	9770	P1829F Forever Winter dfs and similar graphs math	0 / 0	(None)
	9847	P1830A Copil Copac Draws Trees dfs and similar dp graphs trees	0 / 0	(None)
	9835	P1833E Round Dance dfs and similar dsu graphs shortest paths *1600	0 / 0	5
	9833	P1833G Ksyusha and Chinchilla constructive algorithms dfs and similar dp dsu greedy implementation trees *1800	0 / 0	6
	9936	P1835D Doctor's Brown Hypothesis dfs and similar graphs math number theory *2900	0 / 0	10

Pick a problem randomly based on the current filter.