Submission #3229915


Source Code Expand

/* 
我的思路:直接按样例一的方法构造
*/
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10, INF = 1e9 + 10;
inline int read() {
	char c = getchar(); int x = 0, f = 1;
	while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
	while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
	return x * f;
}
int N, M, h, w;
int ans[501][501];
main() {
	N = read(); M = read(); h = read(); w = read();
	if(N % h == 0 && M % w == 0) {puts("No"); return 0;}

	int sum = 0;
	for(int i = 1; i <= N; i++)
		for(int j = 1; j <= M; j++) {
			if(i % h == 0 && j % w == 0) ans[i][j] =  - h * w;
			else ans[i][j] = 1;			
			sum += ans[i][j];
		}
	if(sum <= 0) {puts("No"); return 0;}
	puts("Yes");
	for(int i = 1; i <= N; i++, puts(""))
		for(int j = 1; j <= M; j++)
			printf("%d ", ans[i][j]);
	return 0;
}
/*

*/

Submission Info

Submission Time
Task C - +/- Rectangle
User attack
Language C++14 (GCC 5.4.1)
Score 0
Code Size 884 Byte
Status WA
Exec Time 21 ms
Memory 1664 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 3
AC × 54
WA × 9
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 WA 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt WA 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 WA 3 ms 1280 KB
1_10.txt AC 21 ms 1664 KB
1_11.txt WA 3 ms 1280 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 20 ms 1664 KB
1_16.txt AC 20 ms 1664 KB
1_17.txt AC 20 ms 1664 KB
1_18.txt WA 2 ms 1280 KB
1_19.txt WA 2 ms 1280 KB
1_20.txt AC 20 ms 1664 KB
1_21.txt AC 20 ms 1664 KB
1_22.txt AC 20 ms 1664 KB
1_23.txt AC 20 ms 1664 KB
1_24.txt AC 2 ms 1280 KB
1_25.txt AC 20 ms 1664 KB
1_26.txt AC 20 ms 1664 KB
1_27.txt AC 20 ms 1664 KB
1_28.txt AC 20 ms 1664 KB
1_29.txt AC 20 ms 1664 KB
1_30.txt WA 2 ms 1280 KB
1_31.txt WA 2 ms 1280 KB
1_32.txt AC 21 ms 1664 KB
1_33.txt AC 20 ms 1664 KB
1_34.txt AC 20 ms 1664 KB
1_35.txt WA 2 ms 1280 KB
1_36.txt AC 9 ms 896 KB
1_37.txt AC 17 ms 1536 KB
1_38.txt AC 15 ms 1280 KB
1_39.txt AC 7 ms 1024 KB
1_40.txt AC 4 ms 1024 KB
1_41.txt AC 1 ms 256 KB
1_42.txt AC 2 ms 384 KB
1_43.txt AC 6 ms 768 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 9 ms 1024 KB
1_48.txt AC 1 ms 256 KB
1_49.txt AC 14 ms 1408 KB
1_50.txt AC 13 ms 1408 KB
1_51.txt AC 6 ms 640 KB
1_52.txt AC 1 ms 256 KB
1_53.txt AC 13 ms 1152 KB
1_54.txt AC 14 ms 1152 KB
1_55.txt AC 9 ms 1280 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