結果

問題 No.1384 Bishop and Rook
ユーザー kmjp
提出日時 2021-02-11 02:19:30
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,770 ms / 2,000 ms
コード長 2,058 bytes
コンパイル時間 2,243 ms
コンパイル使用メモリ 199,600 KB
最終ジャッジ日時 2025-01-18 17:12:11
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 55
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0