Problem Set - trees - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3638	codeforces#P1214E Petya and Construction Set constructive algorithms graphs math sortings trees *2000	0 / 0	7
	3635	codeforces#P1214H Tiles Placement constructive algorithms dfs and similar trees *2800	0 / 0	10
	3616	codeforces#P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	10
	3600	codeforces#P1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	8
	3586	codeforces#P1223E Paint the Tree dp sortings trees *2100	0 / 0	7
	3577	codeforces#P1225F Tree Factory constructive algorithms greedy trees *2500	0 / 0	9
	3561	codeforces#P1228F One Node is Gone constructive algorithms implementation trees *2500	0 / 0	9
	3529	codeforces#P1238F The Maximum Subtree dfs and similar dp graphs trees *2200	0 / 0	8
	3509	codeforces#P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	6
	3502	codeforces#P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	0 / 0	6
	3487	codeforces#P1249F Maximum Weight Subset dp trees *2200	0 / 0	8
	3464	codeforces#P1252B Cleaning Robots dp trees *2300	0 / 0	8
	3462	codeforces#P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	3460	codeforces#P1252F Regular Forestation hashing trees *2400	0 / 0	9
	3448	codeforces#P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	9
	3443	codeforces#P1254D Tree Queries data structures probabilities trees *2700	0 / 0	10
	3442	codeforces#P1254E Send Tree to Charlie combinatorics dfs and similar dsu trees *3300	0 / 0	10
	3420	codeforces#P1260F Colored Tree data structures trees *2700	0 / 0	10
	3413	codeforces#P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3351	codeforces#P1276D Tree Elimination dp trees *2900	0 / 0	10
	3342	codeforces#P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	7
	3341	codeforces#P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	8
	3331	codeforces#P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	7
	3330	codeforces#P1280D Miss Punyverse dp greedy trees *2500	0 / 0	9
	3314	codeforces#P1283F DIY Garland constructive algorithms greedy trees *2200	0 / 0	8
	3308	codeforces#P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	10
	3303	codeforces#P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3302	codeforces#P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3299	codeforces#P1286B Numbers on Tree constructive algorithms data structures dfs and similar graphs greedy trees *1800	0 / 0	6
	3274	codeforces#P1292C Xenon's Attack on the Gangs combinatorics dfs and similar dp greedy trees *2300	0 / 0	8
	3273	codeforces#P1292D Chaotic V. dp graphs greedy math number theory trees *2700	0 / 0	10
	3263	codeforces#P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	7
	3250	codeforces#P1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	7
	3245	codeforces#P1297E Modernization of Treeland *special problem dfs and similar trees	0 / 0	(None)
	3237	codeforces#P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	10
	3211	codeforces#P1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	10
	3206	codeforces#P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3200	codeforces#P1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	6
	3190	codeforces#P1307F Cow and Vacation dfs and similar dsu trees *3300	0 / 0	10
	3178	codeforces#P1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	8
	3150	codeforces#P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3141	codeforces#P1322F Assigning Fares dp trees *3500	0 / 0	10
	3133	codeforces#P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	3130	codeforces#P1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	5
	3118	codeforces#P1326G Spiderweb Trees dp geometry trees *3500	0 / 0	10
	3106	codeforces#P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	6
	3084	codeforces#P1332F Independent Set dfs and similar dp trees *2500	0 / 0	9
	3062	codeforces#P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	5
	3056	codeforces#P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	10
	3052	codeforces#P1338B Edge Weight Assignment bitmasks constructive algorithms dfs and similar greedy math trees *1800	0 / 0	6
	3050	codeforces#P1338D Nested Rubber Bands constructive algorithms dfs and similar dp math trees *2700	0 / 0	10
	3043	codeforces#P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	10
	3022	codeforces#P1344E Train Tracks data structures trees *3100	0 / 0	10
	2913	codeforces#P1361D Johnny and James greedy implementation math trees *2900	0 / 0	10
	2912	codeforces#P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	10
	2905	codeforces#P1363C Game On Leaves games trees *1600	0 / 0	5
	2903	codeforces#P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	2898	codeforces#P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	7
	2869	codeforces#P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	10
	2863	codeforces#P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	2855	codeforces#P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	2854	codeforces#P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	2820	codeforces#P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	2813	codeforces#P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	2806	codeforces#P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	8
	2799	codeforces#P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	2795	codeforces#P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	2793	codeforces#P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	2781	codeforces#P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	8
	2775	codeforces#P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	2774	codeforces#P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	9
	2770	codeforces#P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	6
	2769	codeforces#P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	2761	codeforces#P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	2756	codeforces#P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	10
	2737	codeforces#P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	10
	2728	codeforces#P1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	10
	2714	codeforces#P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	2713	codeforces#P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	2701	codeforces#P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	6
	2696	codeforces#P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	10
	2694	codeforces#P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2691	codeforces#P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	6
	2683	codeforces#P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	5
	2671	codeforces#P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	9
	2669	codeforces#P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	10
	2648	codeforces#P1413F Roads and Ramen data structures trees *2800	0 / 0	10
	2639	codeforces#P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2638	codeforces#P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	10
	2600	codeforces#P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	10
	2567	codeforces#P1427F Boring Card Game data structures greedy trees *3200	0 / 0	10
	2527	codeforces#P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	6
	2521	codeforces#P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	5
	2518	codeforces#P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	10
	2512	codeforces#P1438F Olha and Igor interactive probabilities trees *3000	0 / 0	10
	2506	codeforces#P1439E Cheat and Win bitmasks data structures games trees *3500	0 / 0	10
	2499	codeforces#P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2489	codeforces#P1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	10
	2484	codeforces#P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2470	codeforces#P1450G Communism bitmasks dp trees *3500	0 / 0	10

Pick a problem randomly based on the current filter.