結果

問題 No.5019 Hakai Project
ユーザー wanuiwanui
提出日時 2023-11-17 19:00:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,329 ms / 3,000 ms
コード長 12,068 bytes
コンパイル時間 3,703 ms
コンパイル使用メモリ 254,660 KB
実行使用メモリ 6,548 KB
スコア 2,615,573,892
最終ジャッジ日時 2023-11-17 19:02:32
合計ジャッジ時間 110,584 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,948 ms
6,548 KB
testcase_01 AC 2,197 ms
6,548 KB
testcase_02 AC 1,999 ms
6,548 KB
testcase_03 AC 1,917 ms
6,548 KB
testcase_04 AC 1,874 ms
6,548 KB
testcase_05 AC 1,953 ms
6,548 KB
testcase_06 AC 1,944 ms
6,548 KB
testcase_07 AC 2,109 ms
6,548 KB
testcase_08 AC 1,904 ms
6,548 KB
testcase_09 AC 2,329 ms
6,548 KB
testcase_10 AC 1,787 ms
6,548 KB
testcase_11 AC 2,032 ms
6,548 KB
testcase_12 AC 2,061 ms
6,548 KB
testcase_13 AC 2,029 ms
6,548 KB
testcase_14 AC 1,885 ms
6,548 KB
testcase_15 AC 1,954 ms
6,548 KB
testcase_16 AC 1,893 ms
6,548 KB
testcase_17 AC 1,783 ms
6,548 KB
testcase_18 AC 1,940 ms
6,548 KB
testcase_19 AC 2,009 ms
6,548 KB
testcase_20 AC 2,130 ms
6,548 KB
testcase_21 AC 2,063 ms
6,548 KB
testcase_22 AC 1,817 ms
6,548 KB
testcase_23 AC 1,979 ms
6,548 KB
testcase_24 AC 2,044 ms
6,548 KB
testcase_25 AC 2,041 ms
6,548 KB
testcase_26 AC 1,994 ms
6,548 KB
testcase_27 AC 1,850 ms
6,548 KB
testcase_28 AC 1,913 ms
6,548 KB
testcase_29 AC 1,809 ms
6,548 KB
testcase_30 AC 1,953 ms
6,548 KB
testcase_31 AC 1,988 ms
6,548 KB
testcase_32 AC 2,031 ms
6,548 KB
testcase_33 AC 1,829 ms
6,548 KB
testcase_34 AC 2,087 ms
6,548 KB
testcase_35 AC 1,945 ms
6,548 KB
testcase_36 AC 1,807 ms
6,548 KB
testcase_37 AC 1,968 ms
6,548 KB
testcase_38 AC 1,894 ms
6,548 KB
testcase_39 AC 2,064 ms
6,548 KB
testcase_40 AC 2,040 ms
6,548 KB
testcase_41 AC 1,929 ms
6,548 KB
testcase_42 AC 1,721 ms
6,548 KB
testcase_43 AC 1,824 ms
6,548 KB
testcase_44 AC 1,861 ms
6,548 KB
testcase_45 AC 1,776 ms
6,548 KB
testcase_46 AC 1,993 ms
6,548 KB
testcase_47 AC 1,869 ms
6,548 KB
testcase_48 AC 2,162 ms
6,548 KB
testcase_49 AC 2,279 ms
6,548 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int getmove(point, point)':
main.cpp:102:1: warning: control reaches end of non-void function [-Wreturn-type]
  102 | }
      | ^

ソースコード

diff # 

#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
#define debug1(a) { cerr<<#a<<":"<<a<<endl; }
#define debug2(a,b) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<endl; }
#define debug3(a,b,c) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<endl; }
#define debug4(a,b,c,d) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<" "<<#d<<":"<<d<<endl; }

struct point {int r; int c; };
bool operator==(const point &lhs, const point &rhs) { return (lhs.r == rhs.r && lhs.c == rhs.c); }
bool operator!=(const point &lhs, const point &rhs) { return !(lhs == rhs); }
bool operator<(const point &lhs, const point &rhs) {
    if (lhs.r != rhs.r){return lhs.r<rhs.r;}
    return lhs.c<rhs.c;
}
point operator-(const point &self){
    return {-self.r, -self.c};
}
point operator+(const point &lhs, const point &rhs){
    return {lhs.r+rhs.r, lhs.c+rhs.c};
}
point operator-(const point &lhs, const point &rhs){
    return lhs + (-rhs);
}
std::ostream &operator<<(std::ostream &os, point &pt) {
    string s;
    s = "(" + to_string(int(pt.r)) + ", " + to_string(int(pt.c)) + ")";
    return os << s;
};
const int inf = 1e9;
// clang-format on
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);
}
template <typename T>
T random_choice(vector<T> &vec) {
    return vec[engine() % vec.size()];
}
bool anneal_accept(double new_score, double old_score, double cur_time, double begin_time, double end_time, double begin_temp, double end_temp) {
    const int ANNEAL_RND = 1e8;
    const double ANNEAL_EPS = 1e-6;
    double temp = (begin_temp * (end_time - cur_time) + end_temp * (cur_time - begin_time)) / (end_time - begin_time);
    return (exp((new_score - old_score) / temp) > double(engine() % ANNEAL_RND) / ANNEAL_RND + ANNEAL_EPS);
}

}  // namespace marathon
struct operation_t {
    int kind;
    int xyz;
};
struct bomb_t {
    int cost;
    vector<point> ranges;
};
const int _U_ = 0;
const int _R_ = 1;
const int _D_ = 2;
const int _L_ = 3;
const int N = 50;
const int M = 20;
const int N2 = 2500;
vector<point> mvs = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
vector<vector<int>> mvtbl(N2);

