結果

問題 No.1588 Connection
ユーザー parenthesesparentheses
提出日時 2021-07-08 23:20:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 100 ms / 2,000 ms
コード長 3,651 bytes
コンパイル時間 2,410 ms
コンパイル使用メモリ 213,968 KB
実行使用メモリ 25,220 KB
平均クエリ数 471.91
最終ジャッジ日時 2024-07-17 12:32:10
合計ジャッジ時間 5,364 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
24,964 KB
testcase_01 AC 23 ms
24,836 KB
testcase_02 AC 23 ms
25,076 KB
testcase_03 AC 23 ms
25,204 KB
testcase_04 AC 24 ms
24,836 KB
testcase_05 AC 23 ms
24,964 KB
testcase_06 AC 24 ms
24,836 KB
testcase_07 AC 24 ms
25,220 KB
testcase_08 AC 26 ms
24,580 KB
testcase_09 AC 27 ms
24,580 KB
testcase_10 AC 26 ms
24,964 KB
testcase_11 AC 27 ms
25,220 KB
testcase_12 AC 55 ms
24,836 KB
testcase_13 AC 55 ms
25,220 KB
testcase_14 AC 24 ms
24,836 KB
testcase_15 AC 26 ms
24,964 KB
testcase_16 AC 24 ms
24,836 KB
testcase_17 AC 24 ms
25,220 KB
testcase_18 AC 24 ms
24,836 KB
testcase_19 AC 25 ms
24,836 KB
testcase_20 AC 28 ms
24,580 KB
testcase_21 AC 92 ms
25,220 KB
testcase_22 AC 92 ms
25,220 KB
testcase_23 AC 53 ms
24,836 KB
testcase_24 AC 40 ms
25,220 KB
testcase_25 AC 66 ms
24,964 KB
testcase_26 AC 65 ms
24,836 KB
testcase_27 AC 41 ms
25,220 KB
testcase_28 AC 36 ms
24,580 KB
testcase_29 AC 100 ms
24,836 KB
testcase_30 AC 63 ms
24,964 KB
testcase_31 AC 24 ms
24,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
ll llceil(ll a, ll b) { return (a + b - 1) / b; }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; }
string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; }
template<class T> void cout_line(const vector<T>& ans, ll l, ll r) { for (ll i = l; i < r; i++) { if (i != l) { cout << " "; } cout << ans[i]; } cout << '\n'; }
template<class T> void debug_line(const vector<T>& ans, ll l, ll r, ll L = 0) { cerr << "l." << L << " :"; for (ll i = l; i < r; i++) { cerr << " " << ans[i]; } cerr << '\n'; }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
static const double EPS = 1e-10;
static const double PI  = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N, M; cin >> N >> M;
    ll H = N, W = N;

    VVLL S(H, VLL(W,-1));
    S[0][0] = S[H-1][W-1] = 1;

    ll Q = 3000;
    auto masu = [&](ll h, ll w) -> bool {
        if (S[h][w] >= 0) {
            return S[h][w] == 1;
        }
        if (Q == 0) return false;
        Q--;
        cout << h+1 << " " << w+1 << endl;
        string T; cin >> T;
        if (T == "-1") exit(0);
        return (S[h][w] = (T == "Black"));
    };

    VLL dh = {-1,1,0,0};
    VLL dw = {0,0,-1,1};
    VVB visited(H,VB(W,false));
    auto dfs = [&](auto self, ll h, ll w) -> void {
        visited[h][w] = true;
        // cerr << "cur = " << h+1 << " " << w+1 << endl;
        REP(i,4) {
            ll hh = h + dh[i];
            ll ww = w + dw[i];
            if (hh < 0 || H <= hh || ww < 0 || W <= ww) continue;
            if (visited[hh][ww]) continue;
            if (hh == H-1 && ww == W-1) {
                COUT("Yes"); exit(0);
            }
            if (masu(hh, ww)) {
                self(self, hh, ww);
            }
        }
    };
    dfs(dfs, 0, 0);

    COUT("No");

    return 0;
}
0