dsh-eval-guard 0.2.3 → 0.3.1

package/eval/arena/warehouse/workspace/baseline/sim.cpp

@@ -0,0 +1,427 @@
+// sim.cpp   仿真主体
+// 2022 老王 初版
+// 2023 张   改派单、加救援
+// 2024 李   加了报表、改充电（按运营要求）
+// 注意：这个文件很重要，改之前跟我说一声 —— 张
+#include "common.h"
+
+extern int DX4[4];
+extern int DY4[4];
+
+// 读输入
+void ReadAll(istream& in) {
+    in >> W >> H >> T;
+    MAP.resize(H);
+    for (int i = 0; i < H; i++) in >> MAP[i];
+    string tmp;
+    in >> tmp;   // "PARAMS"
+    for (int i = 0; i < 6; i++) in >> PRM[i];
+    in >> tmp >> NR;   // "ROBOTS"
+    for (int i = 0; i < NR; i++) {
+        int a, b;
+        in >> a >> b;
+        RX.push_back(a);
+        RY.push_back(b);
+        RB.push_back(PRM[0]);   // 满电出发
+        RTX.push_back(-1);
+        RTY.push_back(-1);
+        RWS.push_back(0);
+        RDS.push_back(-1);
+        RWT.push_back(0);
+        RTR.push_back(0);
+        RST.push_back("IDLE");
+        ROID.push_back("");
+    }
+    int ne = 0;
+    in >> tmp >> ne;   // "EVENTS"
+    string line;
+    getline(in, line);
+    for (int i = 0; i < ne; i++) {
+        getline(in, line);
+        if (line.size() > 0 && line[line.size() - 1] == '\r') line = line.substr(0, line.size() - 1);
+        EVT.push_back(line);
+    }
+}
+
+// 主循环 ----------------------------------------------------------------
+void RunSim() {
+    for (int t = 0; t < T; t++) {
+        // ====================== 1. 事件 ======================
+        for (int e = 0; e < (int)EVT.size(); e++) {
+            vector<string> w = SPLIT(EVT[e]);
+            if (w.size() < 2) continue;
+            if (S2I(w[0]) != t) continue;
+            string typ = w[1];
+            if (typ == "ORDER") {
+                string id = w[2];
+                int px = S2I(w[3]), py = S2I(w[4]), dx = S2I(w[5]), dy = S2I(w[6]);
+                int pr = S2I(w[7]);
+                bool good = true;
+                if (!INMAP(px, py)) good = false;
+                if (good && !INMAP(dx, dy)) good = false;
+                if (good && ISWALL(px, py)) good = false;
+                if (good && ISWALL(dx, dy)) good = false;
+                if (!good) {
+                    writeLog(t, "REJECT " + id);
+                    continue;
+                }
+                vector<string> f;
+                f.push_back(I2S(px));
+                f.push_back(I2S(py));
+                f.push_back(I2S(dx));
+                f.push_back(I2S(dy));
+                f.push_back(I2S(pr));
+                f.push_back(I2S(t));
+                f.push_back("PENDING");
+                f.push_back("");
+                ORD[id] = f;
+                PEND.push_back(id);
+            } else if (typ == "CANCEL") {
+                string id = w[2];
+                if (ORD.find(id) == ORD.end()) {
+                    writeLog(t, "CANCEL_FAIL " + id);
+                    continue;
+                }
+                CNT[3]++;
+                if (ORD[id][6] == "PENDING") {
+                    // 从待派里删掉
+                    vector<string> np;
+                    for (int k = 0; k < (int)PEND.size(); k++)
+                        if (PEND[k] != id) np.push_back(PEND[k]);
+                    PEND = np;
+                    ORD[id][6] = "CANCELLED";
+                    ORD[id][7] = "";
+                    writeLog(t, "CANCEL " + id);
+                } else if (ORD[id][6] == "ASSIGNED") {
+                    int ri = findRobot(ORD[id][7]);
+                    RST[ri] = "IDLE";
+                    ROID[ri] = "";
+                    RTX[ri] = -1;
+                    RTY[ri] = -1;
+                    RWS[ri] = 0;
+                    ORD[id][6] = "CANCELLED";
+                    ORD[id][7] = "";
+                    writeLog(t, "CANCEL " + id);
+                } else {
+                    // 已经取货了 / 已经送完了，取消不了
+                    writeLog(t, "CANCEL_FAIL " + id);
+                }
+            } else if (typ == "BLOCK") {
+                int x = S2I(w[2]), y = S2I(w[3]);
+                if (INMAP(x, y)) {
+                    if (!ISWALL(x, y)) {
+                        BLK.insert(make_pair(x, y));
+                    }
+                }
+            } else if (typ == "UNBLOCK") {
+                int x = S2I(w[2]), y = S2I(w[3]);
+                if (INMAP(x, y)) {
+                    if (BLK.count(make_pair(x, y))) BLK.erase(make_pair(x, y));
+                }
+            } else {
+                // 不认识的事件，忽略
+            }
+        }
+
+        // ====================== 2. 救援 ======================
+        // 停机 100 tick 以后派人去救，充满电恢复
+        for (int i = 0; i < NR; i++) {
+            if (RST[i] == "DEAD") {
+                if (t - RDS[i] >= 100) {
+                    if (!OCC(RX[i], RY[i], i)) {
+                        RST[i] = "IDLE";
+                        RB[i] = PRM[0] / 2;
+                        RWS[i] = 0;
+                        RDS[i] = -1;
+                        writeLog(t, "RESCUE " + RNAME(i));
+                    }
+                }
+            }
+        }
+
+        // ====================== 3. 充电 ======================
+        for (int i = 0; i < NR; i++) {
+            if (RST[i] != "CHARGING") continue;
+            RB[i] = RB[i] + PRM[1];
+            if (RB[i] > PRM[0]) RB[i] = PRM[0];
+            if (RB[i] * 10 >= PRM[0] * 9) {   // 充满了就走
+                RST[i] = "IDLE";
+                RTX[i] = -1;
+                RTY[i] = -1;
+                writeLog(t, "CHARGED " + RNAME(i));
+            }
+        }
+
+        // ====================== 4. 派单 ======================
+#if USE_NEW_DISPATCH
+        {
+            vector<string> ids = PEND;
+            sort(ids.begin(), ids.end(), [](const string& a, const string& b) {
+                // 优先级高的先，然后来得早的先，然后编号小的先
+                if (S2I(ORD[a][4]) != S2I(ORD[b][4])) return S2I(ORD[a][4]) > S2I(ORD[b][4]);
+                if (S2I(ORD[a][5]) != S2I(ORD[b][5])) return S2I(ORD[a][5]) < S2I(ORD[b][5]);
+                return S2I(a) < S2I(b);
+            });
+            for (int oi = 0; oi < (int)ids.size(); oi++) {
+                string id = ids[oi];
+                int px = S2I(ORD[id][0]), py = S2I(ORD[id][1]);
+                int dx = S2I(ORD[id][2]), dy = S2I(ORD[id][3]);
+                int best = BIGNUM, who = -1;
+                for (int i = 0; i < NR; i++) {
+                    if (RST[i] == "IDLE") {
+                        if (RB[i] >= PRM[2]) {
+                            int a = DIST(RX[i], RY[i], px, py);
+                            if (a < BIGNUM) {
+                                int b = DIST(px, py, dx, dy);
+                                if (b < BIGNUM) {
+                                    int c = CHG_DIST(dx, dy);
+                                    if (c < BIGNUM) {
+                                        if (RB[i] >= a + b + c + PRM[3]) {
+                                            // 选最近的，一样近选编号小的
+                                            if (a <= best) {
+                                                best = a;
+                                                who = i;
+                                            }
+                                        }
+                                    }
+                                }
+                            }
+                        }
+                    }
+                }
+                if (who == -1) continue;
+                RST[who] = "TO_PICKUP";
+                ROID[who] = id;
+                RTX[who] = px;
+                RTY[who] = py;
+                RWS[who] = 0;
+                ORD[id][6] = "ASSIGNED";
+                ORD[id][7] = RNAME(who);
+                vector<string> np;
+                for (int k = 0; k < (int)PEND.size(); k++)
+                    if (PEND[k] != id) np.push_back(PEND[k]);
+                PEND = np;
+                writeLog(t, "ASSIGN " + id + " " + RNAME(who) + " " + I2S(best));
+            }
+        }
+#else
+        oldDispatch(t);
+#endif
+
+        // ====================== 5. 没电的去充电 ======================
+        for (int i = 0; i < NR; i++) {
+            if (RST[i] != "IDLE") continue;
+            if (RB[i] >= PRM[2]) continue;
+            vector<vector<int> > d = BFS(RX[i], RY[i]);
+            vector<pair<int, int> > cs = ALL_CHG();
+            int best = BIGNUM;
+            int cx = -1, cy = -1;
+            for (int k = 0; k < (int)cs.size(); k++) {
+                int x = cs[k].first, y = cs[k].second;
+                if (!OK(x, y)) continue;
+                bool used = false;
+                for (int j = 0; j < NR; j++) {
+                    if (j == i) continue;
+                    if (RST[j] == "CHARGING" && RX[j] == x && RY[j] == y) used = true;
+                    if (RST[j] == "TO_CHARGER" && RTX[j] == x && RTY[j] == y) used = true;
+                }
+                if (used) continue;
+                if (d[y][x] + PRM[3] > RB[i]) continue;
+                if (d[y][x] < best) {
+                    best = d[y][x];
+                    cx = x;
+                    cy = y;
+                }
+            }
+            if (cx < 0) {
+                // 都被占了，那就去最近的排队
+                pair<int, int> p = CHG_NEAR(RX[i], RY[i]);
+                cx = p.first;
+                cy = p.second;
+            }
+            if (cx < 0) continue;
+            RST[i] = "TO_CHARGER";
+            RTX[i] = cx;
+            RTY[i] = cy;
+            RWS[i] = 0;
+            writeLog(t, "GO_CHARGE " + RNAME(i) + " " + I2S(cx) + " " + I2S(cy));
+        }
+
+        // ====================== 6. 走 ======================
+        for (int i = 0; i < NR; i++) {
+            if (RST[i] != "TO_PICKUP" && RST[i] != "DELIVERING" && RST[i] != "TO_CHARGER") continue;
+            if (RX[i] == RTX[i] && RY[i] == RTY[i]) {
+                // 已经在目标上了
+                RWS[i] = 0;
+                if (RST[i] == "TO_PICKUP") {
+                    string oid = ROID[i];
+                    ORD[oid][6] = "PICKED";
+                    RST[i] = "DELIVERING";
+                    RTX[i] = S2I(ORD[oid][2]);
+                    RTY[i] = S2I(ORD[oid][3]);
+                    writeLog(t, "PICK " + oid + " " + RNAME(i));
+                } else if (RST[i] == "DELIVERING") {
+                    string oid = ROID[i];
+                    ORD[oid][6] = "DONE";
+                    int lat = t - S2I(ORD[oid][5]);
+                    writeLog(t, "DELIVER " + oid + " " + RNAME(i) + " " + I2S(lat));
+                    RST[i] = "IDLE";
+                    ROID[i] = "";
+                    RTX[i] = -1;
+                    RTY[i] = -1;
+                } else if (RST[i] == "TO_CHARGER") {
+                    RST[i] = "CHARGING";
+                    writeLog(t, "CHARGE " + RNAME(i));
+                }
+                continue;
+            }
+            if (RB[i] == 0) {
+                // 没电了，趴窝
+                writeLog(t, "DEAD " + RNAME(i));
+                if (ROID[i] != "") {
+                    string oid = ROID[i];
+                    if (RST[i] == "TO_PICKUP") {
+                        ORD[oid][6] = "PENDING";
+                        ORD[oid][7] = "";
+                        PEND.push_back(oid);
+                        writeLog(t, "REQUEUE " + oid);
+                    } else if (RST[i] == "DELIVERING") {
+                        ORD[oid][6] = "LOST";
+                        writeLog(t, "LOST " + oid);
+                    }
+                }
+                RST[i] = "DEAD";
+                RDS[i] = t;
+                ROID[i] = "";
+                RTX[i] = -1;
+                RTY[i] = -1;
+                continue;
+            }
+            if (!OK(RTX[i], RTY[i])) {
+                RWT[i]++;   // 目标被封了，等着
+                continue;
+            }
+            vector<vector<int> > d = BFS2(RTX[i], RTY[i]);
+            int best = BIGNUM, bx = -1, by = -1;
+            for (int k = 0; k < 4; k++) {
+                int nx = RX[i] + DX4[k], ny = RY[i] + DY4[k];
+                if (!OK(nx, ny)) continue;
+                if (d[ny][nx] < best) {
+                    best = d[ny][nx];
+                    bx = nx;
+                    by = ny;
+                }
+            }
+            if (best >= BIGNUM) {
+                RWT[i]++;   // 走不过去
+                continue;
+            }
+            if (OCC(bx, by, i)) {
+                bool moved = false;
+                if (RWS[i] >= 4 && !(bx == RTX[i] && by == RTY[i])) {
+                    // 等太久了，让一让
+                    for (int k = 0; k < 4; k++) {
+                        int nx = RX[i] + DX4[k], ny = RY[i] + DY4[k];
+                        if (OK(nx, ny) && !OCC(nx, ny, i)) {
+                            RX[i] = nx;
+                            RY[i] = ny;
+                            RB[i]--;
+                            RTR[i]++;
+                            RWS[i] = 0;
+                            writeLog(t, "SIDESTEP " + RNAME(i));
+                            moved = true;
+                            break;
+                        }
+                    }
+                }
+                if (moved == false) {
+                    RWT[i]++;
+                    RWS[i]++;
+                    continue;
+                }
+            } else {
+                RX[i] = bx;
+                RY[i] = by;
+                RB[i]--;
+                RTR[i]++;
+                RWS[i] = 0;
+            }
+            // 走完看看到没到
+            if (RX[i] == RTX[i] && RY[i] == RTY[i]) {
+                RWS[i] = 0;
+                if (RST[i] == "TO_PICKUP") {
+                    string oid = ROID[i];
+                    ORD[oid][6] = "PICKED";
+                    RST[i] = "DELIVERING";
+                    RTX[i] = S2I(ORD[oid][2]);
+                    RTY[i] = S2I(ORD[oid][3]);
+                    writeLog(t, "PICK " + oid + " " + RNAME(i));
+                } else if (RST[i] == "DELIVERING") {
+                    string oid = ROID[i];
+                    ORD[oid][6] = "DONE";
+                    int lat = t - S2I(ORD[oid][5]);
+                    writeLog(t, "DELIVER " + oid + " " + RNAME(i) + " " + I2S(lat));
+                    RST[i] = "IDLE";
+                    ROID[i] = "";
+                    RTX[i] = -1;
+                    RTY[i] = -1;
+                } else if (RST[i] == "TO_CHARGER") {
+                    RST[i] = "CHARGING";
+                    writeLog(t, "CHARGE " + RNAME(i));
+                }
+            }
+        }
+
+        // ====================== 7. 报表 ======================
+        if ((t + 1) % PRM[4] == 0) {
+            int c0 = 0, c1 = 0, c2 = 0, c3 = 0, c4 = 0, c5 = 0;
+            for (int i = 0; i < NR; i++) {
+                if (RST[i] == "IDLE") c0++;
+                if (RST[i] == "TO_PICKUP") c1++;
+                if (RST[i] == "DELIVERING") c2++;
+                if (RST[i] == "TO_CHARGER") c3++;
+                if (RST[i] == "CHARGING") c4++;
+                if (RST[i] == "DEAD") c5++;
+            }
+            // 热点（李: 运营要看哪里堵）
+            int hx = -1, hy = -1, hc = -1;
+            for (int y = 0; y < H; y++) {
+                for (int x = 0; x < W; x++) {
+                    if (MAP[y][x] == '#') continue;
+                    int n = 0;
+                    for (int i = 0; i < NR; i++) {
+                        if (RST[i] == "DEAD") continue;
+                        if (abs(RX[i] - x) + abs(RY[i] - y) <= PRM[5]) n++;
+                    }
+                    if (n > hc) {
+                        hc = n;
+                        hx = x;
+                        hy = y;
+                    }
+                }
+            }
+            string s = "REPORT pending=" + I2S(PEND.size()) + " idle=" + I2S(c0) + " to_pickup=" + I2S(c1) +
+                       " delivering=" + I2S(c2) + " to_charger=" + I2S(c3) + " charging=" + I2S(c4) +
+                       " dead=" + I2S(c5) + " hot=" + I2S(hx) + "," + I2S(hy) + "," + I2S(hc);
+            writeLog(t, s);
+        }
+    }
+}
+
+// 收尾统计
+void Finish() {
+    long long open = 0;
+    for (map<string, vector<string> >::iterator it = ORD.begin(); it != ORD.end(); ++it) {
+        string st = it->second[6];
+        if (st == "PENDING" || st == "ASSIGNED" || st == "PICKED") open++;
+    }
+    writeRaw("SUMMARY delivered=" + I2S(CNT[0]) + " lost=" + I2S(CNT[1]) + " rejected=" + I2S(CNT[2]) +
+             " cancelled=" + I2S(CNT[3]) + " open=" + I2S(open));
+    long long avg = 0;
+    if (CNT[0] > 0) avg = (CNT[4] + CNT[0] / 2) / CNT[0];   // 平均延迟，整数除法
+    writeRaw("LATENCY sum=" + I2S(CNT[4]) + " max=" + I2S(CNT[5]) + " avg=" + I2S(avg));
+    for (int i = 0; i < NR; i++) {
+        writeRaw("ROBOT " + RNAME(i) + " " + I2S(RX[i]) + " " + I2S(RY[i]) + " " + I2S(RB[i]) + " " + RST[i] + " " +
+                 I2S(RTR[i]) + " " + I2S(RWT[i]));
+    }
+}