char TBL_INIT[N][N];
bomb_t BOMBS[M];
int getmove(point src, point dest) {
    assert(abs(src.r - dest.r) + abs(src.c - dest.c) == 1);
    if (src.r < dest.r) {
        return _D_;
    }
    if (src.r > dest.r) {
        return _U_;
    }
    if (src.c < dest.c) {
        return _R_;
    }
    if (src.c > dest.c) {
        return _L_;
    }
}
bool ingrid(int i, int j) {
    return 0 <= i && i < N && 0 <= j && j < N;
}
bool ingrid(point p) {
    return ingrid(p.r, p.c);
}
int _p(int r, int c) {
    return r * N + c;
}
int _p(point p) {
    return _p(p.r, p.c);
}
void init_mvtbl() {
    for (int r = 0; r < N; r++) {
        for (int c = 0; c < N; c++) {
            point u = {r, c};
            for (auto mv : mvs) {
                auto v = mv + u;
                if (!ingrid(v)) continue;
                mvtbl[_p(u)].push_back(_p(v));
            }
        }
    }
}
vector<vector<int>> dijcost(point ini, vector<vector<char>> &tbl) {
    priority_queue<uint, vector<uint>, greater<uint>> pq;
    vector<char> tbl_(N2);
    for (int r = 0; r < N; r++) {
        for (int c = 0; c < N; c++) {
            tbl_[_p(r, c)] = tbl[r][c];
        }
    }
    pq.push(_p(ini));
    vector<bool> done(N2);
    vector<int> costs(N2, inf);
    while (pq.size()) {
        uint cu = pq.top();
        pq.pop();
        int cost = cu >> 16;
        int u = cu & 65535;
        if (done[u]) continue;
        done[u] = true;
        costs[u] = cost;
        for (auto v : mvtbl[u]) {
            int nc = cost + 1;
            if (tbl_[v] != '.') {
                nc = cost + 2;
            }
            if (costs[v] <= nc) continue;
            costs[v] = nc;
            pq.push(nc * 65536 + v);
        }
    }
    vector<vector<int>> result(N, vector<int>(N));
    for (int r = 0; r < N; r++) {
        for (int c = 0; c < N; c++) {
            result[r][c] = costs[_p(r, c)];
            // debug4(ini, r, c, result[r][c]);
        }
    }
    return result;
}
void dij_goto(point &hulk, point dest, vector<operation_t> &ops, vector<vector<char>> &tbl) {
    priority_queue<tuple<int, point, point>, vector<tuple<int, point, point>>, greater<tuple<int, point, point>>> pq;
    pq.push({0, hulk, {-1, -1}});
    vector<vector<int>> costs(N, vector<int>(N, inf));
    vector<vector<point>> froms(N, vector<point>(N, {-1, -1}));
    while (pq.size()) {
        int cost;
        point u, frm;
        tie(cost, u, frm) = pq.top();
        pq.pop();
        if (costs[u.r][u.c] <= cost) continue;
        costs[u.r][u.c] = cost;
        froms[u.r][u.c] = frm;
        if (u == dest) break;
        for (auto mv : mvs) {
            point v = mv + u;
            if (!ingrid(v)) continue;
            int nc = cost + 1;
            if (tbl[v.r][v.c] != '.') {
                nc = cost + 2;
            }
            pq.push({nc, v, u});
        }
    }
    {
        point cur = dest;
        vector<point> route;
        while (true) {
            route.push_back(cur);
            if (cur == hulk) break;
            cur = froms[cur.r][cur.c];
        }
        reverse(route.begin(), route.end());
        for (int i = 1; i < int(route.size()); i++) {
            point pre = route[i - 1];
            point nxt = route[i];
            int mvid = getmove(pre, nxt);
            ops.push_back({1, mvid});
        }
    }
    hulk = dest;
}
void solve() {
    point hulk = {0, 0};
    vector<vector<char>> tbl(N, vector<char>(N));
    for (int r = 0; r < N; r++) {
        for (int c = 0; c < N; c++) {
            tbl[r][c] = TBL_INIT[r][c];
        }
    }

    vector<operation_t> ops;
    for (int breakloop = 0; true; breakloop++) {
        debug2(breakloop, marathon::now());
        vector<point> shops;
        vector<point> walls;
        for (int r = 0; r < N; r++) {
            for (int c = 0; c < N; c++) {
                if (tbl[r][c] == '@') shops.push_back({r, c});
                if (tbl[r][c] == '#') walls.push_back({r, c});
            }
        }
        if (shops.size() == 0) break;
        // (移動コスト+爆弾コスト)/破壊個数 が一番小さい
        tuple<point, point, int> bestop = {{-1, -1}, {-1, -1}, -1};
        {
            double bestscore = -1e18;
            auto hulk_cost = dijcost(hulk, tbl);
            vector<vector<point>> midshop(N, vector<point>(N, {-1, -1}));
            vector<vector<int>> move_cost(N, vector<int>(N, inf));
            for (auto shop : shops) {
                auto costs_from_shop = dijcost(shop, tbl);
                for (int r = 0; r < N; r++) {
                    for (int c = 0; c < N; c++) {
                        int cost = costs_from_shop[r][c] * 4 + hulk_cost[r][c];
                        if (move_cost[r][c] > cost) {
                            move_cost[r][c] = cost;
                            midshop[r][c] = shop;
                        }
                    }
                }
            }
            vector<bool> valid_bomb(M, false);
            {
                vector<pair<int, int>> costs;
                for (int bid = 0; bid < M; bid++) {
                    costs.push_back({BOMBS[bid].cost, bid});
                }
                int usenum = M;
                if (marathon::now() < 750) {
                    usenum = M;
                } else if (marathon::now() < 1500) {
                    usenum = M / 2;
                } else if (marathon::now() < 2250) {
                    usenum = M / 4;
                } else {
                    usenum = 2;
                }
                sort(costs.begin(), costs.end());
                for (int i = 0; i < usenum; i++) {
                    valid_bomb[costs[i].second] = true;
                }
            }
            for (int r = 0; r < N; r++) {
                for (int c = 0; c < N; c++) {
                    point now = {r, c};
                    for (int bid = 0; bid < M; bid++) {
                        if (!valid_bomb[bid]) continue;
                        int cost = move_cost[r][c] + BOMBS[bid].cost;

                        int break_wall = 0;
                        int break_shop = 0;

                        for (auto drc : BOMBS[bid].ranges) {
                            point pt = now + drc;
                            if (!ingrid(pt)) continue;
                            if (tbl[pt.r][pt.c] == '#') {
                                break_wall++;
                            }
                            if (tbl[pt.r][pt.c] == '@') {
                                break_shop++;
                            }

                            double score = 0;
                            if (int(shops.size()) - break_shop >= 20) {
                                if (break_wall == 0) continue;
                                score = 1.0 * (-cost) / break_wall;
                            } else if (shops.size() >= 2 && walls.size() > 0) {
                                if (break_wall == 0) continue;
                                score = 1.0 * (-cost - 10000 * break_shop) / break_wall;
                            } else {
                                if (break_wall + break_shop == 0) continue;
                                // score = 1.0 * (break_wall + 0.01 * break_shop) / (break_wall + break_shop);
                                score = 1.0 * (-cost) / (break_wall + break_shop);
                            }
                            if (bestscore < score) {
                                bestscore = score;
                                bestop = {now, midshop[now.r][now.c], bid};
                            }
                        }
                    }
                }
            }
        }
        {
            point midshop, bombpt;
            int bombid;
            tie(bombpt, midshop, bombid) = bestop;
            dij_goto(hulk, midshop, ops, tbl);
            ops.push_back({2, bombid});
            dij_goto(hulk, bombpt, ops, tbl);
            ops.push_back({3, bombid});
            for (auto drc : BOMBS[bombid].ranges) {
                point pt = hulk + drc;
                if (!ingrid(pt)) continue;
                tbl[pt.r][pt.c] = '.';
            }
        }
    }
    {
        cout << ops.size() << endl;
        for (auto op : ops) {
            if (op.kind == 1) {
                char d = '.';
                if (op.xyz == _L_) d = 'L';
                if (op.xyz == _R_) d = 'R';
                if (op.xyz == _U_) d = 'U';
                if (op.xyz == _D_) d = 'D';
                cout << op.kind << " " << d << endl;
            } else {
                cout << op.kind << " " << op.xyz + 1 << endl;
            }
        }
    }
}
int main() {
    marathon::marathon_init();
    init_mvtbl();
    int n, m;
    cin >> n >> m;
    for (int r = 0; r < N; r++) {
        for (int c = 0; c < N; c++) {
            cin >> TBL_INIT[r][c];
        }
    }
    for (int b = 0; b < M; b++) {
        int c, l;
        cin >> c >> l;
        bomb_t bomb;
        bomb.cost = c;
        for (int i = 0; i < l; i++) {
            int dr, dc;
            cin >> dr >> dc;
            bomb.ranges.push_back({dr, dc});
        }
        BOMBS[b] = bomb;
    }
    solve();
}
0