結果
| 問題 | No.2096 Rage With Our Friends |
| ユーザー |
 siganai
|
| 提出日時 | 2022-10-11 21:10:56 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 7,578 bytes |
| コンパイル時間 | 2,604 ms |
| コンパイル使用メモリ | 215,916 KB |
| 実行使用メモリ | 38,912 KB |
| 最終ジャッジ日時 | 2024-06-25 15:44:36 |
| 合計ジャッジ時間 | 9,540 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | RE | - |
| testcase_04 | AC | 2 ms
5,376 KB |
| testcase_05 | AC | 2 ms
5,376 KB |
| testcase_06 | AC | 2 ms
5,376 KB |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | AC | 1 ms
5,376 KB |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | AC | 145 ms
38,912 KB |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | AC | 2 ms
5,376 KB |
| testcase_17 | AC | 141 ms
38,784 KB |
| testcase_18 | RE | - |
| testcase_19 | AC | 2 ms
5,376 KB |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
ソースコード
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
//#include "atcoder/string.hpp"
//#include "atcoder/mincostflow.hpp"
//#include "atcoder/maxflow.hpp"
using namespace std;
//using namespace atcoder;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define elif else if
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return a + b; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr int mod = 1000000007;
//constexpr int mod = 998244353;
static const double PI = 3.1415926535897932;
template <class F> struct REC {
F f;
REC(F &&f_) : f(forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
int main(){
INT(h,w);
INT(sx,sy,gx,gy);
sx--,sy--,gx--,gy--;
VEC(string,s,h);
vvi pre(h+1,vi(w,-1));
rep(j,w) {
rep(i,h) {
if(s[i][j] == '.') pre[i+1][j] = i;
else pre[i+1][j] = pre[i][j];
}
}
debug(pre);
vvi dist(h,vi(w,1e9));
dist[sx][sy] = 0;
deque<pii> q;
q.emplace_front(sx,sy);
while(!q.empty()) {
auto [px,py] = q.front();
q.pop_front();
if(pre[px][py] != -1) {
if(chmin(dist[pre[px][py]][py],dist[px][py])) {
q.emplace_front(pre[px][py],py);
}
}
if(px == h - 1) {
if(py > 0) {
if(pre[px+1][py-1] != -1) {
if(chmin(dist[pre[px+1][py-1]][py-1],dist[px][py])) q.emplace_front(pre[px+1][py-1],py-1);
}
}
if(py < w - 1) {
if(pre[px+1][py+1] != -1) {
if(chmin(dist[pre[px+1][py+1]][py+1],dist[px][py])) q.emplace_front(pre[px+1][py+1],py+1);
}
}
}
else {
if(py > 0) {
if(pre[px+2][py-1] != -1) {
if(chmin(dist[pre[px+2][py-1]][py-1],dist[px][py])) q.emplace_front(pre[px+2][py-1],py-1);
}
}
if(py < w - 1) {
if(pre[px+2][py+1] != -1) {
if(chmin(dist[pre[px+2][py+1]][py+1],dist[px][py])) q.emplace_front(pre[px+2][py+1],py+1);
}
}
}
if(py > 0) {
if(pre[px+1][py-1] != -1) {
int e = px - pre[px+1][py-1];
int p = pre[px+1][py-1];
if(py - 1 > 0) {
if(pre[p+2+e/2][py-2] != -1) {
if(chmin(dist[pre[p+2+e/2][py-2]][py-2],dist[px][py])) q.emplace_front(pre[p+2+e/2][py-2],py-2);
}
//if(px < h - 1 && s[px+1][py-2] == '.' && chmin(dist[px+1][py-2],dist[px][py] + 1)) q.emplace_back(px+1,py - 2);
if(pre[min(h,px+2)][py-2] != -1 && chmin(dist[pre[min(h,px+2)][py-2]][py-2],dist[px][py] + 1)) q.emplace_back(pre[min(h,px+2)][py-2],py-2);
}
if(px < h - 1) {
if(s[px+1][py] == '.' && chmin(dist[px+1][py],dist[px][py] + 1)) q.emplace_back(px+1,py);
}
}
}
if(py < w - 1) {
if(pre[px+1][py+1] != -1) {
int e = px - pre[px+1][py+1];
int p = pre[px+1][py+1];
if(py + 1 < w - 1) {
if(pre[p+2+e/2][py+2] != -1) {
if(chmin(dist[pre[p+2+e/2][py+2]][py+2],dist[px][py])) q.emplace_front(pre[p+2+e/2][py+2],py+2);
}
if(pre[min(h,px+2)][py+2] != -1 && chmin(dist[pre[min(h,px+2)][py+2]][py+2],dist[px][py] + 1)) q.emplace_back(pre[min(h,px+2)][py+2],py+2);
}
if(px < h - 1) {
if(s[px+1][py] == '.' && chmin(dist[px+1][py],dist[px][py] + 1)) q.emplace_back(px+1,py);
}
}
}
}
if(dist[gx][gy] == (int)1e9) cout << -1 << '\n';
else cout << dist[gx][gy] << '\n';
debug(dist);
}