結果
| 問題 | No.5017 Tool-assisted Shooting |
| ユーザー |
 iiljj
|
| 提出日時 | 2023-07-16 18:23:08 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 324 ms / 2,000 ms |
| コード長 | 14,565 bytes |
| コンパイル時間 | 1,839 ms |
| コンパイル使用メモリ | 155,716 KB |
| 実行使用メモリ | 24,444 KB |
| スコア | 89,674 |
| 平均クエリ数 | 2000.00 |
| 最終ジャッジ日時 | 2023-07-16 18:24:55 |
| 合計ジャッジ時間 | 35,019 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge12 |
| 純コード判定しない問題か言語 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 100 |
ソースコード
/* #region Head */// #include <bits/stdc++.h>#include <algorithm>#include <array>#include <bitset>#include <cassert> // assert.h#include <cmath> // math.h#include <cstring>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define ISIZE(x) ((int)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7// constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力for (T &x : vec) is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力REP(i, 0, SIZE(arr)) is >> arr[i];return is;}template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)os << "{";REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力is >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us 出力template <class T> ostream &out_iter(ostream &os, const T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {return out_iter(os, map_var);}template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}// tuple 出力template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {if constexpr (N < std::tuple_size_v<tuple<Args...>>) {os << get<N>(a);if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {os << ' ';} else if constexpr (end_line) {os << '\n';}return operator<< <N + 1, end_line>(os, a);}return os;}template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(std::cout, a); }void pprint() { std::cout << endl; }template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {std::cout << head;if (sizeof...(Tail) > 0) std::cout << ' ';pprint(move(tail)...);}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {DUMPOUT << head;if (sizeof...(Tail) > 0) DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ローカル用#ifndef ONLINE_JUDGE#define DEBUG_#endif#ifndef MYLOCAL#undef DEBUG_#endif#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \assert((std::cin >> __VA_ARGS__));template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = true;AtCoderInitialize() {ios_base::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);std::cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH) std::cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i) v[i]--;}template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i) v[i]++;}/* #endregion */// #include <atcoder/all>// using namespace atcoder;/* #region BFS *//*** @param N ノード数* @param delta 隣接行列を生成する関数．delta(Node v, fn(Node t)).* fn は現在の頂点 current と隣接する頂点を探索する関数．* @param index 頂点→頂点インデックス，のマップ関数．（index(Node v) -> int）* @return 距離テーブル，到達不能な箇所は -1 で埋まっている*/template <typename T = ll, class Node, class Delta, class Index>pair<vc<T>, vc<int>> bfs(const int N, const vc<Node> &starts, Delta delta, Index index) {vc<T> dist(N, -1); // 距離テーブルvc<int> prev(N, -1); // 直前のノードqueue<Node> que; // 「訪問予定」頂点リストfor (const Node &start : starts) {dist[index(start)] = 0; // 初期条件 (頂点 idx1 を初期頂点とする)que.push(start);}// BFS 開始 (キューが空になるまで探索を行う)while (!que.empty()) {const Node current = que.front();que.pop();// 隣接ノードに関するループは外に出すdelta(current, [&](const Node &dst) {const int nxt_idx = index(dst);if (dist[nxt_idx] == -1) {const int cur_idx = index(current);dist[nxt_idx] = dist[cur_idx] + 1;prev[nxt_idx] = cur_idx;que.push(dst);}});}return {dist, prev};}/* #endregion */// 経路復元vc<int> restore(int dst, const vc<int> &bs) {vc<int> res;if (bs[dst] < 0) return res;while (~dst) res.emplace_back(dst), dst = bs[dst];reverse(ALL(res));return res;}constexpr ll W = 25;constexpr ll H = 60;constexpr ll MAXTURN = 1000;// Problemvoid solve() {#ifdef MYLOCAL{// ローカルではこれを捨てるvll p(25);cin >> p;}#endifarray<array<ll, W>, MAXTURN + H + 1> boards_hp, boards_power;REP(row, 0, MAXTURN + H + 1) {fill(ALL(boards_hp[row]), 0);fill(ALL(boards_power[row]), 0);}array<ll, W> counts;fill(ALL(counts), 0);ll n;ll turn = 0;ll current_x = 12;// ll level = 1;// ll beat_power_sum = 0;while (cin >> n) {if (n == -1) return; // ゲーム終了// 入力vll hp(n), power(n), x(n);REP(i, 0, n) cin >> hp[i], power[i], x[i];// turn + 59 に出現するREP(i, 0, n) {boards_hp.at(turn + H)[x[i]] = hp[i];boards_power.at(turn + H)[x[i]] = power[i];counts[x[i]]++;}// 経路計算，(row=turn, col=current_x) を始点として，// row=turn+H-1 まで進む．生き残れる経路を探す．// dump(turn);using Node = pair<int, int>;// 隣接行列生成関数auto delta = [&](Node current, function<void(Node)> transit) {auto [r, c] = current;if (r == H - 1) return;if (turn + r == MAXTURN) return;// 隣接ノードに関するループif (boards_hp.at(turn + r + 1)[c] == 0 && boards_hp.at(turn + r + 2)[c] == 0) {// 正面transit(Node(r + 1, c));}if (c - 1 >= 0 && boards_hp.at(turn + r)[c - 1] == 0 && boards_hp.at(turn + r + 1)[c - 1] == 0 &&boards_hp.at(turn + r + 2)[c - 1] == 0) {// 左transit(Node(r + 1, c - 1));}if (c + 1 < W && boards_hp.at(turn + r)[c + 1] == 0 && boards_hp.at(turn + r + 1)[c + 1] == 0 &&boards_hp.at(turn + r + 2)[c + 1] == 0) {// 右transit(Node(r + 1, c + 1));}};// インデックス生成関数auto index = [&](Node v) { return v.first * W + v.second; };Node start = {0, current_x};auto [dist, prev] = bfs(H * W, vc<Node>{start}, delta, index);// ゴールのうち最も中心に近いところを探すll mindiff = INF;ll argmin_x = -1;// pprint("#", H - 1, MAXTURN - turn);REP(x, 0, W) {int idx = index(Node(min(H - 1, MAXTURN - turn), x));if (dist.at(idx) == -1) continue;if (chmin(mindiff, abs(x - 12))) {argmin_x = x;}}if (argmin_x == -1) {pprint('S');pprint("#", turn + 1, current_x, "NG");if (++turn == MAXTURN) break;dump(turn, __LINE__);continue;}int gi = index(Node(min(H - 1, MAXTURN - turn), argmin_x));vc<int> path = restore(gi, prev);// dump(path);int next_X = path.at(1) % W;// 出力// dump(turn);if (next_X == current_x) {pprint('S');pprint("#", turn + 1, current_x, "S");// dump(turn, __LINE__);} else if (next_X == current_x - 1) {pprint('L');pprint("#", turn + 1, current_x, "L", boards_hp.at(turn)[current_x - 1],boards_hp.at(turn + 1)[current_x - 1], boards_hp.at(turn + 2)[current_x - 1]);// dump(turn, __LINE__);current_x--;} else {assert(next_X == current_x + 1);pprint('R');pprint("#", turn + 1, current_x, "R");// dump(turn, __LINE__);current_x++;}// 正面の最初の敵を攻撃するif (++turn == MAXTURN) break;// break;}}// entry pointint main() {solve();return 0;}