結果
問題 | No.2339 Factorial Paths |
ユーザー |
👑 |
提出日時 | 2023-06-02 22:55:44 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 88 ms / 2,000 ms |
コード長 | 9,974 bytes |
コンパイル時間 | 3,871 ms |
コンパイル使用メモリ | 259,632 KB |
実行使用メモリ | 6,272 KB |
最終ジャッジ日時 | 2024-12-28 21:16:20 |
合計ジャッジ時間 | 9,643 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 |
ソースコード
// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;template <class T>using pq = priority_queue<T>;template <class T>using qp = priority_queue<T, vector<T>, greater<T>>;#define vec(T, A, ...) vector<T> A(__VA_ARGS__);#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));#ifndef RIN__LOCAL#define endl "\n"#endif#define spa ' '#define len(A) A.size()#define all(A) begin(A), end(A)#define fori1(a) for (ll _ = 0; _ < (a); _++)#define fori2(i, a) for (ll i = 0; i < (a); i++)#define fori3(i, a, b) for (ll i = (a); i < (b); i++)#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))#define overload4(a, b, c, d, e, ...) e#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)vector<char> stoc(string &S) {int n = S.size();vector<char> ret(n);for (int i = 0; i < n; i++) ret[i] = S[i];return ret;}#define INT(...)\int __VA_ARGS__;\inp(__VA_ARGS__);#define LL(...)\ll __VA_ARGS__;\inp(__VA_ARGS__);#define STRING(...)\string __VA_ARGS__;\inp(__VA_ARGS__);#define CHAR(...)\char __VA_ARGS__;\inp(__VA_ARGS__);#define VEC(T, A, n)\vector<T> A(n);\inp(A);#define VVEC(T, A, n, m)\vector<vector<T>> A(n, vector<T>(m));\inp(A);const ll MOD1 = 1000000007;const ll MOD9 = 998244353;template <class T>auto min(const T &a) {return *min_element(all(a));}template <class T>auto max(const T &a) {return *max_element(all(a));}template <class T, class S>auto clamp(T &a, const S &l, const S &r) {return (a > r ? r : a < l ? l : a);}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}template <class T, class S>inline bool chclamp(T &a, const S &l, const S &r) {auto b = clamp(a, l, r);return (a != b ? a = b, 1 : 0);}void FLUSH() {cout << flush;}void print() {cout << endl;}template <class Head, class... Tail>void print(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail)) cout << spa;print(forward<Tail>(tail)...);}template <typename T>void print(vector<T> &A) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << ' ';}cout << endl;}template <typename T>void print(vector<vector<T>> &A) {for (auto &row : A) print(row);}template <typename T, typename S>void print(pair<T, S> &A) {cout << A.first << spa << A.second << endl;}template <typename T, typename S>void print(vector<pair<T, S>> &A) {for (auto &row : A) print(row);}template <typename T, typename S>void prisep(vector<T> &A, S sep) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << sep;}cout << endl;}template <typename T, typename S>void priend(T A, S end) {cout << A << end;}template <typename T>void priend(T A) {priend(A, spa);}template <class... T>void inp(T &...a) {(cin >> ... >> a);}template <typename T>void inp(vector<T> &A) {for (auto &a : A) cin >> a;}template <typename T>void inp(vector<vector<T>> &A) {for (auto &row : A) inp(row);}template <typename T, typename S>void inp(pair<T, S> &A) {inp(A.first, A.second);}template <typename T, typename S>void inp(vector<pair<T, S>> &A) {for (auto &row : A) inp(row.first, row.second);}template <typename T>T sum(vector<T> &A) {T tot = 0;for (auto a : A) tot += a;return tot;}template <typename T>vector<T> compression(vector<T> X) {sort(all(X));X.erase(unique(all(X)), X.end());return X;}vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<int>> edges(n, vector<int>());for (int i = 0; i < m; i++) {INT(u, v);u -= indexed;v -= indexed;edges[u].push_back(v);if (!direct) edges[v].push_back(u);}return edges;}vector<vector<int>> read_tree(int n, int indexed = 1) {return read_edges(n, n - 1, false, indexed);}template <typename T>vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());for (int i = 0; i < m; i++) {INT(u, v);T w;inp(w);u -= indexed;v -= indexed;edges[u].push_back({v, w});if (!direct) edges[v].push_back({u, w});}return edges;}template <typename T>vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {return read_wedges<T>(n, n - 1, false, indexed);}inline bool yes(bool f = true) {cout << (f ? "yes" : "no") << endl;return f;}inline bool Yes(bool f = true) {cout << (f ? "Yes" : "No") << endl;return f;}inline bool YES(bool f = true) {cout << (f ? "YES" : "NO") << endl;return f;}inline bool no(bool f = true) {cout << (!f ? "yes" : "no") << endl;return f;}inline bool No(bool f = true) {cout << (!f ? "Yes" : "No") << endl;return f;}inline bool NO(bool f = true) {cout << (!f ? "YES" : "NO") << endl;return f;}////////// https://nyaannyaan.github.io/library/misc/mo.hpp.htmlstruct Mo {int width;vector<int> left, right, order;Mo(int N, int Q) : order(Q) {width = max<int>(1, 1.0 * N / max<double>(1.0, sqrt(Q * 2.0 / 3.0)));iota(begin(order), end(order), 0);}void insert(int l, int r) { /* [l, r) */left.emplace_back(l);right.emplace_back(r);}template <typename AL, typename AR, typename DL, typename DR, typename REM>void run(const AL &add_left, const AR &add_right, const DL &delete_left, const DR &delete_right, const REM &rem) {assert(left.size() == order.size());sort(begin(order), end(order), [&](int a, int b) {int ablock = left[a] / width, bblock = left[b] / width;if (ablock != bblock) return ablock < bblock;if (ablock & 1) return right[a] < right[b];return right[a] > right[b];});int nl = 0, nr = 0;for (auto idx : order) {while (nl > left[idx]) add_left(--nl);while (nr < right[idx]) add_right(nr++);while (nl < left[idx]) delete_left(nl++);while (nr > right[idx]) delete_right(--nr);rem(idx);}}};void solve() {INT(n);if (n == 1) {print(1, 1);print('.');return;}int c = 1;vec(int, A, 0);stack<int> st;st.push(n);int L = 0;int R = 0;while (!st.empty()) {int x = st.top();st.pop();if (x == 1) continue;c += x - 1;A.push_back(x);L += x / 2;R += (x + 1) / 2;st.push(x / 2);st.push((x + 1) / 2);}vvec(char, S, L + 1, R + 1, '#');int pl = 0;int pr = 0;for (auto x : A) {int l = x / 2 + 1;int r = (x + 1) / 2 + 1;fori(i, pl, pl + l) fori(j, pr, pr + r) {S[i][j] = '.';}pl += l - 1;pr += r - 1;}print(L + 1, R + 1);fori(i, L + 1) prisep(S[i], "");}int main() {cin.tie(0)->sync_with_stdio(0);// cout << fixed << setprecision(12);int t;t = 1;// cin >> t;while (t--) solve();return 0;}