結果

問題 No.2928 Gridpath
ユーザー 👑 binapbinap
提出日時 2024-10-12 15:31:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 12 ms / 2,000 ms
コード長 3,202 bytes
コンパイル時間 4,351 ms
コンパイル使用メモリ 269,140 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-12 15:31:18
合計ジャッジ時間 5,172 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 12 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 3 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 1 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 7 ms
5,248 KB
testcase_16 AC 9 ms
5,248 KB
testcase_17 AC 4 ms
5,248 KB
testcase_18 AC 8 ms
5,248 KB
testcase_19 AC 9 ms
5,248 KB
testcase_20 AC 1 ms
5,248 KB
testcase_21 AC 11 ms
5,248 KB
testcase_22 AC 11 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

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);}


int main(){
	int h, w;
	cin >> h >> w;
	int sy, sx;
	int gy, gx;
	cin >> sy >> sx;
	cin >> gy >> gx;
	sy--; sx--;
	gy--; gx--;
	set<pair<int, int>> se;
	
	vector<pair<int, int>> t = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
	
	int ans = 0;
	auto dfs = [&](auto self, int y, int x, int y_before, int x_before) -> void{
		bool ok = true;
		for(auto [y_seen, x_seen] : se){
			if(y_seen == y_before and x_seen == x_before) continue;
			int dist = abs(y - y_seen) + abs(x - x_seen);
			if(dist <= 1) ok = false;
		}
		flush(cout);
		if(!ok) return;
		if(y == gy and x == gx){
			ans++;
			return;
		}
		se.insert(make_pair(y, x));
		for(auto [dy, dx] : t){
			int ny = y + dy;
			int nx = x + dx;
			if(0 <= ny and ny < h and 0 <= nx and nx < w){
				if(ny == y_before and nx == x_before) continue;
				self(self, ny, nx, y, x);
			}
		}
		se.erase(make_pair(y, x));
	};
	dfs(dfs, sy, sx, -1001, -1001);
	cout << ans << "\n";
	return 0;
}
0