Submission #1771553
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define re(i,a,b) for(int i=(a);i<(b);i++)
#define repd(i,a,b) for(int i=(a);i>=(b);i--)
#define run(a) for(int k=head[a];k;k=e[k].ne)
#define v e[k].t
#define clr(a) memset(a,0,sizeof(a));
#define il inline
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define mp make_pair
#define pb push_back
#define w1 first
#define w2 second
#define adm(a,b,c) {a=a+b;if(a>=c)a-=c;else if(a<0)a+=c;}
typedef double db;
typedef long long ll;typedef long double ld;typedef unsigned long long ull;
typedef pair<ll,ll> pa;
const int N=1e6+5,M=5e3+5,INF=1e9,mod=998244353;
const ll linf=1e18;const double eps=1e-8,pi=acos(-1);
il int gmin(int &a,int b){if(a>b)a=b;}il ll gmin(ll &a,ll b){if(a>b)a=b;}il int gmax(int &a,int b){if(a<b)a=b;}il ll gmax(ll &a,ll b){if(a<b)a=b;}
il void read(ll&x){ll f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il ll read(ll&x,ll&y){read(x);read(y);}
il void read(int&x){int f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il int read(int&x,int&y){read(x);read(y);}
il void read(int&a,int&b,int&c){read(a);read(b);read(c);}il void read(ll&a,ll&b,ll&c){read(a);read(b);read(c);}
il int read(){int x;read(x);return x;}
il ll qpow(ll a,ll b,ll p){ll ret=1;for(;b;b>>=1,a=a*a%p)if(b&1)ret=ret*a%p;return ret;}il ll qpow(ll a,ll b){ll ret=1;for(;b;b>>=1,a=a*a%mod)if(b&1)ret=ret*a%mod;return ret;}
il ll qmul(ll a,ll b,ll p){ll ret=0;for(;b;b>>=1,a=(a<<1)%p)if(b&1)adm(ret,a,p);return ret;}il ll qmul(ll a,ll b){ll ret=0;for(;b;b>>=1,a=(a<<1)%mod)if(b&1)adm(ret,a,mod);return ret;}
il void judge(){
freopen("data.in","r",stdin);
freopen("data.out","w",stdout);}
int H,W,h,w,a[550][551];
int main(){
read(H,W);read(h,w);
if(H%h==0)if(W%w==0)return puts("No"),0;
puts("Yes");
rep(i,1,h)rep(j,1,w)a[i][j]=1e3;
a[h][w]=-(1e3*(h*w-1)+1);
rep(i,1,H)rep(j,1,W)
if(i>h)a[i][j]=a[i-h][j];else if(j>w)a[i][j]=a[i][j-w];
rep(i,1,H)rep(j,1,W)printf("%d%c",a[i][j],(j==W)?'\n':' ');
}
Submission Info
Submission Time |
|
Task |
C - +/- Rectangle |
User |
xjt |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
2221 Byte |
Status |
AC |
Exec Time |
25 ms |
Memory |
2816 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
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 |
24 ms |
2560 KB |
1_10.txt |
AC |
24 ms |
2560 KB |
1_11.txt |
AC |
24 ms |
2816 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 |
25 ms |
2560 KB |
1_16.txt |
AC |
24 ms |
2560 KB |
1_17.txt |
AC |
24 ms |
2560 KB |
1_18.txt |
AC |
2 ms |
1280 KB |
1_19.txt |
AC |
25 ms |
2560 KB |
1_20.txt |
AC |
25 ms |
2560 KB |
1_21.txt |
AC |
25 ms |
2560 KB |
1_22.txt |
AC |
24 ms |
2560 KB |
1_23.txt |
AC |
24 ms |
2560 KB |
1_24.txt |
AC |
2 ms |
1280 KB |
1_25.txt |
AC |
24 ms |
2560 KB |
1_26.txt |
AC |
24 ms |
2560 KB |
1_27.txt |
AC |
24 ms |
2560 KB |
1_28.txt |
AC |
25 ms |
2560 KB |
1_29.txt |
AC |
24 ms |
2560 KB |
1_30.txt |
AC |
2 ms |
1280 KB |
1_31.txt |
AC |
24 ms |
2688 KB |
1_32.txt |
AC |
24 ms |
2560 KB |
1_33.txt |
AC |
24 ms |
2560 KB |
1_34.txt |
AC |
24 ms |
2560 KB |
1_35.txt |
AC |
24 ms |
2560 KB |
1_36.txt |
AC |
11 ms |
1280 KB |
1_37.txt |
AC |
20 ms |
2176 KB |
1_38.txt |
AC |
18 ms |
1920 KB |
1_39.txt |
AC |
8 ms |
1280 KB |
1_40.txt |
AC |
4 ms |
1152 KB |
1_41.txt |
AC |
1 ms |
256 KB |
1_42.txt |
AC |
2 ms |
384 KB |
1_43.txt |
AC |
7 ms |
896 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 |
1408 KB |
1_48.txt |
AC |
1 ms |
256 KB |
1_49.txt |
AC |
18 ms |
2048 KB |
1_50.txt |
AC |
16 ms |
1920 KB |
1_51.txt |
AC |
7 ms |
768 KB |
1_52.txt |
AC |
1 ms |
256 KB |
1_53.txt |
AC |
16 ms |
1664 KB |
1_54.txt |
AC |
17 ms |
1792 KB |
1_55.txt |
AC |
10 ms |
1664 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 |