結果
| 問題 | No.3744 XY Tiling |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2026-09-19 17:54:15 |
| 言語 | C++23 (gcc 15.3.0 + boost 1.92.0 + ACL) |
| 結果 |
WA
不安定
|
| 実行時間 | - |
| コード長 | 3,108 bytes |
| 記録 | |
| コンパイル時間 | 2,090 ms |
| コンパイル使用メモリ | 337,792 KB |
| 実行使用メモリ | 10,052 KB |
| 最終ジャッジ日時 | 2026-09-19 17:54:43 |
| 合計ジャッジ時間 | 5,610 ms |
|
ジャッジサーバーID (参考情報) |
judge4_1 / judge1_0 |
(要ログイン)
| サブタスク | 配点 | 結果 |
|---|---|---|
| 部分点 | 60 % | AC * 9 WA * 10 |
| 満点 | 40 % | AC * 25 WA * 35 |
| 合計 | 5 * 0% = 0 点 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
//高速化
struct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;
#define endl '\n' //インタラクティブ問題の時は消す
//型
using ll = long long;
using ld = long double;
// for文
#define overload4(a, b, c, d, e, ...) e
#define rep1(n) for(ll i = 0; i < n; i++)
#define rep2(i, n) for(ll i = 0; i < n; i++)
#define rep3(i, a, b) for(ll i = a; i < b; i++)
#define rep4(i, a, b, step) for(ll i = a; i < b; i+= step)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define per1(n) for(ll i = n-1; i >= 0; i--)
#define per2(i, n) for(ll i = n-1; i >= 0; i--)
#define per3(i, a, b) for(ll i = b-1; i >= a; i--)
#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)
#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)
//関数
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}
template<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}
//定数
constexpr ll mod = 998244353;
constexpr ll minf=-(1<<29);
constexpr ll inf=(1<<29);
constexpr ll MINF=-(1LL<<60);
constexpr ll INF=(1LL<<60);
const int dx[4] ={-1, 0, 1, 0};
const int dy[4] ={ 0, 1, 0,-1};
const int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};
const int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};
void solve();
int main() {
int t = 1;
// cin >> t;
while(t--)solve();
}
void solve(){
int h,w;
cin >> h >> w;
if(h == 2) {
cout << 2 << endl;
rep(i,0,w){
cout << 1 << " " << i+1 << " " << 1 << " " << 2 << " " << i+1 << " " << 2 << " " << endl;
}
return;
}
if(w == 2) {
cout << 2 << endl;
rep(i,0,h){
cout << i+1 << " " << 1 << " " << 1 << " " << i+1 << " " << 2 << " " << 2 << " " << endl;
}
return;
}
if(h == 4) {
cout << 3 << endl;
rep(i,0,w){
cout << 1 << " " << i+1 << " " << 1 << " " << 2 << " " << i+1 << " " << 2 << " " << endl;
cout << 3 << " " << i+1 << " " << 2 << " " << 4 << " " << i+1 << " " << 3 << " " << endl;
}
return;
}
if(w == 4) {
cout << 3 << endl;
rep(i,0,h){
cout << i+1 << " " << 1 << " " << 1 << " " << i+1 << " " << 2 << " " << 2 << " " << endl;
cout << i+1 << " " << 3 << " " << 2 << " " << i+1 << " " << 4 << " " << 3 << " " << endl;
}
return;
}
cout << 4 << endl;
rep(i,0,w){
cout << 1 << " " << i+1 << " " << 1 << " " << 2 << " " << i+1 << " " << 2 << " " << endl;
}
rep(i,0,w){
cout << h << " " << i+1 << " " << 4 << " " << h-1 << " " << i+1 << " " << 3 << " " << endl;
}
rep(i,2,h-2){
rep(j,0,w/2){
int a = 2,b = 3;
cout << i+1 << " " << j*2+1 << " " << a << " " << i+1 << " " << j*2+2 << " " << b << " " << endl;
}
}
}