graphs - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4603	P1146C Tree Diameter bitmasks graphs interactive *1700	0 / 0	5
	4599	P1146G Zoning Restrictions dp flows graphs *2700	0 / 0	10
	4597	P1147A Hide and Seek graphs *1500	0 / 0	5
	4594	P1147D Palindrome XOR dfs and similar graphs *2400	0 / 0	9
	4585	P1148G Gold Experience constructive algorithms graphs math number theory probabilities *3300	0 / 0	10
	4580	P1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	10
	4579	P1149E Election Promises games graphs *3200	0 / 0	10
	4566	P1152E Neko and Flashback constructive algorithms dfs and similar graphs *2400	0 / 0	9
	4545	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	10
	4538	P1156G Optimizer graphs greedy hashing implementation *2700	0 / 0	10
	4527	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	7
	4512	P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	9
	4511	P1163F Indecisive Taxi Fee data structures graphs shortest paths *3000	0 / 0	10
	4498	P1166F Vicky's Delivery Service data structures dsu graphs hashing *2400	0 / 0	9
	4495	P1167C News Distribution dfs and similar dsu graphs *1400	0 / 0	4
	4484	P1169B Pairs graphs implementation *1500	0 / 0	5
	4477	P1170G Graph Decomposition *special problem graphs	0 / 0	(None)
	4460	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	9
	4449	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	6
	4448	P1176E Cover it! dfs and similar dsu graphs shortest paths trees *1700	0 / 0	5
	4436	P1178H Stock Exchange binary search flows graphs *3500	0 / 0	10
	4412	P1183E Subsequences (easy version) dp graphs implementation shortest paths *2000	0 / 0	7
	4404	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	8
	4397	P1184E1 Daleks' Invasion (easy) graphs trees *1900	0 / 0	6
	4396	P1184E2 Daleks' Invasion (medium) dfs and similar graphs shortest paths trees *2100	0 / 0	7
	4395	P1184E3 Daleks' Invasion (hard) data structures dsu graphs trees *2400	0 / 0	9
	4381	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	9
	4374	P1187G Gang Up flows graphs *2500	0 / 0	9
	4321	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	7
	4319	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	9
	4310	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	8
	4305	P1201E1 Knightmare (easy) graphs interactive shortest paths *2900	0 / 0	10
	4304	P1201E2 Knightmare (hard) graphs interactive shortest paths *3000	0 / 0	10
	4287	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	5
	4282	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	6
	4257	P1209D Cow and Snacks dfs and similar dsu graphs *1700	0 / 0	5
	4254	P1209F Koala and Notebook data structures dfs and similar graphs shortest paths strings trees *2600	0 / 0	10
	4250	P1210A Anadi and Domino brute force graphs *1700	0 / 0	5
	4247	P1210D Konrad and Company Evaluation graphs *2400	0 / 0	9
	4237	P1211F kotlinkotlinkotlinkotlin... special problem graphs implementation strings 2300	0 / 0	8
	4234	P1211I Unusual Graph special problem graphs 3000	0 / 0	10
	4227	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	0 / 0	7
	4226	P1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	6
	4221	P1214E Petya and Construction Set constructive algorithms graphs math sortings trees *2000	0 / 0	7
	4201	P1217D Coloring Edges constructive algorithms dfs and similar graphs *2100	0 / 0	7
	4199	P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	10
	4198	P1218A BubbleReactor dp graphs *2800	0 / 0	10
	4195	P1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	9
	4192	P1218G Alpha planetary system constructive algorithms graphs shortest paths *3000	0 / 0	10
	4183	P1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	8
	4153	P1227E Arson In Berland Forest binary search graphs graphs shortest paths *2200	0 / 0	8
	4146	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	6
	4127	P1236F Alice and the Cactus dfs and similar graphs math probabilities *3000	0 / 0	10
	4112	P1238F The Maximum Subtree dfs and similar dp graphs trees *2200	0 / 0	8
	4107	P1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	9
	4105	P1239F Swiper, no swiping! graphs implementation *3400	0 / 0	10
	4104	P1240F Football graphs *3100	0 / 0	10
	4102	P1242B 0-1 MST dfs and similar dsu graphs sortings *1900	0 / 0	6
	4101	P1242C Sum Balance bitmasks dfs and similar dp graphs *2400	0 / 0	9
	4099	P1242E Planar Perimeter constructive algorithms graphs *3200	0 / 0	10
	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
	4065	P1250E The Coronation graphs implementation *2300	0 / 0	8
	4059	P1250K Projectors flows graphs *3100	0 / 0	10
	4056	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	7
	4021	P1252L Road Construction flows graphs *2300	0 / 0	8
	4013	P1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	5
	4010	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	9
	3993	P1255B Fridge Lockers graphs implementation *1100	0 / 0	3
	3944	P1263D Secret Passwords dfs and similar dsu graphs *1500	0 / 0	5
	3940	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3911	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	3907	P1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	10
	3871	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	10
	3854	P1270G Subset with Zero Sum constructive algorithms dfs and similar graphs math *2700	0 / 0	10
	3827	P1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	6
	3822	P1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	6
	3800	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	7
	3777	P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	7
	3757	P1282E The Cake Is a Lie constructive algorithms data structures dfs and similar graphs *2400	0 / 0	9
	3750	P1283D Christmas Trees graphs greedy shortest paths *1800	0 / 0	6
	3740	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	10
	3739	P1284G Seollal graphs *3300	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
	3696	P1290C Prefix Enlightenment dfs and similar dsu graphs *2400	0 / 0	9
	3693	P1290D Coffee Varieties (hard version) constructive algorithms graphs interactive *3000	0 / 0	10
	3683	P1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	10
	3679	P1292D Chaotic V. dp graphs greedy math number theory trees *2700	0 / 0	10
	3646	P1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	6
	3617	P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	10
	3610	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	7
	3608	P1301F Super Jaber dfs and similar graphs implementation shortest paths *2600	0 / 0	10
	3587	P1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	6
	3577	P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	10
	3572	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	6
	3569	P1307G Cow and Exercise flows graphs shortest paths *3100	0 / 0	10
	3561	P1310D Tourism dp graphs probabilities *2300	0 / 0	8
	3518	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 1	7
	3509	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	5

Pick a problem randomly based on the current filter.