結果

問題 No.1384 Bishop and Rook
ユーザー rniyarniya
提出日時 2021-02-07 23:12:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 117 ms / 2,000 ms
コード長 5,796 bytes
コンパイル時間 2,736 ms
コンパイル使用メモリ 203,060 KB
実行使用メモリ 13,236 KB
最終ジャッジ日時 2023-09-18 00:49:49
合計ジャッジ時間 8,917 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 69 ms
12,028 KB
testcase_02 AC 33 ms
5,048 KB
testcase_03 AC 14 ms
4,380 KB
testcase_04 AC 19 ms
4,380 KB
testcase_05 AC 49 ms
6,148 KB
testcase_06 AC 63 ms
8,360 KB
testcase_07 AC 75 ms
12,408 KB
testcase_08 AC 59 ms
8,444 KB
testcase_09 AC 3 ms
4,380 KB
testcase_10 AC 39 ms
7,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 3 ms
4,380 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 96 ms
12,296 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 114 ms
11,868 KB
testcase_17 AC 3 ms
4,380 KB
testcase_18 AC 3 ms
4,376 KB
testcase_19 AC 94 ms
12,588 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 4 ms
4,380 KB
testcase_22 AC 4 ms
4,376 KB
testcase_23 AC 4 ms
4,380 KB
testcase_24 AC 4 ms
4,376 KB
testcase_25 AC 4 ms
4,376 KB
testcase_26 AC 4 ms
4,380 KB
testcase_27 AC 4 ms
4,376 KB
testcase_28 AC 5 ms
4,376 KB
testcase_29 AC 4 ms
4,376 KB
testcase_30 AC 4 ms
4,380 KB
testcase_31 AC 3 ms
4,380 KB
testcase_32 AC 3 ms
4,376 KB
testcase_33 AC 4 ms
4,380 KB
testcase_34 AC 3 ms
4,376 KB
testcase_35 AC 3 ms
4,376 KB
testcase_36 AC 3 ms
4,380 KB
testcase_37 AC 3 ms
4,376 KB
testcase_38 AC 3 ms
4,376 KB
testcase_39 AC 3 ms
4,376 KB
testcase_40 AC 3 ms
4,376 KB
testcase_41 AC 13 ms
4,376 KB
testcase_42 AC 12 ms
4,376 KB
testcase_43 AC 15 ms
4,376 KB
testcase_44 AC 17 ms
4,380 KB
testcase_45 AC 16 ms
4,376 KB
testcase_46 AC 13 ms
4,376 KB
testcase_47 AC 14 ms
4,380 KB
testcase_48 AC 14 ms
4,376 KB
testcase_49 AC 9 ms
4,376 KB
testcase_50 AC 9 ms
4,376 KB
testcase_51 AC 2 ms
4,376 KB
testcase_52 AC 117 ms
13,236 KB
testcase_53 AC 49 ms
6,184 KB
testcase_54 AC 2 ms
4,376 KB
testcase_55 AC 2 ms
4,376 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 char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int dx[3][4] = {{0, 1, 1, 0}, {1, 0, 0, 1}, {0, 1, 0, 1}}, dy[3][4] = {{0, 1, 0, 1}, {1, 0, 1, 0}, {0, 1, 1, 0}};

void solve() {
    int N, M;
    cin >> N >> M;

    if (N == 1 && M == 1) {
        cout << 0 << '\n';
        cout << 1 << ' ' << 1 << '\n';
        return;
    }

    if ((N & 1) || (M & 1)) {
        cout << -1 << '\n';
        return;
    }

    int x = 0, y = 0;
    vector<pair<int, int>> ans;

    if (N == 2) {
        while ((int)ans.size() < N * M) {
            for (int i = 0; i < 4; i++) ans.emplace_back(x + dx[0][i] + 1, y + dy[0][i] + 1);
            y += 2;
        }
    } else if (M == 2) {
        while ((int)ans.size() < N * M) {
            for (int i = 0; i < 4; i++) ans.emplace_back(x + dx[2][i] + 1, y + dy[2][i] + 1);
            x += 2;
        }
    } else {
        while ((int)ans.size() < N * M) {
            int cur, nx, ny;
            if (x % 4 == 0) {
                if (y == M - 2) {
                    cur = 2;
                    nx = 2, ny = 0;
                } else {
                    cur = 0;
                    nx = 0, ny = 2;
                }
            } else {
                if (y == M - 2) {
                    cur = 2;
                    nx = 0, ny = -2;
                } else if (y == 0) {
                    cur = 1;
                    nx = 2, ny = 0;
                } else {
                    cur = 1;
                    nx = 0, ny = -2;
                }
            }
            for (int i = 0; i < 4; i++) ans.emplace_back(x + dx[cur][i] + 1, y + dy[cur][i] + 1);
            x += nx, y += ny;
            // debug(cur, x, y);
        }
    }

    cout << ans.size() - 1 << '\n';
    for (auto p : ans) cout << p.first << ' ' << p.second << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}
0