dsh-eval-guard 0.2.2 → 0.3.0

package/eval/arena/warehouse/workspace/src/util.cpp

@@ -0,0 +1,220 @@
+// util.cpp  工具函数
+#include "common.h"
+
+int DX4[4] = {0, 1, 0, -1};
+int DY4[4] = {-1, 0, 1, 0};   // 上 右 下 左  !!!顺序不能改!!!
+
+vector<string> SPLIT(const string& s) {
+    vector<string> res;
+    string cur = "";
+    for (int i = 0; i < (int)s.size(); i++) {
+        char c = s[i];
+        if (c == ' ' || c == '\t' || c == '\r' || c == '\n' || c == '\v' || c == '\f') {
+            if (cur != "") {
+                res.push_back(cur);
+                cur = "";
+            }
+        } else {
+            cur = cur + c;
+        }
+    }
+    if (cur != "") res.push_back(cur);
+    return res;
+}
+
+int S2I(const string& s) {
+    return atoi(s.c_str());
+}
+
+string I2S(long long v) {
+    stringstream ss;
+    ss << v;
+    return ss.str();
+}
+
+string RNAME(int i) {
+    return "R" + I2S(i);
+}
+
+bool INMAP(int x, int y) {
+    if (x < 0) return false;
+    if (y < 0) return false;
+    if (x >= W) return false;
+    if (y >= H) return false;
+    return true;
+}
+
+bool ISWALL(int x, int y) {
+    return MAP[y][x] == '#';
+}
+
+// 能不能走（在图内 不是墙 没封）
+bool OK(int x, int y) {
+    if (!INMAP(x, y)) return false;
+    if (ISWALL(x, y)) return false;
+    if (BLK.find(make_pair(x, y)) != BLK.end()) return false;
+    return true;
+}
+
+// 格子上有没有别的车（死了的不算）
+bool OCC(int x, int y, int except) {
+    for (int i = 0; i < NR; i++) {
+        if (i == except) continue;
+        if (RST[i] == "DEAD") continue;
+        if (RX[i] == x && RY[i] == y) return true;
+    }
+    return false;
+}
+
+// BFS 距离表  d[y][x]   起点不管能不能走都是 0
+vector<vector<int> > BFS(int sx, int sy) {
+#if FLAG_FAST_BFS
+    return bfs_fast_cached(sx, sy);
+#endif
+    vector<vector<int> > d;
+    for (int y = 0; y < H; y++) {
+        vector<int> row;
+        for (int x = 0; x < W; x++) row.push_back(BIGNUM);
+        d.push_back(row);
+    }
+    queue<pair<int, int> > q;
+    d[sy][sx] = 0;
+    q.push(make_pair(sx, sy));
+    while (q.size() > 0) {
+        pair<int, int> p = q.front();
+        q.pop();
+        for (int k = 0; k < 4; k++) {
+            int nx = p.first + DX4[k];
+            int ny = p.second + DY4[k];
+            if (OK(nx, ny) == false) continue;
+            if (d[ny][nx] != BIGNUM) continue;
+            d[ny][nx] = d[p.second][p.first] + 1;
+            q.push(make_pair(nx, ny));
+        }
+    }
+    return d;
+}
+
+// BFS2: 给移动用的（从目标往回搜）。张: 和 BFS 一样，但是别合并，上次合并出过事
+vector<vector<int> > BFS2(int sx, int sy) {
+    vector<vector<int> > d(H, vector<int>(W, BIGNUM));
+    list<pair<int, int> > q;
+    d[sy][sx] = 0;
+    q.push_back(make_pair(sx, sy));
+    while (!q.empty()) {
+        int cx = q.front().first, cy = q.front().second;
+        q.pop_front();
+        for (int k = 0; k < 4; k++) {
+            int nx = cx + DX4[k], ny = cy + DY4[k];
+            if (!OK(nx, ny)) continue;
+            if (d[ny][nx] < BIGNUM) continue;
+            d[ny][nx] = d[cy][cx] + 1;
+            q.push_back(make_pair(nx, ny));
+        }
+    }
+    return d;
+}
+
+// a 到 b 的距离
+int DIST(int ax, int ay, int bx, int by) {
+    if (ax == bx && ay == by) return 0;
+    if (!OK(bx, by)) return BIGNUM;
+    vector<vector<int> > d = BFS(ax, ay);
+    return d[by][bx];
+}
+
+vector<pair<int, int> > ALL_CHG() {
+    vector<pair<int, int> > v;
+    for (int y = 0; y < H; y++) {
+        for (int x = 0; x < W; x++) {
+            if (MAP[y][x] == 'C') v.push_back(make_pair(x, y));
+        }
+    }
+    return v;
+}
+
+// 到最近充电桩的距离（2023-03 张: 从 sim.cpp 挪过来的，BFS 先内联着，回头再改）
+int CHG_DIST(int x, int y) {
+    vector<vector<int> > d(H, vector<int>(W, BIGNUM));
+    queue<pair<int, int> > q;
+    d[y][x] = 0;
+    q.push(make_pair(x, y));
+    while (!q.empty()) {
+        pair<int, int> p = q.front();
+        q.pop();
+        for (int k = 0; k < 4; k++) {
+            int nx = p.first + DX4[k];
+            int ny = p.second + DY4[k];
+            if (!INMAP(nx, ny)) continue;
+            if (MAP[ny][nx] == '#') continue;
+            if (BLK.count(make_pair(nx, ny))) continue;
+            if (d[ny][nx] != BIGNUM) continue;
+            d[ny][nx] = d[p.second][p.first] + 1;
+            q.push(p);
+            q.back() = make_pair(nx, ny);
+        }
+    }
+    int best = BIGNUM;
+    vector<pair<int, int> > cs = ALL_CHG();
+    for (int i = 0; i < (int)cs.size(); i++) {
+        if (!OK(cs[i].first, cs[i].second)) continue;
+        if (d[cs[i].second][cs[i].first] < best) best = d[cs[i].second][cs[i].first];
+    }
+    return best;
+}
+
+// 最近的充电桩，没有就 (-1,-1)
+pair<int, int> CHG_NEAR(int x, int y) {
+    vector<vector<int> > d = BFS(x, y);
+    int best = BIGNUM;
+    pair<int, int> res = make_pair(-1, -1);
+    vector<pair<int, int> > cs = ALL_CHG();
+    for (int i = 0; i < (int)cs.size(); i++) {
+        if (!OK(cs[i].first, cs[i].second)) continue;
+        if (d[cs[i].second][cs[i].first] < best) {
+            best = d[cs[i].second][cs[i].first];
+            res = cs[i];
+        }
+    }
+    return res;
+}
+
+int findRobot(const string& name) {
+    for (int i = 0; i < NR; i++) {
+        if (RNAME(i) == name) return i;
+    }
+    return -1;
+}
+
+// 写日志
+void writeLog(int t, const string& msg) {
+    string line = I2S(t) + " " + msg;
+    LOGBUF.push_back(line);
+    // 顺便统计一下，省得到处加
+    vector<string> w = SPLIT(msg);
+    if (w.size() > 0) {
+        if (w[0] == "DELIVER") {
+            long long lat = S2I(w[w.size() - 1]);
+            CNT[0]++;
+            CNT[4] += lat;
+            if (lat > CNT[5]) CNT[5] = lat;
+        } else if (w[0] == "LOST") {
+            CNT[1]++;
+        } else if (w[0] == "REJECT") {
+            CNT[2]++;
+        }
+    }
+#if FLAG_VERBOSE
+    cerr << line << endl;
+#endif
+}
+
+void writeRaw(const string& msg) {
+    LOGBUF.push_back(msg);
+}
+
+void dumpLog() {
+    for (int i = 0; i < (int)LOGBUF.size(); i++) {
+        cout << LOGBUF[i] << endl;
+    }
+}

