题库 - *2000 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1339	P1288E Messenger Simulator data structures *2000	3 / 4	7
	1315	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	7
	1303	P1296E2 String Coloring (hard version) data structures dp *2000	1 / 1	7
	1281	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	7
	1257	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	1230	P1311D Three Integers brute force math *2000	0 / 0	7
	1208	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	7
	1203	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	1077	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	1065	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	7
	1054	P1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	7
	1053	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	1027	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	978	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	977	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	7
	954	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	937	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	7
	908	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	866	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	858	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	833	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	1 / 2	7
	820	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	808	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	765	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	723	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	694	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	7
	691	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	7
	690	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	624	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	621	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	7
	620	P1427D Unshuffling a Deck constructive algorithms implementation *2000	0 / 0	7
	595	P1431E Chess Match special problem 2000	0 / 0	7
	566	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	1 / 1	7
	514	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	7
	494	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	482	P1458B Glass Half Spilled dp *2000	0 / 0	7
	360	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	1 / 1	7
	332	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	296	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	228	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	227	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	186	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	187	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	188	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	172	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	173	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	90	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	7
	75	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	24	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	7474	P1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	7

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