graphs - 题库 - Boyacoding

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8316	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees	0 / 0	(无)
	8315	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths	0 / 0	(无)
	8271	P1792F1 Graph Coloring (easy version) dp graphs	0 / 0	(无)
	8270	P1792F2 Graph Coloring (hard version) brute force divide and conquer dp fft graphs	0 / 0	(无)
	8366	P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	8382	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy	0 / 0	(无)
	8381	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dsu graphs greedy	0 / 0	(无)
	8436	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	8426	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	8425	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	8459	P1809F Traveling in Berland binary search data structures graphs greedy implementation *2500	0 / 0	9
	8453	P1810E Monsters brute force data structures dfs and similar dsu graphs greedy *2100	0 / 0	7
	8582	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	8570	P1842D Tenzing and His Animal Friends constructive algorithms graphs greedy *1900	0 / 0	6
	8566	P1842H Tenzing and Random Real Numbers bitmasks dp graphs math probabilities *3000	0 / 0	10
	8559	P1843F1 Omsk Metro (simple version) data structures dfs and similar dp graphs greedy math trees *1800	0 / 0	6
	8553	P1844E Great Grids 2-sat constructive algorithms dfs and similar dsu graphs *2400	0 / 0	9
	8535	P1846G Rudolf and CodeVid-23 bitmasks dp graphs greedy shortest paths *1900	0 / 0	6
	8509	P1850H The Third Letter dfs and similar dsu graphs greedy implementation *1700	0 / 0	5
	8504	P1851E Nastya and Potions dfs and similar dp graphs sortings	0 / 0	(无)
	8502	P1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers	0 / 0	(无)
	8500	P1852B Imbalanced Arrays constructive algorithms graphs greedy math sortings two pointers *1800	0 / 0	6
	8619	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	8607	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	8602	P1860E Fast Travel Text Editor data structures dfs and similar graphs shortest paths	0 / 0	(无)
	8707	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	8705	P1863G Swaps combinatorics dp graphs math *2800	0 / 0	10
	8585	P1864I Future Dominators graphs greedy	0 / 0	(无)
	8700	P1866C Completely Searching for Inversions dfs and similar dp graphs *1900	0 / 0	6
	8692	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	8686	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation *1800	0 / 0	6
	8681	P1868B1 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math *1700	0 / 0	5
	8678	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	8666	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	8660	P1872F Selling a Menagerie dfs and similar dsu graphs implementation math *1800	0 / 0	6
	8651	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	8746	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths	0 / 0	(无)
	8745	P1874C Jellyfish and EVA dp graphs greedy math probabilities	0 / 0	(无)
	8735	P1876C Autosynthesis constructive algorithms dfs and similar graphs greedy sortings	0 / 0	(无)
	8734	P1876D Lexichromatography combinatorics dfs and similar dsu graphs two pointers	0 / 0	(无)
	8732	P1876F Indefinite Clownfish binary search graphs	0 / 0	(无)
	8639	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive math trees *2400	0 / 0	9
	8723	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees	0 / 0	(无)
	8774	P1887B Time Travel binary search graphs shortest paths	0 / 0	(无)
	8771	P1887E Good Colorings binary search constructive algorithms graphs interactive	0 / 0	(无)
	8765	P1889D Game of Stacks brute force dfs and similar graphs implementation trees	0 / 0	(无)
	8764	P1889E Doremy's Swapping Trees dfs and similar graphs trees	0 / 0	(无)
	8822	P1893A Anonymous Informant brute force dfs and similar graphs implementation *1400	0 / 0	4
	8818	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	8750	P1895E Infinite Card Game binary search data structures dfs and similar dp games graphs greedy sortings two pointers	0 / 0	(无)
	8795	P1899F Alex's whims constructive algorithms graphs greedy shortest paths trees *1600	0 / 0	5
	8857	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	8789	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	8850	P1902F Trees and XOR Queries Again data structures dfs and similar graphs implementation math trees *2400	0 / 0	9
	8843	P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
	8922	P1904E Tree Queries data structures dfs and similar graphs implementation trees *2500	0 / 0	9
	8921	P1904F Beautiful Tree data structures dfs and similar graphs implementation trees *2800	0 / 0	10
	8823	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	8887	P1912H Hypercatapult Commute graphs *2400	0 / 0	9
	8878	P1913E Matrix Problem flows graphs *2400	0 / 0	9
	8869	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	8868	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	9022	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	9021	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	9003	P1923E Count Paths data structures dfs and similar dp dsu graphs trees	0 / 0	(无)
	8986	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(无)
	8980	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	8974	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	8968	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	8951	P1931F Chat Screenshots combinatorics dfs and similar graphs *1700	0 / 0	5
	8943	P1932G Moving Platforms graphs math number theory shortest paths	0 / 0	(无)
	8937	P1933F Turtle Mission: Robot and the Earthquake dfs and similar dp graphs shortest paths	0 / 0	(无)
	8933	P1936C Pokémon Arena data structures graphs shortest paths	0 / 0	(无)
	9045	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	9032	P1948C Arrow Path dfs and similar dp graphs shortest paths	0 / 0	3
	9030	P1948E Clique Partition constructive algorithms graphs greedy implementation	0 / 0	5
	9137	P1949G Scooter graphs greedy	0 / 0	(无)
	9135	P1949I Disks dfs and similar geometry graph matchings graphs	0 / 0	(无)
	9134	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(无)
	9126	P1950G Shuffling Songs bitmasks dfs and similar dp graphs hashing implementation strings *1900	0 / 0	6
	9117	P1951I Growing Trees binary search constructive algorithms flows graphs greedy *3200	0 / 0	10
	9085	P1956F Nene and the Passing Game constructive algorithms data structures dsu graphs sortings *3000	0 / 0	10
	9241	P1958I Equal Trees special problem graphs meet-in-the-middle 3100	0 / 0	10
	9191	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers	0 / 0	(无)
	9184	P1968D Permutation Game brute force dfs and similar games graphs math	0 / 0	(无)
	9220	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	9219	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees *2400	0 / 0	9
	9211	P1971H ±1 2-sat dfs and similar graphs *2100	0 / 0	7
	9331	P1977E Tensor constructive algorithms graphs interactive *2600	0 / 0	10
	9325	P1978F Large Graph data structures dfs and similar dsu graphs number theory two pointers *2400	0 / 0	9
	9319	P1979F Kostyanych's Theorem brute force constructive algorithms graphs interactive *2900	0 / 0	10
	9311	P1980G Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs greedy strings trees *2300	0 / 0	8
	9307	P1981D Turtle and Multiplication constructive algorithms dfs and similar graphs number theory *2400	0 / 0	9
	9306	P1981E Turtle and Intersected Segments data structures dsu graphs greedy *2600	0 / 0	10
	9275	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation *1700	0 / 0	5
	9268	P1986F Non-academic Problem dfs and similar graphs trees *1900	0 / 0	6
	9250	P1989F Simultaneous Coloring dfs and similar divide and conquer graphs *3000	0 / 0	10
	9397	P1991D Prime XOR Coloring bitmasks constructive algorithms graphs greedy math number theory	0 / 0	(无)
	9396	P1991E Coloring Game constructive algorithms games graphs greedy interactive	0 / 0	(无)
	9368	P1994D Funny Game constructive algorithms dsu graphs greedy math number theory trees	0 / 0	(无)

根据当前过滤条件随机选择一道题