Submission #3186981

Source Code Expand

Copy
```/* ---------- STL Libraries ---------- */

// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>

// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

/* ---------- Namespace ---------- */

using namespace std;

/* ---------- Type Abbreviation ---------- */

template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;

using ll = long long;

#define fst first
#define snd second
#define mp make_pair
#define mt make_tuple

/* ---------- conversion ---------- */

#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)

/* ---------- container ---------- */

#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))

#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()

#define gsort(b, e) sort(b, e, greater<decltype(*b)>())
#define SORT(v) sort((v).begin(), (v).end())
#define GSORT(v) sort((v).begin(), (v).end(), greater<decltype((v).front())>())

/* ---------- repetition ---------- */

#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); --i)

/* ----------- debug ---------- */

template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}

template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}

template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.fst << "," << p.snd << ")";
}

/* ---------- Constants ---------- */

// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = acos(-1);
// const double EPS = 1e-10;
// const ll dx[4] = {0, -1, 1, 0};
// const ll dy[4] = {-1, 0, 0, 1};
// mt19937 mt(LL(time(0)));

/* ---------- Short Functions ---------- */

template <typename T>
T sq(T a) {
return a * a;
}

template <typename T>
T gcd(T a, T b) {
if (a > b) return gcd(b, a);
return a == 0 ? b : gcd(b % a, a);
}

template <typename T, typename U>
T mypow(T b, U n) {
if (n == 0) return 1;
if (n == 1) return b /* % MOD */;
if (n % 2 == 0) {
return mypow(sq(b) /* % MOD */, n / 2);
} else {
return mypow(b, n - 1) * b /* % MOD */;
}
}

ll pcnt(ll b) {
return __builtin_popcountll(b);
}

/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */

// #define DEBUG

const ll p = 3000;

void solve() {
ll H, W, h, w;
cin >> H >> W >> h >> w;

ll rh = H % h, rw = W % w;
ll minus = h * w * p - (h - rh) * (w - rw) * (p + 1) + 2;

ll total = (rh * W + rw * H - rh * rw) * p - (H / h) * (W / w);

if (total <= 0) {
cout << "No" << endl;
return;
}

cout << "Yes" << endl;
FOR(i, 0, H) {
FOR(j, 0, W) {
if (i % h == h - 1 && j % w == w - 1) {
cout << -minus << " ";
continue;
}

cout << (i % h < rh || j % w < rw ? p : -1) << " ";
}
cout << endl;
}
return;
}

/* ---------- Do not edit below part ---------- */

int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(10);

#ifdef DEBUG
freopen("input.txt", "r", stdin);
int num;
cin >> num;
FOR(_, 1, num) {
cout << "++++++++++++++++++++" << endl;
solve();
}
#else
solve();
#endif

return 0;
}
```

#### Submission Info

Submission Time 2018-09-14 00:45:19+0900 C - +/- Rectangle Misteer C++14 (GCC 5.4.1) 700 4127 Byte AC 25 ms 1664 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt
All 700 / 700 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt
Case Name Status Exec Time Memory
0_00.txt 1 ms 256 KB
0_01.txt 1 ms 256 KB
0_02.txt 1 ms 256 KB
1_00.txt 1 ms 256 KB
1_01.txt 1 ms 256 KB
1_02.txt 1 ms 256 KB
1_03.txt 1 ms 256 KB
1_04.txt 1 ms 256 KB
1_05.txt 1 ms 256 KB
1_06.txt 1 ms 256 KB
1_07.txt 1 ms 256 KB
1_08.txt 1 ms 256 KB
1_09.txt 25 ms 1024 KB
1_10.txt 25 ms 1536 KB
1_11.txt 25 ms 1664 KB
1_12.txt 1 ms 256 KB
1_13.txt 1 ms 256 KB
1_14.txt 1 ms 256 KB
1_15.txt 23 ms 1024 KB
1_16.txt 23 ms 1536 KB
1_17.txt 23 ms 1280 KB
1_18.txt 2 ms 256 KB
1_19.txt 23 ms 1024 KB
1_20.txt 23 ms 1024 KB
1_21.txt 23 ms 1024 KB
1_22.txt 23 ms 1536 KB
1_23.txt 23 ms 1280 KB
1_24.txt 2 ms 256 KB
1_25.txt 21 ms 1536 KB
1_26.txt 20 ms 1536 KB
1_27.txt 21 ms 1536 KB
1_28.txt 21 ms 1536 KB
1_29.txt 20 ms 1536 KB
1_30.txt 2 ms 256 KB
1_31.txt 23 ms 1664 KB
1_32.txt 23 ms 1280 KB
1_33.txt 23 ms 1280 KB
1_34.txt 23 ms 1536 KB
1_35.txt 23 ms 1536 KB
1_36.txt 10 ms 640 KB
1_37.txt 18 ms 1280 KB
1_38.txt 17 ms 896 KB
1_39.txt 8 ms 512 KB
1_40.txt 4 ms 384 KB
1_41.txt 1 ms 256 KB
1_42.txt 1 ms 256 KB
1_43.txt 7 ms 512 KB
1_44.txt 1 ms 256 KB
1_45.txt 1 ms 256 KB
1_46.txt 1 ms 256 KB
1_47.txt 10 ms 768 KB
1_48.txt 1 ms 256 KB
1_49.txt 16 ms 896 KB
1_50.txt 14 ms 896 KB
1_51.txt 6 ms 512 KB
1_52.txt 1 ms 256 KB
1_53.txt 14 ms 768 KB
1_54.txt 14 ms 1024 KB
1_55.txt 9 ms 640 KB
1_56.txt 1 ms 256 KB
1_57.txt 1 ms 256 KB
1_58.txt 1 ms 256 KB
1_59.txt 1 ms 256 KB