結果

問題 No.1851 Regular Tiling
ユーザー woodywoody
提出日時 2022-07-05 01:01:19
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 110 ms / 2,000 ms
コード長 4,570 bytes
コンパイル時間 4,055 ms
コンパイル使用メモリ 237,108 KB
実行使用メモリ 7,680 KB
最終ジャッジ日時 2024-12-14 22:18:40
合計ジャッジ時間 6,266 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
using namespace std;
using namespace atcoder;
using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
int main(){
    int t; cin>>t;
    vector<vvi> ans(t);
    auto one_zero = [&](int ai , int l , int hi,int stnow)->void{
        int now = stnow;
        if (hi%3 == 1){
            ans[ai][now++][l] = 0;
        }
        while(now < hi+stnow){
            ans[ai][now++][l] = 1;
            ans[ai][now++][l] = 1;
            if (now == hi+stnow) break;
            ans[ai][now++][l] = 0;
        }
        return;
    };
    vi tr(t);
    rep(i,t){
        int h,w; cin>>h>>w;
        if (h == 1){
            if (w == 1){
                ans[i].resize(1 , vi(1));
                continue;
            }
            tr[i] = 1;
            swap(h , w);
            // ans[i].resize(h , vi(w));
            // one_zero(i , 0 , h , 0);
            // continue;
        }
        if (h == 2){
            if (w == 2){
                ans[i].resize(2 , vi(2,2));
                continue;
            }
            tr[i] = 1;
            swap(h , w);
        }
        ans[i].resize(h , vi(w));
        int nowl = 0;
        bool ok = false;
        if (w%4 == 1){
            one_zero(i , 0 , h , 0);
            nowl++;
        }
        if (w%4 == 2){
            // rep(j,2) rep(k,h) ans[i][k][w-1-j] = 2;
            ok = true;
            w -= 2;
        }
        while(nowl < w){
            repx(j,nowl,nowl+3){
                rep(k,h) ans[i][k][j] = 2;
            }
            one_zero(i , nowl+1 , h-2 , 1);
            nowl += 3;
            if (nowl == w) break;
            one_zero(i , nowl , h , 0);
            nowl++;
        }
        if (ok){
            one_zero(i , w , h , 0);
            one_zero(i , w+1 , h , 0);
            repx(j,w,w+2) rep(k,h) ans[i][k][j]++;
        }
    }
    rep(i,t){
        if (tr[i] == 1){
            rep(j,sz(ans[i][0])){
                rep(k,sz(ans[i])) cout << ans[i][k][j] << " ";
                cout << endl;
            }
        }else{
            rep(j,sz(ans[i])){
                rep(k,sz(ans[i][0])) cout << ans[i][j][k] << " ";
                cout << endl;
            }
        }
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0