Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"Gym-102823H\":[\"Hamming Distance\",850,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102823\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018 China Collegiate Programming Contest - Guilin Site\\u003c/a\\u003e\"],\"QOJ-7944\":[\"Max Minus Min\",251,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1452\\\"\\u003eThe 2nd Universal Cup. Stage 14: Southeastern Europe\\u003c/a\\u003e\"],\"QOJ-7941\":[\"Jackpot\",320,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1452\\\"\\u003eThe 2nd Universal Cup. Stage 14: Southeastern Europe\\u003c/a\\u003e\"],\"QOJ-7942\":[\"$K$ Subsequences\",241,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1452\\\"\\u003eThe 2nd Universal Cup. Stage 14: Southeastern Europe\\u003c/a\\u003e\"],\"CodeForces-1388B\":[\"Captain Flint and a Long Voyage\",22380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1388\\\"\\u003eCodeforces Round 660 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1388C\":[\"Uncle Bogdan and Country Happiness\",9520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1388\\\"\\u003eCodeforces Round 660 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1388D\":[\"Captain Flint and Treasure\",6279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1388\\\"\\u003eCodeforces Round 660 (Div. 2)\\u003c/a\\u003e\"],\"Gym-103055B\":[\"Restore Atlantis\",202,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103055\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 18th Zhejiang Provincial Collegiate Programming Contest\\u003c/a\\u003e\"],\"CodeForces-601A\":[\"The Two Routes\",12769,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/601\\\"\\u003eCodeforces Round 333 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-879E\":[\"Tournament\",10,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/879\\\"\\u003eCodeforces Round 443 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-601C\":[\"Kleofáš and the n-thlon\",1418,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/601\\\"\\u003eCodeforces Round 333 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-601D\":[\"Acyclic Organic Compounds\",1167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/601\\\"\\u003eCodeforces Round 333 (Div. 1)\\u003c/a\\u003e\"],\"Gym-102483H\":[\"Hard Drive\",1101,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102483\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018-2019 ICPC Northwestern European Regional Programming Contest (NWERC 2018)\\u003c/a\\u003e\"],\"Gym-104787M\":[\"Inverted\",134,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104787\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 CCPC (Qinhuangdao) Onsite (The 2nd Universal Cup. Stage 9: Qinhuangdao)\\u003c/a\\u003e\"],\"CodeForces-932E\":[\"Team Work\",3032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"Gym-104901K\":[\"Rainbow Subarray\",528,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104901\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Jinan Regional Contest (The 2nd Universal Cup. Stage 17: Jinan)\\u003c/a\\u003e\"],\"Gym-104857D\":[\"Balanced Array\",83,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104857\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei)\\u003c/a\\u003e\"],\"QOJ-7936\":[\"Eliminate Tree\",267,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1452\\\"\\u003eThe 2nd Universal Cup. Stage 14: Southeastern Europe\\u003c/a\\u003e\"],\"AtCoder-arc122_d\":[\"XOR Game\",270,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc122\\\"\\u003eTokio Marine \\u0026amp; Nichido Fire Insurance Programming Contest 2021(AtCoder Regular Contest 122)\\u003c/a\\u003e\"],\"QOJ-7937\":[\"Fast XORting\",247,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1452\\\"\\u003eThe 2nd Universal Cup. Stage 14: Southeastern Europe\\u003c/a\\u003e\"],\"Gym-102822J\":[\"Joy of Handcraft\",856,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102822\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020 China Collegiate Programming Contest - Mianyang Site\\u003c/a\\u003e\"],\"Gym-104417F\":[\"Colorful Segments\",108,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104417\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 13th Shandong ICPC Provincial Collegiate Programming Contest\\u003c/a\\u003e\"],\"QOJ-7933\":[\"Build Permutation\",384,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1452\\\"\\u003eThe 2nd Universal Cup. Stage 14: Southeastern Europe\\u003c/a\\u003e\"],\"AtCoder-abc134_e\":[\"Sequence Decomposing\",1612,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc134\\\"\\u003eAtCoder Beginner Contest 134\\u003c/a\\u003e\"],\"AtCoder-abc134_d\":[\"Preparing Boxes\",2186,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc134\\\"\\u003eAtCoder Beginner Contest 134\\u003c/a\\u003e\"],\"CodeForces-1472E\":[\"Correct Placement\",8008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1472\\\"\\u003eCodeforces Round 693 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-936B\":[\"Sleepy Game\",3149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/936\\\"\\u003eCodeforces Round 467 (Div. 1)\\u003c/a\\u003e\"],\"QOJ-7938\":[\"Graph Race\",188,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1452\\\"\\u003eThe 2nd Universal Cup. Stage 14: Southeastern Europe\\u003c/a\\u003e\"],\"CodeForces-878A\":[\"Short Program\",5507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/878\\\"\\u003eCodeforces Round 443 (Div. 1)\\u003c/a\\u003e\"],\"Gym-103931B\":[\"Bracket Query\",87,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103931\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 Shanghai Collegiate Programming Contest\\u003c/a\\u003e\"],\"Gym-104821M\":[\"Trapping Rain Water\",183,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104821\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Nanjing Regional Contest (The 2nd Universal Cup. Stage 11: Nanjing)\\u003c/a\\u003e\"],\"Gym-104053I\":[\"Infection\",226,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"Gym-104417J\":[\"Not Another Path Query Problem\",442,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104417\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 13th Shandong ICPC Provincial Collegiate Programming Contest\\u003c/a\\u003e\"],\"Gym-104768J\":[\"The Phantom Menace\",92,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104768\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023 China Collegiate Programming Contest (CCPC) Guilin Onsite (The 2nd Universal Cup. Stage 8: Guilin)\\u003c/a\\u003e\"],\"Gym-104768H\":[\"Sweet Sugar\",130,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104768\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023 China Collegiate Programming Contest (CCPC) Guilin Onsite (The 2nd Universal Cup. Stage 8: Guilin)\\u003c/a\\u003e\"],\"Gym-104768I\":[\"Barkley II\",362,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104768\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023 China Collegiate Programming Contest (CCPC) Guilin Onsite (The 2nd Universal Cup. Stage 8: Guilin)\\u003c/a\\u003e\"],\"AtCoder-arc091_d\":[\"Strange Nim\",144,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc091\\\"\\u003eAtCoder Regular Contest 091\\u003c/a\\u003e\"],\"AtCoder-arc091_c\":[\"LISDL\",360,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc091\\\"\\u003eAtCoder Regular Contest 091\\u003c/a\\u003e\"],\"CodeChef-MAJIK\":[\"Wishcraft\",1814,\"khaab_2004\"],\"AtCoder-arc091_b\":[\"Remainder Reminder\",574,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc090\\\"\\u003eAtCoder Beginner Contest 090\\u003c/a\\u003e\"],\"AtCoder-arc074_c\":[\"RGB Sequence\",199,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc074\\\"\\u003eAtCoder Regular Contest 074\\u003c/a\\u003e\"],\"Gym-103069D\":[\"City Brain\",372,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103069\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020 ICPC Asia East Continent Final\\u003c/a\\u003e\"],\"Gym-103102D\":[\"Disk Sort\",307,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103102\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020-2021 ICPC Southeastern European Regional Programming Contest (SEERC 2020)\\u003c/a\\u003e\"],\"AtCoder-arc074_d\":[\"Lotus Leaves\",229,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc074\\\"\\u003eAtCoder Regular Contest 074\\u003c/a\\u003e\"],\"AtCoder-arc074_b\":[\"3N Numbers\",475,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc074\\\"\\u003eAtCoder Regular Contest 074\\u003c/a\\u003e\"],\"Gym-104053M\":[\"XOR Sum\",282,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"CodeForces-1443B\":[\"Saving the City\",15959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1443\\\"\\u003eCodeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"CodeForces-1443C\":[\"The Delivery Dilemma\",15636,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1443\\\"\\u003eCodeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"AtCoder-arc108_f\":[\"Paint Tree\",130,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc108\\\"\\u003eAtCoder Regular Contest 108\\u003c/a\\u003e\"],\"AtCoder-arc108_b\":[\"Abbreviate Fox\",2708,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc108\\\"\\u003eAtCoder Regular Contest 108\\u003c/a\\u003e\"],\"AtCoder-arc108_a\":[\"Sum and Product\",3808,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc108\\\"\\u003eAtCoder Regular Contest 108\\u003c/a\\u003e\"],\"AtCoder-arc108_d\":[\"AB\",452,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc108\\\"\\u003eAtCoder Regular Contest 108\\u003c/a\\u003e\"],\"AtCoder-arc108_c\":[\"Keep Graph Connected\",1087,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc108\\\"\\u003eAtCoder Regular Contest 108\\u003c/a\\u003e\"],\"AtCoder-arc148_d\":[\"mod M Game\",489,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc148\\\"\\u003eAtCoder Regular Contest 148\\u003c/a\\u003e\"],\"AtCoder-arc148_c\":[\"Lights Out on Tree\",1017,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc148\\\"\\u003eAtCoder Regular Contest 148\\u003c/a\\u003e\"],\"AtCoder-arc148_b\":[\"dp\",1616,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc148\\\"\\u003eAtCoder Regular Contest 148\\u003c/a\\u003e\"],\"AtCoder-arc148_a\":[\"mod M\",2023,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc148\\\"\\u003eAtCoder Regular Contest 148\\u003c/a\\u003e\"],\"Gym-104369H\":[\"Canvas\",21,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104369\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 Guangdong Provincial Collegiate Programming Contest\\u003c/a\\u003e\"],\"CodeForces-1644D\":[\"Cross Coloring\",7148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1644\\\"\\u003eEducational Codeforces Round 123 (Rated for Div. 2)\\u003c/a\\u003e\"],\"Gym-103743L\":[\"Collecting Diamonds\",257,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103743\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 Jiangsu Collegiate Programming Contest\\u003c/a\\u003e\"],\"AtCoder-arc086_b\":[\"Non-decreasing\",224,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc081\\\"\\u003eAtCoder Beginner Contest 081\\u003c/a\\u003e\"],\"AtCoder-abc133_e\":[\"Virus Tree 2\",971,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc133\\\"\\u003eAtCoder Beginner Contest 133\\u003c/a\\u003e\"],\"AtCoder-agc036_b\":[\"Do Not Duplicate\",497,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc036\\\"\\u003eAtCoder Grand Contest 036\\u003c/a\\u003e\"],\"Gym-102896A\":[\"Almost Balanced Tree\",595,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102896\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eNorthern Eurasia Finals Online 2020\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"verjun","updateTime":1710234872000,"title":"英才科协精选题单(不定期更新)","dislikeCnt":0,"content":"# 前言\n零基础同学可以按顺序刷,有一定基础的同学可以针对自己的薄弱版块刷,题目可能不会按照难度顺序排列。\n\n题单上的题目**全部**会陆续通过“每日一题”的小视频形式进行讲解,讲解视频详见[英才科协官方账号](https://space.bilibili.com/1768953446)。\n\n有的时候某道题目会不止考察一个知识点,这时候它会按照最主要考察的知识点归类。\n\n备战蓝桥杯的同学需要重点关注基础专题如模拟、二分、双指针、数论、图论、动态规划等,这些知识点大致能够应用以后就可以拿一个不错的省奖,冲刺省一及国奖的同学可能还需要对其余专题有一个大致了解,毕竟蓝桥杯大多都是典型题目。\n\n冲刺校队的同学需要对每一个专题都有了解,但不必太过精通,选拔考试的大部分题目还是来源于基础专题。\n\n**题单的题目均来自于较新的比赛,每个版块可能不会涉及经典的题目,经典题目请见Group中的课后练习,同样会以每日一题的形式进行讲解。**\n\n[选题更加经典的题单](https://vjudge.net/article/4664)\n\n# 模拟\n模拟题是算法竞赛中涉及最为广泛的一种题型,它们涉及很少的算法内容,但是很考验代码实现能力。\n\n善用C++的STL库可以大幅减小代码复杂度。\n[problem:CodeForces-1388B]\n[problem:Gym-102483H]\n[problem:CodeForces-1443B]\n[problem:CodeChef-MAJIK]\n[problem:Gym-103743L]\n[problem:Gym-103102D]\n[problem:AtCoder-abc134_d]\n[problem:CodeForces-878A]\n[problem:AtCoder-arc108_b]\n[problem:AtCoder-arc108_d]\n[problem:AtCoder-arc086_b]\n[problem:AtCoder-arc091_c]\n[problem:QOJ-7933]\n\n# 基础算法\n基础算法包括分治、倍增和双指针等算法,一般题目不会只考这些算法。\n[problem:CodeForces-1443C]\n[problem:AtCoder-agc036_b]\n[problem:AtCoder-arc122_d]\n[problem:QOJ-7944]\n[problem:QOJ-7942]\n[problem:QOJ-7937]\n\n# 贪心\n贪心题目主要考察贪心策略的设计,同样也会和某些知识点搭配起来出题。\n[problem:CodeForces-1388C]\n[problem:Gym-102823H]\n[problem:Gym-102896A]\n[problem:AtCoder-arc148_b]\n[problem:AtCoder-arc074_b]\n[problem:QOJ-7941]\n\n# 数学\n数学版块包括博弈论、线性代数、整数数论、多项式和几何等,一般熟练掌握简单整数数论和线性代数相关即可。\n[problem:AtCoder-arc091_b]\n[problem:CodeForces-1644D]\n[problem:CodeForces-932E]\n[problem:AtCoder-arc148_a]\n[problem:AtCoder-arc108_a]\n[problem:AtCoder-arc148_d]\n[problem:AtCoder-arc091_d]\n\n# 图论\n图论包含图和树的处理,基础的内容包含最短路、最小生成树、拓扑排序、树的直径、树的重心等版块,进阶内容有网络流、连通分量等版块。\n[problem:CodeForces-601A]\n[problem:CodeForces-1388D]\n[problem:CodeForces-936B]\n[problem:CodeForces-879E]\n[problem:AtCoder-arc148_c]\n[problem:AtCoder-arc108_c]\n[problem:AtCoder-arc108_f]\n[problem:AtCoder-arc074_d]\n[problem:QOJ-7938]\n[problem:Gym-104768J]\n[problem:Gym-104369H]\n[problem:Gym-103931B]\n[problem:Gym-103069D]\n[problem:Gym-104417J]\n\n# 动态规划\n动态规划很难,但纯动态规划题目较少,基础的动态规划有线性、树形、数位、状压等,进阶部分就是动态规划的优化,包括数据结构优化、多项式优化、斜率优化、四边形不等式优化等。\n[problem:CodeForces-601C]\n[problem:AtCoder-abc134_e]\n[problem:AtCoder-abc133_e]\n[problem:AtCoder-arc074_c]\n[problem:QOJ-7936]\n[problem:Gym-104768H]\n[problem:Gym-104787M]\n[problem:Gym-104417F]\n[problem:Gym-104053M]\n[problem:Gym-104053I]\n\n# 数据结构\n数据结构很多,但常考的就是线段树和树状数组,部分数据结构题目还可以用STL轻松完成。\n[problem:CodeForces-601D]\n[problem:CodeForces-1472E]\n[problem:Gym-102822J]\n[problem:Gym-104857D]\n[problem:Gym-104768I]\n[problem:Gym-104901K]\n[problem:Gym-103055B]\n[problem:Gym-104821M]\n","threadId":185723,"likeCnt":3,"createTime":1710139079000,"isWorkbook":true,"viewCnt":171,"openness":2,"fav":false,"id":4685,"trustable":false}