結果

問題 No.2096 Rage With Our Friends
ユーザー heno239heno239
提出日時 2022-10-07 23:03:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 448 ms / 5,000 ms
コード長 7,982 bytes
コンパイル時間 2,517 ms
コンパイル使用メモリ 164,856 KB
実行使用メモリ 63,680 KB
最終ジャッジ日時 2024-06-12 20:46:23
合計ジャッジ時間 6,138 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
11,716 KB
testcase_01 AC 8 ms
11,716 KB
testcase_02 AC 7 ms
11,720 KB
testcase_03 AC 7 ms
11,720 KB
testcase_04 AC 7 ms
11,716 KB
testcase_05 AC 8 ms
11,848 KB
testcase_06 AC 8 ms
11,852 KB
testcase_07 AC 8 ms
11,720 KB
testcase_08 AC 8 ms
11,724 KB
testcase_09 AC 7 ms
11,720 KB
testcase_10 AC 7 ms
11,720 KB
testcase_11 AC 101 ms
47,308 KB
testcase_12 AC 448 ms
63,680 KB
testcase_13 AC 149 ms
47,304 KB
testcase_14 AC 203 ms
47,304 KB
testcase_15 AC 101 ms
47,304 KB
testcase_16 AC 8 ms
11,844 KB
testcase_17 AC 149 ms
47,304 KB
testcase_18 AC 8 ms
11,720 KB
testcase_19 AC 8 ms
11,716 KB
testcase_20 AC 7 ms
11,720 KB
testcase_21 AC 228 ms
47,304 KB
testcase_22 AC 248 ms
47,300 KB
testcase_23 AC 17 ms
13,768 KB
testcase_24 AC 153 ms
34,376 KB
testcase_25 AC 87 ms
23,876 KB
testcase_26 AC 44 ms
19,400 KB
testcase_27 AC 42 ms
19,400 KB
testcase_28 AC 8 ms
11,848 KB
testcase_29 AC 24 ms
15,432 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

void solve() {
	int h, w; cin >> h >> w;
	int sx, sy, gx, gy;
	cin >> sx >> sy >> gx >> gy; sx--; sy--; gx--; gy--;
	vector<string> s(h);
	rep(i, h)cin >> s[i];
	vector<vector<int>> pre(h+1, vector<int>(w));
	rep(j, w) {
		int cur = 0;
		rep(i, h) {
			if (s[i][j] == '.')cur = i;
			pre[i][j] = cur;
		}
		pre[h][j] = cur;
	}
	vector<vector<int>> dp(h, vector<int>(w,mod));
	dp[sx][sy] = 0;
	queue<P> q[2];
	q[0].push({ sx,sy });
	while (!q[0].empty()) {
		while (!q[0].empty()) {
			P p = q[0].front(); q[0].pop();
			int x = p.first, y = p.second;
			if (x > 0) {
				int px = pre[x - 1][y];
				if (dp[x][y] < dp[px][y]) {
					dp[px][y] = dp[x][y];
					q[0].push({ px,y });
				}
			}
			for (int ny = y - 1; ny <= y + 1; ny += 2) {
				if (ny >= 0 && ny < w) {
					int px = pre[x + 1][ny];
					if (dp[x][y] < dp[px][ny]) {
						dp[px][ny] = dp[x][y];
						q[0].push({ px,ny });
					}
				}
			}
			if (x > 0) {
				if (y >= 2) {
					int px = pre[x - 1][y-1];
					int e = x - px;
					//normal
					int nx = px + 1 + e / 2;
					nx = pre[nx][y - 2];
					int ny = y - 2;
					if (dp[x][y] < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y];
						q[0].push({ nx,ny });
					}
					//hyper
					nx = px + 1 + e;
					nx = pre[nx][y - 2];
					if (dp[x][y] + 1 < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y] + 1;
						q[1].push({ nx,ny });
					}
				}
				if (y >= 1) {
					int px = pre[x - 1][y - 1];
					int e = x - px;
					int nx, ny;
					//normal
					nx = px + 1 + e / 2;
					nx = pre[nx][y];
					ny = y;
					if (dp[x][y] < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y];
						q[0].push({ nx,ny });
					}
					//hyper
					nx = px + 1 + e;
					nx = pre[nx][y];
					if (dp[x][y] + 1 < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y] + 1;
						q[1].push({ nx,ny });
					}
				}
				if (y + 1 < w) {
					int px = pre[x - 1][y + 1];
					int e = x - px;
					int nx, ny;
					//normal
					nx = px + 1 + e / 2;
					nx = pre[nx][y];
					ny = y;
					if (dp[x][y] < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y];
						q[0].push({ nx,ny });
					}
					//hyper
					nx = px + 1 + e;
					nx = pre[nx][y];
					if (dp[x][y] + 1 < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y] + 1;
						q[1].push({ nx,ny });
					}
				}
				if (y + 2 < w) {
					int px = pre[x - 1][y + 1];
					int e = x - px;
					//normal
					int nx = px + 1 + e / 2;
					nx = pre[nx][y + 2];
					int ny = y + 2;
					if (dp[x][y] < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y];
						q[0].push({ nx,ny });
					}
					//hyper
					nx = px + 1 + e;
					nx = pre[nx][y + 2];
					if (dp[x][y] + 1 < dp[nx][ny]) {
						dp[nx][ny] = dp[x][y] + 1;
						q[1].push({ nx,ny });
					}
				}
			}
		}
		swap(q[0], q[1]);
	}
	//cout << dp[1][0] << "\n";
	//cout << dp[2][0] << "\n";
	int ans = dp[gx][gy];
	if (ans == mod)ans = -1;
	cout << ans << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0