Submission #1389689


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int, int> pii;

#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define REP(i, a, b)  for(int i = (a), i##end = (b); i < i##end; ++i)
#define DREP(i, a, b) for(int i=(a-1), i##end = (b); i >=i##end; --i)

template <typename T> bool chkmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> bool chkmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int oo = 0x3f3f3f3f;
const int maxn = 400 + 10;
const int mod = 1e9 + 7;

template<typename T> T read() {
    T n(0), f(1);
    char ch = getchar();
    for( ;!isdigit(ch); ch = getchar()) if(ch == '-') f = -1;
    for( ; isdigit(ch); ch = getchar()) n = n * 10 + ch - 48; 
    return n * f;
}

int H, W, h, w;
int ans[1000][1000];

int main() {
#ifdef Wearry
    freopen("data.txt", "r", stdin);
    freopen("ans.txt", "w", stdout);
#endif

    cin >> H >> W >> h >> w;
    if(H % h == 0 && W % w == 0) return puts("No"), 0;

    if(H%h) {
        REP(i, 0, H) {
            REP(j, 0, W) ans[i][j] = (i % h == 0) ? 1000 * (h-1) - 1 : -1000;
        }
    }else {
        REP(i, 0, H) {
            REP(j, 0, W) ans[i][j] = (j % w == 0) ? 1000 * (w-1) - 1 : -1000;
        }
    }

    puts("Yes");
    REP(i, 0, H) 
        REP(j, 0, W) {
            printf("%d%c", ans[i][j], " \n"[j == W-1]);
        }
     
    return 0;
}

Submission Info

Submission Time
Task C - +/- Rectangle
User Wearry
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1470 Byte
Status AC
Exec Time 26 ms
Memory 3712 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 63
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 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 AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 26 ms 3712 KB
1_10.txt AC 26 ms 3712 KB
1_11.txt AC 26 ms 3456 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 26 ms 3712 KB
1_16.txt AC 26 ms 3712 KB
1_17.txt AC 26 ms 3456 KB
1_18.txt AC 2 ms 2176 KB
1_19.txt AC 25 ms 3712 KB
1_20.txt AC 25 ms 3712 KB
1_21.txt AC 25 ms 3712 KB
1_22.txt AC 25 ms 3712 KB
1_23.txt AC 25 ms 3712 KB
1_24.txt AC 2 ms 2176 KB
1_25.txt AC 25 ms 3712 KB
1_26.txt AC 25 ms 3712 KB
1_27.txt AC 25 ms 3712 KB
1_28.txt AC 25 ms 3584 KB
1_29.txt AC 25 ms 3584 KB
1_30.txt AC 2 ms 2176 KB
1_31.txt AC 25 ms 3456 KB
1_32.txt AC 25 ms 3456 KB
1_33.txt AC 25 ms 3456 KB
1_34.txt AC 25 ms 3456 KB
1_35.txt AC 26 ms 3456 KB
1_36.txt AC 11 ms 1664 KB
1_37.txt AC 21 ms 3072 KB
1_38.txt AC 19 ms 2688 KB
1_39.txt AC 9 ms 1792 KB
1_40.txt AC 5 ms 1792 KB
1_41.txt AC 1 ms 256 KB
1_42.txt AC 1 ms 384 KB
1_43.txt AC 7 ms 1280 KB
1_44.txt AC 1 ms 256 KB
1_45.txt AC 1 ms 256 KB
1_46.txt AC 1 ms 256 KB
1_47.txt AC 11 ms 1920 KB
1_48.txt AC 1 ms 256 KB
1_49.txt AC 18 ms 2944 KB
1_50.txt AC 16 ms 2816 KB
1_51.txt AC 7 ms 1024 KB
1_52.txt AC 1 ms 256 KB
1_53.txt AC 16 ms 2432 KB
1_54.txt AC 17 ms 2432 KB
1_55.txt AC 11 ms 2560 KB
1_56.txt AC 1 ms 256 KB
1_57.txt AC 1 ms 256 KB
1_58.txt AC 1 ms 256 KB
1_59.txt AC 1 ms 256 KB