Problem Set - graphs - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	672	P1777E Edge Reverse binary search dfs and similar graphs trees *2200	0 / 0	8
	665	P1778F Maximizing Root dfs and similar dp graphs math number theory trees *2600	0 / 0	10
	660	P1779E Anya's Simultaneous Exhibition constructive algorithms graphs greedy interactive sortings *2400	0 / 0	9
	658	P1779G The Game of the Century constructive algorithms graphs shortest paths *3000	0 / 0	10
	636	P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	622	P1787D Game on Axis combinatorics dfs and similar dsu graphs implementation *1900	0 / 0	6
	611	P1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees *2500	0 / 0	9
	599	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	598	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	584	P1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	10
	583	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	565	P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	558	P1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	3
	532	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy strings *1400	0 / 0	4
	531	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dfs and similar dsu graphs greedy strings *1500	0 / 0	5
	525	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	515	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	514	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	508	P1805D A Wide, Wide Graph dfs and similar dp graphs greedy trees *1800	0 / 0	6
	477	P1809F Traveling in Berland binary search data structures graphs greedy implementation *2500	0 / 0	9
	471	P1810E Monsters brute force data structures dfs and similar dsu graphs greedy *2100	0 / 0	7
	462	P1811F Is It Flower? dfs and similar graphs implementation *2100	0 / 0	7
	442	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7
	441	P1815C Between constructive algorithms dfs and similar graphs greedy *2200	0 / 0	8
	438	P1815F OH NO1 (-2-3-4) constructive algorithms graphs math *3500	0 / 0	10
	434	P1817B Fish Graph brute force constructive algorithms dfs and similar graphs *1900	0 / 0	6
	408	P1822F Gardening Friends brute force dfs and similar dp graphs trees *1700	0 / 0	5
	401	P1823E Removing Graph brute force dp games graphs math *2500	0 / 0	9
	400	P1823F Random Walk dp graphs math probabilities trees *2600	0 / 0	10
	387	P1826E Walk the Runway bitmasks brute force data structures dp graphs implementation sortings *2400	0 / 0	9
	372	P1829E The Lakes dfs and similar dsu graphs implementation *1100	0 / 0	3
	371	P1829F Forever Winter dfs and similar graphs math *1300	0 / 0	4
	368	P1830A Copil Copac Draws Trees dfs and similar dp graphs trees *1400	0 / 0	4
	349	P1833E Round Dance dfs and similar dsu graphs shortest paths *1600	0 / 0	5
	337	P1835D Doctor's Brown Hypothesis dfs and similar graphs math number theory *2900	0 / 0	10
	335	P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10
	310	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	298	P1842D Tenzing and His Animal Friends constructive algorithms graphs greedy *1900	0 / 0	6
	294	P1842H Tenzing and Random Real Numbers bitmasks dp graphs math probabilities *3000	0 / 0	10
	287	P1843F1 Omsk Metro (simple version) data structures dfs and similar dp graphs greedy math trees *1800	0 / 0	6
	281	P1844E Great Grids 2-sat constructive algorithms dfs and similar dsu graphs *2400	0 / 0	9
	263	P1846G Rudolf and CodeVid-23 bitmasks dp graphs greedy shortest paths *1900	0 / 0	6
	237	P1850H The Third Letter dfs and similar dsu graphs greedy implementation *1700	0 / 0	5
	232	P1851E Nastya and Potions dfs and similar dp graphs sortings *1500	0 / 0	5
	230	P1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers *2000	0 / 0	7
	228	P1852B Imbalanced Arrays constructive algorithms graphs greedy math sortings two pointers *1800	0 / 0	6
	200	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	188	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	183	P1860E Fast Travel Text Editor data structures dfs and similar graphs shortest paths *2400	0 / 0	9
	164	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	162	P1863G Swaps combinatorics dp graphs math *2800	0 / 0	10
	151	P1864I Future Dominators graphs greedy *3500	0 / 0	10
	148	P1866C Completely Searching for Inversions dfs and similar dp graphs *1900	0 / 0	6
	140	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	134	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation *1800	0 / 0	6
	129	P1868B1 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math *1700	0 / 0	5
	126	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	114	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	108	P1872F Selling a Menagerie dfs and similar dsu graphs implementation math *1800	0 / 0	6
	99	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	97	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths *2400	0 / 0	9
	96	P1874C Jellyfish and EVA dp graphs greedy math probabilities *2300	0 / 0	8
	86	P1876C Autosynthesis constructive algorithms dfs and similar graphs greedy sortings *2100	0 / 0	7
	85	P1876D Lexichromatography combinatorics dfs and similar dsu graphs two pointers *2500	0 / 0	9
	83	P1876F Indefinite Clownfish binary search graphs *3500	0 / 0	10
	68	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive trees *2400	0 / 0	9
	61	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees *1700	0 / 0	5
	34	P1887B Time Travel binary search graphs shortest paths *1900	0 / 0	6
	31	P1887E Good Colorings binary search constructive algorithms graphs interactive *3100	0 / 0	10
	25	P1889D Game of Stacks brute force dfs and similar graphs implementation trees *3000	0 / 0	10
	24	P1889E Doremy's Swapping Trees dfs and similar graphs trees *3500	0 / 0	10
	14	P1893A Anonymous Informant brute force dfs and similar graphs implementation *1400	0 / 0	4
	10	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	3	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
	5066	P1899F Alex's whims constructive algorithms graphs shortest paths trees	0 / 0	(None)
	5345	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	5135	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	6620	P1902F Trees and XOR Queries Again data structures dfs and similar divide and conquer graphs implementation math trees *2400	0 / 0	9
	5337	P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
	6705	P1904E Tree Queries data structures dfs and similar graphs implementation trees *2500	0 / 0	9
	6704	P1904F Beautiful Tree data structures dfs and similar graphs implementation trees *2800	0 / 0	10
	6600	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	6670	P1912H Hypercatapult Commute graphs *2400	0 / 0	9
	6661	P1913E Matrix Problem flows graphs *2400	0 / 0	9
	6652	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	6651	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	6644	P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
	6638	P1916F Group Division constructive algorithms dfs and similar graphs greedy *2900	0 / 0	10
	8202	P1918F Caterpillar on a Tree data structures dfs and similar dp graphs greedy implementation sortings trees *2500	0 / 0	9
	8195	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	8194	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	8926	P1923E Count Paths data structures dfs and similar dp dsu graphs trees	0 / 0	(None)
	8918	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	8912	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	8906	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	8900	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	8883	P1931F Chat Screenshots combinatorics dfs and similar graphs *1700	0 / 0	5
	8875	P1932G Moving Platforms graphs math number theory shortest paths	0 / 0	(None)
	8869	P1933F Turtle Mission: Robot and the Earthquake dfs and similar dp graphs shortest paths	0 / 0	(None)
	8853	P1936C Pokémon Arena data structures graphs greedy implementation shortest paths sortings	0 / 0	(None)

Pick a problem randomly based on the current filter.