結果
問題 | No.1398 調和の魔法陣 (構築) |
ユーザー | HEXAebmr |
提出日時 | 2021-02-19 21:55:06 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 191 ms / 3,153 ms |
コード長 | 4,942 bytes |
コンパイル時間 | 1,330 ms |
コンパイル使用メモリ | 136,152 KB |
実行使用メモリ | 6,144 KB |
最終ジャッジ日時 | 2024-09-16 18:47:01 |
合計ジャッジ時間 | 30,468 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 33 ms
6,016 KB |
testcase_07 | AC | 189 ms
6,016 KB |
testcase_08 | AC | 33 ms
6,016 KB |
testcase_09 | AC | 126 ms
6,144 KB |
testcase_10 | AC | 188 ms
6,016 KB |
testcase_11 | AC | 95 ms
6,016 KB |
testcase_12 | AC | 189 ms
6,016 KB |
testcase_13 | AC | 33 ms
6,016 KB |
testcase_14 | AC | 33 ms
6,144 KB |
testcase_15 | AC | 189 ms
6,016 KB |
testcase_16 | AC | 33 ms
6,016 KB |
testcase_17 | AC | 33 ms
6,016 KB |
testcase_18 | AC | 33 ms
6,016 KB |
testcase_19 | AC | 34 ms
6,016 KB |
testcase_20 | AC | 190 ms
6,144 KB |
testcase_21 | AC | 96 ms
6,144 KB |
testcase_22 | AC | 95 ms
6,016 KB |
testcase_23 | AC | 191 ms
6,016 KB |
testcase_24 | AC | 54 ms
6,144 KB |
testcase_25 | AC | 191 ms
6,016 KB |
testcase_26 | AC | 54 ms
6,144 KB |
testcase_27 | AC | 147 ms
6,016 KB |
testcase_28 | AC | 189 ms
6,016 KB |
testcase_29 | AC | 117 ms
6,016 KB |
testcase_30 | AC | 191 ms
6,016 KB |
ソースコード
#include <algorithm> // #include <atcoder/all> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <cstdint> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <limits> #include <list> #include <map> #include <queue> #include <random> #include <regex> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; // using namespace atcoder; using ll = long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using vll = vector<ll>; using vvll = vector<vector<ll>>; using vvvll = vector<vector<vector<ll>>>; using vii = vector<int>; using vvii = vector<vector<int>>; using vvvii = vector<vector<vector<int>>>; using vdd = vector<ld>; using vvdd = vector<vector<ld>>; using vvvdd = vector<vector<vector<ld>>>; using vbb = vector<bool>; using vvbb = vector<vector<bool>>; using vvvbb = vector<vector<vector<bool>>>; using vpll = vector<pll>; using vvpll = vector<vector<pll>>; using vvvpll = vector<vector<vector<pll>>>; #define pb push_back #define mp make_pair #define sc second #define fr first #define endl '\n' #define stpr std::fixed << setprecision #define cYES cout << "YES" << endl #define cNO cout << "NO" << endl #define cYes cout << "Yes" << endl #define cNo cout << "No" << endl #define rep(i, n) for (ll i = 0; i < (n); ++i) #define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d) #define Rep(i, a, b) for (ll i = (a); i < (b); ++i) #define rrep(i, n) for (ll i = n - 1; i >= 0; i--) #define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d) #define rRep(i, a, b) for (ll i = a; i >= b; i--) #define crep(i) for (char i = 'a'; i <= 'z'; ++i) #define Crep(i) for (char i = 'A'; i <= 'Z'; ++i) #define ALL(x) (x).begin(), (x).end() #define rALL(x) (x).rbegin(), (x).rend() #define sort2(A, N) \ sort(A, A + N, \ [](const pii &a, const pii &b) { return a.second < b.second; }); #define debug(v) \ cout << #v << ":"; \ for (auto x : v) { \ cout << x << ' '; \ } \ cout << endl; int ctoi(const char c) { if ('0' <= c && c <= '9') return (c - '0'); return -1; } ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); } ll lcm(ll a, ll b) { return a * b / gcd(a, b); } constexpr ll MOD = 1000000007; constexpr ll INF = 1000000011; constexpr ll MOD2 = 998244353; constexpr ll LINF = 1001002003004005006ll; constexpr ld EPS = 10e-10; template <class T, class U> inline bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; } template <class T, class U> inline bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &&x : v) is >> x; return is; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first; is >> p.second; return is; } template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << ' ' << p.second; return os; } template <class T> ostream &operator<<(ostream &os, vector<T> &v) { for (auto i = begin(v); i != end(v); ++i) { if (i != begin(v)) os << ' '; os << *i; } return os; } int main() { ll W, H, X; cin >> W >> H >> X; ll Y = X; bool Z = 0; vvll P(3, vll(3, 0)); vvll ans(H, vll(W, 0)); rep(i, 2) { rep(j, 2) { P[i][j] = min(9ll, Y); Y -= P[i][j]; } } rep(b, 3) { rep(c, 3) { Z = 0; rep(i, H) { rep(j, W) { ans[i][j] = P[(i + b) % 3][(j + c) % 3]; } } rep(i, H) { rep(j, W) { ll s = 0; Rep(k, i - 1, i + 2) { Rep(l, j - 1, j + 2) { if (k >= 0 && k < H && l >= 0 && l < W) { s += ans[k][l]; } } } if (s != X) { Z = 1; } } } if (Z == 0) { rep(i, H) { rep(j, W) { cout << ans[i][j]; } cout << endl; } return 0; } } } Y = X; rep(i, 2) { rep(j, 2) { P[j][i] = min(9ll, Y); Y -= P[j][i]; } } rep(b, 3) { rep(c, 3) { Z = 0; rep(i, H) { rep(j, W) { ans[i][j] = P[(i + b) % 3][(j + c) % 3]; } } rep(i, H) { rep(j, W) { ll s = 0; Rep(k, i - 1, i + 2) { Rep(l, j - 1, j + 2) { if (k >= 0 && k < H && l >= 0 && l < W) { s += ans[k][l]; } } } if (s != X) { Z = 1; } } } if (Z == 0) { rep(i, H) { rep(j, W) { cout << ans[i][j]; } cout << endl; } return 0; } } } cout << -1 << endl; }