結果
問題 | No.1323 うしらずSwap |
ユーザー |
|
提出日時 | 2020-12-21 10:21:56 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 133 ms / 3,000 ms |
コード長 | 3,672 bytes |
コンパイル時間 | 2,326 ms |
コンパイル使用メモリ | 215,160 KB |
最終ジャッジ日時 | 2025-01-17 05:26:43 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 59 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;const int MOD = 1000000007;//const int MOD = 998244353;const int inf = (1<<28)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;int main(){int H, W;cin >> H >> W;int sx, sy, tx, ty;cin >> sx >> sy >> tx >> ty;sx--, sy--, tx--, ty--;vector<string> S(H);rep(i, H) cin >> S[i];queue<pii> que;vector<vector<int>> d(H, vector<int>(W, inf));vector<vector<pii>> pre(H, vector<pii>(W));vector<vector<bool>> tw(H, vector<bool>(W, false));vector<vector<int>> deg(H, vector<int>(W, 0));vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};rep(i, H){rep(j, W){if(S[i][j] == '#') continue;rep(k, 4){if(S[i+dx[k]][j+dy[k]] == '.') deg[i][j]++;}}}que.emplace(sx, sy);d[sx][sy] = 0;while(!que.empty()){auto [i, j] = que.front(); que.pop();rep(k, 4){int ni = i+dx[k], nj = j+dy[k];if(S[ni][nj] == '#') continue;if(chmin(d[ni][nj], d[i][j]+1)){que.emplace(ni, nj);pre[ni][nj] = pii(i, j);}else if(d[ni][nj] == d[i][j]+1){tw[ni][nj] = true;}}}int D = d[tx][ty];if(D == inf) {cout << -1 << '\n'; return 0;}bool flag = false;int px = tx, py = ty;while(true){if(tw[px][py]) {cout << 2*D << '\n'; return 0;}auto[ax, ay] = pre[px][py];px = ax, py = ay;if(px == sx && py == sy) break;if(deg[px][py] >= 3) flag = true;S[px][py] = '#';}if(flag) {cout << 2*D+2 << '\n'; return 0;}int ans = inf, tmp = inf;rep(i, H){rep(j, W){if(deg[i][j] >= 3) chmin(tmp, d[i][j]);}}rep(i, H) fill(all(d[i]), inf);d[tx][ty] = 0;que.emplace(tx, ty);while(!que.empty()){auto [i, j] = que.front(); que.pop();rep(k, 4){int ni = i+dx[k], nj = j+dy[k];if(S[ni][nj] == '#') continue;if(chmin(d[ni][nj], d[i][j]+1)){que.emplace(ni, nj);}}}rep(i, H){rep(j, W){if(deg[i][j] >= 3) chmin(tmp, d[i][j]);}}chmin(ans, 2*D+4*tmp+4);rep(i, H) fill(all(d[i]), inf);d[sx][sy] = 0;que.emplace(sx, sy);while(!que.empty()){auto [i, j] = que.front(); que.pop();rep(k, 4){int ni = i+dx[k], nj = j+dy[k];if(S[ni][nj] == '#') continue;if(i == sx && j == sy && ni == tx && nj == ty) continue;if(chmin(d[ni][nj], d[i][j]+1)){que.emplace(ni, nj);}}}chmin(ans, D+d[tx][ty]);cout << (ans == inf? -1 : ans) << '\n';}