結果
問題 | No.1323 うしらずSwap |
ユーザー | tokusakurai |
提出日時 | 2020-12-21 10:21:56 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 148 ms / 3,000 ms |
コード長 | 3,672 bytes |
コンパイル時間 | 2,388 ms |
コンパイル使用メモリ | 219,892 KB |
実行使用メモリ | 33,472 KB |
最終ジャッジ日時 | 2023-08-09 14:02:00 |
合計ジャッジ時間 | 8,688 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 1 ms
4,376 KB |
testcase_16 | AC | 51 ms
33,160 KB |
testcase_17 | AC | 82 ms
33,144 KB |
testcase_18 | AC | 51 ms
33,188 KB |
testcase_19 | AC | 84 ms
33,216 KB |
testcase_20 | AC | 50 ms
33,156 KB |
testcase_21 | AC | 90 ms
33,072 KB |
testcase_22 | AC | 146 ms
33,152 KB |
testcase_23 | AC | 91 ms
33,128 KB |
testcase_24 | AC | 148 ms
33,164 KB |
testcase_25 | AC | 86 ms
33,188 KB |
testcase_26 | AC | 70 ms
33,164 KB |
testcase_27 | AC | 68 ms
33,144 KB |
testcase_28 | AC | 70 ms
33,472 KB |
testcase_29 | AC | 73 ms
33,192 KB |
testcase_30 | AC | 117 ms
33,056 KB |
testcase_31 | AC | 74 ms
33,132 KB |
testcase_32 | AC | 124 ms
33,192 KB |
testcase_33 | AC | 144 ms
33,356 KB |
testcase_34 | AC | 142 ms
33,196 KB |
testcase_35 | AC | 138 ms
33,348 KB |
testcase_36 | AC | 133 ms
33,352 KB |
testcase_37 | AC | 131 ms
33,232 KB |
testcase_38 | AC | 131 ms
33,296 KB |
testcase_39 | AC | 131 ms
33,468 KB |
testcase_40 | AC | 133 ms
33,316 KB |
testcase_41 | AC | 128 ms
33,432 KB |
testcase_42 | AC | 123 ms
33,356 KB |
testcase_43 | AC | 42 ms
33,184 KB |
testcase_44 | AC | 63 ms
32,832 KB |
testcase_45 | AC | 55 ms
33,188 KB |
testcase_46 | AC | 63 ms
32,860 KB |
testcase_47 | AC | 46 ms
33,100 KB |
testcase_48 | AC | 66 ms
33,160 KB |
testcase_49 | AC | 105 ms
32,864 KB |
testcase_50 | AC | 61 ms
32,812 KB |
testcase_51 | AC | 37 ms
33,072 KB |
testcase_52 | AC | 48 ms
32,868 KB |
testcase_53 | AC | 111 ms
33,156 KB |
testcase_54 | AC | 55 ms
33,200 KB |
testcase_55 | AC | 110 ms
33,160 KB |
testcase_56 | AC | 41 ms
33,192 KB |
testcase_57 | AC | 117 ms
33,144 KB |
testcase_58 | AC | 2 ms
4,376 KB |
testcase_59 | AC | 2 ms
4,376 KB |
testcase_60 | AC | 2 ms
4,376 KB |
testcase_61 | AC | 2 ms
4,376 KB |
ソースコード
#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'; }