Submission #2164765


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

int a[501],sum[501];
int main(){
    int h,w,y,x;
    cin>>h>>w>>y>>x;
    if(h%y==0&&w%x==0){
        cout<<"No"<<endl;
        return 0;
    }
    cout<<"Yes"<<endl;
    int cur=10000;
    if(w%x!=0){
        FOR(i,1,w+1){
            if(i-x<0) sum[i]=cur;
            else cur=sum[i-x]-1,sum[i]=cur;
        }
        FOR(i,1,w+1) a[i-1]=sum[i]-sum[i-1];
        rep(i,h){
            rep(j,w) cout<<a[j]<<" ";
            cout<<endl;
        }
    }
    else{
        FOR(i,1,h+1){
            if(i-y<0) sum[i]=cur;
            else cur=sum[i-y]-1,sum[i]=cur;
        }
        FOR(i,1,h+1) a[i-1]=sum[i]-sum[i-1];
        rep(i,h){
            rep(j,w) cout<<a[i]<<" ";
            cout<<endl;
        }
    }
    return 0;
}

Submission Info

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