#1173243 (C++23) No.3601 Queen Dist Sum with One Wall

• 問題: No.3601 Queen Dist Sum with One Wall
• ユーザー: abc864197532
• 提出日時: 2026-07-24 22:44:50
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 34 ms / 2,000 ms
• コード長: 2,772 bytes
• コンパイル時間: 2,009 ms
• コンパイル使用メモリ: 331,696 KB
• 実行使用メモリ: 5,888 KB
• 最終ジャッジ日時: 2026-07-24 22:44:57
• 合計ジャッジ時間: 6,034 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_1

ファイルパターン	結果
sample	AC * 1
other	AC * 22

ソースコード

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
#ifdef Doludu
template <typename T>
ostream& operator << (ostream &o, vector <T> vec) {
    o << "{"; int f = 0;
    for (T i : vec) o << (f++ ? " " : "") << i;
    return o << "}";
}
void bug__(int c, auto ...a) {
    cerr << "\e[1;" << c << "m";
    (..., (cerr << a << " "));
    cerr << "\e[0m" << endl;
}
#define bug_(c, x...) bug__(c, __LINE__, "[" + string(#x) + "]", x)
#define bug(x...) bug_(32, x)
#define bugv(x...) bug_(36, vector(x))
#define safe bug_(33, "safe")
#else
#define bug(x...) void(0)
#define bugv(x...) void(0)
#define safe void(0)
#endif
const int mod = 998244353, N = 300005;

void solve() {
    auto good = [&](int x1, int y1, int x2, int y2) {
        return x1 == x2 || y1 == y2 || x1 + y1 == x2 + y2 || x1 - y1 == x2 - y2;
    };
    int n, m, x1, y1, x2, y2;
    cin >> n >> m >> x1 >> y1 >> x2 >> y2, --x1, --y1, --x2, --y2;
    ll base = 2ll * n * m - 2;
    base -= m - 1;
    base -= n - 1;
    {
        int l = 0, r = n - 1;
        l = max(l, x1 + y1 - (m - 1));
        r = min(r, x1 + y1);
        base -= r - l;
    }
    {
        int l = 0, r = n - 1;
        l = max(l, x1 - y1);
        r = min(r, x1 - y1 + m - 1);
        base -= r - l;
    }
    if (!good(x1, y1, x2, y2)) {
        cout << base - 2 << "\n";
        return;
    } else if (x1 + y1 == x2 + y2) {
        base--;
        if (x1 < x2) {
            int more = min(y2, n - 1 - x2);
            base += more;
        } else {
            int more = min(x2, m - 1 - y2);
            base += more;
        }
        cout << base << "\n";
        return;
    } else if (x1 - y1 == x2 - y2) {
        base--;
        if (x1 < x2) {
            int more = min(m - 1 - y2, n - 1 - x2);
            base += more;
        } else {
            int more = min(x2, y2);
            base += more;
        }
        cout << base << "\n";
        return;
    }
    if (y1 == y2) {
        swap(n, m), swap(x1, y1), swap(x2, y2);
    }
    // x1 == x2
    if (y1 > y2) {
        y1 = m - 1 - y1;
        y2 = m - 1 - y2;
    }
    base--;
    bug(x1, y1, x2, y2, n, m);
    // y1 < y2
    int l = y2 - y1 + 1, r = m - 1 - y1;
    // [l, r]
    int up = max(x1, n - x1 - 1);
    // 2, 4, ..., 2up
    // 1, 2, ..., up
    auto f = [&](int x) {
        return min(x, up) + min(x / 2, up) - min(x / 2, up / 2);
    };
    int tot = r - l + 1;
    int two = f(r) - f(l - 1);
    bug(tot, two);
    base += two;
    base += 2 * (tot - two);

    cout << base << "\n";
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}