提出 #31253253

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen(-1e9, 1e8); ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN = 1e6+50000;
const int mod = 998244353;
const int mxlogN = 20;
const int mxK = 26;
const ll inf = 1e18;
const int K = 100000;
const int mxM = 1e6+50000;
bool have[2][mxN];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m; cin >> n >> m;
    vector<pair<int,int>> ans;
    ///uvek ce biti 1 1
    queue<pair<int,int>> q;
    q.push({1,1});
    while(q.size())
    {
        auto par=q.front(); q.pop();
        if(par.first>n||par.second>m||have[0][par.first*3+par.second]||have[1][par.first+3*par.second]) continue;
        have[0][par.first*3+par.second]=1;
        have[1][par.first+3*par.second]=1;
        ans.push_back(par);
        par.first++;
        q.push(par);
        par.first--;
        par.second++;
        q.push(par);
        par.second--;
    }
    cout << ans.size() << "\n";
    for(auto par : ans) cout << par.first << " " << par.second << "\n";

}
/**
BBABBBBBBBBBBBB
*/

提出情報

ジャッジ結果