結果

問題 No.5017 Tool-assisted Shooting
ユーザー wanuiwanui
提出日時 2023-07-17 08:05:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 666 ms / 2,000 ms
コード長 7,058 bytes
コンパイル時間 2,525 ms
コンパイル使用メモリ 204,488 KB
実行使用メモリ 24,348 KB
スコア 4,583,271
平均クエリ数 1000.00
最終ジャッジ日時 2023-07-17 08:06:17
合計ジャッジ時間 68,910 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 597 ms
23,472 KB
testcase_01 AC 623 ms
24,336 KB
testcase_02 AC 561 ms
23,580 KB
testcase_03 AC 605 ms
23,964 KB
testcase_04 AC 582 ms
24,288 KB
testcase_05 AC 584 ms
24,000 KB
testcase_06 AC 606 ms
23,484 KB
testcase_07 AC 602 ms
23,592 KB
testcase_08 AC 578 ms
24,000 KB
testcase_09 AC 584 ms
23,640 KB
testcase_10 AC 615 ms
23,796 KB
testcase_11 AC 576 ms
23,364 KB
testcase_12 AC 604 ms
24,312 KB
testcase_13 AC 619 ms
24,288 KB
testcase_14 AC 621 ms
23,772 KB
testcase_15 AC 595 ms
23,652 KB
testcase_16 AC 604 ms
23,532 KB
testcase_17 AC 610 ms
23,832 KB
testcase_18 AC 601 ms
23,364 KB
testcase_19 AC 628 ms
23,976 KB
testcase_20 AC 599 ms
23,640 KB
testcase_21 AC 614 ms
23,364 KB
testcase_22 AC 593 ms
23,328 KB
testcase_23 AC 578 ms
23,664 KB
testcase_24 AC 603 ms
23,580 KB
testcase_25 AC 642 ms
23,496 KB
testcase_26 AC 601 ms
23,340 KB
testcase_27 AC 587 ms
24,048 KB
testcase_28 AC 615 ms
23,832 KB
testcase_29 AC 567 ms
24,324 KB
testcase_30 AC 563 ms
24,000 KB
testcase_31 AC 584 ms
23,364 KB
testcase_32 AC 634 ms
24,024 KB
testcase_33 AC 636 ms
24,012 KB
testcase_34 AC 591 ms
23,832 KB
testcase_35 AC 630 ms
23,628 KB
testcase_36 AC 574 ms
23,472 KB
testcase_37 AC 606 ms
23,976 KB
testcase_38 AC 624 ms
23,376 KB
testcase_39 AC 598 ms
23,604 KB
testcase_40 AC 607 ms
23,532 KB
testcase_41 AC 594 ms
24,348 KB
testcase_42 AC 617 ms
23,616 KB
testcase_43 AC 587 ms
23,532 KB
testcase_44 AC 620 ms
23,652 KB
testcase_45 AC 608 ms
23,604 KB
testcase_46 AC 612 ms
23,580 KB
testcase_47 AC 573 ms
23,364 KB
testcase_48 AC 618 ms
23,364 KB
testcase_49 AC 589 ms
23,412 KB
testcase_50 AC 592 ms
23,376 KB
testcase_51 AC 599 ms
23,832 KB
testcase_52 AC 615 ms
23,376 KB
testcase_53 AC 609 ms
23,520 KB
testcase_54 AC 618 ms
23,988 KB
testcase_55 AC 599 ms
23,592 KB
testcase_56 AC 591 ms
23,580 KB
testcase_57 AC 588 ms
23,640 KB
testcase_58 AC 598 ms
24,036 KB
testcase_59 AC 621 ms
24,012 KB
testcase_60 AC 631 ms
23,388 KB
testcase_61 AC 590 ms
24,336 KB
testcase_62 AC 586 ms
23,316 KB
testcase_63 AC 631 ms
24,300 KB
testcase_64 AC 606 ms
23,580 KB
testcase_65 AC 666 ms
23,484 KB
testcase_66 AC 636 ms
23,988 KB
testcase_67 AC 599 ms
23,544 KB
testcase_68 AC 605 ms
23,976 KB
testcase_69 AC 640 ms
23,952 KB
testcase_70 AC 597 ms
23,604 KB
testcase_71 AC 609 ms
23,988 KB
testcase_72 AC 596 ms
23,484 KB
testcase_73 AC 594 ms
23,328 KB
testcase_74 AC 567 ms
23,328 KB
testcase_75 AC 625 ms
23,316 KB
testcase_76 AC 606 ms
24,036 KB
testcase_77 AC 614 ms
23,796 KB
testcase_78 AC 595 ms
23,376 KB
testcase_79 AC 602 ms
24,216 KB
testcase_80 AC 609 ms
23,328 KB
testcase_81 AC 582 ms
24,204 KB
testcase_82 AC 590 ms
23,364 KB
testcase_83 AC 597 ms
24,324 KB
testcase_84 AC 605 ms
23,532 KB
testcase_85 AC 622 ms
24,288 KB
testcase_86 AC 614 ms
23,412 KB
testcase_87 AC 601 ms
23,844 KB
testcase_88 AC 619 ms
24,048 KB
testcase_89 AC 600 ms
23,364 KB
testcase_90 AC 609 ms
24,012 KB
testcase_91 AC 634 ms
24,228 KB
testcase_92 AC 572 ms
23,376 KB
testcase_93 AC 608 ms
24,288 KB
testcase_94 AC 606 ms
24,336 KB
testcase_95 AC 607 ms
23,628 KB
testcase_96 AC 640 ms
24,336 KB
testcase_97 AC 601 ms
23,616 KB
testcase_98 AC 629 ms
24,288 KB
testcase_99 AC 600 ms
23,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
const int LOCAL = 0;
using namespace std;

