E. Connected Component on a Chessboard

https://codeforc.es/contest/1196/problem/E

思路：从少的开始构造，从第二行开始构造；例如：先白块，(2,2)（2,4）..再插黑块；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e6+9;
const int maxm=4e5+9;
const int mod=1e9+7;

vector<pii >ans1,ans2;
int b,w;
int tb,tw;
void out(vector<pii >ans1,vector<pii >ans2,bool f)
{
    cout<<"YES"<<endl;
    if(f)
    {
        //fl();
        for(int i=0;i<tw;i++)
        {
            cout<<ans1[i].first<<" "<<ans1[i].second+1<<endl;
        }
        for(int i=0;i<tb;i++)
        {
            cout<<ans2[i].first<<" "<<ans2[i].second+1<<endl;
        }
    }
    else
    {
        for(int i=0;i<tw;i++)
        {
            cout<<ans1[i].first<<" "<<ans1[i].second<<endl;
        }
        for(int i=0;i<tb;i++)
        {
            cout<<ans2[i].first<<" "<<ans2[i].second<<endl;
        }
    }
}
int main()
{

    int q;
    cin>>q;
    while(q--)
    {
        ans1.clear();
        ans2.clear();

        bool f=0;
        cin>>b>>w;
        if(b<w)
        {
            swap(b,w);
            f=1;
        }

        tb=b;
        tw=w;

        if(b>w*2+w+1)
        {
            cout<<"NO"<<endl;
            continue;
        }


        for(int i=1;i<=w;i++)
        {
            ans1.pb({2,i*2});
        }

        for(int i=1;i<=w;i++)
        {
            ans2.pb({2,i*2-1});
        }

        b-=w;


        if(b==0)
        {
            out(ans1,ans2,f);
            continue;
        }

        b--;
        ans2.pb({2,2*w+1});

        if(b==0)
        {
            out(ans1,ans2,f);
            continue;
        }


        int cnt0=1;
        int cnt1=1;

        for(int i=1;i<=w;i++)
        {
            b--;
            ans2.pb({1,2*cnt0});
            cnt0++;
            if(b==0)
            {
                out(ans1,ans2,f);
                break;
            }

            b--;
            ans2.pb({3,2*cnt1});
            cnt1++;
            if(b==0)
            {
                out(ans1,ans2,f);
                break;
            }
        }

    }
    return 0;
}