Problem Set - graphs - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5840	P755E PolandBall and White-Red graph constructive algorithms graphs shortest paths *2400	0 / 0	9
	5826	P757F Team Rocket Rises Again data structures graphs shortest paths *2800	0 / 0	10
	5825	P757G Can Bash Save the Day? data structures divide and conquer graphs trees *3400	0 / 0	10
	5820	P758E Broken Tree dfs and similar dp graphs greedy trees *2600	0 / 0	10
	5812	P761E Dasha and Puzzle constructive algorithms dfs and similar graphs greedy trees *2000	0 / 0	7
	5805	P762F Tree nesting combinatorics graphs trees *2800	0 / 0	10
	5804	P763A Timofey and a tree dfs and similar dp dsu graphs implementation trees *1600	0 / 0	5
	5801	P763D Timofey and a flat tree data structures graphs hashing shortest paths trees *2900	0 / 0	10
	5787	P766D Mahmoud and a Dictionary data structures dfs and similar dp dsu graphs *2000	0 / 0	7
	5783	P767C Garland dfs and similar graphs greedy trees *2000	0 / 0	7
	5771	P769C Cycle In Maze special problem dfs and similar graphs greedy shortest paths 1700	0 / 0	5
	5767	P770C Online Courses In BSU special problem dfs and similar graphs implementation 1500	0 / 0	5
	5765	P771A Bear and Friendship Condition dfs and similar dsu graphs *1500	0 / 0	5
	5757	P772C Vulnerable Kerbals constructive algorithms dp graphs math number theory *2300	0 / 0	8
	5751	P773D Perishable Roads dp graphs shortest paths *2700	0 / 0	10
	5732	P776D The Door Problem 2-sat dfs and similar dsu graphs *2000	0 / 0	7
	5730	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	10
	5713	P780C Andryusha and Colored Balloons dfs and similar graphs greedy trees *1600	0 / 0	5
	5712	P780D Innokenty and a Football League 2-sat graphs greedy implementation shortest paths strings *1900	0 / 0	6
	5711	P780E Underground Lab constructive algorithms dfs and similar graphs *2100	0 / 0	7
	5710	P780F Axel and Marston in Bitland bitmasks dp graphs matrices *2400	0 / 0	9
	5694	P786B Legacy data structures graphs shortest paths *2300	0 / 0	8
	5691	P786E ALT data structures flows graphs trees *3200	0 / 0	10
	5687	P788B Weird journey combinatorics constructive algorithms dfs and similar dsu graphs *2100	0 / 0	7
	5686	P788C The Great Mixing dfs and similar graphs shortest paths *2300	0 / 0	8
	5673	P793B Igor and his way to work dfs and similar graphs implementation shortest paths *1600	0 / 0	5
	5671	P793D Presents in Bankopolis dp graphs shortest paths *2100	0 / 0	7
	5664	P794D Labelling Cities dfs and similar graphs hashing *2400	0 / 0	9
	5657	P796D Police Stations constructive algorithms dfs and similar dp graphs shortest paths trees *2100	0 / 0	7
	5644	P798E Mike and code of a permutation constructive algorithms data structures graphs sortings *3000	0 / 0	10
	5625	P802J Send the Fool Further! (easy) dfs and similar graphs trees *1400	0 / 0	4
	5621	P802N April Fools' Problem (medium) binary search flows graphs *2400	0 / 0	9
	5615	P803E Roma and Poker dp graphs *2000	0 / 0	7
	5607	P804F Fake bullions combinatorics dfs and similar dp graphs number theory *3400	0 / 0	10
	5597	P808F Card Game binary search flows graphs *2400	0 / 0	9
	5585	P811D Vladik and Favorite Game constructive algorithms dfs and similar graphs interactive *2100	0 / 0	7
	5584	P811E Vladik and Entertaining Flags data structures dsu graphs *2600	0 / 0	10
	5580	P812D Sagheer and Kindergarten dfs and similar graphs implementation trees *2700	0 / 0	10
	5576	P813C The Tag Game dfs and similar graphs *1700	0 / 0	5
	5573	P813F Bipartite Checking data structures dsu graphs *2500	0 / 0	9
	5568	P814E An unavoidable detour for home combinatorics dp graphs shortest paths *2600	0 / 0	10
	5548	P818G Four Melodies flows graphs *2600	0 / 0	10
	5543	P819E Mister B and Flight to the Moon constructive algorithms graphs *2800	0 / 0	10
	5537	P821D Okabe and City dfs and similar graphs shortest paths *2200	0 / 0	8
	5525	P825E Minimal Labels data structures dfs and similar graphs greedy *2300	0 / 0	8
	5523	P825G Tree Queries dfs and similar graphs trees *2500	0 / 0	9
	5519	P827D Best Edge Weight data structures dfs and similar graphs trees *2700	0 / 0	10
	5517	P827F Dirty Arkady's Kitchen data structures dp graphs shortest paths *3200	0 / 0	10
	5511	P830D Singer House combinatorics dp graphs trees *2800	0 / 0	10
	5510	P830E Perpetual Motion Machine constructive algorithms dp graphs implementation math trees *3100	0 / 0	10
	5503	P832D Misha, Grisha and Underground dfs and similar graphs trees *1900	0 / 0	6
	5489	P835F Roads in the Kingdom dfs and similar dp graphs trees *2500	0 / 0	9
	5473	P839C Journey dfs and similar dp graphs probabilities trees *1500	0 / 0	5
	5471	P839E Mother of Dragons brute force graphs math meet-in-the-middle *2700	0 / 0	10
	5469	P840B Leha and another game about graph constructive algorithms data structures dfs and similar dp graphs *2100	0 / 0	7
	5461	P842C Ilya And The Tree dfs and similar graphs math number theory trees *2000	0 / 0	7
	5459	P842E Nikita and game binary search dfs and similar divide and conquer graphs trees *2800	0 / 0	10
	5456	P843C Upgrading Tree constructive algorithms dfs and similar graphs math trees *2600	0 / 0	10
	5455	P843D Dynamic Shortest Path graphs shortest paths *3400	0 / 0	10
	5454	P843E Maximum Flow flows graphs *3000	0 / 0	10
	5445	P845G Shortest Path Problem? dfs and similar graphs math *2300	0 / 0	8
	5429	P847J Students Initiation binary search flows graphs *2400	0 / 0	9
	5427	P847L Berland SU Computer Network constructive algorithms dfs and similar graphs hashing trees *2400	0 / 0	9
	5422	P848D Shake It! combinatorics dp flows graphs *2900	0 / 0	10
	5415	P850D Tournament Construction constructive algorithms dp graphs greedy math *2800	0 / 0	10
	5402	P852I Dating brute force dfs and similar graphs trees *2300	0 / 0	8
	5388	P855G Harry Vs Voldemort dfs and similar dp graphs trees *3300	0 / 0	10
	5376	P858F Wizard's Tour constructive algorithms dfs and similar graphs *2300	0 / 0	8
	5371	P859E Desk Disorder combinatorics dfs and similar dsu graphs trees *2100	0 / 0	7
	5366	P862B Mahmoud and Ehab and the bipartiteness dfs and similar graphs trees *1300	0 / 0	4
	5359	P863C 1-2-3 graphs implementation *1800	0 / 0	6
	5336	P864F Cities Excursions dfs and similar graphs trees *2700	0 / 0	10
	5331	P865E Hex Dyslexia bitmasks brute force dp graphs *3300	0 / 0	10
	5323	P868E Policeman and a Tree dp graphs trees *2700	0 / 0	10
	5317	P869D The Overdosing Ubiquity brute force dfs and similar graphs *2800	0 / 0	10
	5311	P870E Points, Lines and Ready-made Titles dfs and similar dsu graphs trees *2300	0 / 0	8
	5309	P871E Restore the Tree graphs greedy trees *2900	0 / 0	10
	5300	P875C National Property 2-sat dfs and similar graphs implementation *2100	0 / 0	7
	5297	P875F Royal Questions dsu graphs greedy *2500	0 / 0	9
	5291	P877D Olya and Energy Drinks data structures dfs and similar graphs shortest paths *2100	0 / 0	7
	5286	P878C Tournament data structures graphs *2700	0 / 0	10
	5280	P883B Berland Army constructive algorithms graphs greedy *2600	0 / 0	10
	5275	P883G Orientation of Edges dfs and similar graphs *1900	0 / 0	6
	5263	P884F Anti-Palindromize flows graphs greedy *2500	0 / 0	9
	5259	P886D Restoration of string constructive algorithms graphs implementation *2000	0 / 0	7
	5245	P888F Connecting Vertices dp graphs *2500	0 / 0	9
	5240	P891C Envy data structures dsu graphs *2300	0 / 0	8
	5233	P893C Rumor dfs and similar graphs greedy *1300	0 / 0	4
	5225	P894E Ralph and Mushrooms dp graphs *2100	0 / 0	7
	5204	P899C Dividing the numbers constructive algorithms graphs math *1300	0 / 0	4
	5193	P901C Bipartite Segments binary search data structures dfs and similar dsu graphs two pointers *2300	0 / 0	8
	5192	P901D Weighting a Tree constructive algorithms dfs and similar graphs *2700	0 / 0	10
	5182	P903G Yet Another Maxflow Problem data structures flows graphs *2700	0 / 0	10
	5179	P906C Party bitmasks brute force dp graphs *2400	0 / 0	9
	5169	P908F New Year and Rainbow Roads graphs greedy implementation *2400	0 / 0	9
	5162	P909E Coprocessor dfs and similar dp graphs greedy *1900	0 / 0	6
	5152	P911F Tree Destruction constructive algorithms dfs and similar graphs greedy trees *2400	0 / 0	9
	5126	P912D Fishes data structures graphs greedy probabilities shortest paths *2100	0 / 0	7
	5119	P913F Strongly Connected Tournament dp graphs math probabilities *2800	0 / 0	10
	5105	P915D Almost Acyclic Graph dfs and similar graphs *2200	0 / 0	8

Pick a problem randomly based on the current filter.