graphs - Problem Set - FJNU

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	993	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	(None)
	976	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	(None)
	968	P1482F Useful Edges graphs shortest paths *2400	0 / 0	(None)
	962	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	(None)
	954	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(None)
	950	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	(None)
	948	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	922	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	(None)
	904	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	(None)
	903	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	(None)
	900	P1495C Garden of the Sun constructive algorithms graphs *2300	0 / 0	(None)
	899	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	(None)
	897	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	(None)
	890	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	(None)
	884	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	(None)
	883	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(None)
	875	P1499G Graph Coloring data structures graphs interactive *3100	0 / 0	(None)
	861	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(None)
	844	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	(None)
	840	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	(None)
	832	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	(None)
	831	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	(None)
	823	P1510K King's Task brute force graphs implementation *1200	0 / 0	(None)
	819	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	(None)
	805	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	(None)
	798	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)
	792	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(None)
	791	P1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	(None)
	785	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	(None)
	780	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	(None)
	777	P1517G Starry Night Camping constructive algorithms flows graphs *3300	0 / 0	(None)
	771	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	(None)
	762	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	(None)
	726	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	(None)
	718	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	(None)
	693	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
	691	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	687	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	(None)
	685	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	(None)
	684	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(None)
	683	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(None)
	681	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	(None)
	670	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	(None)
	662	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(None)
	648	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	(None)
	647	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(None)
	629	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(None)
	626	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(None)
	613	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
	612	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	(None)
	607	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
	605	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	599	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	589	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	(None)
	587	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
	577	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	(None)
	575	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	(None)
	562	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	(None)
	556	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(None)
	554	P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	(None)
	544	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
	540	P1559C Mocha and Hiking constructive algorithms graphs *1200	0 / 0	(None)
	539	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
	538	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
	512	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)
	505	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	499	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(None)
	488	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	485	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	(None)
	477	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)
	475	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
	460	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	(None)
	450	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	(None)
	444	P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	(None)
	441	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	(None)
	435	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	(None)
	432	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	(None)
	419	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
	410	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(None)
	402	P1585G Poachers dp games graphs trees *2500	0 / 0	(None)
	400	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	(None)
	397	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	(None)
	381	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)
	362	P1599I Desert data structures graphs *2700	0 / 0	(None)
	356	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	(None)
	324	P1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	(None)
	319	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	(None)
	318	P1608D Dominoes combinatorics fft graphs math number theory *2400	0 / 0	(None)
	311	P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	(None)
	301	P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	(None)
	278	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	(None)
	268	P1615C Menorah brute force graphs greedy math *1600	0 / 0	(None)
	267	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	(None)
	266	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)
	263	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
	257	P1616F Tricolor Triangles brute force graphs math matrices *2900	0 / 0	(None)
	256	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	(None)
	249	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	(None)
	219	P1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	(None)
	200	P1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.