結果

問題 No.5017 Tool-assisted Shooting
ユーザー hari64hari64
提出日時 2023-07-16 17:28:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 6,067 bytes
コンパイル時間 3,007 ms
コンパイル使用メモリ 218,900 KB
実行使用メモリ 24,528 KB
スコア 1,828,318
平均クエリ数 611.37
最終ジャッジ日時 2023-07-16 17:29:01
合計ジャッジ時間 25,614 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 AC 200 ms
23,400 KB
testcase_03 RE -
testcase_04 AC 172 ms
23,640 KB
testcase_05 AC 180 ms
24,384 KB
testcase_06 AC 164 ms
23,544 KB
testcase_07 RE -
testcase_08 AC 165 ms
24,084 KB
testcase_09 AC 205 ms
24,048 KB
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 AC 237 ms
23,424 KB
testcase_15 RE -
testcase_16 AC 172 ms
23,556 KB
testcase_17 AC 197 ms
24,048 KB
testcase_18 AC 176 ms
23,640 KB
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 AC 230 ms
24,072 KB
testcase_25 AC 246 ms
23,568 KB
testcase_26 RE -
testcase_27 AC 177 ms
23,424 KB
testcase_28 AC 229 ms
23,448 KB
testcase_29 AC 145 ms
23,412 KB
testcase_30 AC 147 ms
23,412 KB
testcase_31 RE -
testcase_32 AC 209 ms
23,424 KB
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 AC 176 ms
23,412 KB
testcase_37 RE -
testcase_38 AC 203 ms
24,060 KB
testcase_39 AC 207 ms
24,396 KB
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 AC 179 ms
23,424 KB
testcase_44 RE -
testcase_45 RE -
testcase_46 AC 203 ms
24,060 KB
testcase_47 AC 168 ms
24,276 KB
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 AC 192 ms
24,072 KB
testcase_55 RE -
testcase_56 AC 169 ms
23,436 KB
testcase_57 AC 186 ms
23,448 KB
testcase_58 AC 215 ms
23,532 KB
testcase_59 AC 265 ms
24,372 KB
testcase_60 RE -
testcase_61 AC 176 ms
23,652 KB
testcase_62 AC 186 ms
23,676 KB
testcase_63 RE -
testcase_64 RE -
testcase_65 AC 239 ms
24,480 KB
testcase_66 RE -
testcase_67 RE -
testcase_68 AC 194 ms
23,580 KB
testcase_69 AC 171 ms
24,396 KB
testcase_70 RE -
testcase_71 RE -
testcase_72 AC 173 ms
24,276 KB
testcase_73 AC 216 ms
23,544 KB
testcase_74 RE -
testcase_75 RE -
testcase_76 AC 184 ms
24,036 KB
testcase_77 RE -
testcase_78 AC 234 ms
24,504 KB
testcase_79 RE -
testcase_80 AC 237 ms
24,036 KB
testcase_81 AC 211 ms
24,048 KB
testcase_82 RE -
testcase_83 RE -
testcase_84 RE -
testcase_85 AC 207 ms
24,336 KB
testcase_86 RE -
testcase_87 AC 175 ms
23,856 KB
testcase_88 RE -
testcase_89 AC 187 ms
23,856 KB
testcase_90 RE -
testcase_91 RE -
testcase_92 RE -
testcase_93 RE -
testcase_94 AC 168 ms
24,396 KB
testcase_95 RE -
testcase_96 RE -
testcase_97 RE -
testcase_98 RE -
testcase_99 AC 176 ms
24,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifndef hari64
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define debug(...)
#else
#include "util/viewer.hpp"
#define debug(...) viewer::_debug(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// clang-format off
using namespace std;
using ll = long long; using ld = long double;
using pii = pair<int, int>; using pll = pair<ll, ll>;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vc<T>>;
template <typename T> using vvvc = vector<vvc<T>>;
using vi = vc<int>; using vl = vc<ll>; using vpi = vc<pii>; using vpl = vc<pll>;
#define ALL(x) begin(x), end(x)
#define RALL(x) (x).rbegin(), (x).rend()
constexpr int INF = 1001001001; constexpr long long INFll = 1001001001001001001;
template <class T> bool chmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> bool chmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
// clang-format on

struct Enemy {
    int h, p;
    int x, y;
    int initH;
    Enemy(int h, int p, int x) : h(h), p(p), x(x), y(59) { initH = h; }
};

constexpr int H = 60;
constexpr int W = 25;
vvc<Enemy> GRID(W);
int NOW_X;
int LEVEL;
int POWER_SUM;
int SCORE;

void update(vvc<Enemy>& g) {
    for (int x = 0; x < W; x++) {
        if (g[x].empty()) continue;
        for (auto& e : g[x]) {
            e.y--;
        }
        if (g[x].back().y == -1) {
            g[x].pop_back();
        }
        assert(g[x].empty() || g[x].back().y != -1);
    }
}

