結果

問題 No.1588 Connection
ユーザー heno239heno239
提出日時 2021-07-08 22:37:44
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 111 ms / 2,000 ms
コード長 4,075 bytes
コンパイル時間 1,639 ms
コンパイル使用メモリ 144,160 KB
実行使用メモリ 24,432 KB
平均クエリ数 500.22
最終ジャッジ日時 2023-09-24 10:46:21
合計ジャッジ時間 4,887 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
24,216 KB
testcase_01 AC 25 ms
23,400 KB
testcase_02 AC 26 ms
24,012 KB
testcase_03 AC 26 ms
23,988 KB
testcase_04 AC 26 ms
23,436 KB
testcase_05 AC 26 ms
23,844 KB
testcase_06 AC 27 ms
24,348 KB
testcase_07 AC 26 ms
24,012 KB
testcase_08 AC 27 ms
24,288 KB
testcase_09 AC 28 ms
23,424 KB
testcase_10 AC 27 ms
23,844 KB
testcase_11 AC 27 ms
23,424 KB
testcase_12 AC 31 ms
24,300 KB
testcase_13 AC 36 ms
23,640 KB
testcase_14 AC 26 ms
23,616 KB
testcase_15 AC 27 ms
23,664 KB
testcase_16 AC 27 ms
23,544 KB
testcase_17 AC 25 ms
23,784 KB
testcase_18 AC 26 ms
23,376 KB
testcase_19 AC 26 ms
23,664 KB
testcase_20 AC 29 ms
24,204 KB
testcase_21 AC 111 ms
23,376 KB
testcase_22 AC 109 ms
24,300 KB
testcase_23 AC 60 ms
24,348 KB
testcase_24 AC 45 ms
24,012 KB
testcase_25 AC 71 ms
24,312 KB
testcase_26 AC 69 ms
23,340 KB
testcase_27 AC 45 ms
24,432 KB
testcase_28 AC 40 ms
24,012 KB
testcase_29 AC 107 ms
24,036 KB
testcase_30 AC 111 ms
24,336 KB
testcase_31 AC 27 ms
24,300 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>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#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;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

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;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return 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 -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += 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;
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];
}

int query(int x, int y) {
	cout << x + 1 << " " << y + 1 << endl;
	string res; cin >> res;
	if (res[0] == 'B')return 1;
	else if (res[0] == 'W')return 0;
	else exit(0);
	return -1;
}

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
bool used[500][500][4];
void solve() {
	int n, m; cin >> n >> m;
	vector<vector<int>> col(n, vector<int>(n, -1));
	col[0][0] = col[n - 1][n - 1] = 1;
	int cx = 0, cy = 0, d = 0;
	while (true) {
		if (used[cx][cy][d])break;
		used[cx][cy][d] = true;
		int nx = cx + dx[d];
		int ny = cy + dy[d];
		bool valid = true;
		if (nx < 0 || ny < 0 || nx >= n || ny >= n) {
			valid = false;
		}
		else {
			if (col[nx][ny] < 0) {
				col[nx][ny] = query(nx, ny);
			}
			if (col[nx][ny] == 0)valid = false;
		}
		if (!valid) {
			d++; if (d == 4)d = 0;
		}
		else {
			cx = nx;
			cy = ny;
			d--;
			if (d < 0)d += 4;
		}
	}
	rep(d, 4)if (used[n - 1][n - 1][d]) {
		cout << "Yes" << endl; return;
	}
	cout << "No" << endl;
}

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