Submission #2412663

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
struct edge{int from, to; ll cost;};

int H, W, h, w;

int count_use(int i, int j){
    return min(i+1, H-i) * min(j+1, W-j);
}

int main() {
    std::ios::sync_with_stdio(0); cin.tie(0);
    
    cin >> H >> W >> h >> w;

    ll ans[H][W];
    fill(ans[0], ans[H], LLONG_MAX);

    int use_cnt[H][W];
    repp(i, H) repp(j, W) use_cnt[i][j] = count_use(i, j);
    #ifdef DEBUG
    rep(H){
        repp(j, W) cerr << use_cnt[i][j] << " ";
        cerr << endl;
    }
    cerr << endl;
    #endif

    repp(i, H-h+1){
        repp(j, W-w+1){
            int most_used_cnt = -1;
            Pii most_used;
            ll total_part = 0LL;
            repp(di, h){
                repp(dj, w){
                    if(ans[i+di][j+dj] == LLONG_MAX){
                        int cnt = use_cnt[i+di][j+dj];
                        if(cnt >= most_used_cnt){
                            most_used_cnt = cnt;
                            most_used = make_pair(i+di, j+dj);
                        }
                        ans[i+di][j+dj] = 1LL;
                        total_part++;
                    }else{
                        total_part += ans[i+di][j+dj];
                    }
                }
            }
            if(total_part >= 0){
                ans[most_used.first][most_used.second] = -h*w;
            }
        }
    }

    ll total_all = 0LL;
    rep(H)repp(j, W) total_all += ans[i][j];

    if(total_all > 0LL){
        cout << "Yes" << endl;
        rep(H){
            repp(j, W) cout << ans[i][j] << " ";
            cout << endl;
        }
    }else{
        cout << "No" << endl;
        #ifdef DEBUG
        rep(H){
            repp(j, W) cerr << ans[i][j] << " ";
            cerr << endl;
        }
        #endif
    }
}

Submission Info

Judge Result