結果
| 問題 | No.5006 Hidden Maze |
| ユーザー |
 komori3
|
| 提出日時 | 2022-06-12 17:46:12 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 11,291 bytes |
| コンパイル時間 | 4,149 ms |
| 実行使用メモリ | 22,888 KB |
| スコア | 0 |
| 平均クエリ数 | 1.00 |
| 最終ジャッジ日時 | 2022-06-12 17:46:55 |
| 合計ジャッジ時間 | 41,332 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
| testcase_39 | RE | - |
| testcase_40 | RE | - |
| testcase_41 | RE | - |
| testcase_42 | RE | - |
| testcase_43 | RE | - |
| testcase_44 | RE | - |
| testcase_45 | RE | - |
| testcase_46 | RE | - |
| testcase_47 | RE | - |
| testcase_48 | RE | - |
| testcase_49 | RE | - |
| testcase_50 | RE | - |
| testcase_51 | RE | - |
| testcase_52 | RE | - |
| testcase_53 | RE | - |
| testcase_54 | RE | - |
| testcase_55 | RE | - |
| testcase_56 | RE | - |
| testcase_57 | RE | - |
| testcase_58 | RE | - |
| testcase_59 | RE | - |
| testcase_60 | RE | - |
| testcase_61 | RE | - |
| testcase_62 | RE | - |
| testcase_63 | RE | - |
| testcase_64 | RE | - |
| testcase_65 | RE | - |
| testcase_66 | RE | - |
| testcase_67 | RE | - |
| testcase_68 | RE | - |
| testcase_69 | RE | - |
| testcase_70 | RE | - |
| testcase_71 | RE | - |
| testcase_72 | RE | - |
| testcase_73 | RE | - |
| testcase_74 | RE | - |
| testcase_75 | RE | - |
| testcase_76 | RE | - |
| testcase_77 | RE | - |
| testcase_78 | RE | - |
| testcase_79 | RE | - |
| testcase_80 | RE | - |
| testcase_81 | RE | - |
| testcase_82 | RE | - |
| testcase_83 | RE | - |
| testcase_84 | RE | - |
| testcase_85 | RE | - |
| testcase_86 | RE | - |
| testcase_87 | RE | - |
| testcase_88 | RE | - |
| testcase_89 | RE | - |
| testcase_90 | RE | - |
| testcase_91 | RE | - |
| testcase_92 | RE | - |
| testcase_93 | RE | - |
| testcase_94 | RE | - |
| testcase_95 | RE | - |
| testcase_96 | RE | - |
| testcase_97 | RE | - |
| testcase_98 | RE | - |
| testcase_99 | RE | - |
コンパイルメッセージ
main.cpp: ラムダ関数内:
main.cpp:271:5: 警告: 制御が非 void 関数の終りに到達しました [-Wreturn-type]
271 | };
| ^
ソースコード
#define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <random>
#include <unordered_set>
#include <atcoder/all>
//#include <boost/rational.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/multiprecision/cpp_bin_float.hpp>
#ifdef _MSC_VER
#include <conio.h>
#include <ppl.h>
#include <filesystem>
#include <opencv2/core.hpp>
#include <opencv2/highgui.hpp>
#include <opencv2/imgproc.hpp>
#include <intrin.h>
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); }
}
#else
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
/** compro_io **/
/* tuple */
// out
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 << ']';
}
template<class Ch, class Tr, class Container>
std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& os, const Container& x);
/* pair */
// out
template<class S, class T>
std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) {
return os << "[" << p.first << ", " << p.second << "]";
}
// in
template<class S, class T>
std::istream& operator>>(std::istream& is, std::pair<S, T>& p) {
return is >> p.first >> p.second;
}
/* container */
// 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 << "]";
}
// in
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;
}
std::ostream& operator<<(std::ostream& os, const std::vector<bool>& v) {
std::string s(v.size(), ' ');
for (int i = 0; i < v.size(); i++) s[i] = v[i] + '0';
os << s;
return os;
}
std::ostream& operator<<(std::ostream& os, const std::vector<std::vector<bool>>& m) {
for (const auto& v : m) os << v << '\n';
return os;
}
/* struct */
template<typename T>
auto operator<<(std::ostream& out, const T& t) -> decltype(out << t.stringify()) {
out << t.stringify();
return out;
}
/* 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);
/** 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);
}
template<typename T>
std::string stringify(const T& x) {
std::ostringstream oss;
oss << x;
return oss.str();
}
/* 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() / 3.0e9;
#else
unsigned long long a, d;
__asm__ volatile("rdtsc"
: "=a"(a), "=d"(d));
return (d << 32 | a) / 3.0e9;
#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 {
uint64_t x = 88172645463325252LL;
void set_seed(unsigned seed, int rep = 100) { x = uint64_t((seed + 1) * 10007); for (int i = 0; i < rep; i++) next_int(); }
unsigned next_int() { x = x ^ (x << 7); return x = x ^ (x >> 9); }
unsigned next_int(unsigned mod) { x = x ^ (x << 7); x = x ^ (x >> 9); return x % mod; }
unsigned next_int(unsigned l, unsigned r) { x = x ^ (x << 7); x = x ^ (x >> 9); return x % (r - l + 1) + l; } // inclusive
double next_double() { return double(next_int()) / UINT_MAX; }
} rnd;
/* 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(std::string str, const std::string& delim) {
for (char& c : str) if (delim.find(c) != std::string::npos) c = ' ';
std::istringstream iss(str);
std::vector<std::string> parsed;
std::string buf;
while (iss >> buf) parsed.push_back(buf);
return parsed;
}
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);
}
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; }
using ll = long long;
using ull = unsigned long long;
using ld = double;
//using ld = boost::multiprecision::cpp_bin_float_quad;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using namespace std;
template<typename T>
void print_vector(const vector<T>& v) {
for (int i = 0; i < v.size(); i++) {
cout << (i ? " " : "") << v[i];
}
cout << '\n';
}
constexpr int di[] = { 0, -1, 0, 1 };
constexpr int dj[] = { -1, 0, 1, 0 };
const string d2c = "LURD";
char c2d[256];
constexpr int N = 20, T = 1000;
constexpr int min_wall = 100, max_wall = 200;
constexpr double init_wall_prob = (min_wall + max_wall) * 0.5 / (N * (N - 1) * 2);
constexpr double init_weight = 1.0, update_weight = 1.0;
constexpr int si = 0, sj = 0, ti = N - 1, tj = N - 1;
constexpr double inf = 1e9;
double success_prob;
int main() {
{
int buf;
cin >> buf >> buf >> buf;
success_prob = (100.0 - buf) / 100.0;
c2d['L'] = 0; c2d['U'] = 1; c2d['R'] = 2; c2d['D'] = 3;
}
double hprob[N][N - 1]; // 壁っぽさ
double hweight[N][N - 1]; // 重み(事前情報的な)
bool hfixed[N][N - 1]; // true なら壁はない
double vprob[N - 1][N];
double vweight[N - 1][N];
bool vfixed[N - 1][N];
//bool seen[N][N] = {}; // 到達したかどうか
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
hprob[i][j] = vprob[j][i] = init_wall_prob;
hweight[i][j] = vweight[j][i] = init_weight;
hfixed[i][j] = vfixed[j][i] = false;
}
}
auto get_cost = [&](int i, int j, int d) {
if (d == 0) return hprob[i][j - 1];
if (d == 1) return vprob[i - 1][j];
if (d == 2) return hprob[i][j];
if (d == 3) return vprob[i][j];
};
// (ti,tj) まで最も壁っぽくなさそうなルートで移動する
auto guess = [&]() {
double dist[N][N];
int prev[N][N];
using Edge = tuple<double, int, int>;
priority_queue<Edge, vector<Edge>, greater<Edge>> pq;
dist[si][sj] = 0;
prev[si][sj] = -1;
pq.emplace(dist[si][sj], si, sj);
while (!pq.empty()) {
auto [mincost, i, j] = pq.top(); pq.pop();
if (dist[i][j] < mincost) continue;
for (int d = 0; d < 4; d++) {
int ni = i + di[d], nj = j + dj[d];
if (ni < 0 || ni >= N || nj < 0 || nj >= N) continue;
double cost = dist[i][j] + get_cost(i, j, d);
if (chmin(dist[ni][nj], cost)) {
dist[ni][nj] = cost;
prev[ni][nj] = d;
pq.emplace(cost, ni, nj);
}
}
}
string path;
{
int i = ti, j = tj, d = prev[i][j];
while (d != -1) {
path += d2c[d];
i -= di[d];
j -= dj[d];
d = prev[i][j];
}
reverse(path.begin(), path.end());
}
return path;
};
auto update = [&](const string& g, const int length) {
assert(length < g.size()); // equal なら終了しているはず
int i = 0, j = 0;
for (int k = 0; k < length; k++) {
int d = c2d[g[k]], ni = i + di[d], nj = j + dj[d];
// (i,j)-(ni,nj) に壁はない
if (d == 0) hfixed[i][j - 1] = true;
if (d == 1) vfixed[i - 1][j] = true;
if (d == 2) hfixed[i][j] = true;
if (d == 3) vfixed[i][j] = true;
i = ni; j = nj;
}
{
int d = c2d[g[length]], ni = i + di[d], nj = j + dj[d];
// (i,j)-(ni,nj) は壁の可能性がある
if (d == 0) {
hprob[i][j - 1] = (hprob[i][j - 1] * hweight[i][j - 1] + update_weight) / (hweight[i][j - 1] + update_weight);
hweight[i][j - 1] += update_weight;
}
if (d == 1) {
vprob[i - 1][j] = (vprob[i - 1][j] * vweight[i - 1][j] + update_weight) / (vweight[i - 1][j] + update_weight);
vweight[i - 1][j] += update_weight;
}
if (d == 2) {
hprob[i][j] = (hprob[i][j] * hweight[i][j] + update_weight) / (hweight[i][j] + update_weight);
hweight[i][j] += update_weight;
}
if (d == 3) {
vprob[i][j] = (vprob[i][j] * vweight[i][j] + update_weight) / (vweight[i][j] + update_weight);
vweight[i][j] += update_weight;
}
}
};
for (int turn = 0; turn <= T; turn++) {
auto g = guess();
cout << g << endl; // predict
int length;
cin >> length; // result
if (length == -1) break;
update(g, length); // update
}
return 0;
}