data structures - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4251	P1209H Moving Walkways data structures greedy math *3300	0 / 0	10
	4232	P1213B Bad Prices data structures implementation *1100	0 / 0	3
	4227	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	0 / 0	7
	4223	P1214C Bad Sequence data structures greedy *1200	0 / 0	4
	4219	P1214G Feeling Good bitmasks data structures *3200	0 / 0	10
	4205	P1216F Wi-Fi data structures dp greedy *2100	0 / 0	7
	4200	P1217E Sum Queries? data structures greedy implementation math *2300	0 / 0	8
	4199	P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	10
	4197	P1218B Guarding warehouses data structures geometry *3000	0 / 0	10
	4193	P1218F Workout plan data structures greedy *1500	0 / 0	5
	4182	P1220F Gardener Alex binary search data structures *2700	0 / 0	10
	4175	P1221F Choose a Square binary search data structures sortings *2400	0 / 0	9
	4168	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	10
	4155	P1227D1 Optimal Subsequences (Easy Version) data structures greedy *1600	0 / 0	5
	4154	P1227D2 Optimal Subsequences (Hard Version) data structures greedy *1800	0 / 0	6
	4137	P1234B2 Social Network (hard version) data structures implementation *1300	0 / 0	4
	4135	P1234D Distinct Characters Queries data structures *1600	0 / 0	5
	4129	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	8
	4128	P1236E Alice and the Unfair Game binary search data structures dp dsu *2500	0 / 0	9
	4125	P1237B Balanced Tunnel data structures sortings two pointers *1300	0 / 0	4
	4122	P1237D Balanced Playlist binary search data structures implementation *2000	0 / 0	7
	4119	P1237G Balanced Distribution data structures dp greedy *3500	0 / 0	10
	4111	P1238G Adilbek and the Watering System data structures greedy sortings *2700	0 / 0	10
	4108	P1239C Queue in the Train data structures greedy implementation *2300	0 / 0	8
	4072	P1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	6
	4067	P1250C Trip to Saint Petersburg data structures *2100	0 / 0	7
	4050	P1251E1 Voting (Easy Version) data structures dp greedy *2300	0 / 0	8
	4047	P1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	9
	4039	P1252C Even Path data structures implementation *1600	0 / 0	5
	4037	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	4032	P1252G Performance Review data structures *2100	0 / 0	7
	4023	P1252K Addition Robot data structures math matrices *2100	0 / 0	7
	4011	P1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	8
	4000	P1254D Tree Queries data structures probabilities trees *2700	0 / 0	10
	3972	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	3969	P1257E The Contest data structures dp greedy *2000	0 / 0	7
	3953	P1260F Colored Tree data structures trees *2700	0 / 0	10
	3941	P1263E Editor data structures implementation *2100	0 / 0	7
	3940	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3933	P1264C Beautiful Mirrors with queries data structures probabilities *2400	0 / 0	9
	3921	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	4
	3919	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	7
	3911	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	3909	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	7
	3874	P1268C K Integers binary search data structures *2300	0 / 0	8
	3851	P1270H Number of Components data structures *3300	0 / 0	10
	3841	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	7
	3819	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	8
	3808	P1277D Let's Play the Words? data structures hashing implementation math *1900	0 / 0	6
	3801	P1278C Berry Jam data structures dp greedy implementation *1700	0 / 0	5
	3800	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	7
	3789	P1279C Stack of Presents data structures implementation *1400	0 / 0	4
	3757	P1282E The Cake Is a Lie constructive algorithms data structures dfs and similar graphs *2400	0 / 0	9
	3752	P1283C Friends and Gifts constructive algorithms data structures math *1500	0 / 0	5
	3745	P1284B New Year and Ascent Sequence binary search combinatorics data structures dp implementation sortings *1400	0 / 0	4
	3743	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	7
	3740	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	10
	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
	3717	P1286D LCC data structures math matrices probabilities *3100	0 / 0	10
	3715	P1286E Fedya the Potter Strikes Back data structures strings *3200	0 / 0	10
	3711	P1287B Hyperset brute force data structures implementation *1500	0 / 0	5
	3703	P1288E Messenger Simulator data structures *2000	0 / 0	7
	3699	P1290A Mind Control brute force data structures implementation *1600	0 / 0	5
	3697	P1290B Irreducible Anagrams binary search constructive algorithms data structures strings two pointers *1800	0 / 0	6
	3691	P1290E Cartesian Tree data structures *3300	0 / 0	10
	3682	P1292A NEKO's Maze Game data structures dsu implementation *1400	0 / 0	4
	3669	P1294D MEX maximizing data structures greedy implementation math *1600	0 / 0	5
	3658	P1295E Permutation Separation data structures divide and conquer *2200	0 / 0	8
	3650	P1296C Yet Another Walking Robot data structures implementation *1500	0 / 0	5
	3645	P1296E2 String Coloring (hard version) data structures dp *2000	0 / 0	7
	3624	P1297F Movie Fan *special problem data structures greedy implementation sortings	0 / 0	(None)
	3621	P1297I Falling Blocks *special problem data structures	0 / 0	(None)
	3618	P1299C Water Balance data structures geometry greedy *2100	0 / 0	7
	3609	P1301E Nanosoft binary search data structures dp implementation *2500	0 / 0	9
	3605	P1302C Segment tree or Fenwick? data structures	0 / 0	(None)
	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
	3585	P1304F1 Animal Observation (easy version) data structures dp *2300	0 / 0	8
	3584	P1304F2 Animal Observation (hard version) data structures dp greedy *2400	0 / 0	9
	3572	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	6
	3567	P1310A Recommendations data structures greedy sortings *1700	0 / 0	5
	3545	P1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	6
	3536	P1312G Autocompletion data structures dfs and similar dp *2600	0 / 0	10
	3533	P1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	5
	3532	P1313C2 Skyscrapers (hard version) data structures dp greedy *1900	0 / 0	6
	3530	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	3513	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	10
	3512	P1320A Journey Planning data structures dp greedy math sortings *1400	0 / 0	4
	3508	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3505	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	9
	3503	P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3496	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3490	P1322E Median Mountain Range data structures *3300	0 / 0	10
	3479	P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	3
	3478	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	4
	3458	P1326E Bombs data structures two pointers *2400	0 / 0	9
	3445	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	9
	3425	P1329C Drazil Likes Heap constructive algorithms data structures greedy implementation *2400	0 / 0	9
	3423	P1329D Dreamoon Likes Strings constructive algorithms data structures *3100	0 / 0	10

Pick a problem randomly based on the current filter.