Problem Set - graphs - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5103	codeforces#P915F Imbalance Value of a Tree data structures dsu graphs trees *2400	0 / 0	9
	5099	codeforces#P916C Jamie and Interesting Graph constructive algorithms graphs shortest paths *1600	0 / 0	5
	5095	codeforces#P917B MADMAX dfs and similar dp games graphs *1700	0 / 0	5
	5086	codeforces#P919D Substring dfs and similar dp graphs *1700	0 / 0	5
	5084	codeforces#P919F A Game With Numbers games graphs shortest paths *2600	0 / 0	10
	5079	codeforces#P920E Connected Components? data structures dfs and similar dsu graphs *2100	0 / 0	7
	5044	codeforces#P923F Public Service constructive algorithms graphs trees *3200	0 / 0	10
	5018	codeforces#P928C Dependency management special problem graphs implementation 1900	0 / 0	6
	5016	codeforces#P930A Peculiar apple-tree dfs and similar graphs trees *1500	0 / 0	5
	4999	codeforces#P933C A Colourful Prospect geometry graphs *2700	0 / 0	10
	4987	codeforces#P936B Sleepy Game dfs and similar dp games graphs *2100	0 / 0	7
	4979	codeforces#P938D Buy a Ticket data structures graphs shortest paths *2000	0 / 0	7
	4976	codeforces#P938G Shortest Path Queries bitmasks data structures dsu graphs *2900	0 / 0	10
	4975	codeforces#P939A Love Triangle graphs *800	0 / 0	3
	4972	codeforces#P939D Love Rescue dfs and similar dsu graphs greedy strings *1600	0 / 0	5
	4956	codeforces#P948A Protect Sheep brute force dfs and similar graphs implementation *900	0 / 0	3
	4953	codeforces#P949C Data Center Maintenance dfs and similar graphs *1900	0 / 0	6
	4937	codeforces#P954D Fight Against Traffic dfs and similar graphs shortest paths *1600	0 / 0	5
	4920	codeforces#P958B2 Maximum Control (medium) data structures dfs and similar graphs greedy trees *2200	0 / 0	8
	4904	codeforces#P959E Mahmoud and Ehab and the xor-MST bitmasks dp graphs implementation math *1900	0 / 0	6
	4897	codeforces#P960F Pathwalks data structures dp graphs *2100	0 / 0	7
	4882	codeforces#P962F Simple Cycles Edges dfs and similar graphs trees *2400	0 / 0	9
	4858	codeforces#P976D Degree Set constructive algorithms graphs implementation *2500	0 / 0	9
	4856	codeforces#P976F Minimal k-covering flows graphs *2500	0 / 0	9
	4851	codeforces#P977E Cyclic Components dfs and similar dsu graphs *1500	0 / 0	5
	4832	codeforces#P980F Cactus to Tree dp graphs trees *2900	0 / 0	10
	4821	codeforces#P982C Cut 'em all! dfs and similar dp graphs greedy trees *1500	0 / 0	5
	4818	codeforces#P982F The Meeting Place Cannot Be Changed dfs and similar graphs *2700	0 / 0	10
	4815	codeforces#P983C Elevator dp graphs shortest paths *2400	0 / 0	9
	4803	codeforces#P986A Fair graphs greedy number theory shortest paths *1600	0 / 0	5
	4801	codeforces#P986C AND Graph bitmasks dfs and similar dsu graphs *2500	0 / 0	9
	4798	codeforces#P986F Oppa Funcan Style Remastered graphs math number theory shortest paths *3300	0 / 0	10
	4786	codeforces#P989C A Mist of Florescence constructive algorithms graphs *1800	0 / 0	6
	4780	codeforces#P990D Graph And Its Complement constructive algorithms graphs implementation *1700	0 / 0	5
	4753	codeforces#P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	10
	4738	codeforces#P999E Reachability from the Capital dfs and similar graphs greedy *2000	0 / 0	7
	4732	codeforces#P1000E We Need More Bosses dfs and similar graphs trees *2100	0 / 0	7
	4701	codeforces#P1003E Tree Constructing constructive algorithms graphs *2100	0 / 0	7
	4687	codeforces#P1005F Berland and the Shortest Paths brute force dfs and similar graphs shortest paths *2100	0 / 0	7
	4682	codeforces#P1006E Military Problem dfs and similar graphs trees *1600	0 / 0	5
	4670	codeforces#P1009D Relatively Prime Graph brute force constructive algorithms graphs greedy math *1700	0 / 0	5
	4667	codeforces#P1009G Allowed Letters bitmasks flows graph matchings graphs greedy *2400	0 / 0	9
	4663	codeforces#P1010D Mars rover dfs and similar graphs implementation trees *2000	0 / 0	7
	4661	codeforces#P1010F Tree fft graphs trees *3400	0 / 0	10
	4657	codeforces#P1012B Chemical table constructive algorithms dfs and similar dsu graphs matrices *1900	0 / 0	6
	4626	codeforces#P1019C Sergey's problem constructive algorithms graphs *3000	0 / 0	10
	4622	codeforces#P1020B Badge brute force dfs and similar graphs *1000	0 / 0	3
	4616	codeforces#P1023F Mobile Phone Network dfs and similar dsu graphs trees *2600	0 / 0	10
	4604	codeforces#P1027D Mouse Hunt dfs and similar graphs *1700	0 / 0	5
	4602	codeforces#P1027F Session in BSU binary search dfs and similar dsu graph matchings graphs *2400	0 / 0	9
	4588	codeforces#P1029E Tree with Small Distances dp graphs greedy *2100	0 / 0	7
	4574	codeforces#P1031F Familiar Operations brute force graphs math *2800	0 / 0	10
	4566	codeforces#P1033A King Escape dfs and similar graphs implementation *1000	0 / 0	3
	4562	codeforces#P1033E Hidden Bipartite Graph binary search constructive algorithms dfs and similar graphs interactive *2800	0 / 0	10
	4544	codeforces#P1037D Valid BFS? dfs and similar graphs shortest paths trees *1700	0 / 0	5
	4543	codeforces#P1037E Trips graphs *2200	0 / 0	8
	4535	codeforces#P1038E Maximum Matching bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	4531	codeforces#P1039C Network Safety dfs and similar dsu graphs math sortings *2200	0 / 0	8
	4522	codeforces#P1041E Tree Reconstruction constructive algorithms data structures graphs greedy *1900	0 / 0	6
	4515	codeforces#P1042F Leaf Sets data structures dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
	4501	codeforces#P1045A Last chance data structures flows graph matchings graphs trees *2500	0 / 0	9
	4499	codeforces#P1045C Hyperspace Highways dfs and similar graphs trees *2300	0 / 0	8
	4481	codeforces#P1051F The Shortest Statement graphs shortest paths trees *2400	0 / 0	9
	4470	codeforces#P1055A Metro graphs *900	0 / 0	3
	4460	codeforces#P1056D Decorate Apple Tree constructive algorithms dfs and similar dp graphs greedy sortings trees *1600	0 / 0	5
	4457	codeforces#P1056G Take Metro brute force data structures graphs *2900	0 / 0	10
	4435	codeforces#P1061E Politics flows graphs *2600	0 / 0	10
	4430	codeforces#P1062D Fun with Integers dfs and similar graphs implementation math *1800	0 / 0	6
	4428	codeforces#P1062F Upgrading Cities dfs and similar graphs *2900	0 / 0	10
	4426	codeforces#P1063B Labyrinth graphs shortest paths *1800	0 / 0	6
	4418	codeforces#P1065B Vasya and Isolated Vertices constructive algorithms graphs *1300	0 / 0	4
	4405	codeforces#P1067B Multihedgehog dfs and similar graphs shortest paths *1800	0 / 0	6
	4399	codeforces#P1068C Colored Rooks constructive algorithms graphs *1700	0 / 0	5
	4398	codeforces#P1070A Find a Number dp graphs number theory shortest paths *2200	0 / 0	8
	4390	codeforces#P1070I Privatization of Roads in Berland flows graph matchings graphs *2400	0 / 0	9
	4372	codeforces#P1076D Edge Deletion graphs greedy shortest paths *1800	0 / 0	6
	4351	codeforces#P1081D Maximum Distance dsu graphs shortest paths sortings *1800	0 / 0	6
	4343	codeforces#P1082D Maximum Diameter Graph constructive algorithms graphs implementation *1800	0 / 0	6
	4340	codeforces#P1082G Petya and Graph flows graphs *2400	0 / 0	9
	4286	codeforces#P1091E New Year and the Acquaintance Estimation binary search data structures graphs greedy implementation math sortings *2400	0 / 0	9
	4272	codeforces#P1093D Beautiful Graph dfs and similar graphs *1700	0 / 0	5
	4263	codeforces#P1095F Make It Connected dsu graphs greedy *1900	0 / 0	6
	4245	codeforces#P1098C Construct a tree binary search constructive algorithms dfs and similar graphs greedy trees *2400	0 / 0	9
	4233	codeforces#P1100E Andrew and Taxi binary search dfs and similar graphs *2200	0 / 0	8
	4219	codeforces#P1102F Elongated Matrix binary search bitmasks brute force dp graphs *2000	0 / 0	7
	4216	codeforces#P1103C Johnny Solving constructive algorithms dfs and similar graphs math *2700	0 / 0	10
	4208	codeforces#P1105D Kilani and the Game dfs and similar graphs implementation shortest paths *1900	0 / 0	6
	4203	codeforces#P1106D Lunar New Year and a Wander data structures dfs and similar graphs greedy shortest paths *1500	0 / 0	5
	4195	codeforces#P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	10
	4187	codeforces#P1108F MST Unification binary search dsu graphs greedy *2100	0 / 0	7
	4168	codeforces#P1111E Tree data structures dfs and similar dp graphs trees *2500	0 / 0	9
	4114	codeforces#P1120D Power Tree dfs and similar dp dsu graphs greedy trees *2500	0 / 0	9
	4096	codeforces#P1131D Gourmet choice dfs and similar dp dsu graphs greedy *2000	0 / 0	7
	4080	codeforces#P1133F1 Spanning Tree with Maximum Degree graphs *1600	0 / 0	5
	4079	codeforces#P1133F2 Spanning Tree with One Fixed Degree constructive algorithms dfs and similar dsu graphs greedy *1900	0 / 0	6
	4071	codeforces#P1137C Museums Tour dp graphs implementation *2500	0 / 0	9
	4063	codeforces#P1139C Edgy Trees dfs and similar dsu graphs math trees *1500	0 / 0	5
	4061	codeforces#P1139E Maximize Mex flows graph matchings graphs *2400	0 / 0	9
	4045	codeforces#P1141G Privatization of Roads in Treeland binary search constructive algorithms dfs and similar graphs greedy trees *1900	0 / 0	6
	4040	codeforces#P1142E Pink Floyd graphs interactive *3200	0 / 0	10

Pick a problem randomly based on the current filter.