結果

問題 No.5006 Hidden Maze
ユーザー mtsdmtsd
提出日時 2022-06-12 17:53:50
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 11,035 bytes
コンパイル時間 2,041 ms
実行使用メモリ 22,876 KB
スコア 74,765
平均クエリ数 253.35
最終ジャッジ日時 2022-06-12 17:54:01
合計ジャッジ時間 9,341 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
21,916 KB
testcase_01 AC 21 ms
21,980 KB
testcase_02 AC 21 ms
21,952 KB
testcase_03 AC 19 ms
22,264 KB
testcase_04 AC 22 ms
21,904 KB
testcase_05 AC 30 ms
21,892 KB
testcase_06 AC 24 ms
21,980 KB
testcase_07 AC 27 ms
22,876 KB
testcase_08 AC 25 ms
22,624 KB
testcase_09 AC 53 ms
21,940 KB
testcase_10 AC 20 ms
21,880 KB
testcase_11 AC 20 ms
22,588 KB
testcase_12 AC 21 ms
21,940 KB
testcase_13 AC 22 ms
22,048 KB
testcase_14 AC 19 ms
21,736 KB
testcase_15 AC 22 ms
22,564 KB
testcase_16 AC 19 ms
22,704 KB
testcase_17 AC 30 ms
21,904 KB
testcase_18 AC 25 ms
21,792 KB
testcase_19 AC 21 ms
21,964 KB
testcase_20 AC 18 ms
21,904 KB
testcase_21 AC 20 ms
22,276 KB
testcase_22 AC 17 ms
22,276 KB
testcase_23 AC 21 ms
21,952 KB
testcase_24 AC 29 ms
21,756 KB
testcase_25 AC 26 ms
21,780 KB
testcase_26 AC 54 ms
21,780 KB
testcase_27 AC 49 ms
21,892 KB
testcase_28 AC 23 ms
22,564 KB
testcase_29 AC 49 ms
21,928 KB
testcase_30 AC 19 ms
21,892 KB
testcase_31 AC 20 ms
22,620 KB
testcase_32 AC 23 ms
21,892 KB
testcase_33 AC 24 ms
22,216 KB
testcase_34 AC 19 ms
22,264 KB
testcase_35 AC 26 ms
21,904 KB
testcase_36 AC 31 ms
21,892 KB
testcase_37 AC 41 ms
21,952 KB
testcase_38 AC 29 ms
21,892 KB
testcase_39 AC 27 ms
21,792 KB
testcase_40 AC 19 ms
22,716 KB
testcase_41 AC 22 ms
21,780 KB
testcase_42 AC 19 ms
21,792 KB
testcase_43 AC 25 ms
22,596 KB
testcase_44 AC 21 ms
21,928 KB
testcase_45 AC 24 ms
22,612 KB
testcase_46 AC 52 ms
21,916 KB
testcase_47 AC 27 ms
21,892 KB
testcase_48 AC 51 ms
22,216 KB
testcase_49 AC 52 ms
21,952 KB
testcase_50 AC 20 ms
21,892 KB
testcase_51 AC 20 ms
21,792 KB
testcase_52 AC 22 ms
22,632 KB
testcase_53 AC 26 ms
22,624 KB
testcase_54 AC 27 ms
22,016 KB
testcase_55 AC 25 ms
22,600 KB
testcase_56 AC 29 ms
21,952 KB
testcase_57 AC 27 ms
21,940 KB
testcase_58 AC 27 ms
22,264 KB
testcase_59 AC 19 ms
22,588 KB
testcase_60 AC 21 ms
22,596 KB
testcase_61 AC 22 ms
21,908 KB
testcase_62 AC 22 ms
22,264 KB
testcase_63 AC 20 ms
21,952 KB
testcase_64 AC 24 ms
21,940 KB
testcase_65 AC 24 ms
22,432 KB
testcase_66 AC 24 ms
22,228 KB
testcase_67 AC 27 ms
21,768 KB
testcase_68 AC 37 ms
22,228 KB
testcase_69 AC 41 ms
21,916 KB
testcase_70 AC 21 ms
22,624 KB
testcase_71 AC 20 ms
21,940 KB
testcase_72 AC 20 ms
21,940 KB
testcase_73 AC 30 ms
21,928 KB
testcase_74 AC 24 ms
22,252 KB
testcase_75 AC 50 ms
21,992 KB
testcase_76 AC 28 ms
21,892 KB
testcase_77 AC 38 ms
21,952 KB
testcase_78 AC 29 ms
21,780 KB
testcase_79 AC 51 ms
21,792 KB
testcase_80 AC 20 ms
21,916 KB
testcase_81 AC 21 ms
22,228 KB
testcase_82 AC 21 ms
22,588 KB
testcase_83 AC 19 ms
21,952 KB
testcase_84 AC 24 ms
21,916 KB
testcase_85 AC 26 ms
21,780 KB
testcase_86 AC 20 ms
21,768 KB
testcase_87 AC 24 ms
21,892 KB
testcase_88 AC 30 ms
22,216 KB
testcase_89 AC 46 ms
21,892 KB
testcase_90 AC 20 ms
21,768 KB
testcase_91 AC 22 ms
21,940 KB
testcase_92 AC 21 ms
21,780 KB
testcase_93 AC 23 ms
22,228 KB
testcase_94 AC 40 ms
21,892 KB
testcase_95 AC 20 ms
21,780 KB
testcase_96 AC 22 ms
21,940 KB
testcase_97 AC 51 ms
21,952 KB
testcase_98 AC 28 ms
22,016 KB
testcase_99 AC 27 ms
21,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
    os << "{";
    for (int i = 0; i<(int)vec.size(); i++) {
        os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "{";
    for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if(itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
    os << "{";
    for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
        os << (*itr);
        ++itr;
        if(itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// tuple 出力
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
    if(N)os<<", ";
    os<<get<N>(t);
    out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
    os<<"(";
    out<0,tuple<Ts...>,Ts...>(os,t);
    os<<")";
    return os;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                                                                                                  \
    vector<type> name(size);                                                                                                                                   \
    IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                                                                                                   \
    vector<vector<type>> name(h, vector<type>(w));                                                                                                             \
    IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)                                                                                                                         \
    vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define INT(...)                                                                                                                                               \
    int __VA_ARGS__;                                                                                                                                           \
    IN(__VA_ARGS__)
#define LL(...)                                                                                                                                                \
    ll __VA_ARGS__;                                                                                                                                            \
    IN(__VA_ARGS__)
#define STR(...)                                                                                                                                               \
    string __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
#define CHR(...)                                                                                                                                               \
    char __VA_ARGS__;                                                                                                                                          \
    IN(__VA_ARGS__)
#define DBL(...)                                                                                                                                               \
    double __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
    for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
    scan(head);
    IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define dbg(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, typename T>
std::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
    array = val;
}
template<typename A, typename T>
std::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
    for (auto& a : array) {
        fill(a, val);
    }
}
template <typename T, typename S> T ceil(T x, S y) {
    assert(y);
    return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));
}
template <typename T, typename S> T floor(T x, S y) {
    assert(y);
    return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));
}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }


template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto e : a) v.emplace_back(e);
    fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto &&e : a) e = lb(v, e);
    renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
    vector<S> v;
    fold_in(v, head, args...);
    sort(all(v)), v.erase(unique(all(v)), v.end());
    renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
bool flag_tate[20][20];
bool flag_yoko[20][20];
double tate[20][20];
double yoko[20][20];
char ch[]={'D','R'};
int dx[] = {1,0};
int dy[] = {0,1};
int main(){
    INT(n,m,P);
    double p = (double)P/100.0;
    int edges = (n-1)*n*2;
    fill(tate,1.0-200.0/edges);
    fill(yoko,1.0-200.0/edges);
    int cnt = 0;
    const double eps = 1e-6;
    while(1){
        cnt++;
        vv(double,dp,n,n);
        vv(char,pre,n,n,'.');
        dp[0][0] = 1.0;
        rep(i,n){
            rep(j,n-1){
                if(abs(dp[i][j+1]-dp[i][j]*yoko[i][j]) <= eps){
                    if(i<=j+1){
                        pre[i][j+1] = 'R';
                    }
                }else if(chmax(dp[i][j+1],dp[i][j] * yoko[i][j])){
                    pre[i][j+1] = 'R';
                }
            }
            if(i!=n-1){
                rep(j,n){
                    if(chmax(dp[i+1][j],dp[i][j]*tate[i][j])){
                        pre[i+1][j] = 'D';
                    }
                }
            }
        }
        int x = n-1,y=n-1;
        string res;
        while(x!=0||y!=0){
            if(pre[x][y]=='.'){
                if(x>y){
                    x--;
                    res.push_back('D');
                }else{
                    y--;
                    res.push_back('R');
                }
                continue;
            }
            res.push_back(pre[x][y]);
            if(pre[x][y]=='D'){
                x--;
            }else{
                y--;
            }
        }
        reverse(all(res));
        cout << res << endl;
        INT(K);
        if(K==-1)return 0;
        rep(i,K){
            if(res[i]=='D'){
                tate[x][y] = 1.0;
                flag_tate[x][y] = true;
                x++;
            }else{
                yoko[x][y] = 1.0;
                flag_yoko[x][y] = true;
                y++;
            }
        }
        if(res[K]=='D'){
            if(flag_tate[x][y])continue;
            tate[x][y] = tate[x][y]*p/(tate[x][y]*p+(1.0-tate[x][y]));
        }else{
            if(flag_yoko[x][y])continue;
            yoko[x][y] = yoko[x][y]*p/(yoko[x][y]*p+(1.0-yoko[x][y]));
        }
    }
    if(cnt>=1000)assert(0);
    return 0;
}
0