package/eval/arena/warehouse/workspace/baseline/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/clock.py

@@ -0,0 +1,42 @@
+"""查看本轮已用时间：python3 clock.py（只有 python 时用 python clock.py）
+
+开赛时间由主办方在你的比赛文件夹里写入（文件名见下面的 MARKER）。本脚本从自己所在的目录开始，
+逐级往上找这个文件，所以解压到哪一层都能找到。只读，不写任何文件。
+"""
+import json
+import time
+from datetime import datetime
+from pathlib import Path
+
+TARGET, LIMIT = 30, 45                  # 分钟：建议用时、强制停止
+MARKER = '.clock_start.json'            # 第 2、3 轮的包里各自换成本轮的文件名
+SUBMIT = '当前的 src/'                   # 本轮以什么为提交
+FINISH = '确认输出正确、写好 src/HANDOFF.md'  # 收尾时该做的事
+
+here = Path(__file__).resolve()
+start, found = None, None
+for d in here.parents:
+    m = d / MARKER
+    if m.is_file():
+        try:
+            start = float(json.loads(m.read_text(encoding='utf-8'))['start_unix'])
+            found = m
+            break
+        except (OSError, ValueError, KeyError):
+            pass
+
+if start is None:
+    st = here.stat()
+    start = getattr(st, 'st_birthtime', None) or st.st_ctime
+    print('！！！注意：没有找到主办方写入的开赛时间（%s），下面暂按本文件的解压时间计算，可能偏短。' % MARKER)
+    print('！！！强制停止以主办方的计时为准，请留出余量。')
+
+used = max(0.0, time.time() - start) / 60
+print('现在：%s' % datetime.now().strftime('%Y-%m-%d %H:%M:%S'))
+print('本轮开始：%s（%s）' % (datetime.fromtimestamp(start).strftime('%H:%M:%S'), '主办方开赛时间' if found else '解压时间'))
+print('已用 %.1f 分钟 | 建议 %d 分钟内完成（还剩 %.1f 分钟） | %d 分钟强制停止（还剩 %.1f 分钟）' % (
+    used, TARGET, max(0.0, TARGET - used), LIMIT, max(0.0, LIMIT - used)))
+if used >= LIMIT:
+    print('已到强制停止时间：%s就是你的提交。' % SUBMIT)
+elif used >= TARGET:
+    print('已超过建议用时：请尽快收尾，%s。' % FINISH)