trees - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4221	P1214E Petya and Construction Set constructive algorithms graphs math sortings trees *2000	0 / 0	7
	4218	P1214H Tiles Placement constructive algorithms dfs and similar trees *2800	0 / 0	10
	4199	P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	10
	4183	P1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	8
	4169	P1223E Paint the Tree dp sortings trees *2100	0 / 0	7
	4160	P1225F Tree Factory constructive algorithms greedy trees *2500	0 / 0	9
	4144	P1228F One Node is Gone constructive algorithms implementation trees *2500	0 / 0	9
	4112	P1238F The Maximum Subtree dfs and similar dp graphs trees *2200	0 / 0	8
	4092	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	6
	4085	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	1 / 1	6
	4070	P1249F Maximum Weight Subset dp trees *2200	0 / 0	8
	4041	P1252B Cleaning Robots dp trees *2300	0 / 0	8
	4037	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	4033	P1252F Regular Forestation hashing trees *2400	0 / 0	9
	4010	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	9
	4000	P1254D Tree Queries data structures probabilities trees *2700	0 / 0	10
	3997	P1254E Send Tree to Charlie combinatorics dfs and similar dsu trees *3300	0 / 0	10
	3953	P1260F Colored Tree data structures trees *2700	0 / 0	10
	3940	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3817	P1276D Tree Elimination dp trees *2900	0 / 0	10
	3800	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	7
	3798	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	8
	3777	P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	7
	3775	P1280D Miss Punyverse dp greedy trees *2500	1 / 1	9
	3747	P1283F DIY Garland constructive algorithms greedy trees *2200	0 / 0	8
	3740	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	10
	3732	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3729	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3723	P1286B Numbers on Tree constructive algorithms data structures dfs and similar graphs greedy trees *1800	0 / 0	6
	3680	P1292C Xenon's Attack on the Gangs combinatorics dfs and similar dp greedy trees *2300	0 / 0	8
	3679	P1292D Chaotic V. dp graphs greedy math number theory trees *2700	0 / 0	10
	3666	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	7
	3642	P1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	7
	3625	P1297E Modernization of Treeland *special problem dfs and similar trees	0 / 0	(None)
	3617	P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	10
	3591	P1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	10
	3586	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3580	P1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	6
	3570	P1307F Cow and Vacation dfs and similar dsu trees *3300	0 / 0	10
	3547	P1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	8
	3503	P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3487	P1322F Assigning Fares dp trees *3500	0 / 0	10
	3476	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	3473	P1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	5
	3452	P1326G Spiderweb Trees dp geometry trees *3500	0 / 0	10
	3433	P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	6
	3393	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	9
	3361	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	5
	3355	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	10
	3351	P1338B Edge Weight Assignment bitmasks constructive algorithms dfs and similar greedy math trees *1800	0 / 0	6
	3349	P1338D Nested Rubber Bands constructive algorithms dfs and similar dp math trees *2700	0 / 0	10
	3342	P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	10
	3321	P1344E Train Tracks data structures trees *3100	0 / 0	10
	3212	P1361D Johnny and James greedy implementation math trees *2900	0 / 0	10
	3211	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	10
	3204	P1363C Game On Leaves games trees *1600	0 / 0	5
	3202	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	3197	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	1 / 1	7
	3168	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	10
	3162	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	3154	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	3153	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	3119	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	3112	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	3105	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	8
	3098	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	3094	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	3092	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	3080	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	8
	3074	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	3073	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	9
	3069	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	6
	3068	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	3060	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	3055	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	10
	3036	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	1 / 3	10
	3027	P1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	10
	3013	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	3012	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	3000	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	6
	2995	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	10
	2993	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2990	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	6
	2982	P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	5
	2970	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	9
	2968	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	10
	2947	P1413F Roads and Ramen data structures trees *2800	0 / 0	10
	2938	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2937	P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	10
	2899	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	10
	2866	P1427F Boring Card Game data structures greedy trees *3200	0 / 0	10
	2826	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	6
	2820	P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	5
	2817	P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	10
	2811	P1438F Olha and Igor interactive probabilities trees *3000	0 / 0	10
	2805	P1439E Cheat and Win bitmasks data structures games trees *3500	0 / 0	10
	2798	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2788	P1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	10
	2783	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2769	P1450G Communism bitmasks dp trees *3500	0 / 0	10

Pick a problem randomly based on the current filter.