graphs - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	351	P1779E Anya's Simultaneous Exhibition constructive algorithms graphs greedy interactive sortings *2400	0 / 0	9
	347	P1779G The Game of the Century constructive algorithms graphs shortest paths *3000	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
	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
	249	P1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	10
	247	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	221	P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	211	P1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	3
	171	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy strings *1400	0 / 0	4
	169	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dfs and similar dsu graphs greedy strings *1500	0 / 0	5
	160	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	145	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	144	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	138	P1805D A Wide, Wide Graph dfs and similar dp graphs greedy trees *1800	0 / 0	6
	86	P1809F Traveling in Berland binary search data structures graphs greedy implementation *2500	0 / 0	9
	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
	48	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7
	45	P1815C Between constructive algorithms dfs and similar graphs greedy *2200	0 / 0	8
	41	P1815F OH NO1 (-2-3-4) constructive algorithms graphs math *3500	0 / 0	10
	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)
	3632	P1823E Removing Graph games graphs	0 / 0	(None)
	3630	P1823F Random Walk graphs math probabilities	0 / 0	(None)
	9782	P1826E Walk the Runway bitmasks brute force data structures dp graphs implementation sortings	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
	9936	P1835D Doctor's Brown Hypothesis dfs and similar graphs math number theory *2900	0 / 0	10
	9934	P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10
	9856	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	9928	P1842D Tenzing and His Animal Friends constructive algorithms graphs greedy *1900	0 / 0	6
	9924	P1842H Tenzing and Random Real Numbers bitmasks dp graphs math probabilities *3000	0 / 0	10
	9917	P1843F1 Omsk Metro (simple version) data structures dfs and similar dp graphs greedy math trees *1800	0 / 0	6
	9911	P1844E Great Grids 2-sat constructive algorithms dfs and similar dsu graphs *2400	0 / 0	9
	9893	P1846G Rudolf and CodeVid-23 bitmasks dp graphs greedy shortest paths *1900	0 / 0	6
	9873	P1850H The Third Letter dfs and similar graphs greedy implementation	0 / 0	(None)
	9952	P1851E Nastya and Potions dfs and similar dp graphs sortings	0 / 0	(None)
	9950	P1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers	0 / 0	(None)
	9948	P1852B Imbalanced Arrays constructive algorithms graphs greedy math sortings two pointers *1800	0 / 0	6
	9982	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	9970	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	9965	P1860E Fast Travel Text Editor data structures dfs and similar graphs shortest paths	0 / 0	(None)
	10030	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers	0 / 0	(None)
	10028	P1863G Swaps combinatorics dp graphs math	0 / 0	(None)
	10017	P1864I Future Dominators graphs greedy	0 / 0	(None)
	10014	P1866C Completely Searching for Inversions dfs and similar dp graphs	0 / 0	(None)
	10067	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation	0 / 0	(None)
	10062	P1868B1 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math	0 / 0	(None)
	10061	P1868B2 Candy Party (Hard Version) bitmasks constructive algorithms dp graphs greedy implementation math	0 / 0	(None)
	10059	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees	0 / 0	(None)
	10123	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	10049	P1872F Selling a Menagerie dfs and similar dsu graphs implementation math	0 / 0	(None)
	10115	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	10113	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths	0 / 0	(None)
	10112	P1874C Jellyfish and EVA dp graphs greedy math probabilities	0 / 0	(None)
	10102	P1876C Autosynthesis constructive algorithms dfs and similar dp graphs trees	0 / 0	(None)
	10101	P1876D Lexichromatography combinatorics dfs and similar dsu graphs two pointers	0 / 0	(None)
	10099	P1876F Indefinite Clownfish binary search graphs	0 / 0	(None)
	10084	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive trees *2400	0 / 0	9
	10165	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees	0 / 0	(None)
	10150	P1887B Time Travel binary search graphs shortest paths	0 / 0	(None)
	10147	P1887E Good Colorings binary search constructive algorithms graphs interactive	0 / 0	(None)
	10141	P1889D Game of Stacks brute force dfs and similar graphs implementation trees	0 / 0	(None)
	10140	P1889E Doremy's Swapping Trees dfs and similar graphs trees	0 / 0	(None)
	10184	P1893A Anonymous Informant brute force dfs and similar graphs implementation *1400	0 / 0	4
	10180	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	10173	P1895E Infinite Card Game binary search brute force data structures dfs and similar dp dsu games graphs greedy sortings two pointers *2300	0 / 0	8
	10198	P1899F Alex's whims constructive algorithms graphs greedy shortest paths trees *1600	0 / 0	5
	10192	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	10186	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	10317	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	10244	P1912H Hypercatapult Commute graphs *2400	0 / 0	9
	10235	P1913E Matrix Problem flows graphs *2400	0 / 0	9
	10226	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	10225	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	10287	P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
	10281	P1916F Group Division constructive algorithms dfs and similar graphs greedy *2900	0 / 0	10
	10342	P1918F Caterpillar on a Tree dfs and similar graphs greedy implementation sortings trees *2500	0 / 0	9
	10263	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	10262	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	10326	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees	0 / 0	(None)
	10435	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	10418	P1931F Chat Screenshots combinatorics dfs and similar graphs *1700	0 / 0	5
	10410	P1932G Moving Platforms graphs math number theory shortest paths *2300	0 / 0	8
	10404	P1933F Turtle Mission: Robot and the Earthquake dfs and similar dp graphs shortest paths *2100	0 / 0	7
	10388	P1936C Pokémon Arena data structures graphs greedy implementation shortest paths sortings *2400	0 / 0	9
	10355	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	10466	P1944A Destroying Bridges graphs greedy math *800	0 / 0	3
	10352	P1948C Arrow Path dfs and similar dp graphs shortest paths shortest paths	0 / 0	(None)
	10350	P1948E Clique Partition binary search constructive algorithms graphs greedy	0 / 0	(None)
	10444	P1949G Scooter graphs greedy	0 / 0	(None)
	10442	P1949I Disks dfs and similar geometry graph matchings graphs	0 / 0	(None)
	10441	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(None)
	10515	P1950G Shuffling Songs bitmasks dfs and similar dp graphs hashing implementation strings	0 / 0	(None)
	10506	P1951I Growing Trees binary search constructive algorithms flows graphs greedy	0 / 0	(None)

Pick a problem randomly based on the current filter.