結果

問題 No.5006 Hidden Maze
ユーザー wanui
提出日時 2022-06-12 16:41:28
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 50 ms / 2,000 ms
コード長 3,297 bytes
コンパイル時間 2,062 ms
実行使用メモリ 22,856 KB
スコア 0
平均クエリ数 1000.00
最終ジャッジ日時 2022-06-12 16:41:39
合計ジャッジ時間 11,180 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
void perr0(){}; template<typename H,typename... T> void perr0(H h,T... t){cerr<<h;perr0(t...);}
void perr(){perr0("\n");}; template<typename H,typename... T>void perr(H h,T... t){perr0(h);if(sizeof...(T)>0)perr0(" ");perr(t...);}
void ioinit() { cout<<fixed<<setprecision(15); cerr<<fixed<<setprecision(6); ios_base::sync_with_stdio(0); cin.tie(0); }
// clang-format on
using pii = pair<int, int>;
using tii = tuple<int, int, int>;

struct point {
    int i;
    int j;
};
bool operator==(const point &lhs, const point &rhs) { return (lhs.i == rhs.i && lhs.j == rhs.j); }
bool operator!=(const point &lhs, const point &rhs) { return !(lhs == rhs); }
bool operator<(const point &lhs, const point &rhs) {
    if (lhs.i != rhs.i) {
        return lhs.i < rhs.i;
    }
    return lhs.j < rhs.j;
}
std::ostream &operator<<(std::ostream &os, point &pt) {
    string s;
    s.push_back('(');
    s = s + to_string(pt.i);
    s = s + ", ";
    s = s + to_string(pt.j);
    s.push_back(')');
    return os << s;
}

mt19937 engine(0);
clock_t start_time;
double now() {
    return 1000.0 * (clock() - start_time) / CLOCKS_PER_SEC;
}
void marathon_init() {
    start_time = clock();
    random_device seed_gen;
    engine.seed(seed_gen());
}
int randint(int mn, int mx) {
    int rng = mx - mn + 1;
    return mn + (engine() % rng);
}
double uniform(double x, double y) {
    const int RND = 1e8;
    double mean = (x + y) / 2.0;
    double dif = y - mean;
    double p = double(engine() % RND) / RND;
    return mean + dif * (1.0 - 2.0 * p);
}
bool anneal_accept(double new_score, double old_score, double cur_time, double begin_time, double end_time, double begin_temp, double end_temp) {
    const int ANNEAL_RND = 1e8;
    const double ANNEAL_EPS = 1e-6;
    double temp = cur_time * (end_temp - begin_temp) / (end_time - begin_time) + (end_time * begin_temp - end_temp * begin_time) / (end_time - begin_time);
    return (exp((new_score - old_score) / temp) > double(engine() % ANNEAL_RND) / ANNEAL_RND + ANNEAL_EPS);
}

const int N = 20;
const int OPS = 1000;

double P;
const int R = 0;
const int D = 1;
const int L = 2;
const int U = 3;
vector<point> mvs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int request(string ops) {
    cout << ops << endl;
    int res;
    cin >> res;
    return res;
}
string makeop(int opid, vector<pair<int, string>> &history) {
    string s = "RDRDRD";
    return s;
}
void solve() {
    int opslimit = OPS;
    opslimit = 1000;

    int maxres = 0;
    vector<pair<int, string>> history;
    for (int opid = 0; opid < opslimit; opid++) {
        string s = makeop(opid, history);
        int res = request(s);
        if (res < 0) {
            return;
        }
        history.push_back({res, s});
        maxres = max(maxres, res);
    }
}
int main() {
    marathon_init();
    ioinit();
    int _h, _w;
    cin >> _h >> _w >> P;
    P *= 0.01;
    solve();
    return 0;
}
0