namespace marathon {
mt19937 engine(0);
clock_t start_time;
double now() {
    return 1000.0 * (clock() - start_time) / CLOCKS_PER_SEC;
}
void marathon_init() {
    start_time = clock();
    random_device seed_gen;
    engine.seed(seed_gen());
}
int randint(int mn, int mx) {
    int rng = mx - mn + 1;
    return mn + (engine() % rng);
}
double uniform(double x, double y) {
    const int RND = 1e8;
    double mean = (x + y) / 2.0;
    double dif = y - mean;
    double p = double(engine() % RND) / RND;
    return mean + dif * (1.0 - 2.0 * p);
}
}  // namespace marathon

const int INIT_MY_C = 12;
const int H = 60;
const int W = 25;

struct enemy_t {
    int init_hp;
    int hp;
    int power;
};
struct state_t {
    enemy_t board[H][W];
    int total_power;
    int total_hp;
    int my_c;
    int turn;

    int level() {
        return 1 + total_power / 100;
    }
};
void read_enemies(state_t &state) {
    int n;
    cin >> n;
    for (int it = 0; it < n; it++) {
        int h, p, x;
        cin >> h >> p >> x;
        enemy_t e;
        e.hp = h;
        e.init_hp = h;
        e.power = p;
        state.board[H - 1][x] = e;
    }
}
void generate_enemies(state_t &state) {
    return;
}
bool move_enemies(state_t &state) {
    for (int r = 0; r < H - 1; r++) {
        for (int c = 0; c < W; c++) {
            state.board[r][c] = state.board[r + 1][c];
        }
    }
    for (int c = 0; c < W; c++) {
        state.board[H - 1][c] = {-1, -1, -1};
    }
    return state.board[0][state.my_c].hp <= 0;
}
char greedy_op(state_t &state) {
    vector<double> scores(3, 0.0);
    for (int pi = 0; pi <= 2; pi++) {
        scores[pi] = marathon::uniform(0.01, 0.02);
        int c = state.my_c;
        if (pi == 0) {
            c--;
        } else if (pi == 2) {
            c++;
        }
        c = (c + W) % W;

        // ゲームオーバー
        if (state.board[0][c].hp > 0) {
            scores[pi] += -1e16;
        }

        // 敵への攻撃
        for (int r = 1; r < H; r++) {
            int level = state.level();
            enemy_t e = state.board[r][c];
            if (e.hp <= 0) continue;

            int turns = (e.hp + level - 1) / level;

            if (turns > r) {
                scores[pi] += -1e10 * (H - r);  // 倒せるかどうか
            } else {
                double ratio = 1.0 * e.power / turns;
                if (state.turn > 950) ratio = 1.0 * e.init_hp / turns;
                scores[pi] += ratio * 1e5;
            }
            break;
        }

        // 敵との近さ
        for (int d = 0; d < W; d++) {
            for (int r = 1; r < H; r++) {
                int distance = min(min(abs(c - W - d), abs(c + W - d)), abs(c - d));
                enemy_t e = state.board[r][d];
                if (e.hp <= 0) continue;

                int level = state.level();  // 本当は途中でレベルが上がるが...

                int turns = (e.hp + level - 1) / level;
                if (turns + distance > r) continue;  // 倒せるかどうか

                double ratio = 1.0 * e.power / turns;
                if (state.turn > 950) ratio = 1.0 * e.init_hp / turns;
                scores[pi] += ratio / (distance + 1.0);  // TODO 適当
            }
        }
    }
    pair<double, int> max_score = {-1e50, -1};
    for (int i = 0; i <= 2; i++) {
        max_score = max({scores[i], i}, max_score);
    }
    if (max_score.second == 0) {
        return 'L';
    } else if (max_score.second == 2) {
        return 'R';
    } else {
        return 'S';
    }
}
bool move_attack(state_t &state, char op) {
    if (op == 'L') {
        state.my_c--;
    } else if (op == 'R') {
        state.my_c++;
    }
    state.my_c = (state.my_c + W) % W;
    if (state.board[0][state.my_c].hp > 0) return false;
    for (int i = 1; i < H; i++) {
        if (state.board[i][state.my_c].hp > 0) {
            state.board[i][state.my_c].hp -= state.level();
            // debug4(state.turn, i, state.my_c, state.level());
            if (state.board[i][state.my_c].hp <= 0) {
                state.total_power += state.board[i][state.my_c].power;
                state.total_hp += state.board[i][state.my_c].init_hp;
                state.board[i][state.my_c] = {-1, -1, -1};
            }
            break;
        }
    }
    return true;
}
double simulation_score(int pi, state_t &org_state) {
    double total_score = 0;
    {
        auto state = org_state;
        {
            // 初回移動
            char op = 'S';
            if (pi == 0) op = 'L';
            if (pi == 2) op = 'R';

            bool alive2 = move_attack(state, op);
            if (!alive2) return -1e8;
        }

        int init_turn = org_state.turn;

        int end_turn = 0;
        if (init_turn > 200) {
            end_turn = init_turn + 30;
        } else {
            end_turn = init_turn + 40;
        }
        end_turn = min(end_turn, 1000);

        for (int turn = init_turn + 1; turn <= end_turn; turn++) {
            state.turn = turn;
            bool alive1 = move_enemies(state);
            if (!alive1) {
                total_score -= 1e6;
                break;
            }
            generate_enemies(state);
            char op = greedy_op(state);
            bool alive2 = move_attack(state, op);

            if (init_turn > 950) {
              total_score += state.total_hp;
            } else {
              total_score += state.total_power;
            }

            if (!alive2) {
                total_score -= 1e6;
                break;
            }
        }
    }
    return total_score;
}
char select_op(state_t &state) {
    int turn = state.turn;

    vector<double> scores(3, 0.0);
    for (int pi = 0; pi <= 2; pi++) {
        scores[pi] = simulation_score(pi, state);
    }
    pair<double, int> max_score = {-1e50, -1};
    for (int i = 0; i <= 2; i++) {
        max_score = max({scores[i], i}, max_score);
    }
    if (max_score.second == 0) {
        return 'L';
    } else if (max_score.second == 2) {
        return 'R';
    } else {
        return 'S';
    }
}
int main() {
    marathon::marathon_init();
    if (LOCAL) {
        for (int c = 0; c < W; c++) {
            int p;
            cin >> p;
        }
    }
    state_t state;
    {
        state.total_power = 0;
        state.total_hp = 0;
        state.my_c = INIT_MY_C;
        for (int r = 0; r < H; r++) {
            for (int c = 0; c < W; c++) {
                state.board[r][c] = {-1, -1, -1};
            }
        }
    }
    for (int turn = 1; turn <= 1000; turn++) {
        state.turn = turn;
        bool alive1 = move_enemies(state);
        if (!alive1) break;
        read_enemies(state);
        char op = select_op(state);
        cout << op << endl;
        bool alive2 = move_attack(state, op);
        if (!alive2) break;
    }
    cerr << "score==" << state.total_hp << " turn==" << state.turn << " power==" << state.total_power << " time==" << marathon::now() << endl;
    return 0;
}
0