結果

問題 No.1384 Bishop and Rook
ユーザー carrot46carrot46
提出日時 2021-02-07 22:24:38
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,404 bytes
コンパイル時間 1,609 ms
コンパイル使用メモリ 175,196 KB
実行使用メモリ 18,816 KB
最終ジャッジ日時 2024-07-04 16:11:19
合計ジャッジ時間 29,253 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 AC 5 ms
5,376 KB
testcase_55 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

void solve(){
    if(N == 1 && M == 1){
        cout<<"0\n1 1"<<endl;
    }else if(N == 1 || M == 1){
        cout<<"-1"<<endl;
    }else if(N == 2 || M == 2){
        bool sp = M == 2;
        if(sp) swap(N, M);
        if(M&1){
            cout<<-1<<endl;
        }else {
            vec x(N * M), y(N * M);
            rep(j, N * M / 4){
                int l = j * 2, i = j * 4;
                x[i] = l + 1; y[i] = 1;
                x[i+1] = l + 2; y[i+1] = 2;
                x[i+2] = l + 1; y[i+2] = 2;
                x[i+3] = l + 2; y[i+3] = 1;
            }
            if(sp) swap(x, y);
            cout<<N * M - 1<<endl;
            rep(i, N * M) cout<<y[i]<<' '<<x[i]<<endl;
        }
    }else if(N == 4 || M == 4){
        bool sp = M == 4;
        if(sp) swap(N, M);
        if(M&1){
            cout<<-1<<endl;
        }else {
            vec x(N * M), y(N * M);
            rep(j, M / 2){
                int l = j * 2, i = j * 4;
                x[i] = l + 1; y[i] = 3;
                x[i+1] = l + 2; y[i+1] = 4;
                x[i+2] = l + 1; y[i+2] = 4;
                x[i+3] = l + 2; y[i+3] = 3;
            }
            reps(i, M * 2, M * 4) {
                x[i] = M + 1 - x[i - M * 2];
                y[i] = 5 - y[i - M * 2];
            }
            if(sp) swap(x, y);
            cout<<N * M - 1<<endl;
            rep(i, N * M) cout<<y[i]<<' '<<x[i]<<endl;
        }
    }else if(N%2 == 0 || M%2 == 0){
        cout<<N * M - 1<<endl;
        vec x(N * M), y(N * M);
        x[0] = 2; y[0] = 1;
        x[1] = 1; y[1] = 2;
        x[2] = 1; y[2] = 1;
        x[3] = 2; y[3] = 2;
        reps(h, 1, N / 2){
            int u = h * 2, i = h * 4;
            x[i] = u + 1; y[i] = 2;
            x[i+1] = u + 2; y[i+1] = 3;
            x[i+2] = u + 1; y[i+2] = 3;
            x[i+3] = u + 2; y[i+3] = 2;
        }
        reps(l, 1, M / 2){
            int i = l * N * 2;
            if(l&1){
                reps(j, i, i + N * 2) {
                    x[j] = x[i + N * 2 - 1 - j];
                    y[j] = l * 4 + 1 - y[i + N * 2 - 1 - j];
                }
            }else{
                reps(j, i, i + N * 2) {
                    x[j] = x[j - i];
                    y[j] = y[j - i];
                }
            }
        }
        rep(i, N * M) cout<<x[i]<<' '<<y[i]<<endl;
    }else{
        cout<<-1<<endl;
    }


}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>Q;
    rep(_, Q) {
        cin>>N>>M;
        solve();
    }
}
0