shortest paths - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	160	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(无)
	159	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	(无)
	86	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	(无)
	75	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	(无)
	71	P1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths *1900	0 / 0	(无)
	62	P1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	(无)
	30	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	(无)
	3	P1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	(无)
	7842	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	(无)
	7817	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	(无)
	7809	P1695C Zero Path bitmasks brute force data structures dp greedy shortest paths	0 / 0	(无)
	7933	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	(无)
	7975	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	(无)
	7988	P1715E Long Way Home binary search brute force chinese remainder theorem combinatorics constructive algorithms data structures dfs and similar divide and conquer dp dsu expression parsing flows games geometry graph matchings graphs greedy hashing implementation interactive math matrices number theory probabilities schedules shortest paths sortings string suffix structures strings ternary search trees two pointers	0 / 0	(无)
	8022	P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	(无)
	8017	P1726F Late For Work (submissions are not allowed) data structures greedy schedules shortest paths *2900	0 / 0	(无)
	8074	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	9
	8156	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	8142	P1753D The Beach constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	8129	P1759C Thermostat greedy math shortest paths *1100	0 / 0	3
	8091	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	8270	P1775D Friendly Spiders graphs math number theory shortest paths	0 / 0	(无)
	8254	P1779G The Game of the Century constructive algorithms graphs shortest paths	0 / 0	(无)
	8359	P1842F Tenzing and Tree dfs and similar greedy shortest paths sortings trees *2500	0 / 0	9
	8315	P1846G Rudolf and CodeVid-23 bitmasks dp graphs greedy shortest paths *1900	0 / 0	6
	8291	P1851E Nastya and Potions dfs and similar dp graphs shortest paths	0 / 0	(无)
	8461	P1869B 2D Traveling geometry math shortest paths sortings *1100	0 / 0	3
	8454	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8455	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8434	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	8555	P1874B Jellyfish and Math bitmasks dp graphs shortest paths	0 / 0	(无)
	8578	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees	0 / 0	(无)
	8588	P1887B Time Travel binary search graphs implementation shortest paths	0 / 0	(无)
	8726	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	8719	P1899F Alex's whims constructive algorithms graphs greedy shortest paths trees *1600	0 / 0	5
	8718	P1899G Unusual Entertainment data structures dfs and similar dsu shortest paths sortings trees two pointers *1900	0 / 0	6
	8838	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	8803	P1948C Arrow Path brute force constructive algorithms dfs and similar dp graphs shortest paths *1300	0 / 0	4
	8748	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8
	8880	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers	0 / 0	(无)
	8953	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5

根据当前过滤条件随机选择一道题