trees - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2555	CF1534D Lost Tree constructive algorithms interactive trees *1800	0 / 0	(None)
2550	CF1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	(None)
2545	CF1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(None)
2544	CF1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	(None)
2510	CF1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(None)
2473	CF1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
2449	CF1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
2430	CF1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(None)
2418	CF1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	(None)
2417	CF1555F Good Graph data structures dsu graphs trees *2700	0 / 0	(None)
2391	CF1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
2389	CF1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
2363	CF1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
2315	CF1575E Eye-Pleasing City Park Tour data structures trees *2600	0 / 0	(None)
2310	CF1575I Illusions of the Desert data structures trees *2300	0 / 0	(None)
2278	CF1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	(None)
2276	CF1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
2261	CF1583B Omkar and Heavenly Tree constructive algorithms trees *1200	0 / 0	(None)
2258	CF1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
2254	CF1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	(None)
2241	CF1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	(None)
2239	CF1585G Poachers dp games graphs trees *2500	0 / 0	(None)
2233	CF1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	(None)
2232	CF1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	(None)
2222	CF1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	(None)
2214	CF1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	(None)
2167	CF1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	(None)
2159	CF1606F Tree Queries brute force dp trees *2800	0 / 0	(None)
2142	CF1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	(None)
2138	CF1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	(None)
2125	CF1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	(None)
2123	CF1610I Mashtali vs AtCoder games trees *3100	0 / 0	(None)
2119	CF1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	(None)
2118	CF1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	(None)
2117	CF1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	(None)
2089	CF1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	(None)
2088	CF1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)
2069	CF1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	(None)
2036	CF1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	(None)
2022	CF1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	(None)
2010	CF1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	(None)
2009	CF1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	(None)
2008	CF1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	(None)
2003	CF1626E Black and White Tree dfs and similar greedy trees *2400	0 / 0	(None)
1998	CF1627C Not Assigning constructive algorithms dfs and similar number theory trees *1400	0 / 0	(None)
1988	CF1628E Groceries in Meteor Town binary search data structures dsu trees *3100	0 / 0	(None)
1971	CF1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(None)
1970	CF1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	(None)
1963	CF1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	(None)
1962	CF1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
1942	CF1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	(None)
1901	CF1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	(None)
1887	CF1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	(None)
1865	CF1654D Potion Brewing Class dfs and similar math number theory trees *2100	0 / 0	(None)
1862	CF1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	(None)
1854	CF1656E Equal Tree Sums constructive algorithms dfs and similar math trees *2200	0 / 0	(None)
1843	CF1657F Words on Tree 2-sat dfs and similar dsu graphs trees *2600	0 / 0	(None)
1829	CF1659F Tree and Permutation Game dfs and similar games graphs trees *3000	0 / 0	(None)
1816	CF1661E Narrow Components brute force data structures dp dsu math trees *2500	0 / 0	(None)
1807	CF1662G Gastronomic Event dp greedy trees	0 / 0	(None)
1797	CF1663A Who Tested? *special problem expression parsing trees	0 / 0	(None)
1786	CF1665C Tree Infection binary search greedy sortings trees *1600	0 / 0	(None)
1773	CF1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	(None)
1766	CF1667D Edge Elimination constructive algorithms dfs and similar dp trees *2900	0 / 0	(None)
1748	CF1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	(None)
1740	CF1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	(None)
1709	CF1675D Vertical Paths graphs implementation trees *1300	0 / 0	(None)
1707	CF1675F Vlad and Unfinished Business dfs and similar dp greedy trees *1800	0 / 0	(None)
1698	CF1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	(None)
1673	CF1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	(None)
1666	CF1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	(None)
1662	CF1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	(None)
1661	CF1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	(None)
1628	CF1689C Infected Tree dfs and similar dp trees *1600	0 / 0	(None)
1611	CF1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	(None)
1600	CF1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	(None)
1589	CF1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	(None)
1588	CF1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	(None)
1581	CF1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	(None)
1566	CF1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	(None)
1538	CF1702G1 Passable Paths (easy version) dfs and similar trees *1900	0 / 0	(None)
1537	CF1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	(None)
1505	CF1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	(None)
1501	CF1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	(None)
1500	CF1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	(None)
1490	CF1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	(None)
1489	CF1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	(None)
1485	CF1710D Recover the Tree constructive algorithms trees *3400	0 / 0	(None)
1474	CF1712F Triameter binary search data structures dfs and similar trees *3200	0 / 0	(None)
1461	CF1714F Build a Tree and That Is It constructive algorithms implementation trees *1900	0 / 0	(None)
1460	CF1714G Path Prefixes binary search data structures dfs and similar trees *1700	0 / 0	(None)
1434	CF1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	(None)
1424	CF1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	(None)
1423	CF1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	(None)
1417	CF1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	(None)
10452	CF1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	(None)
10448	CF1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	(None)
10447	CF1725J Journey dp trees *2500	0 / 0	(None)
10439	CF1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	(None)
10357	CF1738D Permutation Addicts constructive algorithms data structures dfs and similar dsu graphs trees *1900	0 / 0	(None)

Lucky

Pick a problem randomly based on the current filter.

Categories

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

Status

Development

Support

About

Categories

Status

Development

Support

About

Don't have an account?

SIGN IN