結果
| 問題 | No.1434 Make Maze |
| ユーザー |
 leaf_1415
|
| 提出日時 | 2021-03-20 01:42:16 |
| 言語 | C++11 (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 25 ms / 2,000 ms |
| コード長 | 5,034 bytes |
| コンパイル時間 | 3,122 ms |
| コンパイル使用メモリ | 85,160 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-11-24 21:47:54 |
| 合計ジャッジ時間 | 5,295 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 30 |
ソースコード
#include <iostream>#include <cstdio>#include <cmath>#include <ctime>#include <cstdlib>#include <cassert>#include <vector>#include <list>#include <stack>#include <queue>#include <deque>#include <map>#include <set>#include <bitset>#include <string>#include <algorithm>#include <utility>#include <complex>#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)#define chmin(x, y) (x) = min((x), (y))#define chmax(x, y) (x) = max((x), (y))#define sz(x) ((ll)(x).size())#define ceil(x, y) (((x)+(y)-1) / (y))#define all(x) (x).begin(),(x).end()#define outl(...) dump_func(__VA_ARGS__)#define inf 1e18using namespace std;typedef long long llint;typedef long long ll;typedef pair<ll, ll> P;struct edge{ll to, cost;edge(){}edge(ll a, ll b){ to = a, cost = b;}};const ll mod = 1000000007;//const ll mod = 998244353;struct mint{ll x = 0;mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}mint(const mint &ope) {x = ope.x;}mint operator-(){return mint(-x);}mint operator+(const mint &ope){return mint(x) += ope;}mint operator-(const mint &ope){return mint(x) -= ope;}mint operator*(const mint &ope){return mint(x) *= ope;}mint operator/(const mint &ope){return mint(x) /= ope;}mint& operator+=(const mint &ope){x += ope.x;if(x >= mod) x -= mod;return *this;}mint& operator-=(const mint &ope){x += mod - ope.x;if(x >= mod) x -= mod;return *this;}mint& operator*=(const mint &ope){x *= ope.x, x %= mod;return *this;}mint& operator/=(const mint &ope){ll n = mod-2; mint mul = ope;while(n){if(n & 1) *this *= mul;mul *= mul;n >>= 1;}return *this;}mint inverse(){return mint(1) / *this;}bool operator ==(const mint &ope){return x == ope.x;}bool operator !=(const mint &ope){return x != ope.x;}};istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t;return is;}ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}void mark(){ cout << "*" << endl; }void yes(){ cout << "Yes" << endl; }void no(){ cout << "No" << endl; }ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}ll modpow(ll a, ll n){if(n == 0) return 1;if(n % 2) return ((a%mod) * (modpow(a, n-1)%mod)) % mod;else return modpow((a*a)%mod, n/2) % mod;}template<typename T>ostream& operator << (ostream& os, vector<T>& vec) {for(int i = 0; i < vec.size(); i++) {os << vec[i] << (i + 1 == vec.size() ? "" : " ");}return os;}template<typename T>ostream& operator << (ostream& os, deque<T>& deq) {for(int i = 0; i < deq.size(); i++) {os << deq[i] << (i + 1 == deq.size() ? "" : " ");}return os;}template<typename T, typename U>ostream& operator << (ostream& os, pair<T, U>& pair_var) {os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}template<typename T, typename U>ostream& operator << (ostream& os, const pair<T, U>& pair_var) {os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}template<typename T, typename U>ostream& operator << (ostream& os, map<T, U>& map_var) {for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {os << "(" << itr->first << ", " << itr->second << ")";itr++;if(itr != map_var.end()) os << ",";itr--;}return os;}template<typename T>ostream& operator << (ostream& os, set<T>& set_var) {for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {os << *itr;++itr;if(itr != set_var.end()) os << " ";itr--;}return os;}template<typename T>void outa(T a[], ll s, ll t){for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}cout << endl;}void dump_func() {cout << endl;}template <class Head, class... Tail>void dump_func(Head &&head, Tail &&... tail) {cout << head;if(sizeof...(Tail) > 0) cout << " ";dump_func(std::move(tail)...);}ll h, w, x;char c[1005][1005];ll p[1005];int main(void){ios::sync_with_stdio(0);cin.tie(0);cin >> h >> w >> x;if(h+w-2 > x || (h+w-2) % 4 != x % 4){outl(-1);return 0;}bool trans = false;if(h/2/2*2*w < w/2/2*2*h){swap(h, w);trans = true;}rep(i, 1, h/2) p[i] = w;x -= h+w-2;rep(i, 1, h/2){if(i % 2) continue;ll m = min(x/4, w/2);x -= m * 4;p[i] -= m * 2;}rep(i, 1, h){rep(j, 1, w){if(c[i][j] = '.');if(i % 2 == 0 && p[i/2] != j) c[i][j] = '#';}}if(h > 3 && x > 0 && p[h/2] == w){for(int i = 4; i <= w && x > 0; i+=4){c[h-1][i-3] = '.', c[h-2][i-2] = '#';c[h-1][i-1] = '.', c[h][i] = '#';x -= 4;}}if(x > 0){outl(-1);return 0;}if(trans){rep(i, 1, w){rep(j, 1, h) cout << c[j][i];cout << endl;}}else{rep(i, 1, h){rep(j, 1, w) cout << c[i][j];cout << endl;}}return 0;}