Submission #1361800


Source Code Expand

Copy
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define itrep(i, a) for (auto i = (a).begin(); i != (a).end(); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

int board[510][510];

string yes = "Yes", no = "No";

signed main() {
	int H, W, h, w;
	cin >> H >> W >> h >> w;

	if (h == 1 || w == 1) {
		cout << no << endl;
		return 0;
	}

	int soto = h + w - 1;
	int naka = h * w - soto;

	int num1 = 1 + (naka - 1) / soto;
	int num2 = -(soto * num1 - 1) / naka - 2;

	rep(y, h) rep(x, w) board[y][x] = num2;
	rep(y, h) board[y][0] = num1;
	rep(x, w) board[0][x] = num1;

	int dif = num1 * soto + num2 * naka;	// -1であって欲しい
	board[1][1] -= dif + 1;

	rep(y, H) rep(x, W) {
		int tx = x % w;
		int ty = y % h;
		board[y][x] = board[ty][tx];
	}

	int sum = 0;
	rep(y, H) rep(x, W) {
		sum += board[y][x];
	}
	if (sum <= 0) {
		cout << no << endl;
	} else {
		cout << yes << endl;
		rep(y, H) {
			rep(x, W) {
				cout << board[y][x];
				if (x < W - 1) cout << ' ';
			}
			cout << endl;
		}
	}

    return 0;
}

Submission Info

Submission Time
Task C - +/- Rectangle
User iwashi31
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1757 Byte
Status
Exec Time 25 ms
Memory 2944 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt
All 0 / 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 1 ms 256 KB
1_10.txt 1 ms 256 KB
1_11.txt 1 ms 256 KB
1_12.txt 1 ms 256 KB
1_13.txt 1 ms 256 KB
1_14.txt 5 ms 2176 KB
1_15.txt 25 ms 2944 KB
1_16.txt 25 ms 2944 KB
1_17.txt 25 ms 2816 KB
1_18.txt 1 ms 256 KB
1_19.txt 1 ms 256 KB
1_20.txt 25 ms 2944 KB
1_21.txt 25 ms 2944 KB
1_22.txt 25 ms 2944 KB
1_23.txt 25 ms 2816 KB
1_24.txt 1 ms 256 KB
1_25.txt 1 ms 256 KB
1_26.txt 25 ms 2944 KB
1_27.txt 25 ms 2944 KB
1_28.txt 25 ms 2944 KB
1_29.txt 24 ms 2816 KB
1_30.txt 1 ms 256 KB
1_31.txt 1 ms 256 KB
1_32.txt 24 ms 2816 KB
1_33.txt 24 ms 2816 KB
1_34.txt 24 ms 2816 KB
1_35.txt 5 ms 2176 KB
1_36.txt 11 ms 1408 KB
1_37.txt 21 ms 2560 KB
1_38.txt 18 ms 2304 KB
1_39.txt 8 ms 1664 KB
1_40.txt 5 ms 1664 KB
1_41.txt 2 ms 1024 KB
1_42.txt 1 ms 384 KB
1_43.txt 7 ms 1152 KB
1_44.txt 1 ms 768 KB
1_45.txt 2 ms 1536 KB
1_46.txt 1 ms 896 KB
1_47.txt 11 ms 1664 KB
1_48.txt 3 ms 1408 KB
1_49.txt 18 ms 2432 KB
1_50.txt 16 ms 2432 KB
1_51.txt 7 ms 896 KB
1_52.txt 1 ms 1024 KB
1_53.txt 16 ms 2048 KB
1_54.txt 16 ms 2048 KB
1_55.txt 11 ms 2304 KB
1_56.txt 1 ms 256 KB
1_57.txt 2 ms 1152 KB
1_58.txt 3 ms 2176 KB
1_59.txt 3 ms 2048 KB