174 lines
3.5 KiB
C++
174 lines
3.5 KiB
C++
/* Problem URL: https://cses.fi/problemset/task/1689 */
|
|
|
|
#include <bits/stdc++.h>
|
|
#include <ext/pb_ds/assoc_container.hpp>
|
|
#include <ext/pb_ds/tree_policy.hpp>
|
|
|
|
using namespace std;
|
|
using namespace __gnu_pbds;
|
|
|
|
template <class T, class comp = less<>>
|
|
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (int i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int x, y;
|
|
cin >> x >> y;
|
|
x--, y--;
|
|
|
|
int n = 8;
|
|
|
|
vvi ans(n, vi(n));
|
|
|
|
vvi count(n, vi(n));
|
|
|
|
int add[][2] = {{1, 2}, {1, -2}, {-1, 2}, {-1, -2}, {2, 1}, {2, -1}, {-2, 1}, {-2, -1}};
|
|
|
|
auto check = [&](int i, int j) {
|
|
return i >= 0 && i < n && j >= 0 && j < n;
|
|
};
|
|
|
|
rep(i, n) {
|
|
rep(j, n) {
|
|
repv(k, add) {
|
|
int id = i + k[0];
|
|
int jd = j + k[1];
|
|
|
|
if (check(id, jd)) {
|
|
count[id][jd]++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
swap(x, y);
|
|
|
|
int oo = INT32_MAX >> 1;
|
|
|
|
int curx = x;
|
|
int cury = y;
|
|
ans[x][y] = 1;
|
|
|
|
function<bool(int, int)> dfs = [&](int i, int j) {
|
|
if (ans[i][j] == 64) {
|
|
return true;
|
|
}
|
|
|
|
int prev = count[i][j];
|
|
|
|
count[i][j] = oo;
|
|
|
|
priority_queue<tuple<int, int, int>, V<tuple<int, int, int>>, greater<>> pq;
|
|
|
|
repv(k, add) {
|
|
int id = i + k[0];
|
|
int jd = j + k[1];
|
|
|
|
if (check(id, jd)) {
|
|
count[id][jd]--;
|
|
pq.emplace(count[id][jd], id, jd);
|
|
}
|
|
}
|
|
|
|
while (!pq.empty()) {
|
|
auto [ty, id, jd] = pq.top();
|
|
pq.pop();
|
|
|
|
if (ty > 8) {
|
|
break;
|
|
}
|
|
|
|
ans[id][jd] = ans[i][j] + 1;
|
|
|
|
if (dfs(id, jd)) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
repv(k, add) {
|
|
int id = i + k[0];
|
|
int jd = j + k[1];
|
|
|
|
if (check(id, jd)) {
|
|
count[id][jd]++;
|
|
}
|
|
}
|
|
|
|
count[i][j] = prev;
|
|
|
|
return false;
|
|
};
|
|
|
|
dfs(x, y);
|
|
|
|
cout << ans;
|
|
}
|