結果
問題 | No.2339 Factorial Paths |
ユーザー |
![]() |
提出日時 | 2023-06-02 21:59:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 7 ms / 2,000 ms |
コード長 | 2,842 bytes |
コンパイル時間 | 1,304 ms |
コンパイル使用メモリ | 130,388 KB |
最終ジャッジ日時 | 2025-02-13 18:18:07 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 |
ソースコード
#ifndef LOCAL#define FAST_IO#endif// ============#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cmath>#include <iomanip>#include <iostream>#include <list>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define OVERRIDE(a, b, c, d, ...) d#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)#define ALL(x) begin(x), end(x)using namespace std;using u32 = unsigned int;using u64 = unsigned long long;using i32 = signed int;using i64 = signed long long;using f64 = double;using f80 = long double;template <typename T>using Vec = vector<T>;template <typename T>bool chmin(T &x, const T &y) {if (x > y) {x = y;return true;}return false;}template <typename T>bool chmax(T &x, const T &y) {if (x < y) {x = y;return true;}return false;}#ifdef INT128using u128 = __uint128_t;using i128 = __int128_t;istream &operator>>(istream &is, i128 &x) {i64 v;is >> v;x = v;return is;}ostream &operator<<(ostream &os, i128 x) {os << (i64)x;return os;}istream &operator>>(istream &is, u128 &x) {u64 v;is >> v;x = v;return is;}ostream &operator<<(ostream &os, u128 x) {os << (u64)x;return os;}#endif[[maybe_unused]] constexpr i32 INF = 1000000100;[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;struct SetUpIO {SetUpIO() {#ifdef FAST_IOios::sync_with_stdio(false);cin.tie(nullptr);#endifcout << fixed << setprecision(15);}} set_up_io;// ============#ifdef DEBUGF#else#define DBG(x) (void)0#endifint main() {i32 n;cin >> n;if (n == 1) {cout << 1 << ' ' << 1 << '\n';cout << ".\n";return 0;}Vec<pair<i32, i32>> rects;const auto solve = [&rects](const auto &solve, i32 n) -> void {if (n == 1) {return;}i32 k = n / 2;rects.emplace_back(k, n - k);solve(solve, k);solve(solve, n - k);};solve(solve, n);i32 h = 1, w = 1;for (auto [x, y] : rects) {h += x;w += y;}cout << h << ' ' << w << '\n';Vec<string> s(h, string(w, '#'));i32 cx = 0, cy = 0;for (auto [x, y] : rects) {REP(i, x + 1) REP(j, y + 1) {s[cx + i][cy + j] = '.';}cx += x;cy += y;}REP(i, h) {cout << s[i] << '\n';}}