trees - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3914	CF1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	(None)
3908	CF1297E Modernization of Treeland *special problem dfs and similar trees	0 / 0	(None)
3899	CF1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	(None)
3871	CF1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	(None)
3865	CF1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	(None)
3859	CF1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	(None)
3847	CF1307F Cow and Vacation dfs and similar dsu trees *3300	0 / 0	(None)
3833	CF1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	(None)
3803	CF1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	(None)
3793	CF1322F Assigning Fares dp trees *3500	0 / 0	(None)
3784	CF1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(None)
3781	CF1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	(None)
3767	CF1326G Spiderweb Trees dp geometry trees *3500	0 / 0	(None)
3754	CF1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	(None)
3729	CF1332F Independent Set dfs and similar dp trees *2500	0 / 0	(None)
3705	CF1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	(None)
3698	CF1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	(None)
3694	CF1338B Edge Weight Assignment bitmasks constructive algorithms dfs and similar greedy math trees *1800	0 / 0	(None)
3692	CF1338D Nested Rubber Bands constructive algorithms dfs and similar dp math trees *2700	0 / 0	(None)
3684	CF1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	(None)
3661	CF1344E Train Tracks data structures trees *3100	0 / 0	(None)
3539	CF1361D Johnny and James greedy implementation math trees *2900	0 / 0	(None)
3538	CF1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(None)
3530	CF1363C Game On Leaves games trees *1600	0 / 0	(None)
3528	CF1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(None)
3521	CF1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(None)
3489	CF1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(None)
3483	CF1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
3474	CF1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
3473	CF1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(None)
3436	CF1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
3428	CF1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(None)
3420	CF1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	(None)
3411	CF1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
3407	CF1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
3405	CF1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
3392	CF1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(None)
3385	CF1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(None)
3384	CF1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	(None)
3380	CF1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	(None)
3378	CF1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
3370	CF1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(None)
3364	CF1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(None)
3343	CF1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(None)
3333	CF1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	(None)
3318	CF1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	(None)
3317	CF1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
3304	CF1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(None)
3297	CF1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	(None)
3295	CF1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(None)
3292	CF1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	(None)
3283	CF1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	(None)
3270	CF1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	(None)
3267	CF1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	(None)
3244	CF1413F Roads and Ramen data structures trees *2800	0 / 0	(None)
3234	CF1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(None)
3233	CF1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	(None)
3192	CF1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(None)
3154	CF1427F Boring Card Game data structures greedy trees *3200	0 / 0	(None)
3110	CF1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	(None)
3104	CF1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	(None)
3100	CF1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	(None)
3094	CF1438F Olha and Igor interactive probabilities trees *3000	0 / 0	(None)
3087	CF1439E Cheat and Win bitmasks data structures games trees *3500	0 / 0	(None)
3078	CF1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	(None)
3067	CF1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	(None)
3062	CF1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	(None)
3047	CF1450G Communism bitmasks dp trees *3500	0 / 0	(None)
3029	CF1452G Game On Tree data structures dfs and similar greedy trees *2700	0 / 0	(None)
3023	CF1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	(None)
3017	CF1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	(None)
3000	CF1458F Range Diameter Sum data structures trees *3500	0 / 0	(None)
2978	CF1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	(None)
2976	CF1464F My Beautiful Madness data structures trees *3500	0 / 0	(None)
2972	CF1466D 13th Labour of Heracles data structures greedy sortings trees *1500	0 / 0	(None)
2960	CF1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	(None)
2876	CF1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	(None)
2866	CF1481F AB Tree dp greedy trees *3100	0 / 0	(None)
2856	CF1482H Exam data structures string suffix structures trees *3400	0 / 0	(None)
2851	CF1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	(None)
2842	CF1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	(None)
2810	CF1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	(None)
2807	CF1491H Yuezheng Ling and Dynamic Tree data structures trees *3400	0 / 0	(None)
2789	CF1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(None)
2783	CF1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	(None)
2781	CF1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	(None)
2764	CF1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	(None)
2757	CF1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	(None)
2717	CF1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	(None)
2715	CF1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	(None)
2695	CF1511C Yet Another Card Deck brute force data structures implementation trees *1100	0 / 0	(None)
2664	CF1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(None)
2649	CF1517F Reunion combinatorics dp trees *3200	0 / 0	(None)
2641	CF1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	(None)
2626	CF1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
2621	CF1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	(None)
2596	CF1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	(None)
2594	CF1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(None)
2592	CF1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	(None)
2589	CF1528E Mashtali and Hagh Trees combinatorics dp trees *2900	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