結果
| 問題 | No.585 工夫のないパズル |
| ユーザー |
|
| 提出日時 | 2017-10-28 15:17:19 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 5,843 bytes |
| コンパイル時間 | 3,946 ms |
| コンパイル使用メモリ | 236,568 KB |
| 実行使用メモリ | 818,080 KB |
| 最終ジャッジ日時 | 2024-05-01 20:51:44 |
| 合計ジャッジ時間 | 6,651 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | MLE | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
ソースコード
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
return uniform_int_distribution<ll>(l, h)(randdev);
}
#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
struct State {
int field[16];
inline int& operator()(int y, int x) { return field[y * 4 + x]; }
inline int operator()(int y, int x) const { return field[y * 4 + x]; }
inline bool is_satisfy() const { return is_sorted(field, field + 16); }
int heuristic() const ;
inline ll hash() const {
ll h = 0;
repeat(i, 16)
h = (h << 4ll) | (ll)field[i];
return h;
}
void input() {
repeat(i, 4) {
string str;
cin >> str;
repeat(j, 4)
field[4*i + j] = str[j] - 'A';
}
}
private:
inline int at(int y, int x) { return field[y * 4 + x]; }
};
struct Command {
// R = 0, C= 1
int dir;
int pos;
int step;
Command(int d, int p, int s) :dir(d), pos(p), step(s) { }
Command(int h = 0) :dir(h >> 8), pos((h >> 4) & 15), step(h & 15) { }
void apply(State& s) {
if (dir == 0) {
if (step == 1)
swap(s(pos, 3), s(pos, 2)),
swap(s(pos, 2), s(pos, 1)),
swap(s(pos, 1), s(pos, 0));
if (step == 2)
swap(s(pos, 0), s(pos, 2)),
swap(s(pos, 1), s(pos, 3));
if (step == 3)
swap(s(pos, 0), s(pos, 1)),
swap(s(pos, 1), s(pos, 2)),
swap(s(pos, 2), s(pos, 3));
}
else {
if (step == 1)
swap(s(3, pos), s(2, pos)),
swap(s(2, pos), s(1, pos)),
swap(s(1, pos), s(0, pos));
if (step == 2)
swap(s(0, pos), s(2, pos)),
swap(s(1, pos), s(3, pos));
if (step == 3)
swap(s(0, pos), s(1, pos)),
swap(s(1, pos), s(2, pos)),
swap(s(2, pos), s(3, pos));
}
}
void print() {
if (dir == 0)
printf("R");
else
printf("C");
printf(" %d %d\n", pos, step);
}
inline int hash() const {
return (dir << 8) | (pos << 4) | step;
}
};
int State::heuristic() const {
int score = 0;
repeat(i, 16) {
// yoko
score += (i / 4 * 4 <= field[i] && field[i] < i / 4 * 4 + 4);
// tate
score += (i%4 == field[i]%4);
}
return 0;
}
const int maxturn = 90;
unordered_set<ll> mem_hash;
int main() {
State first_state;
first_state.input();
if (first_state.is_satisfy())
cout << 0 << endl, exit(0);
vector<State> states;
vector<pair<int, int>> previnfo; // prev_stateid, prev_command
vector<priority_queue<pair<int,int>>> beams(maxturn);
states.push_back(first_state);
previnfo.emplace_back(0, 0);
beams[0].emplace(0, 0);
function<void(int)> finalize = [&](int stateid) {
stack<Command> commands;
while (stateid != 0) {
auto p = previnfo[stateid];
commands.emplace(p.second);
stateid = p.first;
}
printf("%d\n", (int)commands.size());
while (!commands.empty()) {
commands.top().print();
commands.pop();
}
};
for (auto btime = TIME; MILLISEC(TIME - btime) < 1990;) {
for (int turn = 0; turn < maxturn; ++turn) {
for (int beamidx = 0; beamidx < 5 && !beams[turn].empty(); ++beamidx) {
int stateidx = beams[turn].top().second;
beams[turn].pop();
State state = states[stateidx];
repeat(dir, 2) repeat( pos, 4) iterate(step, 1, 4) {
Command command(dir, pos, step);
State new_state = state;
command.apply(new_state);
int new_stateid = states.size();
previnfo.emplace_back(stateidx, command.hash());
states.push_back(new_state);
if (new_state.is_satisfy())
finalize(new_stateid), exit(0);
if (turn + 1 < maxturn)
beams[turn + 1].emplace(new_state.heuristic(), new_stateid);
}
}
}
}
cout << "akan" << endl;
return 0;
}