graph matchings - 题库 - oj

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8874	P21D Traveling Graph bitmasks graph matchings graphs *2400	0 / 0	9
	8525	P86B Tetris revisited constructive algorithms graph matchings greedy math *2200	0 / 0	8
	8453	P103E Buying Sets flows graph matchings *2900	0 / 0	10
	8384	P120H Brevity is Soul of Wit graph matchings *1800	0 / 0	6
	8182	P166D Shoe Store dp graph matchings greedy sortings two pointers *2500	0 / 0	9
	8177	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	10
	7755	P266B Queue at the School constructive algorithms graph matchings implementation shortest paths *800	0 / 0	3
	7660	P290C WTF? special problem graph matchings implementation trees 1700	0 / 0	5
	7563	P316C2 Tidying Up flows graph matchings *2300	0 / 0	8
	7404	P353E Antichain dp graph matchings greedy *2200	0 / 0	8
	7251	P387D George and Interesting Graph graph matchings *2200	0 / 0	8
	6938	P468B Two Sets 2-sat dfs and similar dsu graph matchings greedy *2000	0 / 0	7
	6936	P468D Tree graph matchings *3100	0 / 0	10
	6935	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	10
	6854	P489B BerSU Ball dfs and similar dp graph matchings greedy sortings two pointers *1200	0 / 0	4
	6841	P491C Deciphering flows graph matchings *2300	0 / 0	8
	6814	P498C Array and Operations flows graph matchings number theory *2100	0 / 0	7
	6519	P575C Party bitmasks brute force graph matchings *2700	0 / 0	10
	6454	P590E Birthday graph matchings strings *3200	0 / 0	10
	6330	P618D Hamiltonian Spanning Tree dfs and similar dp graph matchings greedy trees *2200	0 / 0	8
	5824	P737E Tanya is 5! graph matchings graphs greedy schedules *3300	0 / 0	10
	5819	P739D Recover a functional graph graph matchings *3400	0 / 0	10
	5580	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	10
	5319	P852D Exploration plan binary search flows graph matchings shortest paths *2100	0 / 0	7
	5164	P891D Sloth dfs and similar dp graph matchings trees *3100	0 / 0	10
	4779	P981F Round Marriage binary search graph matchings greedy *2500	0 / 0	9
	4620	P1009G Allowed Letters bitmasks flows graph matchings graphs greedy *2400	0 / 0	9
	4555	P1027F Session in BSU binary search dfs and similar dsu graph matchings graphs *2400	0 / 0	9
	4511	P1034B Little C Loves 3 II brute force constructive algorithms flows graph matchings *2200	0 / 0	8
	4454	P1045A Last chance data structures flows graph matchings graphs trees *2500	0 / 0	9
	4426	P1054F Electric Scheme flows graph matchings *2700	0 / 0	10
	4355	P1067E Random Forest Rank dp graph matchings math trees *2800	0 / 0	10
	4343	P1070I Privatization of Roads in Berland flows graph matchings graphs *2400	0 / 0	9
	4148	P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	10
	4014	P1139E Maximize Mex flows graph matchings graphs *2400	0 / 0	9
	3803	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	8
	3774	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	8
	3689	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	9
	3477	P1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	9
	3360	P1264E Beautiful League constructive algorithms flows graph matchings *2700	0 / 0	10
	3261	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	10
	2925	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	9
	2875	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	3
	2773	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	2753	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	2715	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	10
	2641	P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2589	P1416F Showing Off flows graph matchings greedy implementation *3300	0 / 0	10
	2554	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	6
	2475	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2321	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	8
	2311	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2118	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	10
	2117	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	10
	2031	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2029	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	1985	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(无)
	1920	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	1899	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	1779	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	1713	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1687	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1584	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	9
	1558	P1615G Maximum Adjacent Pairs constructive algorithms graph matchings *3300	0 / 0	10
	1498	P1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	3
	1461	P1630F Making It Bipartite flows graph matchings graphs number theory *3400	0 / 0	10
	1442	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	9
	1364	P1651E Sum of Matchings brute force combinatorics constructive algorithms dfs and similar graph matchings greedy math *2600	0 / 0	10
	1341	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	1167	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	1016	P1710E Two Arrays binary search games graph matchings *2400	0 / 0	9
	976	P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	9
	971	P1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	10
	954	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	920	P1728F Fishermen flows graph matchings greedy *3100	0 / 0	10
	876	P1735E House Planning constructive algorithms data structures graph matchings greedy *2400	0 / 0	9
	717	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	708	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	682	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	671	P1773A Amazing Trick constructive algorithms graph matchings math probabilities *1900	0 / 0	6
	668	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	589	P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	288	P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10
	9027	P1896F Bracket Xoring bitmasks constructive algorithms graph matchings implementation	0 / 0	(无)
	9072	P1906I Contingency Plan 2 graph matchings *2900	0 / 0	10
	9034	P1913E Matrix Problem flows graph matchings graphs	0 / 0	(无)
	9157	P1922F Replace on Segment dp graph matchings *2500	0 / 0	9
	9370	P1952B Is it stated? fft graph matchings strings	0 / 0	(无)
	9362	P1952J Help, what does it mean to be "Based" 2-sat binary search bitmasks brute force chinese remainder theorem combinatorics constructive algorithms data structures dfs and similar divide and conquer dp dsu expression parsing fft flows games geometry graph matchings graphs greedy hashing implementation interactive math matrices meet-in-the-middle number theory probabilities schedules shortest paths sortings string suffix structures strings ternary search trees two pointers	0 / 0	(无)
	9381	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings	0 / 0	(无)

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