#741898 (C++17) No.1851 Regular Tiling

• 問題: No.1851 Regular Tiling
• ユーザー: KKT89
• 提出日時: 2022-02-25 21:59:24
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 76 ms / 2,000 ms
• コード長: 3,355 bytes
• コンパイル時間: 1,618 ms
• コンパイル使用メモリ: 135,132 KB
• 最終ジャッジ日時: 2025-01-28 02:03:46
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
sample	AC * 1
other	AC * 14

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q; cin >> q;
    while(q--){
        int h,w; cin >> h >> w;
        bool done = false;
        for(int _i=1;_i<=2;_i++){
            for(int _j=1;_j<=2;_j++){
                if(done)break;
                bool ok = true;
                int sum = 0;
                int turn = _i;
                while(sum < h){
                    sum += turn;
                    turn = 3-turn;
                }
                if(sum != h){
                    ok = false; continue;
                }
                sum = 0;
                turn = _j;
                while(sum < w){
                    sum += turn;
                    turn = 3-turn;
                }
                if(sum != w){
                    ok = false; continue;
                }
                if(ok)done = true;
                int t1 = _i, t2 = _j;
                for(int i=0;i<h;i++){
                    if(t1 == 1){
                        t2 = _j;
                        for(int j=0;j<w;j++){
                            if(t2 == 1){
                                cout << 0 << " "; 
                            }
                            else{
                                cout << 1 << " " << 1 << " ";
                                j++;
                            }
                            t2 = 3-t2;
                        }
                        cout << "\n";
                    }
                    else{
                        t2 = _j;
                        for(int j=0;j<w;j++){
                            if(t2 == 1){
                                cout << 1 << " "; 
                            }
                            else{
                                cout << 2 << " " << 2 << " ";
                                j++;
                            }
                            t2 = 3-t2;
                        }
                        cout << "\n";
                        t2 = _j;
                        for(int j=0;j<w;j++){
                            if(t2 == 1){
                                cout << 1 << " "; 
                            }
                            else{
                                cout << 2 << " " << 2 << " ";
                                j++;
                            }
                            t2 = 3-t2;
                        }
                        cout << "\n";
                        i++;
                    }
                    t1 = 3-t1;
                }
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX