Submission #1773255


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
int main()
{
	int H,W,h,w;
	cin>>H>>W>>h>>w;
	if(H%h==0&&W%w==0)
	{
		puts("No");
		return 0;
	}
	puts("Yes");
	int s=555;
	for(int i=1;i<=H;++i)
	{
		for(int j=1;j<=W;++j)
		{
			if(i%h==0&&j%w==0)
				cout<<-s*(h*w-1)-1<<" ";
			else cout<<s<<" ";
		}
		cout<<"\n";
	}
}

Submission Info

Submission Time
Task C - +/- Rectangle
User fjzzq2002
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1333 Byte
Status AC
Exec Time 23 ms
Memory 1280 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 23 ms 1280 KB
1_10.txt AC 23 ms 1280 KB
1_11.txt AC 23 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 22 ms 1280 KB
1_16.txt AC 22 ms 1280 KB
1_17.txt AC 22 ms 1280 KB
1_18.txt AC 1 ms 256 KB
1_19.txt AC 22 ms 1280 KB
1_20.txt AC 22 ms 1280 KB
1_21.txt AC 22 ms 1280 KB
1_22.txt AC 22 ms 1152 KB
1_23.txt AC 22 ms 1280 KB
1_24.txt AC 1 ms 256 KB
1_25.txt AC 22 ms 1280 KB
1_26.txt AC 22 ms 1280 KB
1_27.txt AC 22 ms 1152 KB
1_28.txt AC 22 ms 1152 KB
1_29.txt AC 22 ms 1152 KB
1_30.txt AC 1 ms 256 KB
1_31.txt AC 23 ms 1280 KB
1_32.txt AC 22 ms 1280 KB
1_33.txt AC 23 ms 1280 KB
1_34.txt AC 22 ms 1280 KB
1_35.txt AC 23 ms 1280 KB
1_36.txt AC 10 ms 640 KB
1_37.txt AC 18 ms 1024 KB
1_38.txt AC 16 ms 896 KB
1_39.txt AC 7 ms 512 KB
1_40.txt AC 4 ms 384 KB
1_41.txt AC 1 ms 256 KB
1_42.txt AC 1 ms 256 KB
1_43.txt AC 6 ms 512 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 10 ms 640 KB
1_48.txt AC 1 ms 256 KB
1_49.txt AC 16 ms 896 KB
1_50.txt AC 14 ms 896 KB
1_51.txt AC 6 ms 512 KB
1_52.txt AC 1 ms 256 KB
1_53.txt AC 14 ms 896 KB
1_54.txt AC 15 ms 896 KB
1_55.txt AC 9 ms 640 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