結果

問題 No.5006 Hidden Maze
ユーザー iiljjiiljj
提出日時 2022-06-12 15:14:47
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 116 ms / 2,000 ms
コード長 15,800 bytes
コンパイル時間 1,466 ms
実行使用メモリ 22,864 KB
スコア 72,432
平均クエリ数 276.68
最終ジャッジ日時 2022-06-12 15:14:57
合計ジャッジ時間 9,889 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

/* #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>(cout, a); }
void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(Tail) > 0) cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void 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((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), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { 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;
using coord_t = short;
constexpr coord_t H = 20;
constexpr coord_t W = 20;
/* #region dijkstra_f_restore */
constexpr double dinf = double(INF);
using Weight = double;
Weight inf = dinf;
/**
* @param N
* @param delta delta(Node v, fn(Node t)).
* fn current
* @param index index(Node v) -> int
* @return
*/
template <class Node, class Delta, class Index>
pair<Weight, vc<int>> dijkstra_f_restore(int N, const vc<Node> &starts, const Node &terminal, Delta delta, Index index,
Weight init = 0) {
struct state {
Weight cost;
Node dst;
state(Weight cost, Node dst) : cost(cost), dst(dst) {}
bool operator<(const state &o) const { return cost > o.cost; }
// bool operator>(const state &o) const { return cost > o.cost; }
};
vc<int> bs(N, -1); //
vc<Weight> dist(N, inf); //
priority_queue<state> que; //
for (const Node &start : starts) {
int idx = index(start);
assert(0 <= idx && idx < N);
dist[idx] = init; // ( start )
que.emplace(init, start);
}
while (!que.empty()) {
state cur = que.top(); // tie(d, v) = que.top();
que.pop();
Node current = cur.dst;
Weight cur_dist = cur.cost;
int ci = index(current);
//
delta(current, [&](Node dst, Weight weight) -> void {
Weight nxt_dist = cur_dist + weight;
int idx = index(dst);
assert(0 <= idx && idx < N);
if (chmin(dist[idx], nxt_dist)) {
que.emplace(nxt_dist, dst);
bs[idx] = ci;
}
});
}
// dump(dist);
//
vc<int> res;
int dst = index(terminal);
int dst_bak = dst;
// if (bs[dst] < 0) return res;
while (~dst) res.emplace_back(dst), dst = bs[dst];
reverse(ALL(res));
// return res;
return {dist[dst_bak], res};
}
/* #endregion */
// Problem
void solve() {
VAR(int, h, w, p);
// assert(h == H);
// assert(w == W);
assert(6 <= p && p <= 15);
double P = double(p) / 100;
int wall_place_sum = (h * (w - 1)) + ((h - 1) * w);
int wall_cnt = 11; //
// int wall_cnt = 150; //
int ok_cnt = 0; //
vc<vc<int>> ok_horizontal(h, vc<int>(w - 1, 0)); //
vc<vc<int>> ok_vertical(h - 1, vc<int>(w, 0)); //
vc<vc<int>> ng_cnt_horizontal(h, vc<int>(w - 1, 0)); //
vc<vc<int>> ng_cnt_vertical(h - 1, vc<int>(w, 0)); //
using Node = pair<coord_t, coord_t>; // row, col
const static vc<coord_t> dx{1, 0, -1, 0};
Node start = {0, 0};
Node goal = {h - 1, w - 1};
//
auto delta = [&](const Node &current, function<void(Node, double)> transit) -> void {
auto [r, c] = current;
//
for (short q = 0; q < 4; q++) {
coord_t nr = r + dx[q];
coord_t nc = c + dx[q ^ 1];
if (nr < 0 || nr >= h || nc < 0 || nc >= w) continue;
double cost = 0;
if (nr == r) {
//
if (ok_horizontal[r][min(c, nc)] == 1) {
// 0
} else {
if (ng_cnt_horizontal[r][min(c, nc)] == 0) {
cost += double(wall_cnt) / (wall_place_sum - ok_cnt) / 100;
} else {
cost += 1.0 - powl(P, ng_cnt_horizontal[r][min(c, nc)]);
}
}
} else {
//
if (ok_vertical[min(r, nr)][c] == 1) {
// 0
} else {
if (ng_cnt_vertical[min(r, nr)][c] == 0) {
cost += double(wall_cnt) / (wall_place_sum - ok_cnt) / 100;
} else {
cost += 1.0 - powl(P, ng_cnt_vertical[min(r, nr)][c]);
}
}
}
// if (r == 1 && c == 4 && nr == 2) {
// dump(cost);
// }
transit(Node(nr, nc), cost); // 1
}
};
//
auto index = [&](const Node &v) -> int { return v.first * w + v.second; };
TREP(int, trial, 0, 1001) {
// dump(double(wall_cnt) / (wall_place_sum - ok_cnt));
// dump(ng_cnt_vertical);
auto [dist, res] = dijkstra_f_restore(h * w, vc<Node>{start}, goal, delta, index, double(0));
// dump(res);
const int len = ISIZE(res);
string ans;
TREP(int, i, 1, len) {
int r = res[i] / w;
int c = res[i] % w;
int pr = res[i - 1] / w;
int pc = res[i - 1] % w;
if (r == pr) {
if (c > pc)
ans.push_back('R');
else
ans.push_back('L');
} else {
if (r > pr)
ans.push_back('D');
else
ans.push_back('U');
}
}
pprint(ans);
// break;
VAR(int, ok_len);
if (ok_len == -1) break;
// ok_cnt += ok_len;
TREPM(int, i, 1, ok_len) {
int r = res[i] / w;
int c = res[i] % w;
int pr = res[i - 1] / w;
int pc = res[i - 1] % w;
if (r == pr) {
if (ok_horizontal[r][min(c, pc)] == 0) {
ok_horizontal[r][min(c, pc)] = 1;
ok_cnt++;
}
} else {
if (ok_vertical[min(r, pr)][c] == 0) {
ok_vertical[min(r, pr)][c] = 1;
ok_cnt++;
}
}
}
{
int r = res[ok_len + 1] / w;
int c = res[ok_len + 1] % w;
int pr = res[ok_len] / w;
int pc = res[ok_len] % w;
if (r == pr) {
ng_cnt_horizontal[r][min(c, pc)]++;
} else {
ng_cnt_vertical[min(r, pr)][c]++;
}
}
}
}
// entry point
int main() {
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0