結果
問題 | No.2339 Factorial Paths |
ユーザー | ir5 |
提出日時 | 2024-07-20 13:53:28 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 2,992 bytes |
コンパイル時間 | 3,965 ms |
コンパイル使用メモリ | 146,172 KB |
実行使用メモリ | 19,072 KB |
最終ジャッジ日時 | 2024-07-20 13:53:39 |
合計ジャッジ時間 | 11,489 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 13 ms
18,944 KB |
testcase_01 | AC | 13 ms
18,944 KB |
testcase_02 | AC | 13 ms
18,944 KB |
testcase_03 | AC | 13 ms
19,072 KB |
testcase_04 | AC | 13 ms
18,944 KB |
testcase_05 | AC | 13 ms
18,944 KB |
testcase_06 | AC | 14 ms
18,944 KB |
testcase_07 | AC | 14 ms
18,944 KB |
testcase_08 | AC | 14 ms
19,072 KB |
testcase_09 | AC | 14 ms
19,072 KB |
testcase_10 | AC | 14 ms
18,944 KB |
testcase_11 | AC | 15 ms
19,072 KB |
testcase_12 | AC | 16 ms
18,944 KB |
testcase_13 | AC | 17 ms
18,944 KB |
testcase_14 | AC | 21 ms
18,944 KB |
testcase_15 | AC | 31 ms
18,944 KB |
testcase_16 | AC | 42 ms
18,944 KB |
testcase_17 | AC | 52 ms
18,944 KB |
testcase_18 | AC | 54 ms
19,072 KB |
testcase_19 | AC | 53 ms
18,944 KB |
testcase_20 | AC | 53 ms
19,072 KB |
testcase_21 | AC | 54 ms
18,944 KB |
testcase_22 | AC | 54 ms
18,944 KB |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n; public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}}; template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif namespace solver { template<typename T1, typename T2> struct In2 { T1 a; T2 b; friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; } }; template<typename T1, typename T2, typename T3> struct In3 { T1 a; T2 b; T3 c; friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; } }; int n; void read() { cin >> n; } using RetType = void; RetType run() { vector<vector<int>> f(2000, vector<int>(2000)); queue<int> q; q.push(n); int h = 1, w = 1; f[0][0] = 1; dump(n); while (!q.empty()) { int m = q.front(); q.pop(); if (m == 1) continue; // 400 -> 201x201 -> 400x...x201 / (200!)^2 int h1 = m / 2, w1 = m - h1; dump(h1 << " " << w1); for (int i : range(h - 1, h + h1)) for (int j : range(w - 1, w + w1)) { f[i][j] = 1; } h += h1; w += w1; q.push(h1); q.push(w1); } cout << h << " " << w << endl; for (int i : range(h)) { for (int j : range(w)) cout << (f[i][j] ? '.' : '#'); cout << endl; } dump(h << " " << w); } } // namespace template <typename F> void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } run(solver::run); }