File size: 2,980 Bytes
ff444f7 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int N = 10;
const int LIM = 10000;
using tiii = tuple<int, int, int>;
vector<string> G{
"@.....#.#.",
"#.#.#.#...",
".#.#..#.#.",
".....#..#.",
"#.#.#..##.",
"...#.#.#..",
".#.#.#..#.",
"..#...#.#.",
"#...#....#",
"..#..#.#..",
};
vector<vector<pair<int, int>>> pos(80);
map<tiii, int> dp, op;
map<tiii, tiii> pr;
map<int, tiii> best;
void init() {
map<pair<int, int>, int> dist;
dist[{0, 0}] = 0;
queue<pair<int, int>> q;
q.push({0, 0});
while (!q.empty()) {
auto [r, c] = q.front();
q.pop();
for (auto [r2, c2] : {pair{r - 1, c}, {r + 1, c}, {r, c - 1}, {r, c + 1}}) {
if (0 <= r2 && r2 < N && 0 <= c2 && c2 < N && G[r2][c2] == '.' &&
!dist.count({r2, c2})) {
dist[{r2, c2}] = dist[{r, c}] + 1;
pos[dist[{r2, c2}]].emplace_back(r2, c2);
q.push({r2, c2});
}
}
}
vector<int> sz;
for (auto l : pos) {
sz.push_back(l.size());
}
vector<vector<tiii>> elts(62);
dp[{0, 0, 1}] = 1;
elts[1].emplace_back(0, 0, 1);
for (int d = 0; d < 60; d++) {
if (d > 1 && sz[d] == 0) {
break;
}
while (!elts[d].empty()) {
auto tt = elts[d].back();
auto [u, v, state] = tt;
elts[d].pop_back();
if (0 <= u && u <= LIM && 0 <= v && v <= LIM) {
if (!best.count(u)) {
best[u] = tt;
}
} else {
continue;
}
tiii t0 = tiii{u, v, state ^ 1}, t1, t2;
if (!dp.count(t0)) {
dp[t0] = d + 1;
op[t0] = 0;
pr[t0] = tt;
elts[d + 1].push_back(t0);
}
if (sz[d] >= 1) {
if (state % 2) {
t1 = tiii{v, v, state ^ 1};
} else {
t1 = tiii{u, u + v, state ^ 1};
}
if (!dp.count(t1)) {
dp[t1] = d + 1;
op[t1] = 1;
pr[t1] = tt;
elts[d + 1].push_back(t1);
}
}
if (sz[d] >= 2) {
if (state % 2) {
t2 = tiii{u - 1, v, state ^ 1};
} else {
t2 = tiii{u + 1, v, state ^ 1};
}
if (!dp.count(t2)) {
dp[t2] = d + 1;
op[t2] = 2;
pr[t2] = tt;
elts[d + 1].push_back(t2);
}
}
}
}
}
void solve() {
int K;
cin >> K;
vector<int> rev;
for (auto state = best[K]; state != tiii{0, 0, 1}; state = pr[state]) {
rev.push_back(op[state]);
}
rev.push_back(0);
reverse(rev.begin(), rev.end());
vector<string> out = G;
for (int i = 0; i < (int)rev.size(); i++) {
for (int x = 0; x < rev[i]; x++) {
auto [r, c] = pos[i][x];
out[r][c] = '*';
}
}
cout << N << " " << N << endl;
for (int i = 0; i < N; i++) {
cout << out[i] << endl;
}
}
int main() {
init();
int T;
cin >> T;
for (int t = 1; t <= T; t++) {
cout << "Case #" << t << ": ";
solve();
}
return 0;
}
|