結果
問題 | No.1398 調和の魔法陣 (構築) |
ユーザー |
![]() |
提出日時 | 2021-02-19 23:40:17 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,824 bytes |
コンパイル時間 | 1,670 ms |
コンパイル使用メモリ | 168,652 KB |
実行使用メモリ | 7,044 KB |
最終ジャッジ日時 | 2024-09-16 23:42:17 |
合計ジャッジ時間 | 27,841 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 WA * 9 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)#define rep(i,n) REP(i,0,n)#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)#define ALLOF(c) (c).begin(), (c).end()typedef long long ll;typedef unsigned long long ull;int field[1000][1000];int main(){int W, H, X;cin >> W >> H >> X;if(X == 0){rep(i,H){rep(j,W){cout << 0;}cout << endl;}}else if(W==1 && H==1){if(X<=9){cout << X << endl;}else{cout << -1 << endl;}}else if(W==1 && H==2){if(X<=18){int a, b;if(X == 18) a = b = 9;else{a = X%9;b = X - a;}cout << a << endl;cout << b << endl;}else{cout << -1 << endl;}}else if(W==2 && H==1){if(X<=18){int a, b;if(X == 18) a = b = 9;else{a = X%9;b = X - a;}cout << a << b << endl;}else{cout << -1 << endl;}}else if(W==1){if(X<=18 && H%3==2){int a, b;if(X == 18) a = b = 9;else{a = X%9;b = X - a;}for(int i=0;i<H; i+=3){if(i>0) cout << 0 << endl;cout << a << endl;cout << b << endl;}}else{cout << -1 << endl;}}else if(H==1){if(X<=18 && W%3==2){int a, b;if(X == 18) a = b = 9;else{a = X%9;b = X - a;}for(int i=0;i<W; i+=3){if(i>0) cout << 0;cout << a << b;}cout << endl;}else{cout << -1 << endl;}}else {if(X > 36){cout << -1 << endl;return 0;}int a,b,c,d;if(X == 36){a = b = c = d = 9;}else if(X <= 9){a = X;b = c = d = 0;}else if(X <= 18){if(X == 18) a = b = 9;else{a = X%9;b = X - a;}c = d = 0;}else{a = X%9;b = c = d = (X-a)/3;}if(b == 0){if(W%3==0 || H%3==0){cout << -1 << endl;return 0;}}else if(c == 0){if(!(W%3==2 || H%3==2)){cout << -1 << endl;return 0;}}else{if(W%3!=2 || H%3!=2){cout << -1 << endl;return 0;}}for(int i=0; i<H; i+=3){for(int j=0; j<W; j+=3){if(H%3==2){field[i][j] = a; field[i][j+1] = b;field[i+1][j] = c; field[i+1][j+1] = d;}else{field[i][j] = a; field[i][j+1] = c;field[i+1][j] = b; field[i+1][j+1] = d;}}}rep(i,H){rep(j,W){cout << field[i][j];}cout << endl;}}return 0;}