結果

問題 No.1588 Connection
ユーザー rniyarniya
提出日時 2021-07-08 22:52:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 5,108 bytes
コンパイル時間 2,214 ms
コンパイル使用メモリ 206,508 KB
実行使用メモリ 25,476 KB
平均クエリ数 334.00
最終ジャッジ日時 2024-07-17 11:41:32
合計ジャッジ時間 5,086 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

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

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int N, M;

int query(int a, int b) {
    assert(0 <= a && a < N);
    assert(0 <= b && b < N);
    cout << a + 1 << ' ' << b + 1 << endl;
    string T;
    cin >> T;
    if (T == "-1") exit(0);
    return T == "Black";
}

void answer(int flag) { cout << (flag ? "Yes" : "No") << endl; }

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> M;

    if (M < 2 * N - 1) {
        answer(0);
        return 0;
    }

    vector<vector<int>> res(N, vector<int>(N, -1));
    res[0][0] = res[N - 1][N - 1] = 1;
    auto dfs = [&](auto self, int x, int y) -> void {
        for (int i = 0; i < 4; i++) {
            int nx = x + dx[i], ny = y + dy[i];
            if (nx < 0 || N <= nx || ny < 0 || N <= ny) continue;
            if (nx == N - 1 && ny == N - 1) {
                answer(1);
                exit(0);
            }
            if (res[nx][ny] != -1) continue;
            int T = (M > 0 ? query(nx, ny) : 1);
            res[nx][ny] = T;
            if (!T)
                M--;
            else
                self(self, nx, ny);
        }
    };
    dfs(dfs, 0, 0);

    answer(0);
    return 0;
}
0