結果
| 問題 | No.5019 Hakai Project |
| ユーザー |
 komori3
|
| 提出日時 | 2023-11-18 19:07:52 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 44 ms / 3,000 ms |
| コード長 | 17,052 bytes |
| コンパイル時間 | 3,989 ms |
| コンパイル使用メモリ | 261,952 KB |
| 実行使用メモリ | 6,676 KB |
| スコア | 1,502,618,537 |
| 最終ジャッジ日時 | 2023-11-18 19:08:04 |
| 合計ジャッジ時間 | 10,807 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge13 |
| 純コード判定しない問題か言語 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 9 ms
6,676 KB |
| testcase_01 | AC | 17 ms
6,676 KB |
| testcase_02 | AC | 15 ms
6,676 KB |
| testcase_03 | AC | 15 ms
6,676 KB |
| testcase_04 | AC | 16 ms
6,676 KB |
| testcase_05 | AC | 30 ms
6,676 KB |
| testcase_06 | AC | 17 ms
6,676 KB |
| testcase_07 | AC | 9 ms
6,676 KB |
| testcase_08 | AC | 14 ms
6,676 KB |
| testcase_09 | AC | 15 ms
6,676 KB |
| testcase_10 | AC | 28 ms
6,676 KB |
| testcase_11 | AC | 17 ms
6,676 KB |
| testcase_12 | AC | 15 ms
6,676 KB |
| testcase_13 | AC | 30 ms
6,676 KB |
| testcase_14 | AC | 15 ms
6,676 KB |
| testcase_15 | AC | 23 ms
6,676 KB |
| testcase_16 | AC | 32 ms
6,676 KB |
| testcase_17 | AC | 15 ms
6,676 KB |
| testcase_18 | AC | 12 ms
6,676 KB |
| testcase_19 | AC | 13 ms
6,676 KB |
| testcase_20 | AC | 18 ms
6,676 KB |
| testcase_21 | AC | 11 ms
6,676 KB |
| testcase_22 | AC | 22 ms
6,676 KB |
| testcase_23 | AC | 13 ms
6,676 KB |
| testcase_24 | AC | 12 ms
6,676 KB |
| testcase_25 | AC | 14 ms
6,676 KB |
| testcase_26 | AC | 19 ms
6,676 KB |
| testcase_27 | AC | 10 ms
6,676 KB |
| testcase_28 | AC | 41 ms
6,676 KB |
| testcase_29 | AC | 28 ms
6,676 KB |
| testcase_30 | AC | 16 ms
6,676 KB |
| testcase_31 | AC | 19 ms
6,676 KB |
| testcase_32 | AC | 12 ms
6,676 KB |
| testcase_33 | AC | 14 ms
6,676 KB |
| testcase_34 | AC | 10 ms
6,676 KB |
| testcase_35 | AC | 10 ms
6,676 KB |
| testcase_36 | AC | 17 ms
6,676 KB |
| testcase_37 | AC | 25 ms
6,676 KB |
| testcase_38 | AC | 17 ms
6,676 KB |
| testcase_39 | AC | 22 ms
6,676 KB |
| testcase_40 | AC | 13 ms
6,676 KB |
| testcase_41 | AC | 10 ms
6,676 KB |
| testcase_42 | AC | 19 ms
6,676 KB |
| testcase_43 | AC | 17 ms
6,676 KB |
| testcase_44 | AC | 12 ms
6,676 KB |
| testcase_45 | AC | 11 ms
6,676 KB |
| testcase_46 | AC | 9 ms
6,676 KB |
| testcase_47 | AC | 22 ms
6,676 KB |
| testcase_48 | AC | 44 ms
6,676 KB |
| testcase_49 | AC | 17 ms
6,676 KB |
ソースコード
#define _CRT_NONSTDC_NO_WARNINGS
#define _SILENCE_CXX17_ITERATOR_BASE_CLASS_DEPRECATION_WARNING
#include <bits/stdc++.h>
#include <random>
#include <unordered_set>
#include <array>
#include <optional>
#ifdef _MSC_VER
#include <opencv2/core.hpp>
#include <opencv2/core/utils/logger.hpp>
#include <opencv2/imgproc.hpp>
#include <opencv2/highgui.hpp>
#include <conio.h>
#include <ppl.h>
#include <omp.h>
#include <filesystem>
#include <intrin.h>
/* g++ functions */
int __builtin_clz(unsigned int n) { unsigned long index; _BitScanReverse(&index, n); return 31 - index; }
int __builtin_ctz(unsigned int n) { unsigned long index; _BitScanForward(&index, n); return index; }
namespace std { inline int __lg(int __n) { return sizeof(int) * 8 - 1 - __builtin_clz(__n); } }
/* enable __uint128_t in MSVC */
//#include <boost/multiprecision/cpp_int.hpp>
//using __uint128_t = boost::multiprecision::uint128_t;
#else
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
/** compro io **/
namespace aux {
template<typename T, unsigned N, unsigned L> struct tp { static void output(std::ostream& os, const T& v) { os << std::get<N>(v) << ", "; tp<T, N + 1, L>::output(os, v); } };
template<typename T, unsigned N> struct tp<T, N, N> { static void output(std::ostream& os, const T& v) { os << std::get<N>(v); } };
}
template<typename... Ts> std::ostream& operator<<(std::ostream& os, const std::tuple<Ts...>& t) { os << '{'; aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t); return os << '}'; } // tuple out
template<class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& os, const Container& x); // container out (fwd decl)
template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) { return os << '{' << p.first << ", " << p.second << '}'; } // pair out
template<class S, class T> std::istream& operator>>(std::istream& is, std::pair<S, T>& p) { return is >> p.first >> p.second; } // pair in
std::ostream& operator<<(std::ostream& os, const std::vector<bool>::reference& v) { os << (v ? '1' : '0'); return os; } // bool (vector) out
std::ostream& operator<<(std::ostream& os, const std::vector<bool>& v) { bool f = true; os << '{'; for (const auto& x : v) { os << (f ? "" : ", ") << x; f = false; } os << '}'; return os; } // vector<bool> out
template<class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& os, const Container& x) { bool f = true; os << '{'; for (auto& y : x) { os << (f ? "" : ", ") << y; f = false; } return os << '}'; } // container out
template<class T, class = decltype(std::begin(std::declval<T&>())), class = typename std::enable_if<!std::is_same<T, std::string>::value>::type> std::istream& operator>>(std::istream& is, T& a) { for (auto& x : a) is >> x; return is; } // container in
template<typename T> auto operator<<(std::ostream& out, const T& t) -> decltype(out << t.stringify()) { out << t.stringify(); return out; } // struct (has stringify() func) out
/** io setup **/
struct IOSetup { IOSetup(bool f) { if (f) { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); } std::cout << std::fixed << std::setprecision(15); } }
iosetup(true); // set false when solving interective problems
/** string formatter **/
template<typename... Ts> std::string format(const std::string& f, Ts... t) { size_t l = std::snprintf(nullptr, 0, f.c_str(), t...); std::vector<char> b(l + 1); std::snprintf(&b[0], l + 1, f.c_str(), t...); return std::string(&b[0], &b[0] + l); }
/** dump **/
#define DUMPOUT std::cerr
std::ostringstream DUMPBUF;
#define dump(...) do{DUMPBUF<<" ";DUMPBUF<<#__VA_ARGS__<<" :[DUMP - "<<__LINE__<<":"<<__FUNCTION__<<']'<<std::endl;DUMPBUF<<" ";dump_func(__VA_ARGS__);DUMPOUT<<DUMPBUF.str();DUMPBUF.str("");DUMPBUF.clear();}while(0);
void dump_func() { DUMPBUF << std::endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPBUF << head; if (sizeof...(Tail) == 0) { DUMPBUF << " "; } else { DUMPBUF << ", "; } dump_func(std::move(tail)...); }
/** timer **/
class Timer {
double t = 0, paused = 0, tmp;
public:
Timer() { reset(); }
static double time() {
#ifdef _MSC_VER
return __rdtsc() / 2.9e9;
#else
unsigned long long a, d;
__asm__ volatile("rdtsc"
: "=a"(a), "=d"(d));
return (d << 32 | a) / 2.9e9;
#endif
}
void reset() { t = time(); }
void pause() { tmp = time(); }
void restart() { paused += time() - tmp; }
double elapsed_ms() const { return (time() - t - paused) * 1000.0; }
};
/** rand **/
struct Xorshift {
static constexpr uint64_t M = INT_MAX;
static constexpr double e = 1.0 / M;
uint64_t x = 88172645463325252LL;
Xorshift() {}
Xorshift(uint64_t seed) { reseed(seed); }
inline void reseed(uint64_t seed) { x = 0x498b3bc5 ^ seed; for (int i = 0; i < 20; i++) next(); }
inline uint64_t next() { x = x ^ (x << 7); return x = x ^ (x >> 9); }
inline int next_int() { return next() & M; }
inline int next_int(int mod) { return next() % mod; }
inline int next_int(int l, int r) { return l + next_int(r - l + 1); }
inline double next_double() { return next_int() * e; }
};
/** shuffle **/
template<typename T> void shuffle_vector(std::vector<T>& v, Xorshift& rnd) { int n = v.size(); for (int i = n - 1; i >= 1; i--) { int r = rnd.next_int(i); std::swap(v[i], v[r]); } }
/** split **/
std::vector<std::string> split(const std::string& str, const std::string& delim) {
std::vector<std::string> res;
std::string buf;
for (const auto& c : str) {
if (delim.find(c) != std::string::npos) {
if (!buf.empty()) res.push_back(buf);
buf.clear();
}
else buf += c;
}
if (!buf.empty()) res.push_back(buf);
return res;
}
/** misc **/
template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T& val) { std::fill((T*)array, (T*)(array + N), val); } // fill array
template<typename T, typename ...Args> auto make_vector(T x, int arg, Args ...args) { if constexpr (sizeof...(args) == 0)return std::vector<T>(arg, x); else return std::vector(arg, make_vector<T>(x, args...)); }
template<typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
/* fast queue */
class FastQueue {
int front = 0;
int back = 0;
int v[4096];
public:
inline bool empty() { return front == back; }
inline void push(int x) { v[front++] = x; }
inline int pop() { return v[back++]; }
inline void reset() { front = back = 0; }
inline int size() { return front - back; }
};
class RandomQueue {
int sz = 0;
int v[4096];
public:
inline bool empty() const { return !sz; }
inline int size() const { return sz; }
inline void push(int x) { v[sz++] = x; }
inline void reset() { sz = 0; }
inline int pop(int i) {
std::swap(v[i], v[sz - 1]);
return v[--sz];
}
inline int pop(Xorshift& rnd) {
return pop(rnd.next_int(sz));
}
};
#if 1
inline double get_temp(double stemp, double etemp, double t, double T) {
return etemp + (stemp - etemp) * (T - t) / T;
};
#else
inline double get_temp(double stemp, double etemp, double t, double T) {
return stemp * pow(etemp / stemp, t / T);
};
#endif
constexpr int N = 50;
constexpr int M = 20;
constexpr int dy[] = { 0, -1, 0, 1 };
constexpr int dx[] = { 1, 0, -1, 0 };
constexpr char d2c[] = "RULD";
int c2d[256];
namespace NInitializer {
struct Initializer {
Initializer() {
c2d['R'] = 0;
c2d['U'] = 1;
c2d['L'] = 2;
c2d['D'] = 3;
}
} initialize_instance;
}
struct Pos {
int y, x;
Pos(int y_ = 0, int x_ = 0) : y(y_), x(x_) {}
inline int distance(const Pos& rhs) const {
return abs(y - rhs.y) + abs(x - rhs.x);
}
inline int distance(int ry, int rx) const {
return abs(y - ry) + abs(x - rx);
}
};
std::istream& operator>>(std::istream& in, Pos& p) {
in >> p.y >> p.x;
return in;
}
struct Bomb {
int cost;
std::vector<Pos> displacements;
inline size_t size() const { return displacements.size(); }
};
std::istream& operator>>(std::istream& in, Bomb& b) {
int L;
in >> b.cost >> L;
b.displacements.resize(L);
in >> b.displacements;
return in;
}
struct Input {
std::array<std::array<char, N>, N> grid;
std::array<Bomb, M> bombs;
Input(std::istream& in) {
{ int buf; in >> buf >> buf; } // ignore N, M
in >> grid >> bombs;
}
};
struct State {
std::array<std::array<char, N>, N> grid;
std::array<Bomb, M> bombs;
std::array<std::array<int, N>, N> shop_grid;
std::vector<Pos> shops;
std::vector<bool> shop_bombed;
int64_t cost;
Pos pos;
int num_total_bombs;
std::vector<int> num_bombs;
std::vector<std::pair<int, int>> commands;
int remaining;
State() {}
State(const Input& input) : grid(input.grid), bombs(input.bombs) {
remaining = 0;
{
int id = 0;
for (auto& v : shop_grid) {
std::fill(v.begin(), v.end(), -1);
}
for (int y = 0; y < N; y++) {
for (int x = 0; x < N; x++) {
if (grid[y][x] != '.') {
remaining++;
}
if (grid[y][x] == '@') {
shop_grid[y][x] = id;
shops.emplace_back(y, x);
shop_bombed.push_back(false);
id++;
}
}
}
}
cost = 0;
pos = { 0, 0 };
num_total_bombs = 0;
num_bombs.resize(M);
}
inline bool is_inside(int y, int x) const {
return 0 <= y && y < N && 0 <= x && x < N;
}
inline bool is_inside(const Pos& p) const {
return is_inside(p.y, p.x);
}
void move(int dir) {
pos.y += dy[dir];
pos.x += dx[dir];
assert(is_inside(pos));
cost += int64_t(num_total_bombs + 1) * (num_total_bombs + 1) * (grid[pos.y][pos.x] == '.' ? 1 : 2);
commands.emplace_back(1, dir);
}
void move(char cdir) {
move(c2d[cdir]);
}
void move_simple(int y, int x) {
while (pos.x < x) move('R');
while (pos.x > x) move('L');
while (pos.y < y) move('D');
while (pos.y > y) move('U');
}
void move_simple(const Pos& target) {
move_simple(target.y, target.x);
}
void move_shop(int shop_id) {
assert(!shop_bombed[shop_id]);
move_simple(shops[shop_id]);
}
void purchase(int bomb_id) {
assert(grid[pos.y][pos.x] == '@');
cost += bombs[bomb_id].cost;
num_bombs[bomb_id]++;
num_total_bombs++;
commands.emplace_back(2, bomb_id);
}
void use(int bomb_id) {
assert(num_bombs[bomb_id]);
num_bombs[bomb_id]--;
num_total_bombs--;
for (const auto& [dy, dx] : bombs[bomb_id].displacements) {
int ny = pos.y + dy, nx = pos.x + dx;
if (!is_inside(ny, nx)) continue;
if (grid[ny][nx] == '@') {
int shop_id = shop_grid[ny][nx];
shop_bombed[shop_id] = true;
}
if (grid[ny][nx] != '.') {
remaining--;
grid[ny][nx] = '.';
}
}
commands.emplace_back(3, bomb_id);
}
void output(std::ostream& out) const {
out << commands.size() << '\n';
for (const auto& [t, x] : commands) {
out << t << ' ';
if (t == 1) out << d2c[x];
else out << x + 1;
out << '\n';
}
}
void solve_naive() {
move_shop(0);
for (int i = 0; i < 2500; i++) purchase(0);
for (int y = 0; y < N; y++) {
if (y & 1) {
for (int x = N - 1; x >= 0; x--) {
move_simple({ y, x });
use(0);
if (!remaining) return;
}
}
else {
for (int x = 0; x < N; x++) {
move_simple({ y, x });
use(0);
if (!remaining) return;
}
}
}
}
int nearest_shop(const Pos& p) const {
int nearest = -1, min_dist = INT_MAX;
for (int s = 0; s < (int)shops.size(); s++) {
if (chmin(min_dist, p.distance(shops[s]))) {
nearest = s;
}
}
return nearest;
}
void solve() {
// shop s で爆弾 b を購入し、位置 p で起動して shop s に戻るのに必要なコスト
// 爆弾コスト C_b
// manhattan_dist(s,p)=d として、d*4+d (行きと帰り 実際は'#'の数だけコスト増)
auto cost_map = make_vector(0, N, N, M);
for (int y = 0; y < N; y++) {
for (int x = 0; x < N; x++) {
int s = nearest_shop({ y, x });
int d = shops[s].distance(y, x);
for (int b = 0; b < M; b++) {
cost_map[y][x][b] = bombs[b].cost + d * 5;
}
}
}
auto can_bomb = make_vector(true, N, N, M);
for (int b = 0; b < M; b++) {
for (auto [dy, dx] : bombs[b].displacements) {
for (auto [sy, sx] : shops) {
int y = sy - dy, x = sx - dx;
if (!is_inside(y, x)) continue;
can_bomb[y][x][b] = false;
}
}
}
auto overlap = make_vector(0, N, N);
std::vector<std::tuple<int, int, int>> used;
for (int y = 0; y < N; y++) {
for (int x = 0; x < N; x++) {
for (int b = 0; b < M; b++) {
if (!can_bomb[y][x][b]) continue;
for (auto [dy, dx] : bombs[b].displacements) {
if (!is_inside(y + dy, x + dx)) continue;
overlap[y + dy][x + dx]++;
}
used.emplace_back(y, x, b);
}
}
}
Xorshift rnd;
shuffle_vector(used, rnd);
{
std::vector<std::tuple<int, int, int>> nused;
for (auto [y, x, b] : used) {
bool ok = true;
for (auto [dy, dx] : bombs[b].displacements) {
int ny = y + dy, nx = x + dx;
if (!is_inside(ny, nx)) continue;
int lo = grid[ny][nx] != '.';
if (overlap[ny][nx] <= lo) {
ok = false;
break;
}
}
if (!ok) {
nused.emplace_back(y, x, b);
}
else {
for (auto [dy, dx] : bombs[b].displacements) {
if (!is_inside(y + dy, x + dx)) continue;
overlap[y + dy][x + dx]--;
}
}
}
used = nused;
}
dump(used.size());
for (auto [y, x, b] : used) {
// 現在地 -> shop -> (y, x)
int min_dist = INT_MAX, sid = -1;
for (int s = 0; s < (int)shops.size(); s++) {
if (chmin(min_dist, shops[s].distance(pos) + shops[s].distance(y, x) * 4)) {
sid = s;
}
}
move_simple(shops[sid]);
purchase(b);
move_simple(y, x);
use(b);
}
{
int cheapest = -1, min_cost = INT_MAX;
for (int b = 0; b < M; b++) {
if (chmin(min_cost, bombs[b].cost)) {
cheapest = b;
}
}
for (auto [y, x] : shops) {
if (grid[y][x] != '@') continue;
move_simple(y, x);
purchase(cheapest);
use(cheapest);
}
}
dump(remaining, cost);
}
};
int main([[maybe_unused]] int argc, [[maybe_unused]] char** argv) {
//batch_execution();
//exit(1);
Timer timer;
#ifdef HAVE_OPENCV_HIGHGUI
cv::utils::logging::setLogLevel(cv::utils::logging::LogLevel::LOG_LEVEL_SILENT);
#endif
#if 0
std::ifstream ifs("../../Hakai-Project/visualizer/in.txt");
std::istream& in = ifs;
std::ofstream ofs("../../Hakai-Project/visualizer/out.txt");
std::ostream& out = ofs;
#else
std::istream& in = std::cin;
std::ostream& out = std::cout;
#endif
Input input(in);
State state(input);
state.solve();
dump(state.cost);
dump(state.commands.size());
state.output(out);
return 0;
}