結果
| 問題 | No.3598 Queen vs. King |
| コンテスト | |
| ユーザー |
 coindarw
|
| 提出日時 | 2026-07-24 22:17:32 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.90.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 8,532 bytes |
| 記録 | |
| コンパイル時間 | 3,943 ms |
| コンパイル使用メモリ | 378,392 KB |
| 実行使用メモリ | 6,016 KB |
| 平均クエリ数 | 563.67 |
| 最終ジャッジ日時 | 2026-07-24 22:22:07 |
| 合計ジャッジ時間 | 5,180 ms |
|
ジャッジサーバーID （参考情報） |
judge1_0 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 3 RE * 7 |
ソースコード
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif
using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;
// clang-format off
using vint = vector<int>;using vvint = vector<vector<int>>;using vvvint = vector<vector<vector<int>>>;
using vll = vector<ll>;using vvll = vector<vector<ll>>;using vvvll = vector<vector<vector<ll>>>;
using vlll = vector<lll>;using vvlll = vector<vector<lll>>;using vvvlll = vector<vector<vector<lll>>>;
using vchar = vector<char>;using vvchar = vector<vector<char>>;using vvvchar = vector<vector<vector<char>>>;
using vstr = vector<string>;using vvstr = vector<vector<string>>;using vvvstr = vector<vector<vector<string>>>;
using vpi = vector<pair<int, int>>;using vvpi = vector<vector<pair<int, int>>>;using vvpint = vector<vector<pair<int, int>>>;
using vpl = vector<pair<ll, ll>>;using vvpl = vector<vector<pair<ll, ll>>>;using vvplint = vector<vector<pair<ll, int>>>;
using vbool = vector<bool>;using vvbool = vector<vector<bool>>;using vvvbool = vector<vector<vector<bool>>>;
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}
template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }
template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}
template <typename T>void oupl(const T& a) {cout << a;}
template <typename T, typename... Args>void oupl(const T& a, const Args&... args) {cout << a << " ", oupl(args...);}
inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
auto minE(const auto&a) {
return min_element(a.begin(), a.end());
}
auto maxE(const auto&a) {
return max_element(a.begin(), a.end());
}
#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on
#pragma GCC diagnostic push
#pragma GCC diagnostic error "-Wshadow"
int main() {
ll t;
inp(t);
while (t--) {
ll h, w, x, y;
inp(h, w, x, y);
auto query = [&](ll nx, ll ny) -> pair<ll, ll> {
cout << nx << " " << ny << endl;
ll xx, yy;
inp(xx, yy);
if (xx == -1) {
exit(1);
}
return {xx, yy};
};
ll cx, cy;
if (h == x || w == y) {
if (h == x) {
cx = h - 1, cy = 1;
} else {
cx = 1, cy = w - 1;
}
} else {
if (h == 3 && w == 3) {
cx = 1, cy = 2;
} else {
if (h - 2 == 1) {
cx = 1, cy = w - 2;
} else {
cx = h - 2, cy = 1;
}
}
}
tie(x, y) = query(cx, cy);
if (x == 0 && y == 0) {
continue;
}
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
tuple<ll, ll, ll> nxt = {inf, inf, inf};
rep(i, 2) {
rep(d1, 8) {
rep(d2, 8) {
ll px = x + dx[d1] + dx[d2];
ll py = y + dy[d1] + dy[d2];
if (px == cx && py == cy) continue;
if (px == 0 || py == 0 || px == h + 1 || py == w + 1) continue;
if (px == cx || py == cy || px + py == cx + cy || px - py == cx - cy) {
ll cnt = 0;
rep(d3, 8) {
ll ax = x + dx[d3];
ll ay = y + dy[d3];
if (ax == 0 || ay == 0 || ax == h + 1 || ay == w + 1) continue;
if (px == ax || py == ay || px + py == ax + ay || px - py == ax - ay) {
continue;
}
cnt++;
}
nxt = min(nxt, {cnt, px, py});
}
}
}
ll nxtX = get<1>(nxt);
ll nxtY = get<2>(nxt);
cx = nxtX;
cy = nxtY;
tie(x, y) = query(cx, cy);
if (x == 0 && y == 0) {
break;
}
}
}
}
#pragma GCC diagnostic pop