	ID	题目显示标签隐藏标签	AC / 尝试	难度
	494	P1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	(无)
	493	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	(无)
	492	P1476F Lanterns binary search data structures dp *3000	0 / 0	(无)
	491	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	(无)
	490	P1477A Nezzar and Board constructive algorithms math number theory *1800	0 / 0	(无)
	489	P1477B Nezzar and Binary String data structures greedy *1900	0 / 0	(无)
	488	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	(无)
	487	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	(无)
	486	P1477E Nezzar and Tournaments data structures greedy *3300	0 / 0	(无)
	485	P1477F Nezzar and Chocolate Bars combinatorics fft math probabilities *3500	0 / 0	(无)
	484	P1478A Nezzar and Colorful Balls brute force greedy *800	0 / 0	(无)
	483	P1478B Nezzar and Lucky Number brute force dp greedy math *1100	0 / 0	(无)
	482	P1478C Nezzar and Symmetric Array implementation math sortings *1700	0 / 0	(无)
	481	P1479A Searching Local Minimum binary search interactive ternary search *1700	0 / 0	(无)
	480	P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	(无)
	479	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	(无)
	478	P1479C Continuous City bitmasks constructive algorithms *2500	0 / 0	(无)
	477	P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	(无)
	476	P1479E School Clubs dp fft math number theory probabilities *3500	0 / 0	(无)
	475	P1480A Yet Another String Game games greedy strings *800	0 / 0	(无)
	474	P1480B The Great Hero greedy implementation sortings *900	0 / 0	(无)
	473	P1481A Space Navigation greedy strings *800	0 / 0	(无)
	472	P1481B New Colony brute force greedy implementation *1100	0 / 0	(无)
	471	P1481C Fence Painting brute force constructive algorithms greedy *1600	0 / 0	(无)
	470	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	(无)
	469	P1481E Sorting Books data structures dp greedy *2500	0 / 0	(无)
	468	P1481F AB Tree dp greedy trees *3100	0 / 0	(无)
	467	P1482A Prison Break math *800	0 / 0	(无)
	466	P1482B Restore Modulo implementation math *1500	0 / 0	(无)
	465	P1482C Basic Diplomacy brute force constructive algorithms greedy implementation *1600	0 / 0	(无)
	464	P1482D Playlist data structures dsu implementation shortest paths *1900	0 / 0	(无)
	463	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	(无)
	462	P1482F Useful Edges graphs shortest paths *2400	0 / 0	(无)
	461	P1482G Vabank binary search interactive *3200	0 / 0	(无)
	460	P1482H Exam data structures string suffix structures trees *3400	0 / 0	(无)
	459	P1485A Add and Divide brute force greedy math number theory *1000	0 / 0	(无)
	458	P1485B Replace and Keep Sorted dp implementation math *1200	0 / 0	(无)
	457	P1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	(无)
	456	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	(无)
	455	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	(无)
	454	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	(无)
	453	P1486A Shifting Stacks greedy implementation *900	0 / 0	(无)
	452	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	(无)
	451	P1486C1 Guessing the Greatest (easy version) binary search interactive *1600	0 / 0	(无)
	450	P1486C2 Guessing the Greatest (hard version) binary search interactive *1900	0 / 0	(无)
	449	P1486D Max Median binary search data structures dp *2100	0 / 0	(无)
	448	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(无)
	447	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	(无)
	446	P1487A Arena implementation sortings *800	0 / 0	(无)
	445	P1487B Cat Cycle math number theory *1200	0 / 0	(无)
	444	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	(无)
	443	P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	(无)
	442	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(无)
	441	P1487F Ones dp greedy shortest paths *2900	0 / 0	(无)
	440	P1487G String Counting combinatorics dp fft math *2700	0 / 0	(无)
	439	P1488A From Zero To Y special problem math 900	0 / 0	(无)
	438	P1488B RBS Deletion special problem greedy 1800	0 / 0	(无)
	437	P1488C Two Policemen special problem binary search brute force math 1900	0 / 0	(无)
	436	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	(无)
	435	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	(无)
	434	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	(无)
	433	P1488G Painting Numbers special problem data structures greedy number theory 2500	0 / 0	(无)
	432	P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	(无)
	431	P1488I Demonic Invasion special problem flows 3100	0 / 0	(无)
	430	P1488J Flower Shop special problem data structures fft math 3100	0 / 0	(无)
	429	P1490A Dense Array greedy math *800	0 / 0	(无)
	428	P1490B Balanced Remainders brute force constructive algorithms math *1000	0 / 0	(无)
	427	P1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	(无)
	426	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	(无)
	425	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	(无)
	424	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	(无)
	423	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	(无)
	422	P1491A K-th Largest Value brute force greedy implementation *800	0 / 0	(无)
	421	P1491B Minimal Cost brute force math *1200	0 / 0	(无)
	420	P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	(无)
	419	P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	(无)
	418	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	(无)
	417	P1491F Magnets binary search constructive algorithms interactive *2700	0 / 0	(无)
	416	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	(无)
	415	P1491H Yuezheng Ling and Dynamic Tree data structures trees *3400	0 / 0	(无)
	414	P1491I Ruler Of The Zoo brute force data structures *3500	0 / 0	(无)
	413	P1492A Three swimmers math *800	0 / 0	(无)
	412	P1492B Card Deck data structures greedy math *1100	0 / 0	(无)
	411	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	(无)
	410	P1492D Genius's Gambit bitmasks constructive algorithms greedy math *1900	0 / 0	(无)
	409	P1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	(无)
	408	P1493A Anti-knapsack constructive algorithms greedy *800	0 / 0	(无)
	407	P1493B Planet Lapituletti brute force implementation *1300	0 / 0	(无)
	406	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	(无)
	405	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	(无)
	404	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	(无)
	403	P1493F Enchanted Matrix bitmasks interactive number theory *2600	0 / 0	(无)
	402	P1494A ABC String bitmasks brute force implementation *900	0 / 0	(无)
	401	P1494B Berland Crossword bitmasks brute force greedy implementation *1400	0 / 0	(无)
	400	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	(无)
	399	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(无)
	398	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	(无)
	397	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	(无)
	396	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	(无)
	395	P1495B Let's Go Hiking games greedy *1900	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

杨旭龙、王树淳、王国斌、宋文宇、朱天伦

特别鸣谢

肖飞、关玉蓉、魏银珍、周芬

Worker 0, 169ms
Powered by Hydro v4.13.4
Modified by HGNU ACM TEAM (Repo Link)