dsh-eval-guard 0.2.3 → 0.3.1

package/eval/arena/ctf/bots/doubao-seed-2.1-turbo.cpp

@@ -0,0 +1,320 @@
+// 夺旗 bot v15 - 稳定版，基于最佳表现优化
+// 策略：
+// - 每个单位独立决策
+// - 优先拿旗，有敌人在范围内就打
+// - 低血量撤退
+// - 每个单位去最近的可用旗子
+#include <bits/stdc++.h>
+using namespace std;
+
+struct Unit { int id, team, x, y, hp, flag, respawn_at; };
+struct Flag { int id; string status; int x, y, holder, return_at; };
+struct Event { string type; vector<int> args; };
+
+struct Game {
+    int teams = 0, me = 0, size = 0, turns = 0, hp = 0, damage = 0, respawn = 0, flag_return = 0, flag_cooldown = 0;
+    vector<string> map;
+    vector<pair<int, int>> bases;
+    vector<pair<int, int>> spots;
+    int turn = 0;
+    vector<int> score;
+    vector<Unit> units;
+    vector<Flag> flags;
+    vector<Event> events;
+};
+
+bool read_turn(Game& g) {
+    string w;
+    while (cin >> w) {
+        if (w == "INIT") {
+            cin >> g.teams >> g.me >> g.size >> g.turns >> g.hp >> g.damage >> g.respawn >> g.flag_return >> g.flag_cooldown;
+        } else if (w == "MAP") {
+            g.map.assign(g.size, "");
+            for (auto& row : g.map) cin >> row;
+        } else if (w == "BASES") {
+            int k; cin >> k; g.bases.resize(k);
+            for (auto& b : g.bases) cin >> b.first >> b.second;
+        } else if (w == "SPOTS") {
+            int k; cin >> k; g.spots.resize(k);
+            for (auto& s : g.spots) cin >> s.first >> s.second;
+        } else if (w == "TURN") {
+            cin >> g.turn;
+        } else if (w == "SCORE") {
+            g.score.resize(g.teams);
+            for (auto& s : g.score) cin >> s;
+        } else if (w == "UNITS") {
+            int k; cin >> k; g.units.resize(k);
+            for (auto& u : g.units) { string tag; cin >> tag >> u.id >> u.team >> u.x >> u.y >> u.hp >> u.flag >> u.respawn_at; }
+        } else if (w == "FLAGS") {
+            int k; cin >> k; g.flags.resize(k);
+            for (auto& f : g.flags) { string tag; cin >> tag >> f.id >> f.status >> f.x >> f.y >> f.holder >> f.return_at; }
+        } else if (w == "EVENTS") {
+            int k; cin >> k; g.events.assign(k, {});
+            string line; getline(cin, line);
+            for (auto& e : g.events) {
+                getline(cin, line);
+                istringstream in(line);
+                string tag; in >> tag >> e.type;
+                for (int v; in >> v;) e.args.push_back(v);
+            }
+        } else if (w == "END") {
+            return true;
+        }
+    }
+    return false;
+}
+
+inline int mdist(int x1, int y1, int x2, int y2) {
+    return abs(x1 - x2) + abs(y1 - y2);
+}
+
+inline bool is_wall(const Game& g, int x, int y) {
+    return x < 0 || y < 0 || x >= g.size || y >= g.size || g.map[y][x] == '#';
+}
+
+vector<vector<int>> bfs_from(const Game& g, int sx, int sy) {
+    vector<vector<int>> d(g.size, vector<int>(g.size, -1));
+    if (sx < 0 || sy < 0) return d;
+    queue<pair<int,int>> q;
+    d[sy][sx] = 0;
+    q.push({sx, sy});
+    static const int dx[] = {0, 0, -1, 1};
+    static const int dy[] = {-1, 1, 0, 0};
+    while (!q.empty()) {
+        auto [x, y] = q.front(); q.pop();
+        for (int di = 0; di < 4; di++) {
+            int nx = x + dx[di], ny = y + dy[di];
+            if (is_wall(g, nx, ny) || d[ny][nx] != -1) continue;
+            d[ny][nx] = d[y][x] + 1;
+            q.push({nx, ny});
+        }
+    }
+    return d;
+}
+
+char step_toward(const Game& g, const vector<vector<int>>& d, int sx, int sy, int tx, int ty) {
+    if (sx == tx && sy == ty) return 'S';
+    if (d[ty][tx] == -1 || d[sy][sx] == -1) return 'S';
+    
+    static const int dx[] = {0, 0, -1, 1};
+    static const int dy[] = {-1, 1, 0, 0};
+    
+    int cx = tx, cy = ty;
+    while (d[cy][cx] > 1) {
+        bool found = false;
+        for (int di = 0; di < 4; di++) {
+            int nx = cx + dx[di], ny = cy + dy[di];
+            if (!is_wall(g, nx, ny) && d[ny][nx] == d[cy][cx] - 1) {
+                cx = nx; cy = ny;
+                found = true;
+                break;
+            }
+        }
+        if (!found) break;
+    }
+    
+    if (cx == sx && cy == sy - 1) return 'U';
+    if (cx == sx && cy == sy + 1) return 'D';
+    if (cx == sx - 1 && cy == sy) return 'L';
+    if (cx == sx + 1 && cy == sy) return 'R';
+    return 'S';
+}
+
+bool can_attack(const Game& g, int ax, int ay, int tx, int ty) {
+    if (mdist(ax, ay, tx, ty) > 2) return false;
+    int dx = tx - ax, dy = ty - ay;
+    if (abs(dx) == 2 && dy == 0) return !is_wall(g, ax + dx/2, ay);
+    if (abs(dy) == 2 && dx == 0) return !is_wall(g, ax, ay + dy/2);
+    if (abs(dx) == 1 && abs(dy) == 1) return !is_wall(g, ax + dx, ay) || !is_wall(g, ax, ay + dy);
+    return true;
+}
+
+bool in_my_base(const Game& g, int x, int y) {
+    auto [bx, by] = g.bases[g.me];
+    return abs(x - bx) <= 1 && abs(y - by) <= 1;
+}
+
+pair<int,int> best_base_cell(const Game& g, const vector<vector<int>>& dist) {
+    auto [bx, by] = g.bases[g.me];
+    int best_d = INT_MAX;
+    pair<int,int> best = {bx, by};
+    for (int dy = -1; dy <= 1; dy++) {
+        for (int dx = -1; dx <= 1; dx++) {
+            int nx = bx + dx, ny = by + dy;
+            if (is_wall(g, nx, ny)) continue;
+            if (dist[ny][nx] != -1 && dist[ny][nx] < best_d) {
+                best_d = dist[ny][nx];
+                best = {nx, ny};
+            }
+        }
+    }
+    return best;
+}
+
+char move_away(const Game& g, int x, int y, int tx, int ty) {
+    static const int dx[] = {0, 0, -1, 1};
+    static const int dy[] = {-1, 1, 0, 0};
+    static const char dirs[] = {'U', 'D', 'L', 'R'};
+    int best_d = mdist(x, y, tx, ty);
+    char best = 'S';
+    for (int d = 0; d < 4; d++) {
+        int nx = x + dx[d], ny = y + dy[d];
+        if (is_wall(g, nx, ny)) continue;
+        int nd = mdist(nx, ny, tx, ty);
+        if (nd > best_d) { best_d = nd; best = dirs[d]; }
+    }
+    return best;
+}
+
+string decide(const Game& g) {
+    vector<char> moves(3, 'S');
+    vector<string> actions(3, "-");
+    vector<string> notes(3, "");
+    
+    vector<Unit> mine;
+    for (auto& u : g.units) if (u.team == g.me) mine.push_back(u);
+    
+    vector<Unit> enemies;
+    for (auto& u : g.units) if (u.team != g.me && u.x != -1) enemies.push_back(u);
+    
+    // 对每个单位独立决策
+    for (int i = 0; i < 3; i++) {
+        auto& u = mine[i];
+        if (u.x == -1) continue;
+        
+        auto dist = bfs_from(g, u.x, u.y);
+        
+        // 找最佳攻击目标
+        int best_pri = -1;
+        Unit best_target = {-1, -1, -1, -1, 0, -1, -1};
+        for (auto& e : enemies) {
+            if (!can_attack(g, u.x, u.y, e.x, e.y)) continue;
+            int pri = 0;
+            if (e.flag != -1) pri += 1000;
+            pri += (100 - e.hp) * 5;
+            if (pri > best_pri) { best_pri = pri; best_target = e; }
+        }
+        
+        // 携旗：回基地
+        if (u.flag != -1) {
+            if (in_my_base(g, u.x, u.y)) {
+                notes[i] = "交旗";
+            } else {
+                auto [tx, ty] = best_base_cell(g, dist);
+                moves[i] = step_toward(g, dist, u.x, u.y, tx, ty);
+                notes[i] = "回基地";
+            }
+            continue;
+        }
+        
+        // 没携旗
+        bool did_action = false;
+        
+        // 1. 攻击（如果有好目标）
+        if (best_target.id != -1 && u.hp > 34) {
+            actions[i] = to_string(best_target.id);
+            int d = mdist(u.x, u.y, best_target.x, best_target.y);
+            if (u.hp <= 67 && d <= 1) {
+                // 低血量且敌人贴脸，边打边退
+                moves[i] = move_away(g, u.x, u.y, best_target.x, best_target.y);
+                notes[i] = "边打边退";
+            } else {
+                moves[i] = 'S';
+                notes[i] = "攻击";
+            }
+            did_action = true;
+        }
+        
+        if (!did_action) {
+            // 2. 找最近的旗子
+            int best_fd = INT_MAX;
+            Flag best_flag = {-1, "", -1, -1, -1, -1};
+            for (auto& f : g.flags) {
+                if (f.status != "home" && f.status != "dropped") continue;
+                int d = dist[f.y][f.x];
+                if (d != -1 && d < best_fd) { best_fd = d; best_flag = f; }
+            }
+            
+            if (best_flag.id != -1) {
+                if (best_fd == 0) {
+                    actions[i] = "P";
+                    notes[i] = "拾旗";
+                } else {
+                    moves[i] = step_toward(g, dist, u.x, u.y, best_flag.x, best_flag.y);
+                    if (best_fd == 1) actions[i] = "P";
+                    notes[i] = "拿旗";
+                }
+                did_action = true;
+            }
+        }
+        
+        if (!did_action) {
+            // 3. 找最近的敌方携旗者
+            int best_cd = INT_MAX;
+            Unit best_carrier;
+            for (auto& e : enemies) {
+                if (e.flag == -1) continue;
+                int d = dist[e.y][e.x];
+                if (d != -1 && d < best_cd) { best_cd = d; best_carrier = e; }
+            }
+            if (best_carrier.id != -1 && best_cd < 15) {
+                moves[i] = step_toward(g, dist, u.x, u.y, best_carrier.x, best_carrier.y);
+                notes[i] = "拦截";
+                did_action = true;
+            }
+        }
+        
+        if (!did_action) {
+            // 4. 回基地
+            if (!in_my_base(g, u.x, u.y)) {
+                auto [tx, ty] = best_base_cell(g, dist);
+                moves[i] = step_toward(g, dist, u.x, u.y, tx, ty);
+                notes[i] = "回防";
+            } else {
+                notes[i] = "待命";
+            }
+        }
+        
+        // 低血量强制撤退
+        if (u.hp <= 34 && u.flag == -1) {
+            int nearest_d = INT_MAX;
+            int nex = -1, ney = -1;
+            for (auto& e : enemies) {
+                int d = mdist(u.x, u.y, e.x, e.y);
+                if (d <= 4 && d < nearest_d) {
+                    nearest_d = d;
+                    nex = e.x;
+                    ney = e.y;
+                }
+            }
+            if (nex != -1) {
+                moves[i] = move_away(g, u.x, u.y, nex, ney);
+                actions[i] = "-";
+                notes[i] = "撤退";
+            }
+        }
+    }
+    
+    string out = to_string(g.turn);
+    for (int i = 0; i < 3; i++) {
+        out += " ";
+        out += moves[i];
+        out += " ";
+        out += actions[i];
+    }
+    out += " # ";
+    for (int i = 0; i < 3; i++) {
+        if (i > 0) out += ";";
+        out += notes[i];
+    }
+    
+    return out;
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    Game g;
+    while (read_turn(g)) {
+        cout << decide(g) << endl;
+    }
+}