binary search - 题库 - Boyacoding

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1699	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	8
	1692	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	1687	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	1678	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	1674	P1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	4
	1663	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	1659	P1446F Line Distance binary search data structures geometry *3200	0 / 0	10
	1652	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	1638	P1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	4
	1628	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	1621	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	1601	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	1594	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	5
	1593	P1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	5
	1592	P1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	6
	1591	P1463A Dungeon binary search math *1100	0 / 0	3
	1588	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	1576	P1466I The Riddle of the Sphinx binary search data structures data structures interactive *3400	0 / 0	10
	1567	P1468D Firecrackers binary search sortings *1700	0 / 0	5
	1564	P1468G Hobbits binary search geometry *2500	0 / 0	9
	1559	P1468L Prime Divisors Selection binary search greedy math number theory *2700	0 / 0	10
	1551	P1469F Power Sockets binary search data structures greedy *2600	0 / 0	10
	1550	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	1548	P1470C Strange Shuffle binary search brute force constructive algorithms interactive *2500	0 / 0	9
	1546	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	1538	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	1527	P1474B Different Divisors binary search constructive algorithms greedy math number theory *1000	0 / 0	3
	1519	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	6
	1515	P1476A K-divisible Sum binary search constructive algorithms greedy math *1000	0 / 0	3
	1514	P1476B Inflation binary search brute force greedy math *1300	0 / 0	4
	1510	P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	1499	P1479A Searching Local Minimum binary search interactive ternary search *1700	0 / 0	5
	1495	P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	10
	1479	P1482G Vabank binary search interactive *3200	0 / 0	10
	1475	P1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	5
	1470	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	5
	1469	P1486C1 Guessing the Greatest (easy version) binary search interactive *1600	0 / 0	5
	1468	P1486C2 Guessing the Greatest (hard version) binary search interactive *1900	0 / 0	6
	1467	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	1466	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	1461	P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	5
	1455	P1488C Two Policemen special problem binary search brute force math 1900	0 / 0	6
	1454	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	6
	1452	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	8
	1445	P1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	3
	1443	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	1442	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	1441	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	6
	1435	P1491F Magnets binary search constructive algorithms interactive *2700	0 / 0	10
	1429	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	1424	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	1418	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	1398	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	1385	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	1382	P1500E Subset Trick binary search data structures *3300	0 / 0	10
	1376	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	1353	P1508B Almost Sorted binary search combinatorics constructive algorithms implementation *1800	0 / 0	6
	1311	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	1310	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	10
	1301	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	1297	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	1291	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	9
	1276	P1520F1 Guess the K-th Zero (Easy version) binary search interactive *1600	0 / 0	5
	1275	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	1269	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	1242	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	9
	1231	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	1215	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(无)
	1214	P1533F Binary String Partition *special problem binary search greedy	0 / 0	(无)
	1198	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	1196	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	1195	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	1184	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	1183	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	1179	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	4
	1176	P1538F Interesting Function binary search dp math number theory *1500	0 / 0	5
	1175	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	1171	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	1170	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	1164	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	10
	1134	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	6
	1131	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	6
	1121	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	1120	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	1119	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	1116	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	1112	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1105	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1103	P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	10
	1090	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	1064	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	1052	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	6
	1051	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1048	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	4
	1039	P1566A Median Maximization binary search greedy math *800	0 / 0	3
	1021	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	6
	1010	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	10
	1008	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	1004	P1572E Polygon binary search dp geometry *3000	0 / 0	10
	998	P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	4

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