Submission #1608368


Source Code Expand

#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair

const int MAXN = 510;

int n, m, h, w, p[MAXN][MAXN];

int main() {
  scanf("%d %d %d %d",&n,&m,&h,&w);
  if (n == h && m == w) {
    puts("No");
    return 0;
  }

  REP(i, h) REP(j, w) p[i][j] = 1;
  p[h - 1][w - 1] = -w * h;

  FOR(j, w, m) REP(i, h) p[i][j] = p[i][j % w];
  FOR(i, h, n) REP(j, m) p[i][j] = p[i % h][j];

  ll sum = 0;
  REP(i, n) REP(j, m) sum += p[i][j];
  if (sum <= 0) {
    puts("No");
    return 0;
  }

  puts("Yes");
  REP(i, n) {
    REP(j, m) printf("%d ",p[i][j]);
    puts("");
  }

  return 0;
}

Submission Info

Submission Time
Task C - +/- Rectangle
User mkisic
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1223 Byte
Status WA
Exec Time 20 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:37:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d %d",&n,&m,&h,&w);
                                   ^

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 1280 KB
1_07.txt AC 2 ms 1280 KB
1_08.txt AC 2 ms 1280 KB
1_09.txt WA 2 ms 1280 KB
1_10.txt AC 20 ms 1792 KB
1_11.txt WA 2 ms 1280 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 2 ms 1280 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 20 ms 1792 KB
1_16.txt AC 20 ms 1792 KB
1_17.txt AC 20 ms 1792 KB
1_18.txt WA 2 ms 1280 KB
1_19.txt WA 2 ms 1280 KB
1_20.txt AC 20 ms 1792 KB
1_21.txt AC 20 ms 1792 KB
1_22.txt AC 20 ms 1792 KB
1_23.txt AC 20 ms 1792 KB
1_24.txt AC 1 ms 1280 KB
1_25.txt AC 20 ms 1792 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 20 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 14 ms 1280 KB
1_39.txt AC 7 ms 1024 KB
1_40.txt AC 3 ms 1024 KB
1_41.txt AC 1 ms 640 KB
1_42.txt AC 1 ms 384 KB
1_43.txt AC 6 ms 768 KB
1_44.txt AC 1 ms 512 KB
1_45.txt AC 1 ms 896 KB
1_46.txt AC 1 ms 640 KB
1_47.txt AC 9 ms 1024 KB
1_48.txt AC 1 ms 896 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 640 KB
1_53.txt AC 13 ms 1152 KB
1_54.txt AC 13 ms 1280 KB
1_55.txt AC 8 ms 1280 KB
1_56.txt AC 1 ms 256 KB
1_57.txt AC 1 ms 768 KB
1_58.txt AC 2 ms 1280 KB
1_59.txt AC 2 ms 1152 KB