#616013 (C++17) No.1384 Bishop and Rook

• 問題: No.1384 Bishop and Rook
• ユーザー: kmjp
• 提出日時: 2021-02-11 02:19:30
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,187 ms / 2,000 ms
• コード長: 2,058 bytes
• コンパイル時間: 1,952 ms
• コンパイル使用メモリ: 209,000 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-08 13:59:32
• 合計ジャッジ時間: 17,170 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	682 ms; 5,376 KB
testcase_02	AC	324 ms; 5,376 KB
testcase_03	AC	122 ms; 5,376 KB
testcase_04	AC	170 ms; 5,376 KB
testcase_05	AC	469 ms; 5,376 KB
testcase_06	AC	631 ms; 5,376 KB
testcase_07	AC	723 ms; 5,376 KB
testcase_08	AC	575 ms; 5,376 KB
testcase_09	AC	14 ms; 5,376 KB
testcase_10	AC	386 ms; 5,376 KB
testcase_11	AC	9 ms; 5,376 KB
testcase_12	AC	19 ms; 5,376 KB
testcase_13	AC	11 ms; 5,376 KB
testcase_14	AC	1,002 ms; 5,376 KB
testcase_15	AC	12 ms; 5,376 KB
testcase_16	AC	1,148 ms; 5,376 KB
testcase_17	AC	10 ms; 5,376 KB
testcase_18	AC	19 ms; 5,376 KB
testcase_19	AC	943 ms; 5,376 KB
testcase_20	AC	11 ms; 5,376 KB
testcase_21	AC	30 ms; 5,376 KB
testcase_22	AC	31 ms; 5,376 KB
testcase_23	AC	26 ms; 5,376 KB
testcase_24	AC	32 ms; 5,376 KB
testcase_25	AC	31 ms; 5,376 KB
testcase_26	AC	28 ms; 5,376 KB
testcase_27	AC	28 ms; 5,376 KB
testcase_28	AC	28 ms; 5,376 KB
testcase_29	AC	30 ms; 5,376 KB
testcase_30	AC	25 ms; 5,376 KB
testcase_31	AC	19 ms; 5,376 KB
testcase_32	AC	25 ms; 5,376 KB
testcase_33	AC	24 ms; 5,376 KB
testcase_34	AC	24 ms; 5,376 KB
testcase_35	AC	23 ms; 5,376 KB
testcase_36	AC	16 ms; 5,376 KB
testcase_37	AC	16 ms; 5,376 KB
testcase_38	AC	16 ms; 5,376 KB
testcase_39	AC	15 ms; 5,376 KB
testcase_40	AC	18 ms; 5,376 KB
testcase_41	AC	118 ms; 5,376 KB
testcase_42	AC	120 ms; 5,376 KB
testcase_43	AC	142 ms; 5,376 KB
testcase_44	AC	153 ms; 5,376 KB
testcase_45	AC	153 ms; 5,376 KB
testcase_46	AC	126 ms; 5,376 KB
testcase_47	AC	135 ms; 5,376 KB
testcase_48	AC	128 ms; 5,376 KB
testcase_49	AC	76 ms; 5,376 KB
testcase_50	AC	76 ms; 5,376 KB
testcase_51	AC	4 ms; 5,376 KB
testcase_52	AC	1,187 ms; 5,376 KB
testcase_53	AC	495 ms; 5,376 KB
testcase_54	AC	5 ms; 5,376 KB
testcase_55	AC	3 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T,H,W;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>H>>W;
		if(H==1&&W==1) {
			cout<<0<<endl;
			cout<<"1 1"<<endl;
			continue;
		}
		if(H%2||W%2) {
			cout<<-1<<endl;
			continue;
		}
		cout<<H*W-1<<endl;
		if(H==2) {
			for(x=0;x<W;x+=2) {
				cout<<1<<" "<<x+1<<endl;
				cout<<2<<" "<<x+2<<endl;
				cout<<2<<" "<<x+1<<endl;
				cout<<1<<" "<<x+2<<endl;
			}
		}
		else if(W==2) {
			for(y=0;y<H;y+=2) {
				cout<<y+1<<" "<<1<<endl;
				cout<<y+2<<" "<<2<<endl;
				cout<<y+1<<" "<<2<<endl;
				cout<<y+2<<" "<<1<<endl;
			}
		}
		else {
			for(y=0;y<H;y+=2) {
				if(y%4==0) {
					// right
					cout<<y+1<<" "<<2<<endl;
					cout<<y+2<<" "<<1<<endl;
					cout<<y+1<<" "<<1<<endl;
					cout<<y+2<<" "<<2<<endl;
					for(x=2;x<W;x+=2) {
						cout<<y+2<<" "<<x+1<<endl;
						cout<<y+1<<" "<<x+2<<endl;
						cout<<y+1<<" "<<x+1<<endl;
						cout<<y+2<<" "<<x+2<<endl;
					}
				}
				else {
					for(x=W-2;x>=2;x-=2) {
						cout<<y+1<<" "<<x+2<<endl;
						cout<<y+2<<" "<<x+1<<endl;
						cout<<y+2<<" "<<x+2<<endl;
						cout<<y+1<<" "<<x+1<<endl;
					}
					cout<<y+1<<" "<<x+2<<endl;
					cout<<y+2<<" "<<x+1<<endl;
					cout<<y+1<<" "<<x+1<<endl;
					cout<<y+2<<" "<<x+2<<endl;
				}
			}
		}
		
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}