acmer-coach 2.6.0 → 2.6.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (9) hide show
  1. package/README.md +10 -2
  2. package/assets/knowledge/CONTEST_PROFILES.yaml +166 -97
  3. package/assets/rules/coach-rules.md +2 -0
  4. package/dev/catalog-check.mjs +44 -9
  5. package/dev.sh +1 -1
  6. package/docs/china-contest-sources.md +423 -0
  7. package/docs//346/257/224/350/265/233/344/270/216/346/225/231/345/255/246/344/276/235/346/215/256.md +23 -6
  8. package/index.js +1 -1
  9. package/package.json +1 -1
package/README.md CHANGED
@@ -121,13 +121,21 @@ learned/verified 记录，或路线中在此前安排的必验训练，不能从
121
121
 
122
122
  详见 [长期课程机制](docs/长期课程机制.md)。
123
123
 
124
+ ### 2.6.1：中国区多赛站资料
125
+
126
+ `regional-diagnostic` 现在有五站六场、七十道已核对题意与官方题解的样本：南京2022十三题与2023六题、西安2025十三题、杭州2024十三题、上海2025十三题、香港2025十二题。每题保留教学模型、现有能力ID及真实PDF页码。
127
+
128
+ 西安配置继续使用旧 `xian-pending` ID，内容已补为2025全卷十三题，已有目标不用迁移。更多比赛保留在[56场中国区资料索引](docs/china-contest-sources.md)，按需核验，不把候选链接数量当审核覆盖。杭州的浙江省赛错配已更正为UCup Stage25、场次1893；原始工作表未修改。
129
+
130
+ 资料扩充不增加工具、课程引擎或评分权重。小鲸根据个人和团队训练证据选择重点；样本不是完整考纲、出题概率、学生掌握记录或金牌保证。尚未运行全部题目解法、交互器或完整核验现场奖牌榜。
131
+
124
132
  ### 2.6：独立验收、灵活训练与逐题依据
125
133
 
126
134
  章节分数及限时通过仍记为 `passed`，但只有本次做出的题都明确报告 `independent: true`，才新增 `verified` 和验证段位。独立性未知或有帮助时，保留实际成绩，不能自动认证；旧证书保留，不补造独立事实。独立性来自明确记录，不是工具能从 AC 猜出的结论。延迟保持与迁移仍由既有课程 `exitChecks` 单独验收。
127
135
 
128
136
  训练沿用 `coach_assign` / `coach_log` / `coach_plan`：短诊断和整场 VP 可以直接绑定比赛能力，时长由教练明确给出；旧知识点练习和默认时长继续支持。计划只记录安排，不证明训练完成。
129
137
 
130
- `coach_target profiles` 和 `coach_focus` 返回逐题 `samples` 与 `coverage`。中国亚洲区域赛主配置包含南京 2022 全卷十三题和 2023 六题，每题列模型、能力和命题组解题页；NWERC 十三题仅作扩展参考，WF 的三题仍是题面诊断。西安目录已经核对，题解未获取，算法样本数如实为零。覆盖数字不产生专题频率、奖牌线或预测；小鲸结合个人证据决定重点。
138
+ `coach_target profiles` 和 `coach_focus` 返回逐题 `samples` 与 `coverage`。2.6最初包含南京2022十三题与2023六题，2.6.1扩至五站七十题并补齐西安样本；NWERC十三题仅作扩展参考，WF的三题仍是题面诊断。覆盖数字不产生专题频率、奖牌线或预测；小鲸结合个人证据决定重点。
131
139
 
132
140
  ### 2.5：接着教，判断仍归小鲸
133
141
 
@@ -160,7 +168,7 @@ learned/verified 记录，或路线中在此前安排的必验训练，不能从
160
168
  `read` 返回每项 `exitCheckResults` 和缺口；旧 v1/v2 课程只读保留，先 `revise` 补齐条件
161
169
  后升级 v3。通过检测证明的是该次条件下的表现，不能解释成永久掌握。
162
170
 
163
- `coach_target profiles` 提供 `regional-diagnostic`、`wf-extension`、`xian-pending` 三个
171
+ `coach_target profiles` 提供 `regional-diagnostic`、`nwerc-reference`、`wf-extension`、`xian-pending` 四个
164
172
  有来源、采样范围和限制的配置，选定后可通过 `profileId` 保存。它们都仍是 provisional，
165
173
  不是西安考纲、专题频率或奖牌保证。`coach_scope` 优先使用14张精确节点卡，返回识别条件、
166
174
  证明问题、失效反例、迁移练习与原始资料，避免把一个 DP 通用卡当成所有 DP 节点的讲法。
package/assets/knowledge/CONTEST_PROFILES.yaml CHANGED
@@ -1,118 +1,187 @@
1
- # 这是可追溯的选题诊断，不是出题频率榜；provisional 禁止解释成官方考纲。
1
+ # 有限真题支持教学诊断；候选索引、样本覆盖和出题频率分别说明。
2
2
  version: 1
3
3
  profiles:
4
4
  - id: regional-diagnostic
5
- title: 中国亚洲区域赛能力诊断（南京 2022/2023 样本）
6
- scope: 以中国亚洲区域赛原题和命题组题解建立模型诊断，结合本人和团队的 VP 事实取舍。
7
- status: provisional
5
+ title: "中国亚洲区域赛能力诊断（五站六场样本）"
6
+ scope: "以南京、西安、杭州、上海、香港原题和命题组题解诊断比赛能力，结合本人和团队的 VP 事实取舍。"
7
+ status: "provisional"
8
8
  sources:
9
- - {title: SUA 南京 2022 命题组中文题解（全卷十三题）, url: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf'}
10
- - {title: SUA 南京 2023 命题组题解（QOJ 镜像，采样六题）, url: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf'}
11
- - {title: QOJ 西安历年比赛目录（对应赛区的原题入口）, url: 'https://qoj.ac/category/87'}
12
- competencyIds: [contest-reading, contest-decision, implementation-stability, dp-modeling, graph-modeling, data-structures, math-combinatorics, code-review, team-communication]
9
+ - {"title":"SUA 南京 2022 命题组中文题解（全卷十三题）","url":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf"}
10
+ - {"title":"SUA 南京 2023 命题组题解（QOJ 镜像，采样六题）","url":"https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf"}
11
+ - {"title":"Xi'an 2025 命题组题解（全卷13题）","url":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1"}
12
+ - {"title":"Hangzhou 2024 命题组题解（全卷13题）","url":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1"}
13
+ - {"title":"Shanghai 2025 命题组题解（全卷13题）","url":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf"}
14
+ - {"title":"Hong Kong 2025 命题组题解（全卷12题）","url":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf"}
15
+ - {"title":"中国区比赛资料索引（56场候选，按需核验）","url":"https://github.com/Miantiao1231/acmer-coach/blob/main/docs/china-contest-sources.md"}
16
+ competencyIds: ["contest-reading","contest-decision","implementation-stability","dp-modeling","graph-modeling","data-structures","math-combinatorics","code-review","team-communication"]
13
17
  samples:
14
- - {year: 2022, contest: Nanjing, problem: I, model: 从旋转回文条件推出字符频次计数, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=3'}
15
- - {year: 2022, contest: Nanjing, problem: G, model: 维护总和及数量的可反悔贪心, competencyIds: [math-combinatorics, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=5'}
16
- - {year: 2022, contest: Nanjing, problem: D, model: 二分阈值与有效操作区间前缀统计, competencyIds: [contest-reading, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=7'}
17
- - {year: 2022, contest: Nanjing, problem: B, model: 单调队列优化 DP 与前后缀复用, competencyIds: [dp-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=10'}
18
- - {year: 2022, contest: Nanjing, problem: A, model: 整体移动转边界与二维前缀和, competencyIds: [contest-reading, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=15'}
19
- - {year: 2022, contest: Nanjing, problem: M, model: 局部极小与水平边界的分类计数, competencyIds: [math-combinatorics, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=19'}
20
- - {year: 2022, contest: Nanjing, problem: J, model: 等式变二分图边与连通块配对, competencyIds: [graph-modeling], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=22'}
21
- - {year: 2022, contest: Nanjing, problem: E, model: 树形 DP 与虚树深度统计, competencyIds: [dp-modeling, graph-modeling], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=25'}
22
- - {year: 2022, contest: Nanjing, problem: C, model: 逆序操作与通配位置的贪心构造, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=28'}
23
- - {year: 2022, contest: Nanjing, problem: H, model: 树上边贡献与凹性背包合并优化, competencyIds: [dp-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=33'}
24
- - {year: 2022, contest: Nanjing, problem: K, model: 堆排列概率与完全二叉树对称计数, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=36'}
25
- - {year: 2022, contest: Nanjing, problem: L, model: 链上弦覆盖与二边割的增量维护, competencyIds: [graph-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=45'}
26
- - {year: 2022, contest: Nanjing, problem: F, model: 锐角三角剖分的基例与递增构造, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=48'}
27
- - {year: 2023, contest: Nanjing, problem: I, model: 按重置时间排序并检查约束区间一致性, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=3'}
28
- - {year: 2023, contest: Nanjing, problem: F, model: 最后写入者依赖 DAG 与拓扑序交换, competencyIds: [graph-modeling], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=5'}
29
- - {year: 2023, contest: Nanjing, problem: C, model: 异或计数同余与区间分解，题名不是算法标签, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=7'}
30
- - {year: 2023, contest: Nanjing, problem: G, model: 交换论证结合前缀选择与后缀背包, competencyIds: [dp-modeling, data-structures], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=9'}
31
- - {year: 2023, contest: Nanjing, problem: A, model: 双位置可达状态与相对移动约束, competencyIds: [graph-modeling], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=11'}
32
- - {year: 2023, contest: Nanjing, problem: L, model: 降序楼层贪心与放松下界的匹配证明, competencyIds: [math-combinatorics, contest-reading], solutionReviewed: true, sourceUrl: 'https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=13'}
18
+ - {"year":2022,"contest":"Nanjing","problem":"I","model":"从旋转回文条件推出字符频次计数","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=3"}
19
+ - {"year":2022,"contest":"Nanjing","problem":"G","model":"维护总和及数量的可反悔贪心","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=5"}
20
+ - {"year":2022,"contest":"Nanjing","problem":"D","model":"二分阈值与有效操作区间前缀统计","competencyIds":["contest-reading","data-structures"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=7"}
21
+ - {"year":2022,"contest":"Nanjing","problem":"B","model":"单调队列优化 DP 与前后缀复用","competencyIds":["dp-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=10"}
22
+ - {"year":2022,"contest":"Nanjing","problem":"A","model":"整体移动转边界与二维前缀和","competencyIds":["contest-reading","data-structures"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=15"}
23
+ - {"year":2022,"contest":"Nanjing","problem":"M","model":"局部极小与水平边界的分类计数","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=19"}
24
+ - {"year":2022,"contest":"Nanjing","problem":"J","model":"等式变二分图边与连通块配对","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=22"}
25
+ - {"year":2022,"contest":"Nanjing","problem":"E","model":"树形 DP 与虚树深度统计","competencyIds":["dp-modeling","graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=25"}
26
+ - {"year":2022,"contest":"Nanjing","problem":"C","model":"逆序操作与通配位置的贪心构造","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=28"}
27
+ - {"year":2022,"contest":"Nanjing","problem":"H","model":"树上边贡献与凹性背包合并优化","competencyIds":["dp-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=33"}
28
+ - {"year":2022,"contest":"Nanjing","problem":"K","model":"堆排列概率与完全二叉树对称计数","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=36"}
29
+ - {"year":2022,"contest":"Nanjing","problem":"L","model":"链上弦覆盖与二边割的增量维护","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=45"}
30
+ - {"year":2022,"contest":"Nanjing","problem":"F","model":"锐角三角剖分的基例与递增构造","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf#page=48"}
31
+ - {"year":2023,"contest":"Nanjing","problem":"I","model":"按重置时间排序并检查约束区间一致性","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=3"}
32
+ - {"year":2023,"contest":"Nanjing","problem":"F","model":"最后写入者依赖 DAG 与拓扑序交换","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=5"}
33
+ - {"year":2023,"contest":"Nanjing","problem":"C","model":"异或计数同余与区间分解，题名不是算法标签","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=7"}
34
+ - {"year":2023,"contest":"Nanjing","problem":"G","model":"交换论证结合前缀选择与后缀背包","competencyIds":["dp-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=9"}
35
+ - {"year":2023,"contest":"Nanjing","problem":"A","model":"双位置可达状态与相对移动约束","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=11"}
36
+ - {"year":2023,"contest":"Nanjing","problem":"L","model":"降序楼层贪心与放松下界的匹配证明","competencyIds":["math-combinatorics","contest-reading"],"solutionReviewed":true,"sourceUrl":"https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf#page=13"}
37
+ - {"year":2025,"contest":"Xi'an","problem":"A","model":"最大攻击者归约与区间覆盖链的线段树动态维护","competencyIds":["contest-reading","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=1"}
38
+ - {"year":2025,"contest":"Xi'an","problem":"B","model":"端点颜色修正的重排判定、双指针最短区间与贪心构造","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=2"}
39
+ - {"year":2025,"contest":"Xi'an","problem":"C","model":"毛毛虫森林判定与双指针维护诱导子图度数","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=4"}
40
+ - {"year":2025,"contest":"Xi'an","problem":"D","model":"前后缀可达点压缩边数，分列选择构造不同共同可达集合","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=5"}
41
+ - {"year":2025,"contest":"Xi'an","problem":"E","model":"重链剖分把根路径翻转转成前缀，分块统计区间操作的奇偶贡献","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=6"}
42
+ - {"year":2025,"contest":"Xi'an","problem":"F","model":"单后继依赖形成基环树，从环上首个相遇事件传播停止时间","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=6"}
43
+ - {"year":2025,"contest":"Xi'an","problem":"G","model":"相邻交换论证得到升降序投票贪心","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=7"}
44
+ - {"year":2025,"contest":"Xi'an","problem":"H","model":"黑色连通块计数，EGF、Lagrange 反演与 Stirling 多项式提取系数","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=7"}
45
+ - {"year":2025,"contest":"Xi'an","problem":"I","model":"三点路径异或求中心，恢复祖先关系与相邻深度树边","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=8"}
46
+ - {"year":2025,"contest":"Xi'an","problem":"J","model":"购点树形 DP 维护最小和次小子代价，祖先链前缀和回答合并查询","competencyIds":["dp-modeling","graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=8"}
47
+ - {"year":2025,"contest":"Xi'an","problem":"K","model":"按位子集包含的排列匹配，删一位建图压缩网络流","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=9"}
48
+ - {"year":2025,"contest":"Xi'an","problem":"L","model":"多边形边长判定、排序连续段与单调指针求各边数最大周长","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=9"}
49
+ - {"year":2025,"contest":"Xi'an","problem":"M","model":"消空性质分类与补集两状态 DP，区分 1、至少 n 的值和奇偶特例","competencyIds":["dp-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=10"}
50
+ - {"year":2024,"contest":"Hangzhou","problem":"A","model":"等位字符约束连成等价类，连通块判定能否区分第三串","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=4"}
51
+ - {"year":2024,"contest":"Hangzhou","problem":"B","model":"线段树压缩每位唯一零与区间按位与，定位最优删除位置","competencyIds":["data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=17"}
52
+ - {"year":2024,"contest":"Hangzhou","problem":"C","model":"凸包内公切线界定遮挡半平面，扫描有理数开区间补集","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=42"}
53
+ - {"year":2024,"contest":"Hangzhou","problem":"D","model":"前缀匹配 DP 逐位构造最小字典序，另有 Lyndon 分解解法","competencyIds":["dp-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=27"}
54
+ - {"year":2024,"contest":"Hangzhou","problem":"E","model":"必需上行和空档建立下界，单调指针与优先队列构造运输顺序","competencyIds":["math-combinatorics","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=7"}
55
+ - {"year":2024,"contest":"Hangzhou","problem":"F","model":"排名前缀集合确定 SCC 分段，前缀和统计区间互相可达对","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=14"}
56
+ - {"year":2024,"contest":"Hangzhou","problem":"G","model":"拆环并延长的基环树 DFS，维护各颜色第 k 次出现距离","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=25"}
57
+ - {"year":2024,"contest":"Hangzhou","problem":"H","model":"重链长度的不可行情形分类，借最长链挂接构造原树","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=8"}
58
+ - {"year":2024,"contest":"Hangzhou","problem":"I","model":"旋转半周距离查询找到经过弦的最短路，再二分弦端点","competencyIds":["graph-modeling","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=22"}
59
+ - {"year":2024,"contest":"Hangzhou","problem":"J","model":"按两类卡牌的独有数字集合分解，插板计数与高维前缀和","competencyIds":["math-combinatorics","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=19"}
60
+ - {"year":2024,"contest":"Hangzhou","problem":"K","model":"交换提前最晚标记，逐行统计剩余完成时刻并应用行宽下界","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=5"}
61
+ - {"year":2024,"contest":"Hangzhou","problem":"L","model":"分段 DP 的决策单调性，用连续扩展处理取整平局并定位分界","competencyIds":["dp-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=36"}
62
+ - {"year":2024,"contest":"Hangzhou","problem":"M","model":"笛卡尔树归约子数组整除条件，差分 gcd 因数筛选全局平移","competencyIds":["math-combinatorics","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1#page=11"}
63
+ - {"year":2025,"contest":"Shanghai","problem":"A","model":"二分深度与候选树重心消除的交互定位","competencyIds":["graph-modeling","contest-reading"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=10"}
64
+ - {"year":2025,"contest":"Shanghai","problem":"B","model":"二分图异或不变量、奇环修正与生成树DFS构造","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=7"}
65
+ - {"year":2025,"contest":"Shanghai","problem":"C","model":"排列二值化与不平衡倍增的限次数排序构造","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=24"}
66
+ - {"year":2025,"contest":"Shanghai","problem":"D","model":"按位拆分0/1子问题并合并通配三态求和","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=3"}
67
+ - {"year":2025,"contest":"Shanghai","problem":"E","model":"小汉明距离复制树上增量维护对称差并统计可选父亲","competencyIds":["graph-modeling","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=13"}
68
+ - {"year":2025,"contest":"Shanghai","problem":"F","model":"两次扫描线维护凸包并二分判交，处理坐标为零","competencyIds":["math-combinatorics","data-structures"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=29"}
69
+ - {"year":2025,"contest":"Shanghai","problem":"G","model":"分组缩至至多两组与总异或掩码下的线性基优化","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=4"}
70
+ - {"year":2025,"contest":"Shanghai","problem":"H","model":"同值配对策略与未配对元素分类的异或博弈","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=5"}
71
+ - {"year":2025,"contest":"Shanghai","problem":"I","model":"保留位置DP与异或高低位分解优化","competencyIds":["dp-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=8"}
72
+ - {"year":2025,"contest":"Shanghai","problem":"J","model":"路径前缀闭包与二度化Trie惰性扩展","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=9"}
73
+ - {"year":2025,"contest":"Shanghai","problem":"K","model":"前缀极值单调性分块与三段贡献前缀和","competencyIds":["data-structures"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=15"}
74
+ - {"year":2025,"contest":"Shanghai","problem":"L","model":"最左合法切分去重与常数禁切状态的区间DP","competencyIds":["dp-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=20"}
75
+ - {"year":2025,"contest":"Shanghai","problem":"M","model":"兄弟叶子异值限制、卡塔兰数容斥与分治计数","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-12-zh.pdf#page=22"}
76
+ - {"year":2025,"contest":"Hong Kong","problem":"A","model":"匹配拟阵的增广替换维护与右端点扫描","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=23"}
77
+ - {"year":2025,"contest":"Hong Kong","problem":"B","model":"单次免费边成路径、双次免费边成完整子树的树形DP","competencyIds":["graph-modeling","dp-modeling"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=14"}
78
+ - {"year":2025,"contest":"Hong Kong","problem":"C","model":"模n余数可达性分层、插板法与生成函数容斥计数","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=27"}
79
+ - {"year":2025,"contest":"Hong Kong","problem":"D","model":"操作时刻逆排列的单调传播DP与李超树直线优化","competencyIds":["dp-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=26"}
80
+ - {"year":2025,"contest":"Hong Kong","problem":"E","model":"邻域大小点集的下凸包与最大权闭合子图切线求解","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=38"}
81
+ - {"year":2025,"contest":"Hong Kong","problem":"F","model":"拓扑定向编码指定环，再用强连通分量与入度剥离解码","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=20"}
82
+ - {"year":2025,"contest":"Hong Kong","problem":"G","model":"单向浇水距离取min与线段树定位对数个更新区间","competencyIds":["data-structures"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=17"}
83
+ - {"year":2025,"contest":"Hong Kong","problem":"H","model":"最长公共前缀上下界压缩为相邻同字符判定","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=4"}
84
+ - {"year":2025,"contest":"Hong Kong","problem":"I","model":"多DFS序公共连续子树判定与树/森林区间DP","competencyIds":["graph-modeling","dp-modeling"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=11"}
85
+ - {"year":2025,"contest":"Hong Kong","problem":"J","model":"截止时间约束的逆序最长作业贪心与堆维护","competencyIds":["math-combinatorics","data-structures"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=6"}
86
+ - {"year":2025,"contest":"Hong Kong","problem":"K","model":"后继更大元素树、长度哈希与倍增比较循环移位的前缀最大值序列","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=8"}
87
+ - {"year":2025,"contest":"Hong Kong","problem":"L","model":"多边形边粘合的可定向性不变量与并查集欧拉示性数","competencyIds":["math-combinatorics","graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://ucup.ac/tutorials/tutorials-4-14-en.pdf#page=33"}
33
88
  selectionGuidance:
34
- - 中国亚洲区域赛优先使用对应赛区和年份的真题；先诊断读题、模型选择和实现，不按 CF rating 连续解锁知识点。
35
- - 结合本人 VP 已确认的失败原因选择本周重点；一道成功题可作为起点，不证明同模型已经掌握。
36
- - I/G 用于条件提炼与贪心证明，D/A 用于变量转化和统计，B 用于从朴素转移推导优化；模型对应题解，训练取舍由教练决定。
37
- - 西安目标优先看西安配置及对应原题；NWERC 只作扩展参考，不用欧洲样本代替中国赛区依据。
89
+ - "中国亚洲区域赛优先使用对应赛站和年份的原题；先诊断读题、模型选择和实现，不按 CF rating 连续解锁知识点。"
90
+ - "当前五站六场共七十题已核对题解：南京2022十三题、2023六题，西安2025十三题、杭州2024十三题、上海2025十三题、香港2025十二题。同题镜像不增加覆盖。"
91
+ - "结合本人和团队 VP 中已确认的失败原因选择本周重点；一道成功题只作为能力起点，不证明同模型已经掌握。"
92
+ - "同一能力跨不同赛站、叙事和约束进行迁移，先让学生自行识别模型；不要为了覆盖样本把所有出现过的知识点依次教完。"
93
+ - "西安目标可以继续使用 xian-pending 配置ID，现已补入2025原题；旧ID不表示样本仍为空。NWERC仅作扩展参考。"
94
+ - "需要更多年份或赛站时按需打开资料索引，先核对原题与题解，候选链接不能充当已审核模型。"
38
95
  limitations:
39
- - 当前采样南京 2022 全卷十三题和 2023 六题，未做跨年份与跨赛区专题频率统计；不能推出中国区域赛频率或本届西安预测。
40
- - 这不是完整考纲，模型是教学解释而非唯一解法；验收阈值需按个人和团队事实调整。
41
- - 未核验目标届次奖牌榜单，不给出金牌题数或奖牌保证。
96
+ - "当前只有五站六场的有限样本，南京2023只采六题；未做跨赛区专题频率统计，不能预测本届区域赛或给出专题权重。"
97
+ - "七十题已阅读题解并对照题意，未运行全部解法或交互器。模型和能力对应是教学解释，不是唯一解法、完整考纲或学生掌握证据。"
98
+ - "现场奖牌榜单尚未完整核验；线上重赛榜与现场榜分开，不给出金牌题数或奖牌保证。"
99
+ - "原赛年份以官方赛事别名为准，不因UCup或训练营重赛日期改年；题解页码是实体PDF页序，不能用印刷页脚替代。"
100
+ - "上海A的重赛题面允许40次交互询问，其他版本需重核协议和限制；上海H/I题解记号与题面存在差异，不直接照抄判定或代价式。"
101
+ - "香港K题解概述的字典序方向与正式题面不一致，依题面核对最小方向；香港PDF页脚跳号，采样页码已按实体页修正。"
42
102
  - id: nwerc-reference
43
- title: 区域赛通用能力诊断（NWERC 2024 全卷样本）
44
- scope: 用公开区域赛的题面与官方解题建立诊断任务，再结合本人 VP 证据取舍。
45
- status: provisional
103
+ title: "区域赛通用能力诊断（NWERC 2024 全卷样本）"
104
+ scope: "用公开区域赛的题面与官方解题建立诊断任务，再结合本人 VP 证据取舍。"
105
+ status: "provisional"
46
106
  sources:
47
- - title: NWERC 2024 官方题面（A–M 全卷）
48
- url: https://2024.nwerc.eu/main/problem-set.pdf
49
- - title: NWERC 2024 官方解题（A–M 对应页）
50
- url: https://2024.nwerc.eu/main/solutions.pdf
51
- - title: ICPC NCNA 公布的区域赛规则（通用背景，不提供专题频率）
52
- url: https://nc.na.icpc.global/rules/
53
- competencyIds: [contest-reading, contest-decision, implementation-stability, dp-modeling, graph-modeling, data-structures, math-combinatorics, code-review, team-communication]
107
+ - {"title":"NWERC 2024 官方题面（A–M 全卷）","url":"https://2024.nwerc.eu/main/problem-set.pdf"}
108
+ - {"title":"NWERC 2024 官方解题（A–M 对应页）","url":"https://2024.nwerc.eu/main/solutions.pdf"}
109
+ - {"title":"ICPC NCNA 公布的区域赛规则（通用背景，不提供专题频率）","url":"https://nc.na.icpc.global/rules/"}
110
+ competencyIds: ["contest-reading","contest-decision","implementation-stability","dp-modeling","graph-modeling","data-structures","math-combinatorics","code-review","team-communication"]
54
111
  samples:
55
- - {year: 2024, contest: NWERC, problem: A, model: 自定义排序规则, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=4'}
56
- - {year: 2024, contest: NWERC, problem: B, model: 周期标号游走与状态动态规划，题名不能决定算法, competencyIds: [graph-modeling, dp-modeling], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=24'}
57
- - {year: 2024, contest: NWERC, problem: C, model: 网格极端点收缩与几何分类, competencyIds: [math-combinatorics, graph-modeling], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=19'}
58
- - {year: 2024, contest: NWERC, problem: D, model: 排序后按最小元素分类计数与背包, competencyIds: [dp-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=11'}
59
- - {year: 2024, contest: NWERC, problem: E, model: 下标变换与模幂, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=8'}
60
- - {year: 2024, contest: NWERC, problem: F, model: 单调栈和并查集跳过已满位置, competencyIds: [data-structures], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=13'}
61
- - {year: 2024, contest: NWERC, problem: G, model: 双连通分量与排列奇偶性, competencyIds: [graph-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=31'}
62
- - {year: 2024, contest: NWERC, problem: H, model: 交互函数迭代的等式构造，存在多种解法, competencyIds: [graph-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=16'}
63
- - {year: 2024, contest: NWERC, problem: I, model: 素数指数参数化与容斥预处理, competencyIds: [math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=28'}
64
- - {year: 2024, contest: NWERC, problem: J, model: 独立优化与最近更高障碍限制, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=7'}
65
- - {year: 2024, contest: NWERC, problem: K, model: 最短路与按距离排序的概率期望, competencyIds: [graph-modeling, math-combinatorics], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=15'}
66
- - {year: 2024, contest: NWERC, problem: L, model: 单调可行性与贪心配对二分, competencyIds: [contest-reading, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=10'}
67
- - {year: 2024, contest: NWERC, problem: M, model: 期望线性性与面积前后缀求和，检查整数溢出, competencyIds: [math-combinatorics, implementation-stability], solutionReviewed: true, sourceUrl: 'https://2024.nwerc.eu/main/solutions.pdf#page=22'}
112
+ - {"year":2024,"contest":"NWERC","problem":"A","model":"自定义排序规则","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=4"}
113
+ - {"year":2024,"contest":"NWERC","problem":"B","model":"周期标号游走与状态动态规划，题名不能决定算法","competencyIds":["graph-modeling","dp-modeling"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=24"}
114
+ - {"year":2024,"contest":"NWERC","problem":"C","model":"网格极端点收缩与几何分类","competencyIds":["math-combinatorics","graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=19"}
115
+ - {"year":2024,"contest":"NWERC","problem":"D","model":"排序后按最小元素分类计数与背包","competencyIds":["dp-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=11"}
116
+ - {"year":2024,"contest":"NWERC","problem":"E","model":"下标变换与模幂","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=8"}
117
+ - {"year":2024,"contest":"NWERC","problem":"F","model":"单调栈和并查集跳过已满位置","competencyIds":["data-structures"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=13"}
118
+ - {"year":2024,"contest":"NWERC","problem":"G","model":"双连通分量与排列奇偶性","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=31"}
119
+ - {"year":2024,"contest":"NWERC","problem":"H","model":"交互函数迭代的等式构造，存在多种解法","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=16"}
120
+ - {"year":2024,"contest":"NWERC","problem":"I","model":"素数指数参数化与容斥预处理","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=28"}
121
+ - {"year":2024,"contest":"NWERC","problem":"J","model":"独立优化与最近更高障碍限制","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=7"}
122
+ - {"year":2024,"contest":"NWERC","problem":"K","model":"最短路与按距离排序的概率期望","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=15"}
123
+ - {"year":2024,"contest":"NWERC","problem":"L","model":"单调可行性与贪心配对二分","competencyIds":["contest-reading","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=10"}
124
+ - {"year":2024,"contest":"NWERC","problem":"M","model":"期望线性性与面积前后缀求和，检查整数溢出","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://2024.nwerc.eu/main/solutions.pdf#page=22"}
68
125
  selectionGuidance:
69
- - 先用整场 VP 诊断读题、实现、调试与分工，再用经确认的失败原因选择专题；成功题用作能力基线。
70
- - 采样 A 检查从精确排序规则到实现的转化；D 检查计数状态；E 检查大次数变换与模幂，题名不决定算法。
71
- - 采样 L 检查可行性单调性与贪心证明；F 检查单调栈和并查集组合；K 检查路径与概率模型组合。
72
- - 赛前优先修复已证实、可在剩余时间完成验收的障碍；未证实的缺口先安排短诊断，不直接扩知识点。
73
- - 同一题允许多种正确解法；把能解释条件并独立迁移作为验收，不能将某个算法标签当唯一答案。
126
+ - "先用整场 VP 诊断读题、实现、调试与分工，再用经确认的失败原因选择专题；成功题用作能力基线。"
127
+ - "采样 A 检查从精确排序规则到实现的转化；D 检查计数状态；E 检查大次数变换与模幂，题名不决定算法。"
128
+ - "采样 L 检查可行性单调性与贪心证明；F 检查单调栈和并查集组合；K 检查路径与概率模型组合。"
129
+ - "赛前优先修复已证实、可在剩余时间完成验收的障碍；未证实的缺口先安排短诊断，不直接扩知识点。"
130
+ - "同一题允许多种正确解法；把能解释条件并独立迁移作为验收，不能将某个算法标签当唯一答案。"
74
131
  limitations:
75
- - 当前算法样本只有 NWERC 2024 的一届全卷十三题，不能推出中国区域赛频率、任何场次金牌题数或西安出题预测。
76
- - 读题时间盒、换题条件、验收动作是插件教学设计，需要按个人与团队记录调整，规则来源不证明这些训练阈值。
77
- - 未做跨年份统计；此配置不是西安考纲，排名与奖牌目标仍需对应比赛榜单。模型映射是教学解释，官方解题不证明该题在其他赛区高频。
132
+ - "当前算法样本只有 NWERC 2024 的一届全卷十三题，不能推出中国区域赛频率、任何场次金牌题数或西安出题预测。"
133
+ - "读题时间盒、换题条件、验收动作是插件教学设计，需要按个人与团队记录调整，规则来源不证明这些训练阈值。"
134
+ - "未做跨年份统计；此配置不是西安考纲，排名与奖牌目标仍需对应比赛榜单。模型映射是教学解释，官方解题不证明该题在其他赛区高频。"
78
135
  - id: wf-extension
79
- title: WF 扩展能力诊断（题面样本）
80
- scope: 在基础能力稳定后，以 World Finals 原题检查跨模型推理、约束解释和交互实现。
81
- status: provisional
136
+ title: "WF 扩展能力诊断（题面样本）"
137
+ scope: "在基础能力稳定后，以 World Finals 原题检查跨模型推理、约束解释和交互实现。"
138
+ status: "provisional"
82
139
  sources:
83
- - title: ICPC 2024 World Finals 官方题面（采样 B、I、L）
84
- url: https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf
85
- - title: ICPC 2024 交互题评测说明（输出刷新等要求）
86
- url: https://docs.icpc.global/wp-content/uploads/2024/08/2024-JudgingNotes.pdf
87
- competencyIds: [contest-reading, contest-decision, dp-modeling, graph-modeling, data-structures, math-combinatorics, code-review, team-communication]
140
+ - {"title":"ICPC 2024 World Finals 官方题面（采样 B、I、L）","url":"https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf"}
141
+ - {"title":"ICPC 2024 交互题评测说明（输出刷新等要求）","url":"https://docs.icpc.global/wp-content/uploads/2024/08/2024-JudgingNotes.pdf"}
142
+ competencyIds: ["contest-reading","contest-decision","dp-modeling","graph-modeling","data-structures","math-combinatorics","code-review","team-communication"]
88
143
  samples:
89
- - {year: 2024, contest: World Finals, problem: B, model: 概率对象与事件依赖诊断，题解尚未核验, competencyIds: [math-combinatorics], solutionReviewed: false, sourceUrl: 'https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf'}
90
- - {year: 2024, contest: World Finals, problem: I, model: 树上覆盖目标建模，题解尚未核验, competencyIds: [graph-modeling], solutionReviewed: false, sourceUrl: 'https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf'}
91
- - {year: 2024, contest: World Finals, problem: L, model: 交互信息状态诊断，策略尚未核验, competencyIds: [contest-reading], solutionReviewed: false, sourceUrl: 'https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf'}
144
+ - {"year":2024,"contest":"World Finals","problem":"B","model":"概率对象与事件依赖诊断，题解尚未核验","competencyIds":["math-combinatorics"],"solutionReviewed":false,"sourceUrl":"https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf"}
145
+ - {"year":2024,"contest":"World Finals","problem":"I","model":"树上覆盖目标建模，题解尚未核验","competencyIds":["graph-modeling"],"solutionReviewed":false,"sourceUrl":"https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf"}
146
+ - {"year":2024,"contest":"World Finals","problem":"L","model":"交互信息状态诊断，策略尚未核验","competencyIds":["contest-reading"],"solutionReviewed":false,"sourceUrl":"https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf"}
92
147
  selectionGuidance:
93
- - 采样 B 用于检查概率对象、重复元素与事件依赖的精确表达；不能仅凭概率题标签选一个模板。
94
- - 采样 I 用于检查树上覆盖目标与最坏响应时间的建模，要求先解释判定或优化方案再实现。
95
- - 采样 L 用于检查未知位置与朝向下的信息状态、安全动作和终止条件；交互程序必须按评测说明刷新输出。
96
- - 只有当前基础能力经新题和延迟复测确认后，才将此样本中的扩展任务转为主线；短期比赛可保留为旁线讨论。
148
+ - "采样 B 用于检查概率对象、重复元素与事件依赖的精确表达；不能仅凭概率题标签选一个模板。"
149
+ - "采样 I 用于检查树上覆盖目标与最坏响应时间的建模，要求先解释判定或优化方案再实现。"
150
+ - "采样 L 用于检查未知位置与朝向下的信息状态、安全动作和终止条件；交互程序必须按评测说明刷新输出。"
151
+ - "只有当前基础能力经新题和延迟复测确认后，才将此样本中的扩展任务转为主线；短期比赛可保留为旁线讨论。"
97
152
  limitations:
98
- - 当前只有 2024 WF 三道题面样本，未核验这些题的完整官方题解；能力映射是教学诊断推断，不是唯一解法。
99
- - 不能从样本推出 WF 录取标准、区域赛奖牌线或必备专题全表；不把 CF rating 当作阶段通过证据。
100
- - 不用未验证的交互策略宣称可通过；需要对应交互器与完整程序验证。
153
+ - "当前只有 2024 WF 三道题面样本，未核验这些题的完整官方题解；能力映射是教学诊断推断，不是唯一解法。"
154
+ - "不能从样本推出 WF 录取标准、区域赛奖牌线或必备专题全表；不把 CF rating 当作阶段通过证据。"
155
+ - "不用未验证的交互策略宣称可通过；需要对应交互器与完整程序验证。"
101
156
  - id: xian-pending
102
- title: 西安区域赛（待采样）
103
- scope: 为已选西安目标保留真实样本入口；当前只提供通用比赛过程诊断。
104
- status: provisional
157
+ title: "西安区域赛能力诊断（2025全卷样本）"
158
+ scope: "用2025西安区域赛十三道原题及官方题解支持目标诊断；实际备赛取舍结合当前个人、团队和剩余时间。"
159
+ status: "provisional"
105
160
  sources:
106
- - title: QOJ 西安历年比赛目录（仅核验样本入口，未作专题统计）
107
- url: https://qoj.ac/category/87
108
- - title: ICPC NCNA 公布的区域赛规则（通用背景，非西安本届规则）
109
- url: https://nc.na.icpc.global/rules/
110
- competencyIds: [contest-reading, contest-decision, implementation-stability, code-review, team-communication]
111
- samples: []
161
+ - {"title":"西安2025官方题解（全卷十三题）","url":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1"}
162
+ - {"title":"西安2025原题与赛事身份","url":"https://contest.ucup.ac/contest/2562"}
163
+ - {"title":"QOJ西安历年原题目录","url":"https://qoj.ac/category/87"}
164
+ - {"title":"中国区比赛资料索引（候选入口）","url":"https://github.com/Miantiao1231/acmer-coach/blob/main/docs/china-contest-sources.md"}
165
+ competencyIds: ["contest-reading","contest-decision","implementation-stability","dp-modeling","graph-modeling","data-structures","math-combinatorics","code-review","team-communication"]
166
+ samples:
167
+ - {"year":2025,"contest":"Xi'an","problem":"A","model":"最大攻击者归约与区间覆盖链的线段树动态维护","competencyIds":["contest-reading","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=1"}
168
+ - {"year":2025,"contest":"Xi'an","problem":"B","model":"端点颜色修正的重排判定、双指针最短区间与贪心构造","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=2"}
169
+ - {"year":2025,"contest":"Xi'an","problem":"C","model":"毛毛虫森林判定与双指针维护诱导子图度数","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=4"}
170
+ - {"year":2025,"contest":"Xi'an","problem":"D","model":"前后缀可达点压缩边数，分列选择构造不同共同可达集合","competencyIds":["graph-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=5"}
171
+ - {"year":2025,"contest":"Xi'an","problem":"E","model":"重链剖分把根路径翻转转成前缀，分块统计区间操作的奇偶贡献","competencyIds":["graph-modeling","data-structures"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=6"}
172
+ - {"year":2025,"contest":"Xi'an","problem":"F","model":"单后继依赖形成基环树，从环上首个相遇事件传播停止时间","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=6"}
173
+ - {"year":2025,"contest":"Xi'an","problem":"G","model":"相邻交换论证得到升降序投票贪心","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=7"}
174
+ - {"year":2025,"contest":"Xi'an","problem":"H","model":"黑色连通块计数，EGF、Lagrange 反演与 Stirling 多项式提取系数","competencyIds":["math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=7"}
175
+ - {"year":2025,"contest":"Xi'an","problem":"I","model":"三点路径异或求中心，恢复祖先关系与相邻深度树边","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=8"}
176
+ - {"year":2025,"contest":"Xi'an","problem":"J","model":"购点树形 DP 维护最小和次小子代价，祖先链前缀和回答合并查询","competencyIds":["dp-modeling","graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=8"}
177
+ - {"year":2025,"contest":"Xi'an","problem":"K","model":"按位子集包含的排列匹配，删一位建图压缩网络流","competencyIds":["graph-modeling"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=9"}
178
+ - {"year":2025,"contest":"Xi'an","problem":"L","model":"多边形边长判定、排序连续段与单调指针求各边数最大周长","competencyIds":["math-combinatorics","implementation-stability"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=9"}
179
+ - {"year":2025,"contest":"Xi'an","problem":"M","model":"消空性质分类与补集两状态 DP，区分 1、至少 n 的值和奇偶特例","competencyIds":["dp-modeling","math-combinatorics"],"solutionReviewed":true,"sourceUrl":"https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1#page=10"}
112
180
  selectionGuidance:
113
- - 使用本人和当前团队 VP 的经确认障碍安排短期动作，专题需求暂参考区域赛通用诊断并明示来源。
114
- - 先核验目标届次、原始题面、主办方题解和榜单，再记录逐题模型、可替代解法及样本年份。
115
- - 样本补齐后才修订专题取舍；比赛名和账号 rating 都不能单独生成西安专题权重。
181
+ - "先结合本人和当前队伍的VP记录定位可改善障碍，再用西安2025样本或其他中国赛站新题做短诊断、迁移与限时验收。"
182
+ - "按题意、约束和证明选择模型；贪心、图、DP、数据结构与计数可交叉出现，不能按题号顺序固定开课。"
183
+ - "原配置ID保留，已有目标无需迁移。遇到没有证据的缺口先诊断，旧样本不能自动生成本届专题权重。"
116
184
  limitations:
117
- - 历年目录不能证明某知识点高频；尚未完成西安原题与官方题解逐题采样，不能预测本届题目。
118
- - 此配置不是西安考纲，也未核验目标届次奖牌榜单，不能给出金牌保证或做题数保证。
185
+ - "当前采样2025一届全卷十三题，已核对题意和官方题解；不是西安完整考纲，不能预测本届题目或知识点频率。"
186
+ - "现场榜单和目标届次奖牌名单尚未完整核验，不能给出金牌题数或保证；题解中的通过比例不等于未来出题概率。"
187
+ - "未运行全部程序或独立验证替代解法；样本模型是教学解释，学习保持、迁移和团队表现仍需真实训练记录。"
package/assets/rules/coach-rules.md CHANGED
@@ -17,6 +17,8 @@
17
17
  条件选模型，不能从题名或一次样本计数推出必考、高频或完整考纲。
18
18
  provisional 表示有限样本或尚待取样，不能称官方考纲、预测本届高频专题或保证奖牌。
19
19
  不因某知识点“低频”就永久排除，不把同一道题的某一种解法当唯一算法标签。
20
+ 更多赛站可按需查看 profile 来源里的中国区资料索引。索引链接是候选，先核对年份、
21
+ 赛站、原题和题解；同题镜像不重复算覆盖。现场榜与线上重赛榜分开，不从后者推奖牌线。
20
22
  * 原始 VP 判题、耗时和提交是观察；WA 不等于不会，AC 不证明独立完成。先用
21
23
  `coach_curriculum assess` 取事实引用，再在 `coach_postmortem findings` 记录 hypothesis。
22
24
  查代码/回放核实后才用 confirmed，引用本场真实事实并解释原因；resolved 需要独立成功
package/dev/catalog-check.mjs CHANGED
@@ -19,7 +19,15 @@ function sources(value, label) {
19
19
  assert.ok(typeof source.title === 'string' && source.title.trim(), `${label}: source title required`)
20
20
  const url = new URL(source.url)
21
21
  assert.equal(url.protocol, 'https:', `${label}: public HTTPS source required`)
22
- assert.ok(!url.username && !url.password && !url.search, `${label}: no account credentials or query data`)
22
+ assert.ok(!url.username && !url.password, `${label}: no account credentials`)
23
+ if (url.search) {
24
+ assert.equal(url.hostname, 'contest.ucup.ac', `${label}: only public official attachments may use query parameters`)
25
+ assert.equal(url.pathname, '/download.php')
26
+ assert.deepEqual([...url.searchParams.keys()].sort(), ['id', 'r', 'type'])
27
+ assert.equal(url.searchParams.get('type'), 'attachments')
28
+ assert.match(url.searchParams.get('id'), /^\d+$/)
29
+ assert.match(url.searchParams.get('r'), /^\d+$/)
30
+ }
23
31
  assert.ok(url.pathname !== '/', `${label}: link to evidence, not a homepage`)
24
32
  }
25
33
  }
@@ -35,27 +43,54 @@ test('contest evidence exposes actual reviewed samples, never a complete syllabu
35
43
  const store = createStrategyStore({ dataDir: dir, competenciesPath: fileURLToPath(new URL('COMPETENCIES.yaml', knowledge)) })
36
44
  const profiles = store.target('profiles').availableProfiles
37
45
  const regional = profiles.find(profile => profile.id === 'regional-diagnostic')
38
- assert.equal(regional.coverage.sampledProblems, 19)
39
- assert.equal(regional.coverage.reviewedSolutions, 19)
40
- assert.deepEqual(regional.coverage.years, [2022, 2023])
46
+ assert.equal(regional.coverage.sampledProblems, 70)
47
+ assert.equal(regional.coverage.reviewedSolutions, 70)
48
+ assert.deepEqual(regional.coverage.years, [2022, 2023, 2024, 2025])
41
49
  assert.equal(regional.coverage.isSyllabus, false)
42
50
  assert.deepEqual(regional.samples.filter(sample => sample.year === 2022).map(sample => sample.problem).sort(), [...'ABCDEFGHIJKLM'])
43
- assert.equal(new Set(regional.samples.map(sample => `${sample.contest}:${sample.year}:${sample.problem}`)).size, 19)
51
+ assert.equal(new Set(regional.samples.map(sample => `${sample.contest}:${sample.year}:${sample.problem}`)).size, 70)
52
+ const additions = [
53
+ ["Xi'an", 2025, 'ABCDEFGHIJKLM', 'contest.ucup.ac', '/download.php'],
54
+ ['Hangzhou', 2024, 'ABCDEFGHIJKLM', 'contest.ucup.ac', '/download.php'],
55
+ ['Shanghai', 2025, 'ABCDEFGHIJKLM', 'ucup.ac', '/tutorials/tutorials-4-12-zh.pdf'],
56
+ ['Hong Kong', 2025, 'ABCDEFGHIJKL', 'ucup.ac', '/tutorials/tutorials-4-14-en.pdf'],
57
+ ]
58
+ for (const [city, year, letters, host, pathname] of additions) {
59
+ const samples = regional.samples.filter(sample => sample.contest === city && sample.year === year)
60
+ assert.deepEqual(samples.map(sample => sample.problem).sort(), [...letters], `${city}: reviewed full paper`)
61
+ for (const sample of samples) {
62
+ const url = new URL(sample.sourceUrl)
63
+ assert.equal(url.hostname, host)
64
+ assert.equal(url.pathname, pathname)
65
+ assert.match(url.hash, /^#page=[1-9]\d*$/)
66
+ if (city === "Xi'an" || city === 'Hangzhou') {
67
+ assert.equal(url.searchParams.get('type'), 'attachments')
68
+ assert.equal(url.searchParams.get('id'), city === "Xi'an" ? '2562' : '1893')
69
+ assert.equal(url.searchParams.get('r'), '1')
70
+ }
71
+ }
72
+ }
44
73
  assert.match(regional.title, /中国|亚洲/)
45
74
  for (const sample of regional.samples) {
46
75
  assert.ok(sample.model && sample.solutionReviewed)
47
- assert.match(sample.sourceUrl, sample.year === 2022
76
+ if (sample.contest === 'Nanjing') assert.match(sample.sourceUrl, sample.year === 2022
48
77
  ? /^https:\/\/sua\.ac\/wiki\/2022-icpc-nanjing\/tutorial-sketch-zh\.pdf#page=\d+$/
49
78
  : /^https:\/\/universal-cup-website\.qoj\.ac\/files\/ucup\/tutorials\/tutorials-2-11\.pdf#page=\d+$/)
50
79
  assert.ok(sample.competencyIds.every(id => competencies.some(card => card.id === id)))
51
80
  }
52
81
  const xian = profiles.find(profile => profile.id === 'xian-pending')
53
- assert.equal(xian.coverage.sampledProblems, 0)
54
- assert.equal(xian.coverage.reviewedSolutions, 0)
82
+ assert.equal(xian.coverage.sampledProblems, 13)
83
+ assert.equal(xian.coverage.reviewedSolutions, 13)
84
+ assert.deepEqual(xian.coverage.years, [2025])
85
+ assert.deepEqual(xian.samples, regional.samples.filter(sample => sample.contest === "Xi'an"))
55
86
  assert.equal(xian.coverage.isSyllabus, false)
56
87
  assert.equal(store.target('set', { expectedRevision: 0, contest: '区域赛', date: '2026-10-17', result: '稳定', profileId: regional.id, weeklyHours: 25,
57
88
  priorities: [{ id: 'graph-modeling', weight: 10 }] }).ok, true)
58
- assert.equal(store.focus().profile.coverage.sampledProblems, 19)
89
+ assert.equal(store.focus().profile.coverage.sampledProblems, 70)
90
+ assert.equal(store.target('set', { expectedRevision: 1, contest: '西安区域赛', date: '2026-10-17', result: '稳定', profileId: 'xian-pending', weeklyHours: 25,
91
+ priorities: [{ id: 'graph-modeling', weight: 10 }] }).ok, true)
92
+ assert.equal(store.focus().profile.coverage.reviewedSolutions, 13)
93
+ assert.equal(store.focus().profile.id, 'xian-pending')
59
94
  assert.equal(profiles.find(profile => profile.id === 'nwerc-reference').coverage.reviewedSolutions, 13)
60
95
  } finally { rmSync(dir, { recursive: true, force: true }) }
61
96
  })
package/dev.sh CHANGED
@@ -35,7 +35,7 @@ done
35
35
  # 从副本目录跑 `bash dev.sh` 走的是另一条路（`dsh plugin remove/add`，而那条
36
36
  # 路不可靠），和这份的行为不一样。换句话说，**同一个命令，从哪个目录按回车
37
37
  # 决定跑哪份脚本** —— 两份 dev.sh 就是两份真相，正是这份文件在防的那种坑。
38
- SYNC_FILES='index.js package.json verify.mjs verify-shape.mjs progress-cli.mjs build-node-meta.mjs cordis.patch.yml README.md lib/client.js lib/vp-client.js lib/workspace-migration.js lib/setup.js lib/curriculum.js lib/curriculum-evidence.js lib/curriculum-planning.js lib/strategy.js lib/teaching.js assets/knowledge/COMPETENCIES.yaml assets/knowledge/NODE_SCOPES.yaml assets/knowledge/CONTEST_PROFILES.yaml assets/knowledge/vp.html assets/knowledge/skilltree.html assets/rules/coach-rules.md dev/curriculum-check.mjs dev/curriculum-evidence-check.mjs dev/strategy-check.mjs dev/workspace-migration-check.mjs dev/vp-client-check.mjs dev/vp-sync-check.mjs dev/catalog-check.mjs dev/coaching-contract-check.mjs dev/teaching-check.mjs dev/grading-check.mjs dev/training-check.mjs coach/skilltree_template.html dev/run-all.sh docs/长期课程机制.md docs/比赛与教学依据.md docs/设计方针.md dev.sh'
38
+ SYNC_FILES='index.js package.json verify.mjs verify-shape.mjs progress-cli.mjs build-node-meta.mjs cordis.patch.yml README.md lib/client.js lib/vp-client.js lib/workspace-migration.js lib/setup.js lib/curriculum.js lib/curriculum-evidence.js lib/curriculum-planning.js lib/strategy.js lib/teaching.js assets/knowledge/COMPETENCIES.yaml assets/knowledge/NODE_SCOPES.yaml assets/knowledge/CONTEST_PROFILES.yaml assets/knowledge/vp.html assets/knowledge/skilltree.html assets/rules/coach-rules.md dev/curriculum-check.mjs dev/curriculum-evidence-check.mjs dev/strategy-check.mjs dev/workspace-migration-check.mjs dev/vp-client-check.mjs dev/vp-sync-check.mjs dev/catalog-check.mjs dev/coaching-contract-check.mjs dev/teaching-check.mjs dev/grading-check.mjs dev/training-check.mjs coach/skilltree_template.html dev/run-all.sh docs/长期课程机制.md docs/比赛与教学依据.md docs/设计方针.md docs/china-contest-sources.md dev.sh'
39
39
  STALE=''
40
40
  for f in $SYNC_FILES; do
41
41
  for d in "${DSTS[@]}"; do
package/docs/china-contest-sources.md ADDED
@@ -0,0 +1,423 @@
1
+ # 中国区比赛资料索引
2
+
3
+ 来源：用户整理的56场公开比赛资料，2026-10-12接入。原始工作表保持不动。
4
+
5
+ 这里保存资料候选，按需打开对应赛事，不随每轮对话全部注入。链接存在或HTTP成功不证明比赛身份和题解正确。只有读过题面、题解并记录逐题模型的条目，才进入 CONTEST_PROFILES.yaml 的 solutionReviewed 覆盖。
6
+
7
+ 覆盖2019—2026：45场区域赛、7场EC-Final、4场邀请赛。邀请赛作为补充，省赛、网络赛和同题镜像不重复算区域赛样本。赛事年份按原赛季，不因重赛举办年改写。
8
+
9
+ 现场榜、CF练习榜和UCup重赛榜分别核对身份；判断奖牌门槛需要对应现场榜。题目通过比例不是未来出题概率。
10
+
11
+ 已修正2024杭州的UCup错配：Stage8 Cangqian为浙江省赛，真正的2024杭州区域赛是Stage25 Hangzhou、场次1893。其他未核实条目保留候选身份。
12
+
13
+ ## 2026
14
+
15
+ ### 南昌（邀请赛）
16
+
17
+ - 题面候选：<https://codeforces.com/gym/106551/attachments/download/37848/statements-en.pdf>；<https://codeforces.com/gym/106551/attachments/download/37847/statements-zh.pdf>；<https://codeforces.com/gym/106551>
18
+ - 官方题解候选：<https://codeforces.com/gym/106551/attachments/download/37849/solution.pdf>
19
+ - 社区资料候选：<https://www.cnblogs.com/LeoCodex/p/20161350>；<https://www.bilibili.com/video/BV1gnL16nEJj/>；<https://www.luogu.com.cn/article/h1oiz05v>
20
+ - 榜单候选：<https://codeforces.com/gym/106551/standings>
21
+
22
+ ### 深圳（邀请赛）
23
+
24
+ - 题面候选：<https://sua.ac/wiki/2026-icpc-invitational-shenzhen/contest-en.pdf>；<https://sua.ac/wiki/2026-icpc-invitational-shenzhen/contest-zh.pdf>
25
+ - 官方题解候选：<https://sua.ac/wiki/2026-icpc-invitational-shenzhen/tutorial-sketch-zh.pdf>；<https://ucup.ac/tutorials/tutorials-4-e5-zh.pdf>
26
+ - 社区资料候选：<https://www.cnblogs.com/BigSmall-En/p/19964638>；<https://www.cnblogs.com/SHOJYS/p/19865050>；<https://www.zhihu.com/question/2012528096838984086>
27
+ - 榜单候选：<https://board.xcpcio.com/icpc/51st/shenzhen-invitational>；<https://sua.ac/wiki/2026-icpc-invitational-shenzhen/board/index.html>；<https://qoj.ac/contest/3588?v=1>
28
+
29
+ ## 2025
30
+
31
+ ### 成都（区域赛）
32
+
33
+ - 题面候选：<https://codeforces.com/gym/106161/attachments/download/34102/contest.en-cf.pdf>；<https://qoj.ac/contest/2567>
34
+ - 官方题解候选：<https://codeforces.com/gym/106161/attachments/download/34103/2025%20%E5%9B%BD%E9%99%85%E5%A4%A7%E5%AD%A6%E7%94%9F%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E7%AB%9E%E8%B5%9B%E4%BA%9A%E6%B4%B2%E5%8C%BA%E5%9F%9F%E8%B5%9B%EF%BC%88%E6%88%90%E9%83%BD%E7%AB%99%EF%BC%89%E9%A2%98%E8%A7%A3.pdf>；<https://qoj.ac/download.php?type=attachments&id=2567&r=1>
35
+ - 社区资料候选：<https://www.zhihu.com/question/1961881511054780403>；<https://kisuraop.github.io/posts/1fbf08d.html>；<https://www.cnblogs.com/dbg-8/p/23135138>；<https://blog.csdn.net/2301_81172006/article/details/154406871>
36
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/chengdu>
37
+ - CF Gym候选：<https://codeforces.com/gym/106161>
38
+
39
+ ### 香港（区域赛）
40
+
41
+ - 题面候选：<https://qoj.ac/contest/3169>
42
+ - 官方题解候选：<https://ucup.ac/tutorials/tutorials-4-14-en.pdf>
43
+ - 社区资料候选：<https://chen-hongxuan.github.io/chx-AT-xjtu/posts/vp20260821-2026-icpc-hong-kong/>；<https://www.luogu.com.cn/article/bxwbaaon>
44
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/hongkong>
45
+
46
+ ### 南京（区域赛）
47
+
48
+ - 题面候选：<https://sua.ac/wiki/2025-icpc-nanjing/contest-en.pdf>；<https://sua.ac/wiki/2025-icpc-nanjing/contest-zh.pdf>；<https://contest.ucup.ac/download.php?type=attachments&id=2581&r=0>；<https://qoj.ac/contest/2581?v=1>
49
+ - 官方题解候选：<https://sua.ac/wiki/2025-icpc-nanjing/tutorial-sketch-zh.pdf>；<https://contest.ucup.ac/download.php?type=attachments&id=2581&r=2>
50
+ - 社区资料候选：<https://www.zhihu.com/question/1963739083760199356>；<https://www.bilibili.com/video/BV1VxkiB8EBW/>；<https://www.cnblogs.com/butaihuia/category/2505749.html>；<https://www.cnblogs.com/BigSmall-En/p/23243067>
51
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/nanjing>；<https://contest.ucup.ac/contest/2581/standings>；<https://sua.ac/wiki/2025-icpc-nanjing/board>
52
+
53
+ ### 上海（区域赛）
54
+
55
+ - 题面候选：<https://qoj.ac/contest/2908>
56
+ - 官方题解候选：<https://ucup.ac/tutorials/tutorials-4-12-zh.pdf>
57
+ - 社区资料候选：<https://www.cnblogs.com/Sai0511/p/19787759>；<https://www.cnblogs.com/bananawolf/p/23126201>；<https://www.luogu.com.cn/article/pugx55j5>
58
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/shanghai>
59
+
60
+ ### 沈阳（区域赛）
61
+
62
+ - 题面候选：<https://codeforces.com/gym/106252/attachments/download/34720/contest_en.pdf>；<https://codeforces.com/gym/106252/attachments/download/34721/contest_zh.pdf>；<https://codeforces.com/gym/106252>；<https://qoj.ac/contest/2641>
63
+ - 官方题解候选：<https://codeforces.com/gym/106252/attachments/download/34725/shenyang_2025_editorial.pdf>
64
+ - 社区资料候选：<https://zhuanlan.zhihu.com/p/1979060908568372647>；<https://blog.csdn.net/weixin_65995475/article/details/157250215>；<https://blog.csdn.net/weixin_65995475/article/details/157220948>；<https://www.cnblogs.com/butaihuia/p/20065585>
65
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/shenyang>；<https://codeforces.com/gym/106252/standings>；<https://rl.algoux.cn/collection/official?rankId=icpc2025shenyang>
66
+
67
+ ### 西安（区域赛）
68
+
69
+ - 题面候选：<https://contest.ucup.ac/contest/2562>；<https://qoj.ac/contest/2562>
70
+ - 官方题解候选：<https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1>
71
+ - 社区资料候选：<https://www.cnblogs.com/Kescholar/p/19158354>；<https://www.cnblogs.com/alexande/p/23242589>；<https://xiamen-university-malaysia.github.io/xcpc-wiki/solution/2026-04-27-ICPC2025%E8%A5%BF%E5%AE%89%E5%8C%BA%E5%9F%9F%E8%B5%9B-MystiqueasIris-zeyu10/>
72
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/xian>；<https://contest.ucup.ac/contest/2562/standings>
73
+
74
+ ### EC-Final（EC-Final）
75
+
76
+ - 题面候选：<https://sua.ac/wiki/2025-icpc-ecfinal/contest-en.pdf>；<https://qoj.ac/contest/3295?v=1>
77
+ - 官方题解候选：<https://sua.ac/wiki/2025-icpc-ecfinal/tutorial-sketch-zh.pdf>
78
+ - 社区资料候选：<https://www.zhihu.com/question/1975983771565195445>；<https://www.bilibili.com/video/BV1DaFwzuEyq/>；<https://www.luogu.com.cn/article/69lh72tc>；<https://www.zhihu.com/question/1975983771565195445/answer/2001963996971037430>
79
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/ecfinal>；<https://sua.ac/wiki/2025-icpc-ecfinal/board>
80
+
81
+ ### 武汉（邀请赛）
82
+
83
+ - 题面候选：<https://qoj.ac/contest/2609>
84
+ - 社区资料候选：<https://blog.csdn.net/2302_80005692/article/details/155277446>；<https://kisuraop.github.io/posts/1fbf08d.html>；<https://www.luogu.com.cn/article/f30fdoys>；<https://www.luogu.com.cn/article/vv6akvgn>
85
+ - 榜单候选：<https://board.xcpcio.com/icpc/50th/wuhan>
86
+
87
+ ## 2024
88
+
89
+ ### 成都（区域赛）
90
+
91
+ - 题面候选：<https://codeforces.com/gym/105486/attachments/download/28065/contest-45695-en.pdf>；<https://codeforces.com/gym/105486>；<https://codeforces.com/gym/105486/attachments>
92
+ - 官方题解候选：<https://codeforces.com/gym/105486/attachments/download/28066/ICPC成都.pdf>；<https://codeforces.com/gym/105486/attachments/download/28066/ICPC%E6%88%90%E9%83%BD.pdf>
93
+ - 社区资料候选：<https://www.cnblogs.com/doecr/p/22805965>；<https://www.cnblogs.com/cjcf/p/18520863>；<https://mip001.com/post/2024-icpc-qu-yu-sai-cheng-du-zhan-vp-bu-fen-ti-jie/>；<https://www.cnblogs.com/redial/p/19153604>
94
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/chengdu>
95
+
96
+ ### 杭州（区域赛）
97
+
98
+ - 题面候选：<https://codeforces.com/gym/105657/attachments/download/29538/contest-43074-en.pdf>；<https://contest.ucup.ac/contest/1893?v=1>
99
+ - 官方题解候选：<https://codeforces.com/gym/105657/attachments/download/29539/hangzhou_2024_editorial.pdf>；<https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1>
100
+ - 社区资料候选：<https://www.zhihu.com/question/2075998990>；<https://zhuanlan.zhihu.com/p/19728788536>；<https://zhuanlan.zhihu.com/p/1947095840259838975>；<https://wallbreaker5th.top/posts/oi_icpc/sol_icpc_2024_hangzhou>；<https://www.cnblogs.com/BYR-KKK/p/18723376>
101
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/hangzhou>；<https://sua.ac/wiki/2024-icpc-hangzhou/board/>；<https://contest.ucup.ac/contest/1893/standings>
102
+ - CF Gym候选：<https://codeforces.com/gym/105657>
103
+
104
+ ### 香港（区域赛）
105
+
106
+ - 题面候选：<https://contest.ucup.ac/download.php?type=attachments&id=1885&r=0>；<https://contest.ucup.ac/contest/1885/problem/9924/statement/zh_cn>；<https://qoj.ac/contest/1885?v=1>
107
+ - 官方题解候选：<https://contest.ucup.ac/download.php?type=attachments&id=1885&r=1>
108
+ - 社区资料候选：<https://wallbreaker5th.top/posts/oi_icpc/sol_icpc_2024_hongkong>；<https://www.cnblogs.com/Young-Cloud/p/19127116>；<https://www.cnblogs.com/yerosius/p/18717587>；<https://blog.csdn.net/Maxwell_Newton/article/details/153053220>
109
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/hongkong>
110
+
111
+ ### 南京（区域赛）
112
+
113
+ - 题面候选：<https://codeforces.com/gym/105484/attachments/download/28235/contest-zh.pdf>；<https://codeforces.com/gym/105484/attachments/download/28234/contest-en.pdf>；<https://sua.ac/wiki/2024-icpc-nanjing/contest-en.pdf>；<https://sua.ac/wiki/2024-icpc-nanjing/contest-zh.pdf>；<https://codeforces.com/gym/105484>；<https://qoj.ac/contest/1828?v=1>
114
+ - 官方题解候选：<https://codeforces.com/gym/105484/attachments/download/28236/tutorial-sketch-zh.pdf>；<https://sua.ac/wiki/2024-icpc-nanjing/tutorial-sketch-zh.pdf>
115
+ - 社区资料候选：<https://www.zhihu.com/question/1697731848>；<https://www.bilibili.com/video/BV1dQDtYzERC/>；<https://wallbreaker5th.top/posts/oi_icpc/sol_icpc_2024_nanjing.html>；<https://blog.hikariyo.net/xcpc/editorial/2024-nanjing-reg/>
116
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/nanjing>；<https://sua.ac/wiki/2024-icpc-nanjing/board/>
117
+
118
+ ### 上海（区域赛）
119
+
120
+ - 题面候选：<https://contest.ucup.ac/download.php?type=attachments&id=1913&r=0>；<https://contest.ucup.ac/contest/1913>
121
+ - 官方题解候选：<https://contest.ucup.ac/download.php?type=attachments&id=1913&r=1>
122
+ - 社区资料候选：<https://www.cnblogs.com/redial/p/18664720>；<https://www.cnblogs.com/kangyi996/p/19173769>；<https://www.cnblogs.com/rickylin/p/19140066>
123
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/shanghai>；<https://contest.ucup.ac/contest/1913/standings>
124
+
125
+ ### 沈阳（区域赛）
126
+
127
+ - 题面候选：<https://codeforces.com/gym/105578/attachments/download/28637/2024-shenyang-statement-en.pdf>；<https://codeforces.com/gym/105578/attachments/download/28638/2024-shenyang-statement-zh.pdf>
128
+ - 官方题解候选：<https://codeforces.com/gym/105578/attachments/download/29328/shenyang_2024_editorial.pdf>
129
+ - 社区资料候选：<https://wallbreaker5th.top/posts/oi_icpc/sol_icpc_2024_shenyang>；<https://www.cnblogs.com/szmssf/p/18706357>；<https://www.cnblogs.com/joyce-peng/articles/19205560>；<https://blog.csdn.net/2301_80379979/article/details/144212428>
130
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/shenyang>
131
+ - CF Gym候选：<https://codeforces.com/gym/105578>
132
+
133
+ ### EC-Final（EC-Final）
134
+
135
+ - 题面候选：<https://qoj.ac/contest/1894>
136
+ - 社区资料候选：<https://www.cnblogs.com/wjwweiwei/p/18695104>；<https://blogs.sving1024.top/posts/55384/>
137
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/ecfinal>
138
+
139
+ ### 昆明（邀请赛）
140
+
141
+ - 题面候选：<https://codeforces.com/gym/105588/attachments/download/28813/1-statement-english.pdf>；<https://codeforces.com/gym/105588/attachments/download/28814/2-statement-chinese.pdf>
142
+ - 官方题解候选：<https://codeforces.com/gym/105588/attachments/download/28803/tutorial.pdf>
143
+ - 社区资料候选：<https://www.cnblogs.com/doecr/p/22684237>；<https://www.cnblogs.com/Young-Cloud/p/19128972>；<https://www.zh314.xyz/2024/12/10/icpc2024-%E6%98%86%E6%98%8E-h%E6%89%AB%E6%8F%8F%E5%9C%B0%E5%B9%B3%E7%BA%BF-%E9%A2%98%E8%A7%A3/>
144
+ - 榜单候选：<https://board.xcpcio.com/icpc/49th/kunming>；<https://qoj.ac/contest/1871>；<https://contest.ucup.ac/results/QOJ1871>
145
+ - CF Gym候选：<https://codeforces.com/gym/105588>
146
+
147
+ ## 2023
148
+
149
+ ### 杭州（区域赛）
150
+
151
+ - 题面候选：<https://codeforces.com/gym/104976/attachments/download/24254/hangzhou(zh).pdf>；<https://codeforces.com/gym/104976/attachments/download/24253/hangzhou(en).pdf>；<https://codeforces.com/gym/104976>；<https://assets.ucup.ac/statements/statements-2-22.pdf>；<https://contest.ucup.ac/contest/1516>
152
+ - 官方题解候选：<https://codeforces.com/gym/104976/attachments/download/24255/Hangzhou_Tutorial.pdf>
153
+ - 社区资料候选：<https://www.cnblogs.com/maple276/p/18141919>；<https://www.cnblogs.com/ft61/p/18031259>；<https://www.luogu.com.cn/article/rea9hcxi>；<https://blog.csdn.net/2301_80281705/article/details/139072999>
154
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/hangzhou>；<https://contest.ucup.ac/contest/1516/standings>；<https://codeforces.com/gym/104976/standings>
155
+
156
+ ### 合肥（区域赛）
157
+
158
+ - 题面候选：<https://codeforces.com/gym/104857/attachments/download/23404/HefeiStatements.pdf>；<https://qoj.ac/problem/7874>
159
+ - 官方题解候选：<https://codeforces.com/gym/104857/attachments/download/23405/23hefei-sol.pdf>；<https://contest.ucup.ac/download.php?type=attachments&id=1440&r=1>
160
+ - 社区资料候选：<https://www.cnblogs.com/ft61/p/18393689>；<https://www.cnblogs.com/Young-Cloud/p/19146823>；<https://www.cnblogs.com/luckyblock/p/17859464.html>；<https://blog.csdn.net/2301_79881289/article/details/152414055>
161
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/hefei>；<https://contest.ucup.ac/contest/1440/standings>；<https://contest.ucup.ac/contest/1440>
162
+ - CF Gym候选：<https://codeforces.com/gym/104857>
163
+
164
+ ### 香港（区域赛）
165
+
166
+ - 题面候选：<https://codeforces.com/gym/104172/attachments/download/18932/Official%20Contest.pdf>；<https://codeforces.com/group/wmhDiB5PTN/contest/469222/attachments/download/18932/Official%20Contest.pdf>；<https://qoj.ac/contest/1099>
167
+ - 官方题解候选：<https://codeforces.com/gym/104172/attachments/download/18933/Hong_Kong_Tutorial.pdf>
168
+ - 社区资料候选：<https://www.cnblogs.com/Zeoy-kkk/p/17242177.html>；<https://www.cnblogs.com/jimmywang/p/17233366.html>；<https://blog.csdn.net/qq_61305213/article/details/129228421>
169
+ - 榜单候选：<https://codeforces.com/gym/104172/standings>；<https://board.xcpcio.com/icpc/47th/hongkong>
170
+ - CF Gym候选：<https://codeforces.com/gym/104172>
171
+
172
+ ### 济南（区域赛）
173
+
174
+ - 题面候选：<https://codeforces.com/gym/104901/attachments/download/23713/contest-zh.pdf>；<https://codeforces.com/gym/104901/attachments/download/23712/contest-en.pdf>；<https://sua.ac/wiki/2023-icpc-jinan/contest-en.pdf>；<https://sua.ac/wiki/2023-icpc-jinan/contest-zh.pdf>
175
+ - 官方题解候选：<https://codeforces.com/gym/104901/attachments/download/23714/tutorial-sketch-zh.pdf>；<https://sua.ac/wiki/2023-icpc-jinan/tutorial-sketch-zh.pdf>
176
+ - 社区资料候选：<https://www.zhihu.com/question/631214119>；<https://www.bilibili.com/video/BV1VC4y117Bh/>；<https://www.cnblogs.com/maple276/p/18005460>；<https://www.cnblogs.com/RosmontisL/p/18107197>
177
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/jinan>；<https://sua.ac/wiki/2023-icpc-jinan/board>
178
+ - QOJ候选：<https://qoj.ac/contest/1472>
179
+ - CF Gym候选：<https://codeforces.com/gym/104901>
180
+
181
+ ### 澳门（区域赛）
182
+
183
+ - 题面候选：<https://codeforces.com/gym/104891/attachments/download/23610/statements-2-15.pdf>；<https://codeforces.com/gym/104891>
184
+ - 官方题解候选：<https://codeforces.com/gym/104891/attachments/download/23611/tutorials-2-15.pdf>；<https://qoj.ac/files/ucup/tutorials/tutorials-2-15.pdf>
185
+ - 社区资料候选：<https://www.cnblogs.com/c201904xyorz/articles/17969215>；<https://blog.csdn.net/qq_42643660/article/details/142703863>
186
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/macau>；<https://qoj.ac/results/QOJ1459>
187
+
188
+ ### 南京（区域赛）
189
+
190
+ - 题面候选：<https://codeforces.com/gym/104821/attachments/download/23214/2023nj-en.pdf>；<https://codeforces.com/gym/104821/attachments/download/23215/2023nj-cn.pdf>；<https://sua.ac/wiki/2023-icpc-nanjing/contest-en.pdf>；<https://sua.ac/wiki/2023-icpc-nanjing/contest-zh.pdf>；<https://qoj.ac/contest/1435>
191
+ - 官方题解候选：<https://codeforces.com/gym/104821/attachments/download/23217/nanjing_2023_editorial.pdf>；<https://sua.ac/wiki/2023-icpc-nanjing/tutorial-sketch-zh.pdf>；<https://sua.ac/wiki/2023-icpc-nanjing/>
192
+ - 社区资料候选：<https://www.zhihu.com/question/627281278>；<https://www.bilibili.com/video/BV1VQ4y1n7vC/>；<https://www.cnblogs.com/MiniLong/p/18442481>；<https://www.cnblogs.com/Young-Cloud/p/19136179>；<https://www.cnblogs.com/kangyi996/p/19203389>
193
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/nanjing>；<https://sua.ac/wiki/2023-icpc-nanjing/board/>；<https://qoj.ac/contest/1435/standings>
194
+ - CF Gym候选：<https://codeforces.com/gym/104821>
195
+
196
+ ### 沈阳（区域赛）
197
+
198
+ - 题面候选：<https://codeforces.com/gym/104869/attachments/download/23414/contest-35353-en.pdf>；<https://codeforces.com/gym/104869>
199
+ - 官方题解候选：<https://codeforces.com/gym/104869/attachments/download/23443/2023shenyang_tutorial.pdf>
200
+ - 社区资料候选：<https://www.cnblogs.com/dmoransky/p/17935177.html>；<https://zhuanlan.zhihu.com/p/667857302>；<https://blog.csdn.net/dhxbshbdjzxy/article/details/139061981>；<https://www.zhihu.com/question/628657108>
201
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/shenyang>；<https://codeforces.com/gym/104869/standings>
202
+
203
+ ### 西安（区域赛）
204
+
205
+ - 题面候选：<https://codeforces.com/gym/105471>；<https://qoj.ac/contest/1291>；<https://qoj.ac/contest/1784>
206
+ - 官方题解候选：<https://codeforces.com/gym/105471/attachments>
207
+ - 社区资料候选：<https://www.xiezheyuan.xyz/problems/lives/ucup/3-9.html>；<https://www.cnblogs.com/Young-Cloud/p/19144556>；<https://www.luogu.com.cn/article/62rq75ty>
208
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/xian>
209
+
210
+ ### EC-Final（EC-Final）
211
+
212
+ - 题面候选：<https://contest.ucup.ac/download.php?type=attachments&id=1522&r=0>；<https://contest.ucup.ac/contest/1522>
213
+ - 官方题解候选：<https://assets.ucup.ac/tutorials/tutorials-2-23.pdf>；<https://contest.ucup.ac/download.php?type=attachments&id=1522&r=1>
214
+ - 社区资料候选：<https://www.luogu.com.cn/article/auj5604a>；<https://www.luogu.com.cn/article/rh7aixly>；<https://www.cnblogs.com/Kescholar/p/19137353>；<https://www.zhihu.com/question/634199857/answer/3356337905>
215
+ - 榜单候选：<https://board.xcpcio.com/icpc/48th/ecfinal>；<https://contest.ucup.ac/contest/1522/standings>
216
+
217
+ ## 2022
218
+
219
+ ### 杭州（区域赛）
220
+
221
+ - 题面候选：<https://codeforces.com/gym/104090/attachments/download/18135/2022ICPCHangzhouStatements.pdf>；<https://qoj.ac/download.php?type=statement&id=5302>；<https://codeforces.com/gym/104090>；<https://mirror.codeforces.com/gym/104090/attachments/download/18135/2022ICPCHangzhouStatements.pdf>；<https://qoj.ac/contest/1071>
222
+ - 官方题解候选：<https://codeforces.com/gym/104090/attachments/download/18136/2022ICPCHangzhouTutorial.pdf>；<https://codeforces.com/gym/104090/attachments>
223
+ - 社区资料候选：<https://www.cnblogs.com/Hamine/p/17213471.html>；<https://www.cnblogs.com/redial/p/18700013>；<https://blog.csdn.net/qq_74355721/article/details/142342587>；<https://zhuanlan.zhihu.com/p/627718647>
224
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/hangzhou>
225
+
226
+ ### 合肥（区域赛）
227
+
228
+ - 社区资料候选：<https://challestend.github.io/icpc-2022-regional-hefei-notes/>；<https://www.cnblogs.com/thedreammaker/p/16696961.html>；<https://lrl52.top/737/2022-icpc-hefei-record/>
229
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/hefei>
230
+
231
+ ### 香港（区域赛）
232
+
233
+ - 题面候选：<https://qoj.ac/contest/1099>
234
+ - 社区资料候选：<https://www.cnblogs.com/haze1231/p/18080265>；<https://www.cnblogs.com/Kescholar/category/2474828.html>
235
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/hongkong>
236
+
237
+ ### 济南（区域赛）
238
+
239
+ - 题面候选：<https://codeforces.com/gym/104076>；<https://codeforces.com/group/6K18zNGBDB/contest/104076/attachments/download/18036/jn.pdf>；<https://qoj.ac/contest/1053>；<https://www.luogu.com.cn/contest/135030>
240
+ - 官方题解候选：<https://codeforces.com/group/nt86J5RALD/contest/104076/attachments/download/18037/jinan_sol.pdf>
241
+ - 社区资料候选：<https://zhuanlan.zhihu.com/p/1901666378689274449>；<https://zhuanlan.zhihu.com/p/594998880>；<https://zhuanlan.zhihu.com/p/590527069>；<https://zhuanlan.zhihu.com/p/587399484>
242
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/jinan>
243
+
244
+ ### 南京（区域赛）
245
+
246
+ - 题面候选：<https://codeforces.com/gym/104128/attachments/download/18620/contest-zh.pdf>；<https://codeforces.com/gym/104128/attachments/download/18621/contest-en.pdf>；<https://sua.ac/wiki/2022-icpc-nanjing/contest-en.pdf>；<https://sua.ac/wiki/2022-icpc-nanjing/contest-zh.pdf>；<https://codeforces.com/gym/104128>；<https://qoj.ac/contest/1093>
247
+ - 官方题解候选：<https://codeforces.com/gym/104128/attachments/download/18363/nanjing_2022_editorial.pdf>；<https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf>；<https://codeforces.com/group/IzJO8Wzxd1/contest/483991/attachments/download/18363/nanjing_2022_editorial.pdf>
248
+ - 社区资料候选：<https://www.zhihu.com/question/572113636>；<https://www.cnblogs.com/do-while-true/p/17368384.html>；<https://blog.csdn.net/m0_74087709/article/details/143310592>；<https://zhuanlan.zhihu.com/p/631037205>；<https://www.luogu.com.cn/blog/WonderThyme/bi-sai-12022icpc-na-jing>
249
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/nanjing>；<https://sua.ac/wiki/2022-icpc-nanjing/board/>
250
+
251
+ ### 沈阳（区域赛）
252
+
253
+ - 题面候选：<https://codeforces.com/gym/104160/attachments/download/18867/contest-29627-en.pdf>；<https://codeforces.com/gym/104160>；<https://qoj.ac/contest/1096>
254
+ - 官方题解候选：<https://codeforces.com/gym/104160/attachments/download/18879/shenyang_2022_editorial.pdf>
255
+ - 社区资料候选：<https://www.cnblogs.com/ZHANG-SHENG-HAO/p/17798882.html>；<https://zhuanlan.zhihu.com/p/4357623026>；<https://zhuanlan.zhihu.com/p/581167267>；<https://blog.csdn.net/tt6899911/article/details/130536214>
256
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/shenyang>；<https://codeforces.com/gym/104160/standings>
257
+
258
+ ### 西安（区域赛）
259
+
260
+ - 题面候选：<https://codeforces.com/gym/104077/attachments/download/18288/problem.pdf>；<https://codeforces.com/gym/104077>
261
+ - 官方题解候选：<https://codeforces.com/gym/104077/attachments/download/18289/Tutorial%20(zh-cn)%20(zipped).zip>
262
+ - 社区资料候选：<https://zhuanlan.zhihu.com/p/588162564>；<https://www.cnblogs.com/hankeke303/p/18154715/icpc2022xian>；<https://blog.csdn.net/m0_62289613/article/details/130045410>；<https://www.luogu.com.cn/article/b75wfysj>
263
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/xian>；<https://codeforces.com/gym/104077/standings>
264
+ - QOJ候选：<https://qoj.ac/contest/1051>
265
+
266
+ ### EC-Final（EC-Final）
267
+
268
+ - 题面候选：<https://contest.ucup.ac/download.php?type=attachments&id=1197&r=0>；<https://contest.ucup.ac/download.php?type=attachments&id=1197&r=1>；<https://contest.ucup.ac/contest/1197>
269
+ - 官方题解候选：<https://contest.ucup.ac/download.php?type=attachments&id=1197&r=2>
270
+ - 社区资料候选：<https://www.luogu.com.cn/blog/hokarikanae/ec-final-2022-bi-ji>；<https://www.zhihu.com/question/543929336>；<https://www.luogu.com.cn/article/jx92nqdh>；<https://www.cnblogs.com/yyyyxh/p/18349836/minimum_suffix>
271
+ - 榜单候选：<https://board.xcpcio.com/icpc/47th/ec-final>；<https://contest.ucup.ac/results/QOJ1197>；<https://contest.ucup.ac/contest/1197/standings>
272
+ - QOJ候选：<https://qoj.ac/contest/1197>
273
+
274
+ ## 2021
275
+
276
+ ### 济南（区域赛）
277
+
278
+ - 题面候选：<https://qoj.ac/download.php?type=statement&id=10773>
279
+ - 社区资料候选：<https://blog.csdn.net/Hytidel/article/details/126190833>；<https://www.cnblogs.com/Paranoid5/p/15558884.html>；<https://www.cnblogs.com/yctql/p/15557653.html>；<https://zhuanlan.zhihu.com/p/433840102>
280
+ - 榜单候选：<https://board.xcpcio.com/icpc/46th/jinan>
281
+ - QOJ候选：<https://qoj.ac/contest/1997>
282
+
283
+ ### 昆明（区域赛）
284
+
285
+ - 题面候选：<https://qoj.ac/contest/1870>；<https://ac.nowcoder.com/acm/contest/32708>
286
+ - 社区资料候选：<https://www.cnblogs.com/BigSmall-En/p/19814506>；<https://www.cnblogs.com/WIDA/p/16224507.html>
287
+ - 榜单候选：<https://board.xcpcio.com/icpc/46th/kunming>
288
+
289
+ ### 澳门（区域赛）
290
+
291
+ - 题面候选：<https://codeforces.com/gym/104373/attachments/download/20209/contest-en.pdf>；<https://sua.ac/wiki/2021-icpc-macau/contest-en.pdf>；<https://qoj.ac/contest/911>；<https://www.luogu.com.cn/contest/134300>
292
+ - 官方题解候选：<https://codeforces.com/gym/104373/attachments/download/20208/macau_2021_editorial.pdf>；<https://sua.ac/wiki/2021-icpc-macau/tutorial-sketch-en.pdf>
293
+ - 社区资料候选：<https://www.luogu.com.cn/contest/134300#problems>；<https://www.zhihu.com/question/462046077>；<https://blog.csdn.net/Irving0323/article/details/118517977>；<https://www.cnblogs.com/ZzTzZ/p/16819121.html>；<https://www.luogu.com.cn/article/vtyz8f0s>
294
+ - 榜单候选：<https://board.xcpcio.com/icpc/46th/macau>；<https://sua.ac/wiki/2021-icpc-macau/board>
295
+ - CF Gym候选：<https://codeforces.com/gym/104373>
296
+
297
+ ### 南京（区域赛）
298
+
299
+ - 题面候选：<https://sua.ac/wiki/2021-icpc-nanjing/contest-en.pdf>；<https://codeforces.com/gym/103470>；<https://qoj.ac/contest/1236>
300
+ - 官方题解候选：<https://zhuanlan.zhihu.com/p/441174109>；<https://jiang.ly/blog/chenjb/blog/583?lang=default>
301
+ - 社区资料候选：<https://www.zhihu.com/question/498925531>；<https://www.cnblogs.com/Hany01/p/gym103470.html>；<https://www.bilibili.com/video/BV1Bu4y1w7Zv/>；<https://www.cnblogs.com/newuser233/p/16078738.html>；<https://blog.csdn.net/Hytidel/article/details/126811023>
302
+ - 榜单候选：<https://board.xcpcio.com/icpc/46th/nanjing>；<https://sua.ac/wiki/2021-icpc-nanjing/rankings.pdf>
303
+
304
+ ### 上海（区域赛）
305
+
306
+ - 题面候选：<https://codeforces.com/gym/103446/attachments/download/14827/the-2021-icpc-asia-shanghai-regional-programming-contest-en.pdf>
307
+ - 官方题解候选：<https://codeforces.com/gym/103446/attachments/download/14828/LiyuuCute.pdf>
308
+ - 社区资料候选：<https://zhuanlan.zhihu.com/p/562603014>；<https://cdn.acwing.com/blog/content/27587/>；<https://zhuanlan.zhihu.com/p/485713764>；<https://www.cnblogs.com/stff577/p/16357832.html>
309
+ - 榜单候选：<https://board.xcpcio.com/icpc/46th/shanghai>
310
+ - QOJ候选：<https://qoj.ac/contest/2016>
311
+ - CF Gym候选：<https://codeforces.com/gym/103446>
312
+
313
+ ### 沈阳（区域赛）
314
+
315
+ - 题面候选：<https://codeforces.com/gym/103427>；<https://qoj.ac/contest/1252>
316
+ - 社区资料候选：<https://www.cnblogs.com/do-while-true/p/17665207.html>；<https://www.zhihu.com/question/500358591>；<https://www.cnblogs.com/1625--H/p/15657170.html>；<https://ac.nowcoder.com/acm/discuss/blogs?tagId=144204>
317
+ - 榜单候选：<https://board.xcpcio.com/icpc/46th/shenyang>
318
+
319
+ ### EC-Final（EC-Final）
320
+
321
+ - 题面候选：<https://codeforces.com/gym/103861/attachments/download/16769/statements_ec_2021.pdf>；<https://qoj.ac/contest/1041>
322
+ - 社区资料候选：<https://zhuanlan.zhihu.com/p/592854367>；<https://www.cnblogs.com/dmoransky/p/17927294.html>；<https://www.cnblogs.com/KIMYON/p/16842332.html>；<https://blog.csdn.net/JungleZRD/article/details/138872556>
323
+ - CF Gym候选：<https://codeforces.com/gym/103861>
324
+
325
+ ## 2020
326
+
327
+ ### 济南（区域赛）
328
+
329
+ - 题面候选：<https://ac.nowcoder.com/acm/contest/10662>
330
+ - 社区资料候选：<https://www.cnblogs.com/AireenYe/p/ICPC2020Jinan.html>；<https://blog.csdn.net/qq_45812711/article/details/115314574>；<https://juejin.cn/post/6912006793698738183>
331
+ - QOJ候选：<https://qoj.ac/contest/2181>
332
+
333
+ ### 澳门（区域赛）
334
+
335
+ - 题面候选：<https://codeforces.com/gym/103119/attachments/download/13795/macau2020.pdf>；<https://codeforces.com/gym/103119>
336
+ - 官方题解候选：<https://codeforces.com/gym/103119/attachments/download/13796/2020icpc-macau-analyze.pdf>
337
+ - 社区资料候选：<https://codeforces.com/blog/entry/91354>
338
+ - 榜单候选：<https://codeforces.com/gym/103119/standings>
339
+ - QOJ候选：<https://qoj.ac/contest/1538>
340
+
341
+ ### 南京（区域赛）
342
+
343
+ - 题面候选：<https://codeforces.com/gym/102992/attachments/download/20230/contest-en.pdf>；<https://sua.ac/wiki/2020-icpc-nanjing/contest-en.pdf>；<https://codeforces.com/gym/102992>
344
+ - 官方题解候选：<https://zhuanlan.zhihu.com/p/338249705>
345
+ - 社区资料候选：<https://www.luogu.com.cn/contest/130129#problems>；<https://www.zhihu.com/question/434669683>；<https://codeforces.com/blog/entry/86621>
346
+ - 榜单候选：<https://board.xcpcio.com/icpc/2020/nanjing>；<https://codeforces.com/gym/102992/standings>
347
+ - QOJ候选：<https://qoj.ac/contest/1235>
348
+
349
+ ### 上海（区域赛）
350
+
351
+ - 题面候选：<https://codeforces.com/gym/102900>
352
+ - 官方题解候选：<https://zhuanlan.zhihu.com/p/336649300>
353
+ - 社区资料候选：<https://www.cnblogs.com/jojoqiao/p/15768882.html>；<https://juejin.cn/post/7154726506345234463>
354
+ - 榜单候选：<https://codeforces.com/gym/102900/standings>
355
+ - QOJ候选：<https://qoj.ac/contest/1477>
356
+
357
+ ### 沈阳（区域赛）
358
+
359
+ - 题面候选：<https://codeforces.com/gym/103202/attachments/download/14051/statements.pdf>；<https://codeforces.com/gym/103202>
360
+ - 官方题解候选：<https://codeforces.com/gym/103202/attachments/download/14072/ICPC_2020_Shenyang_Regional_Tutorial.pdf>
361
+ - 榜单候选：<https://codeforces.com/gym/103202/standings>
362
+ - QOJ候选：<https://qoj.ac/contest/1251>
363
+
364
+ ### 银川（区域赛）
365
+
366
+ - 题面候选：<https://codeforces.com/gym/104022/attachments/download/17741/yinchuan-2020-onsite-statement.pdf>；<https://codeforces.com/gym/104022>
367
+ - 榜单候选：<https://codeforces.com/gym/104022/standings>
368
+ - QOJ候选：<https://qoj.ac/contest/1322>
369
+
370
+ ### EC-Final（EC-Final）
371
+
372
+ - 题面候选：<https://codeforces.com/gym/103069/attachments/download/13618/contest-21429-en.pdf>；<https://codeforces.com/gym/103069>
373
+ - 社区资料候选：<https://codeforces.com/blog/entry/90271>
374
+ - 榜单候选：<https://codeforces.com/gym/103069/standings>
375
+ - QOJ候选：<https://qoj.ac/contest/1040>
376
+
377
+ ## 2019
378
+
379
+ ### 香港（区域赛）
380
+
381
+ - 题面候选：<https://codeforces.com/gym/102452/attachments/download/10019/2019-2020-icpc-asia-hong-kong-regional-contest-en.pdf>；<https://codeforces.com/gym/102452>；<https://icpcarchive.github.io/Asia%20East%20Continent%20Contests/Hongkong/2019%20Asia%20Hong%20Kong%20Regional%20Contest/problems.pdf>
382
+ - 官方题解候选：<https://icpcarchive.github.io/Asia%20East%20Continent%20Contests/Hongkong/2019%20Asia%20Hong%20Kong%20Regional%20Contest/solution.pdf>
383
+ - 社区资料候选：<https://blog.cycleke.com/media/2019-icpc-hongkong/19HKEditorial-V1.pdf>
384
+ - 榜单候选：<https://codeforces.com/gym/102452/standings>
385
+ - QOJ候选：<https://qoj.ac/contest/1537>
386
+
387
+ ### 南京（区域赛）
388
+
389
+ - 题面候选：<https://codeforces.com/gym/103466/attachments/download/14822/statements.pdf>；<https://codeforces.com/gym/103466>
390
+ - 社区资料候选：<https://www.luogu.com.cn/article/5tjvigki>；<https://blog.nowcoder.net/ylt111?tagName=icpc>
391
+ - 榜单候选：<https://codeforces.com/gym/103466/standings>
392
+ - QOJ候选：<https://qoj.ac/contest/1321>
393
+
394
+ ### 上海（区域赛）
395
+
396
+ - 题面候选：<https://qoj.ac/download.php?id=11009&type=statement>；<https://qoj.ac/download.php?id=11013&type=statement>；<https://ac.nowcoder.com/acm/contest/9855/A>
397
+ - 社区资料候选：<https://www.cnblogs.com/charles1999/p/12341852.html>；<https://blog.csdn.net/weixin_44116061/article/details/104349342>；<https://jozky.blog.csdn.net/article/details/120459893>
398
+ - QOJ候选：<https://qoj.ac/contest/1866>
399
+
400
+ ### 沈阳（区域赛）
401
+
402
+ - 题面候选：<https://ac.nowcoder.com/acm/problem/236911>
403
+ - 社区资料候选：<https://www.zhihu.com/question/355837417>；<https://blog.nowcoder.net/n/4221e7c0abec4579a6c28caf397224c2>；<https://www.cnblogs.com/tudouuuuu/p/11896905.html>
404
+
405
+ ### 徐州（区域赛）
406
+
407
+ - 社区资料候选：<https://www.cnblogs.com/Maxx-el/p/14132684.html>；<https://blog.csdn.net/cheng__yu_/article/details/109248883>；<https://blog.csdn.net/spnooyseed/article/details/107267877>
408
+ - QOJ候选：<https://qoj.ac/contest/1834>
409
+
410
+ ### 银川（区域赛）
411
+
412
+ - 题面候选：<https://codeforces.com/gym/104021/attachments/download/17740/yinchuan-2019-onsite-statement.pdf>；<https://codeforces.com/gym/104021>；<https://icpcarchive.github.io/Asia%20East%20Continent%20Contests/Yinchuan/2019%20Asia%20Yinchuan%20Regional%20Contest/problems.pdf>
413
+ - 官方题解候选：<https://codeforces.com/gym/104021/attachments/download/17738/yinchuan-2019-onsite-solution.pdf>；<https://icpcarchive.github.io/Asia%20East%20Continent%20Contests/Yinchuan/2019%20Asia%20Yinchuan%20Regional%20Contest/solution.pdf>
414
+ - 社区资料候选：<https://blog.csdn.net/u010799660/article/details/102802045>
415
+ - 榜单候选：<https://codeforces.com/gym/104021/standings>；<https://board.xcpcio.com/data/icpc/2019/yinchuan/config.json>
416
+ - QOJ候选：<https://qoj.ac/contest/1320>
417
+
418
+ ### EC-Final（EC-Final）
419
+
420
+ - 题面候选：<https://codeforces.com/gym/102471/attachments/download/10238/statements.pdf>；<https://codeforces.com/gym/102471>；<https://ac.nowcoder.com/acm/contest/3732/A>
421
+ - 社区资料候选：<https://blog.csdn.net/Herr_Shiiiii/article/details/104056297>；<https://blog.nowcoder.net/ylt111?tagName=icpc>
422
+ - 榜单候选：<https://codeforces.com/gym/102471/standings>
423
+ - QOJ候选：<https://qoj.ac/contest/1039>
package/docs//346/257/224/350/265/233/344/270/216/346/225/231/345/255/246/344/276/235/346/215/256.md CHANGED
@@ -12,21 +12,38 @@
12
12
 
13
13
  `NODE_SCOPES` 的 `id` 必须与 MAP 节点完全一致。`recognition` 用于读题识别；`proofQuestions` 用于确认学生能解释；`notFor` 用于主动暴露边界；`transferProblems` 是练习任务描述，不是假造的题目编号；`exitEvidence` 是教学验收建议。来源证明技术条件，练习设计由插件负责。
14
14
 
15
- ## 2.6：中国亚洲区域赛的逐题依据
15
+ ## 2.6.1：中国亚洲区域赛的逐题依据
16
16
 
17
- 默认通用配置 `regional-diagnostic` 面向中国亚洲区域赛：南京 2022 全卷十三题和南京 2023 六题，共十九题，逐题列年份、模型、能力、题解核验状态和页码。来源是 [SUA 2022 命题组题解](https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf)与 [QOJ 镜像的 SUA 2023 题解](https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf)。NWERC 放在独立的 `nwerc-reference` 配置，供扩展讨论。
17
+ 默认通用配置 `regional-diagnostic` 有五站六场、七十道样本，逐题列年份、教学模型、现有能力、题解核验状态和真实PDF页码。
18
18
 
19
- `coverage` 自动汇总真实样本数量、题解核验数量及年份；没有样本就返回零。西安 [QOJ 历年目录](https://qoj.ac/category/87)已核对，原始题解附件未获取，因此维持待采样，不从题名补造算法。十九题不是中国区域赛专题频率统计；已核对模型也不保证唯一解法、完整考纲或本届命题。教练结合个人和团队的新证据决定重点，不按 rating 解锁下一章。
19
+ | 原赛 | 样本 | 官方题解 |
20
+ | --- | --- | --- |
21
+ | 南京2022 | A—M，13题 | [SUA命题组题解](https://sua.ac/wiki/2022-icpc-nanjing/tutorial-sketch-zh.pdf) |
22
+ | 南京2023 | A/C/F/G/I/L，6题 | [QOJ镜像的命题组题解](https://universal-cup-website.qoj.ac/files/ucup/tutorials/tutorials-2-11.pdf) |
23
+ | 西安2025 | A—M，13题 | [官方题解](https://contest.ucup.ac/download.php?type=attachments&id=2562&r=1) |
24
+ | 杭州2024 | A—M，13题 | [Stage25官方题解](https://contest.ucup.ac/download.php?type=attachments&id=1893&r=1) |
25
+ | 上海2025 | A—M，13题 | [命题组题解](https://ucup.ac/tutorials/tutorials-4-12-zh.pdf) |
26
+ | 香港2025 | A—L，12题 | [官方题解](https://ucup.ac/tutorials/tutorials-4-14-en.pdf) |
27
+
28
+ `coverage` 沿用原加载器，自动汇总配置内的样本数量、题解核验数量和年份。西安配置保留 `xian-pending` ID，并填入2025十三题；同题也出现在通用配置中，两个配置不能相加当成独立题数。模型映射是教学解释，不是唯一解法、知识点频率或学生掌握证据。NWERC仍是独立扩展参考。
29
+
30
+ 另保留[56场中国区资料索引](china-contest-sources.md)：45场区域赛、7场EC-Final、4场邀请赛。链接只是候选，按需核对，不随每轮对话注入；省赛、网络赛、同题镜像不混入区域赛样本。原始工作表未修改，索引内杭州2024错配由Stage8 Cangqian省赛改为Stage25 Hangzhou、场次1893。
31
+
32
+ 四个 profile 均保留 `provisional`：表示只能在说明限制后用于诊断，不能输出“完整官方考纲”。`solutionReviewed` 表示读过题解并对照题意，未运行全部解法或交互器，也未完整核验现场奖牌榜单。未来即使使用 `reviewed` 状态，也不能去掉这些边界。
33
+
34
+ ### 原始资料的版本差异
35
+
36
+ 上海和香港的题面镜像可能写UCup或训练营重赛年，原赛年由官方赛事别名与命题组题解核定。香港PDF页脚跳号，样本使用实体PDF页序。香港K的题解概述写字典序最大，正式题面要求最小；[正式题面](https://contest.ucup.ac/download.php?contest_id=3169&id=15442&type=statement)优先。上海H/I题解有判定或代价式记号差异，样本只记录结构，讲授时须对照对应题面重新推导。上海A重赛版允许40次交互询问，换版本需重新核对协议。
20
37
 
21
- 三个 profile 当前均是 `provisional`：`regional-diagnostic`、`wf-extension`、`xian-pending`。这个状态表示可用于带限制的诊断，不能输出“已掌握本比赛考纲”。`reviewed` 也只能表示记录的样本已人工核验，不能去掉样本限制。
38
+ 杭州K将最晚的k个标记提前，不是把最大时刻直接减k；杭州L的取整代价需要处理平局，不能套未经验证的决策单调性。存在其他正确解法时，教练可以自主选择。
22
39
 
23
40
  ## 本轮采样范围
24
41
 
25
- 区域赛诊断取自 [NWERC 2024 官方题面](https://2024.nwerc.eu/main/problem-set.pdf) 的 A、D、E、F、K、L，与[官方解题](https://2024.nwerc.eu/main/solutions.pdf)对应章节核对。它们用来检查规则实现、状态设计、重复变换与多模型组合；没有采样全部题目，也没有跨年份计数。NWERC 与中国区域赛的差异保留为限制，不推导西安趋势。
42
+ 扩展配置 `nwerc-reference` 取自 [NWERC 2024 官方题面](https://2024.nwerc.eu/main/problem-set.pdf) 与[官方解题](https://2024.nwerc.eu/main/solutions.pdf)，包含A—M十三题。它们支持规则实现、状态设计与多模型组合的扩展讨论，没有跨年份频率统计；不推导中国赛区或西安趋势。
26
43
 
27
44
  WF 扩展诊断只读了 [2024 World Finals 官方题面](https://icpc.global/worldfinals/problems/2024-ICPC-World-Finals/icpc2024.pdf) 的 B、I、L，能力映射是教学推断。没有核验这些题的完整官方题解。交互程序的刷新与协议要求另依据[官方交互评测说明](https://docs.icpc.global/wp-content/uploads/2024/08/2024-JudgingNotes.pdf)。
28
45
 
29
- [QOJ 西安目录](https://qoj.ac/category/87)只用于确认历年原题入口。当前没有完成原题、主办方题解、榜单的逐题核验，所以西安配置保持待采样，不生成专题权重。采用 [NCNA 公布的区域赛规则](https://nc.na.icpc.global/rules/)作通用赛制背景，也不能把它视作西安本届现场规则。
46
+ [QOJ 西安目录](https://qoj.ac/category/87)用于更多年份原题入口。2025全卷已完成题意与官方题解核验，但现场榜和目标届次奖牌名单尚未完整核验，不生成专题权重或奖牌保证。采用 [NCNA 公布的区域赛规则](https://nc.na.icpc.global/rules/)作通用赛制背景，也不能把它视作西安本届现场规则。
30
47
 
31
48
  ## 小鲸怎样使用
32
49
 
package/index.js CHANGED
@@ -38,7 +38,7 @@ import { migratePersonalWorkspace as migrateWorkspacePersonalFiles } from './lib
38
38
  const name = 'acmer-coach'
39
39
  const inject = ['tools']
40
40
 
41
- const VERSION = '2.6.0'
41
+ const VERSION = '2.6.1'
42
42
 
43
43
  // 默认题目循环：40 自己做 + 10 解决遗留 + 10 重写 = 60 分钟。
44
44
  // 小诊断和完整 VP 使用独立时长，不强加题目循环的收尾。
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "acmer-coach",
3
3
  "description": "小鲸教练插件：保存训练位置和真实证据，支持教练判断、持续教学与比赛备赛。读 MAP/DEPENDS/PROGRESS，提供训练、判因和检测工具。",
4
- "version": "2.6.0",
4
+ "version": "2.6.1",
5
5
  "repository": {
6
6
  "type": "git",
7
7
  "url": "git+https://github.com/Miantiao1231/acmer-coach.git"