tuple<int, int, string> simulate(vector<int>& enemy) {
    string moves = "";
    int score = 0;
    int score2 = 0;
    int nowX = NOW_X;
    int level = LEVEL;
    int powerSum = POWER_SUM;
    int totalTurn = 0;
    int enemyIndex = 0;

    auto grid = GRID;
    // for (int x = 0; x < W; x++) {
    //     set<int> check;
    //     for (auto& e : grid[x]) {
    //         check.insert(e.y);
    //     }
    //     assert(check.size() == grid[x].size());
    // }

    while (true) {
        totalTurn++;
        if (totalTurn > 1000) break;

        string move = "S";
        if (nowX < enemy[enemyIndex]) {
            if (enemy[enemyIndex] - nowX < 12) {
                move = "R";
            } else {
                move = "L";
            }
        } else if (nowX > enemy[enemyIndex]) {
            if (nowX - enemy[enemyIndex] < 12) {
                move = "L";
            } else {
                move = "R";
            }
        }
        if (enemyIndex <= 1) {
            moves += move;
        }

        if (move == "L") nowX = (25 + nowX - 1) % 25;
        if (move == "R") nowX = (25 + nowX + 1) % 25;
        if (move == "S") nowX = nowX;

        if (grid[nowX].empty()) continue;
        if (grid[nowX].back().y == 1 || grid[nowX].back().y == 0) {
            return {-INF, -INF, "S"};
        }
        grid[nowX].back().h -= level;

        score2 += grid[nowX].back().initH;
        if (grid[nowX].back().h <= 0) {
            score += grid[nowX].back().initH;
            powerSum += grid[nowX].back().p;
            level = 1 + powerSum / 100;
            grid[nowX].pop_back();
            while (enemyIndex < int(enemy.size()) && grid[enemy[enemyIndex]].empty()) {
                enemyIndex++;
            }
            if (enemyIndex >= int(enemy.size())) break;
        }

        update(grid);
    }

    return {score / totalTurn, score2, moves};
}

string solve() {
    int bestScore = -1;
    string bestMove = "";
    if (LEVEL <= 150) {
        for (int e1 = 0; e1 < W; e1++) {
            if (GRID[e1].empty()) continue;
            vi enemies = {e1};
            auto [score, _, move] = simulate(enemies);
            if (chmax(bestScore, score)) {
                bestMove = move;
            }
        }
    } else {
        for (int e1 = 0; e1 < W; e1++) {
            if (GRID[e1].empty()) continue;
            for (int e2 = 0; e2 < W; e2++) {
                if (GRID[e2].empty()) continue;
                vi enemies = {e1, e2};
                auto [score, _, move] = simulate(enemies);
                if (chmax(bestScore, score)) {
                    bestMove = move;
                }
            }
        }
    }
    if (bestScore == -1) {
        debug("Game Over!");
    }
    assert(!bestMove.empty());
    // debug(bestScore, bestMove);
    return bestMove;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

#ifdef hari64
    for (int _ = 0; _ < W; _++) {
        int p;
        cin >> p;
        assert(1 <= p && p <= 8);
    }
#endif

    NOW_X = 12;
    LEVEL = 1;
    POWER_SUM = 0;
    SCORE = 0;

    const int NUM_OF_TURNS = 1000;

    string moves = "";
    vector<string> ans;

    for (int i = 0; i < NUM_OF_TURNS; i++) {
        // debug(i);
        update(GRID);

        int n;
        cin >> n;
        if (n == -1) break;

        for (int i = 0; i < n; i++) {
            int h, p, x;
            cin >> h >> p >> x;
            assert(GRID[x].empty() || GRID[x].front().y < 59);
            GRID[x].insert(GRID[x].begin(), Enemy(h, p, x));
        }

        string s;
        if (i <= 5) {
            s = "S";
        } else if (i <= 40) {
            if (moves.size() == 0) {
                moves = solve();
            }
            s = string(1, moves[0]);
            moves.erase(moves.begin());
        } else {
            s = string(1, solve()[0]);
        }

#ifndef hari64
        cout << s << endl;
        flush(cout);
#endif
        ans.push_back(s);

        if (s == "L") NOW_X = (25 + NOW_X - 1) % 25;
        if (s == "R") NOW_X = (25 + NOW_X + 1) % 25;
        if (s == "S") NOW_X = NOW_X;

        if (GRID[NOW_X].empty()) continue;
        GRID[NOW_X].back().h -= LEVEL;
        if (GRID[NOW_X].back().h <= 0) {
            SCORE += GRID[NOW_X].back().initH;
            POWER_SUM += GRID[NOW_X].back().p;
            LEVEL = 1 + POWER_SUM / 100;
            GRID[NOW_X].pop_back();
        }
    }

    debug(SCORE, LEVEL, POWER_SUM, NOW_X);

#ifdef hari64
    for (auto s : ans) {
        cout << s << endl;
    }
#endif

    return 0;
}
0