結果
問題 | No.1323 うしらずSwap |
ユーザー | trineutron |
提出日時 | 2020-12-21 00:13:41 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 464 ms / 3,000 ms |
コード長 | 3,893 bytes |
コンパイル時間 | 2,563 ms |
コンパイル使用メモリ | 218,596 KB |
実行使用メモリ | 220,600 KB |
最終ジャッジ日時 | 2023-08-09 14:01:32 |
合計ジャッジ時間 | 19,073 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 310 ms
220,356 KB |
testcase_17 | AC | 430 ms
219,728 KB |
testcase_18 | AC | 286 ms
220,580 KB |
testcase_19 | AC | 435 ms
219,788 KB |
testcase_20 | AC | 289 ms
220,096 KB |
testcase_21 | AC | 287 ms
220,292 KB |
testcase_22 | AC | 418 ms
220,516 KB |
testcase_23 | AC | 284 ms
220,044 KB |
testcase_24 | AC | 422 ms
220,256 KB |
testcase_25 | AC | 285 ms
220,072 KB |
testcase_26 | AC | 277 ms
220,600 KB |
testcase_27 | AC | 283 ms
220,468 KB |
testcase_28 | AC | 235 ms
198,932 KB |
testcase_29 | AC | 262 ms
220,500 KB |
testcase_30 | AC | 396 ms
220,580 KB |
testcase_31 | AC | 264 ms
220,060 KB |
testcase_32 | AC | 373 ms
220,312 KB |
testcase_33 | AC | 464 ms
199,296 KB |
testcase_34 | AC | 441 ms
199,664 KB |
testcase_35 | AC | 433 ms
201,624 KB |
testcase_36 | AC | 442 ms
201,884 KB |
testcase_37 | AC | 439 ms
201,024 KB |
testcase_38 | AC | 405 ms
201,108 KB |
testcase_39 | AC | 409 ms
201,540 KB |
testcase_40 | AC | 421 ms
201,368 KB |
testcase_41 | AC | 430 ms
202,132 KB |
testcase_42 | AC | 414 ms
201,236 KB |
testcase_43 | AC | 180 ms
194,888 KB |
testcase_44 | AC | 206 ms
194,644 KB |
testcase_45 | AC | 206 ms
196,656 KB |
testcase_46 | AC | 206 ms
194,780 KB |
testcase_47 | AC | 190 ms
194,880 KB |
testcase_48 | AC | 186 ms
194,928 KB |
testcase_49 | AC | 228 ms
194,968 KB |
testcase_50 | AC | 177 ms
193,932 KB |
testcase_51 | AC | 148 ms
192,920 KB |
testcase_52 | AC | 160 ms
193,112 KB |
testcase_53 | AC | 220 ms
195,436 KB |
testcase_54 | AC | 162 ms
193,328 KB |
testcase_55 | AC | 234 ms
194,928 KB |
testcase_56 | AC | 152 ms
193,380 KB |
testcase_57 | AC | 237 ms
196,164 KB |
testcase_58 | AC | 3 ms
4,380 KB |
testcase_59 | AC | 4 ms
4,380 KB |
testcase_60 | AC | 3 ms
4,376 KB |
testcase_61 | AC | 2 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using point = pair<int, int>; const vector<int> dx{1, 0, -1, 0}, dy{0, 1, 0, -1}; int main() { constexpr int inf = 1e9; int h, w, ra, ca, rb, cb; cin >> h >> w >> ra >> ca >> rb >> cb; ra--; ca--; rb--; cb--; vector<string> s(h); for (int i = 0; i < h; i++) { cin >> s.at(i); } vector d(h, vector(w, inf)), db(h, vector(w, inf)), dloop(h, vector(w, inf)); queue<point> q; d.at(ra).at(ca) = 0; q.emplace(ra, ca); while (not q.empty()) { auto [x, y] = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int newx = x + dx.at(i), newy = y + dy.at(i); if (s.at(newx).at(newy) == '#') continue; if (d.at(newx).at(newy) != inf) continue; d.at(newx).at(newy) = d.at(x).at(y) + 1; q.emplace(newx, newy); } } const int dist = d.at(rb).at(cb); if (dist == inf) { cout << -1 << endl; return 0; } db.at(rb).at(cb) = 0; q.emplace(rb, cb); while (not q.empty()) { auto [x, y] = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int newx = x + dx.at(i), newy = y + dy.at(i); if (s.at(newx).at(newy) == '#') continue; if (db.at(newx).at(newy) != inf) continue; db.at(newx).at(newy) = db.at(x).at(y) + 1; q.emplace(newx, newy); } } vector<vector<int>> v(2 * h * w), v_back(h * w), v_front(h * w); for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { if (d.at(i).at(j) == inf or db.at(i).at(j) == inf) continue; int d_total = d.at(i).at(j) + db.at(i).at(j); if (abs(d.at(i).at(j) - db.at(i).at(j)) < dist) { v.at(d.at(i).at(j) - db.at(i).at(j) + h * w).push_back(d_total); } else if (d.at(i).at(j) - db.at(i).at(j) > 0) { v_back.at(d.at(i).at(j)).push_back(d_total); } else { v_front.at(db.at(i).at(j)).push_back(d_total); } } } int ans = inf; for (int i = 0; i < 2 * h * w; i++) { sort(v.at(i).begin(), v.at(i).end()); if (v.at(i).size() >= 2) { ans = min(ans, v.at(i).at(0) + v.at(i).at(1)); } if (i >= h * w) continue; sort(v_back.at(i).begin(), v_back.at(i).end()); if (v_back.at(i).size() >= 2) { ans = min(ans, v_back.at(i).at(0) + v_back.at(i).at(1)); } sort(v_front.at(i).begin(), v_front.at(i).end()); if (v_front.at(i).size() >= 2) { ans = min(ans, v_front.at(i).at(0) + v_front.at(i).at(1)); } } int x_erase = rb, y_erase = cb, d_erase = dist; while (d_erase) { s.at(x_erase).at(y_erase) = '#'; for (int i = 0; i < 4; i++) { int newx = x_erase + dx.at(i), newy = y_erase + dy.at(i); if (s.at(newx).at(newy) == '#') continue; if (d.at(newx).at(newy) >= d_erase) continue; x_erase = newx; y_erase = newy; d_erase--; break; } } s.at(rb).at(cb) = '.'; dloop.at(ra).at(ca) = 0; q.emplace(ra, ca); while (not q.empty()) { auto [x, y] = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int newx = x + dx.at(i), newy = y + dy.at(i); if (s.at(newx).at(newy) == '#') continue; if (dloop.at(newx).at(newy) != inf) continue; if (x == ra and y == ca and newx == rb and newy == cb) continue; dloop.at(newx).at(newy) = dloop.at(x).at(y) + 1; q.emplace(newx, newy); } } ans = min(ans, dist + dloop.at(rb).at(cb)); if (ans == inf) { cout << -1 << endl; } else { cout << ans << endl; } }