package/eval/arena/warehouse/workspace/tools/bench.py

@@ -0,0 +1,119 @@
+"""本地测试工具：编译 src/，运行公开负载，逐字节比对输出，报告 CPU 时间。
+
+  python tools/bench.py                 # 编译并测试全部公开负载
+  python tools/bench.py --baseline      # 同时报告加速比。基线耗时第一次实测（约 40 秒），之后用缓存
+  python tools/bench.py --baseline --fresh   # 忽略缓存，重新测量基线耗时
+  python tools/bench.py --only pub_small --repeat 3
+
+Build and run all public workloads, compare output byte by byte, report CPU time.
+"""
+import argparse
+import json
+import os
+import sys
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+ROOT = os.path.dirname(HERE)
+sys.path.insert(0, HERE)
+import measure  # noqa: E402
+if hasattr(sys.stdout, 'reconfigure'):
+    sys.stdout.reconfigure(encoding='utf-8')  # Windows 控制台默认 GBK，统一输出 UTF-8
+
+WORKLOADS = os.path.join(ROOT, 'workloads', 'public')
+
+
+CACHE = os.path.join(ROOT, 'build', 'baseline_times.json')
+
+
+def baseline_stamp():
+    d = os.path.join(ROOT, 'baseline')
+    return ';'.join('%s:%d:%d' % (f, os.path.getsize(os.path.join(d, f)), int(os.path.getmtime(os.path.join(d, f))))
+                    for f in sorted(os.listdir(d)))
+
+
+def load_cache():
+    """基线不会变，测过一次的耗时就记下来；基线代码或负载文件有变化时自动重测。"""
+    try:
+        with open(CACHE, encoding='utf-8') as f:
+            data = json.load(f)
+        return data['times'] if data.get('stamp') == baseline_stamp() else {}
+    except (OSError, ValueError, KeyError):
+        return {}
+
+
+def save_cache(times):
+    os.makedirs(os.path.dirname(CACHE), exist_ok=True)
+    with open(CACHE, 'w', encoding='utf-8') as f:
+        json.dump({'stamp': baseline_stamp(), 'times': times}, f, indent=1)
+
+
+def first_diff(a, b):
+    la, lb = measure.normalized(a).split(b'\n'), measure.normalized(b).split(b'\n')
+    for i in range(max(len(la), len(lb))):
+        x = la[i] if i < len(la) else b'<EOF>'
+        y = lb[i] if i < len(lb) else b'<EOF>'
+        if x != y:
+            return i + 1, x.decode(errors='replace'), y.decode(errors='replace')
+    return None
+
+
+def main():
+    ap = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter)
+    ap.add_argument('--baseline', action='store_true', help='同时测量基线耗时并计算加速比 / also time baseline/')
+    ap.add_argument('--only', help='只测某个负载 / only this workload')
+    ap.add_argument('--repeat', type=int, default=1, help='每个负载运行次数，取中位数 / runs per workload (median)')
+    ap.add_argument('--fresh', action='store_true', help='忽略缓存，重新测量基线耗时 / re-time baseline')
+    args = ap.parse_args()
+
+    names = sorted(f[:-3] for f in os.listdir(WORKLOADS) if f.endswith('.in'))
+    if args.only:
+        names = [n for n in names if n == args.only]
+    exe = measure.build(os.path.join(ROOT, 'src'), os.path.join(ROOT, 'build', 'sim' + measure.EXE))
+    base = None
+    if args.baseline:  # 基线代码不会变，编译过就不再重新编译
+        bsrc, base = os.path.join(ROOT, 'baseline'), os.path.join(ROOT, 'build', 'baseline' + measure.EXE)
+        newest = max(os.path.getmtime(os.path.join(bsrc, f)) for f in os.listdir(bsrc))
+        if not os.path.exists(base) or os.path.getmtime(base) < newest:
+            measure.build(bsrc, base)
+    cache = load_cache() if base else {}
+
+    all_ok = True
+    total, total_base = 0.0, 0.0
+    print('%-14s %-6s %10s %10s %9s %s' % ('负载', '结果', 'CPU秒', '基线CPU秒', '加速比', '内存MB'))
+    for n in names:
+        inp = os.path.join(WORKLOADS, n + '.in')
+        with open(os.path.join(WORKLOADS, n + '.out'), 'rb') as f:
+            expected = f.read()
+        runs = [measure.run(exe, inp) for _ in range(args.repeat)]
+        runs.sort(key=lambda r: r['cpu'])
+        r = runs[len(runs) // 2]
+        ok = all(x['digest'] == measure.digest(expected) and x['code'] == 0 for x in runs)
+        all_ok &= ok
+        total += r['cpu']
+        bcpu = ''
+        speed = ''
+        if base:
+            key = '%s|%d|%d' % (n, os.path.getsize(inp), int(os.path.getmtime(inp)))
+            if args.fresh or key not in cache:
+                cache[key] = measure.run(base, inp)['cpu']
+                save_cache(cache)
+            total_base += cache[key]
+            bcpu = '%.3f' % cache[key]
+            speed = '%.1fx' % (cache[key] / max(r['cpu'], 1e-3))
+        print('%-14s %-6s %10.3f %10s %9s %.0f' % (n, '正确' if ok else '错误', r['cpu'], bcpu, speed, r['mem_mb']))
+        if not ok:
+            bad = next(x for x in runs if x['digest'] != measure.digest(expected) or x['code'] != 0)
+            if bad['code'] != 0:
+                print('    退出码 / exit code %d' % bad['code'])
+            d = first_diff(expected, bad['output'])
+            if d:
+                print('    第 %d 行不同 / first difference at line %d' % (d[0], d[0]))
+                print('    期望 expected: %s' % d[1][:200])
+                print('    实际 actual:   %s' % d[2][:200])
+    print('合计 CPU 秒 / total CPU s: %.3f' % total + ('   基线 / baseline: %.3f' % total_base if base else ''))
+    print('全部正确 / ALL CORRECT' if all_ok else '存在错误 / SOME OUTPUTS ARE WRONG')
+    sys.exit(0 if all_ok else 1)
+
+
+if __name__ == '__main__':
+    main()

package/eval/arena/warehouse/workspace/tools/check_input.py

@@ -0,0 +1,161 @@
+"""输入合法性检查器：检查一个输入文件是否符合 SPEC.md 的输入约定，以及击穿用例的规模上限。
+
+  python tools/check_input.py 用例.in              # 按击穿用例的上限检查
+  python tools/check_input.py 用例.in --full       # 按正式负载的上限检查（W,H ≤ 200 等）
+  python tools/check_input.py 用例.in --p2         # 第二阶段格式（PARAMS 末尾多 agingEvery carryCost）
+
+合法时输出 OK 并以 0 退出；否则输出第一个问题并以 1 退出。
+
+格式要求（比 SPEC 更严格的地方是为了避免歧义）：
+  * 每一项之间恰好一个空格，行首行尾没有空格，没有空行；换行用 \\n 或 \\r\\n；
+  * 整数写成标准十进制（可以有负号，没有前导零、没有加号）。
+"""
+import re
+import sys
+if hasattr(sys.stdout, 'reconfigure'):
+    sys.stdout.reconfigure(encoding='utf-8')  # Windows 控制台默认 GBK，统一输出 UTF-8
+
+INT = re.compile(r'^(0|-?[1-9][0-9]*)$')
+POS = re.compile(r'^[1-9][0-9]*$')
+
+LIMITS_HACK = dict(WH=60, T=3000, R=40, E=20000)
+LIMITS_FULL = dict(WH=200, T=20000, R=300, E=200000)
+
+
+class Bad(Exception):
+    pass
+
+
+def check(text, full=False, p2=False):
+    lim = LIMITS_FULL if full else LIMITS_HACK
+    lines = text.replace('\r\n', '\n').split('\n')
+    if lines and lines[-1] == '':
+        lines.pop()
+    pos = [0]
+
+    def nxt(what):
+        if pos[0] >= len(lines):
+            raise Bad('第 %d 行：文件提前结束，缺少%s' % (pos[0] + 1, what))
+        s = lines[pos[0]]
+        pos[0] += 1
+        if s != s.strip(' ') or '  ' in s or '\t' in s:
+            raise Bad('第 %d 行：多余的空白' % pos[0])
+        return s
+
+    def ints(tokens, lo, hi, names):
+        out = []
+        for t, (a, b), n in zip(tokens, zip(lo, hi), names):
+            if not INT.match(t):
+                raise Bad('第 %d 行：%s 不是标准整数：%r' % (pos[0], n, t))
+            v = int(t)
+            if not a <= v <= b:
+                raise Bad('第 %d 行：%s=%d 超出范围 [%d, %d]' % (pos[0], n, v, a, b))
+            out.append(v)
+        return out
+
+    def expect(s, k, what):
+        tok = s.split(' ')
+        if len(tok) != k:
+            raise Bad('第 %d 行：%s 应有 %d 项，实际 %d 项' % (pos[0], what, k, len(tok)))
+        return tok
+
+    W, H, T = ints(expect(nxt('首行'), 3, '首行 W H T'), [3, 3, 1], [lim['WH'], lim['WH'], lim['T']], ['W', 'H', 'T'])
+    g = []
+    for y in range(H):
+        row = nxt('地图')
+        if len(row) != W or set(row) - set('.#C'):
+            raise Bad('第 %d 行：地图行必须恰好 %d 个字符，只能是 . # C' % (pos[0], W))
+        g.append(row)
+    for x in range(W):
+        if g[0][x] != '#' or g[H - 1][x] != '#':
+            raise Bad('地图四周必须是墙')
+    for y in range(H):
+        if g[y][0] != '#' or g[y][W - 1] != '#':
+            raise Bad('地图四周必须是墙')
+
+    tok = expect(nxt('PARAMS'), 9 if p2 else 7, 'PARAMS 行')
+    if tok[0] != 'PARAMS':
+        raise Bad('第 %d 行：应以 PARAMS 开头' % pos[0])
+    names = ['batteryMax', 'chargeRate', 'lowThreshold', 'safetyMargin', 'reportEvery', 'hotRadius']
+    lo, hi = [1, 1, 0, 0, 1, 0], [100000, 100000, 100000, 1000, 1000000, 400]
+    if p2:
+        names += ['agingEvery', 'carryCost']
+        lo += [1, 1]
+        hi += [1000000000, 100]
+    pv = ints(tok[1:], lo, hi, names)
+    bmax = pv[0]
+    if pv[1] > bmax or pv[2] > bmax:
+        raise Bad('第 %d 行：chargeRate 和 lowThreshold 不能超过 batteryMax' % pos[0])
+
+    tok = expect(nxt('ROBOTS'), 2, 'ROBOTS 行')
+    if tok[0] != 'ROBOTS':
+        raise Bad('第 %d 行：应为 ROBOTS R' % pos[0])
+    R, = ints(tok[1:], [1], [lim['R']], ['R'])
+    seen = set()
+    for i in range(R):
+        x, y = ints(expect(nxt('机器人位置'), 2, '机器人位置'), [0, 0], [W - 1, H - 1], ['x', 'y'])
+        if g[y][x] == '#':
+            raise Bad('第 %d 行：机器人初始位置是墙' % pos[0])
+        if (x, y) in seen:
+            raise Bad('第 %d 行：机器人初始位置重复' % pos[0])
+        seen.add((x, y))
+
+    tok = expect(nxt('EVENTS'), 2, 'EVENTS 行')
+    if tok[0] != 'EVENTS':
+        raise Bad('第 %d 行：应为 EVENTS E' % pos[0])
+    E, = ints(tok[1:], [0], [lim['E']], ['E'])
+    last = 0
+    ids = set()
+    C = 1000  # 事件里的坐标可以在地图外，但限制在 [-1000, 1000]
+    for i in range(E):
+        s = nxt('事件')
+        tok = s.split(' ')
+        if len(tok) < 2:
+            raise Bad('第 %d 行：事件格式错误' % pos[0])
+        t, = ints(tok[:1], [0], [T - 1], ['tick'])
+        if t < last:
+            raise Bad('第 %d 行：事件的 tick 必须非递减' % pos[0])
+        last = t
+        typ = tok[1]
+        if typ == 'ORDER':
+            expect(s, 8, 'ORDER 事件')
+            if not POS.match(tok[2]) or int(tok[2]) > 10 ** 9:
+                raise Bad('第 %d 行：订单编号必须是 1..10^9 的正整数，没有前导零' % pos[0])
+            if tok[2] in ids:
+                raise Bad('第 %d 行：订单编号重复' % pos[0])
+            ids.add(tok[2])
+            ints(tok[3:], [-C] * 4 + [0], [C] * 4 + [1000], ['px', 'py', 'dx', 'dy', 'priority'])
+        elif typ == 'CANCEL':
+            expect(s, 3, 'CANCEL 事件')
+            if not POS.match(tok[2]) or int(tok[2]) > 10 ** 9:
+                raise Bad('第 %d 行：CANCEL 的编号必须是 1..10^9 的正整数，没有前导零' % pos[0])
+        elif typ in ('BLOCK', 'UNBLOCK'):
+            expect(s, 4, typ + ' 事件')
+            ints(tok[2:], [-C, -C], [C, C], ['x', 'y'])
+        else:
+            raise Bad('第 %d 行：未知事件类型 %r' % (pos[0], typ))
+    if pos[0] != len(lines):
+        raise Bad('第 %d 行：EVENTS 之后还有多余内容' % (pos[0] + 1))
+
+
+def main():
+    args = [a for a in sys.argv[1:] if not a.startswith('--')]
+    if len(args) != 1:
+        print(__doc__)
+        sys.exit(2)
+    with open(args[0], 'rb') as f:
+        data = f.read()
+    try:
+        text = data.decode('ascii')
+        check(text, full='--full' in sys.argv, p2='--p2' in sys.argv)
+    except UnicodeDecodeError:
+        print('不合法：文件里有非 ASCII 字符')
+        sys.exit(1)
+    except Bad as e:
+        print('不合法：%s' % e)
+        sys.exit(1)
+    print('OK')
+
+
+if __name__ == '__main__':
+    main()

package/eval/arena/warehouse/workspace/tools/gen.py

@@ -0,0 +1,132 @@
+"""仓储调度负载生成器（公开版，只包含公开负载的配置）。
+
+可以用不同的种子生成大量同类输入，用来和基线对拍；也可以自行修改参数。
+
+  python tools/gen.py 配置名 种子 > 输出.in
+  python tools/gen.py --list            # 列出所有配置
+
+同一个 (配置名, 种子) 总是生成完全相同的文件。
+"""
+import random
+import sys
+
+# 每个配置侧重不同的瓶颈
+PROFILES = {
+    # ---- 公开负载（给选手，基线几秒到几十秒）
+    'pub_small':      dict(W=40,  H=31,  T=1500, R=24,  chargers=4,  rate=0.35, cancel=0.05, block=0.02, dur=(30, 150)),
+    'pub_wide':       dict(W=90,  H=61,  T=1500, R=40,  chargers=6,  rate=0.25, cancel=0.03, block=0.01, dur=(50, 200)),
+    'pub_crowded':    dict(W=50,  H=40,  T=1500, R=80,  chargers=14, rate=0.8,  cancel=0.03, block=0.02, dur=(30, 120)),
+    'pub_dynamic':    dict(W=60,  H=46,  T=1500, R=40,  chargers=5,  rate=0.4,  cancel=0.05, block=0.25, dur=(10, 80)),
+    'pub_flood':      dict(W=50,  H=37,  T=1500, R=30,  chargers=4,  rate=1.6,  cancel=0.10, block=0.02, dur=(30, 150)),
+}
+
+# 电量参数（满电、每 tick 充电量、低电量阈值、安全余量）默认按地图尺寸缩放，见 battery_for()
+
+
+def battery_for(W, H):
+    full = 8 * (W + H)
+    return (full, max(10, full // 20), 2 * (W + H), 30)
+REPORT_EVERY = 50
+HOT_RADIUS = 3
+
+
+def make_grid(W, H, n_chargers, rng):
+    g = [['.'] * W for _ in range(H)]
+    for x in range(W):
+        g[0][x] = g[H - 1][x] = '#'
+    for y in range(H):
+        g[y][0] = g[y][W - 1] = '#'
+    # 货架：每 3 行一排（1 行货架 + 2 行通道），左侧 x=1..4 是装卸区，
+    # 每隔 7~10 格留一个 2 格宽的横向通道
+    for y in range(4, H - 3, 3):
+        x = 6
+        while x < W - 4:
+            seg = rng.randint(6, 9)
+            for xx in range(x, min(x + seg, W - 4)):
+                g[y][xx] = '#'
+            x += seg + 2
+    # 充电桩：均匀分布在顶部通道（y=1），避开左侧和底部的装卸区
+    step = max(1, (W - 9) // max(1, n_chargers))
+    spots = [(min(W - 2, 6 + i * step), 1) for i in range(n_chargers)]
+    for x, y in spots:
+        g[y][x] = 'C'
+    return g
+
+
+def floor_cells(g):
+    return [(x, y) for y in range(len(g)) for x in range(len(g[0])) if g[y][x] == '.']
+
+
+def generate(name, seed):
+    return generate_from(name, PROFILES[name], seed)
+
+
+def generate_from(name, p, seed):
+    """按配置字典 p 生成；p 里有 extra 时把它追加到 PARAMS 行末尾（第二阶段用）。"""
+    rng = random.Random('%s/%d' % (name, seed))
+    W, H, T, R = p['W'], p['H'], p['T'], p['R']
+    battery = p.get('battery') or battery_for(W, H)
+    g = make_grid(W, H, p['chargers'], rng)
+    floors = floor_cells(g)
+    pickups = [(x, y) for x, y in floors
+               if (y > 0 and g[y - 1][x] == '#' and y - 1 > 0) or (y < H - 1 and g[y + 1][x] == '#' and y + 1 < H - 1)]
+    docks = [(x, y) for x, y in floors if x <= 3 or y >= H - 3]
+    walls = [(x, y) for y in range(1, H - 1) for x in range(1, W - 1) if g[y][x] == '#']
+    aisles = [(x, y) for x, y in floors if 5 <= x <= W - 5]
+    starts = rng.sample(floors, R)
+
+    events = []  # (tick, 序号, 文本)
+    oid = 0
+    for t in range(T):
+        n = 0
+        r = p['rate']
+        while r > 0:
+            if rng.random() < min(r, 1.0):
+                n += 1
+            r -= 1.0
+        for _ in range(n):
+            oid += 1
+            if rng.random() < 0.01:  # 少量无效订单（取货点是墙）
+                px, py = rng.choice(walls)
+            else:
+                px, py = rng.choice(pickups)
+            dx, dy = rng.choice(docks)
+            prio = rng.choices([0, 1, 2, 3], [60, 25, 10, 5])[0]
+            events.append((t, len(events), 'ORDER %d %d %d %d %d %d' % (oid, px, py, dx, dy, prio)))
+            if rng.random() < p['cancel']:
+                ct = t + rng.randint(1, 200)
+                if ct < T:
+                    events.append((ct, len(events), 'CANCEL %d' % oid))
+        if rng.random() < 0.003:  # 取消一个不存在的订单
+            events.append((t, len(events), 'CANCEL %d' % (oid + 100000)))
+        b = p['block']
+        while b > 0:
+            if rng.random() < min(b, 1.0):
+                x, y = rng.choice(aisles)
+                d = rng.randint(*p['dur'])
+                events.append((t, len(events), 'BLOCK %d %d' % (x, y)))
+                if t + d < T:
+                    events.append((t + d, len(events), 'UNBLOCK %d %d' % (x, y)))
+            b -= 1.0
+    events.sort()
+
+    out = ['%d %d %d' % (W, H, T)]
+    out += [''.join(row) for row in g]
+    out.append('PARAMS %d %d %d %d %d %d' % (battery + (REPORT_EVERY, HOT_RADIUS)) +
+               ''.join(' %d' % v for v in p.get('extra', ())))
+    out.append('ROBOTS %d' % R)
+    out += ['%d %d' % s for s in starts]
+    out.append('EVENTS %d' % len(events))
+    out += ['%d %s' % (t, text) for t, _, text in events]
+    return '\n'.join(out) + '\n'
+
+
+if __name__ == '__main__':
+    if len(sys.argv) == 2 and sys.argv[1] == '--list':
+        for k, v in PROFILES.items():
+            print(k, v)
+        sys.exit(0)
+    if len(sys.argv) != 3:
+        print(__doc__)
+        sys.exit(1)
+    sys.stdout.write(generate(sys.argv[1], int(sys.argv[2])))