#1189225 (C++23) No.3744 XY Tiling

• 問題: No.3744 XY Tiling
• ユーザー: noya2
• 提出日時: 2026-09-19 17:07:09
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: RE
• 実行時間: -
• コード長: 6,024 bytes
• コンパイル時間: 2,138 ms
• コンパイル使用メモリ: 346,016 KB
• 実行使用メモリ: 10,056 KB
• 最終ジャッジ日時: 2026-09-19 17:07:23
• 合計ジャッジ時間: 8,119 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_0

サブタスク	配点	結果
部分点	60 %	AC * 19
満点	40 %	AC * 19 RE * 41
合計	5 * 60% = 300 点

ソースコード

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

struct dom {
    int x1, y1, c1;
    int x2, y2, c2;
    friend ostream &operator<<(ostream &os, dom d){
        return os << d.x1+1 << ' ' << d.y1+1 << ' ' << d.c1 << ' ' << d.x2+1 << ' ' << d.y2+1 << ' ' << d.c2;
    }
};

vector<dom> make_even(int h, int w){
    if (h > w){
        auto ans = make_even(w,h);
        for (auto &[x1, y1, c1, x2, y2, c2] : ans){
            swap(x1,y1);
            swap(x2,y2);
        }
        return ans;
    }
    vector<dom> ans;
    int lx = 0, rx = h, ly = 0, ry = w;
    int p = 1;
    while (true){
        if (rx - lx == 2){
            int u = lx, d = lx+1;
            repp(j,ly,ry){
                ans.push_back({u,j,p,d,j,2});
            }
            break;
        }
        if (rx - lx == 4){
            int uc = p, dc = 4-p;
            repp(j,ly,ry){
                ans.push_back({lx,j,uc,lx+1,j,2});
                ans.push_back({lx+2,j,2,lx+3,j,dc});
            }
            break;
        }
        repp(i,lx,rx-2){
            ans.push_back({i,ly,p,i,ly+1,2});
        }
        repp(j,ly,ry-2){
            ans.push_back({rx-2,j,p,rx-1,j,2});
        }
        repp(i,lx+2,rx){
            ans.push_back({i,ry-2,2,i,ry-1,4-p});
        }
        repp(j,ly+2,ry){
            ans.push_back({lx,j,2,lx+1,j,4-p});
        }
        lx += 2, rx -= 2;
        ly += 2, ry -= 2;
        p = 4-p;
    }
    return ans;
}

void solve(){
    int h, w; in(h,w);
    assert(h % 2 == 0 && w % 2 == 0);
    auto ans = make_even(h,w);
    int ma = 0;
    for (auto d : ans){
        chmax(ma,d.c1);
        chmax(ma,d.c2);
    }
    out(ma);
    for (auto d : ans){
        out(d);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}