結果
問題 | No.1988 Divisor Tiling |
ユーザー |
![]() |
提出日時 | 2022-06-24 21:44:13 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 4,501 bytes |
コンパイル時間 | 11,734 ms |
コンパイル使用メモリ | 297,596 KB |
最終ジャッジ日時 | 2025-01-30 00:15:28 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 |
ソースコード
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <iostream> #include <iomanip> #include <string> #include <cmath> #include <algorithm> #include <vector> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <list> #include <stack> #include <queue> #include <bitset> #include <numeric> #include <cassert> #include <memory> #include <random> #include <functional> #include <complex> #include <immintrin.h> #include <stdexcept> #ifdef DEBUG #include "./CompetitiveProgrammingCpp/debug.hpp" #include "./CompetitiveProgrammingCpp/Timer.hpp" #include "./CompetitiveProgrammingCpp/sample.hpp" #else #define dump(...) #endif /* macro */ #define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i) #define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i) #define REP(i, n) FOR(i, 0, (n)) #define RREP(i, n) RFOR(i, 0, (n)) #define REPC(x,c) for(const auto& x:(c)) #define REPI2(it,b,e) for(auto it = (b); it != (e); ++it) #define REPI(it,c) REPI2(it, (c).begin(), (c).end()) #define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend()) #define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);) #define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end()) #define ALL(x) (x).begin(),(x).end() #define cauto const auto& /* macro func */ template<class T> inline auto sort(T& t) { std::sort(ALL(t)); } template<class T> inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); } template<class T> inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); } template<class T, class S> inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; } template<class T, class S> inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; } inline auto BR() { std::cout << "\n"; } /* type define */ using ll = long long; using VS = std::vector<std::string>; using VL = std::vector<long long>; using VVL = std::vector<VL>; using VVVL = std::vector<VVL>; using VVVVL = std::vector<VVVL>; using VVVVVL = std::vector<VVVVL>; using VD = std::vector<double>; template<class T> using V = std::vector<T>; template<class T = ll, class U = T> using P = std::pair<T, U>; using PAIR = P<ll>; /* using std */ using std::cout; constexpr char endl = '\n'; using std::cin; using std::pair; using std::string; using std::stack; using std::queue; using std::deque; using std::vector; using std::list; using std::map; using std::unordered_map; using std::multimap; using std::unordered_multimap; using std::set; using std::unordered_set; using std::unordered_multiset; using std::multiset; using std::bitset; using std::priority_queue; /* Initial processing */ struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing; /* Remove the source of the bug */ auto pow(signed, signed) { assert(false); } /* define hash */ namespace std { template <> class hash<std::pair<ll, ll>> { public: size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } }; } /* input */ template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; } /* constant value */ // constexpr ll MOD = 1000000007; constexpr ll MOD = 998244353; //============================================================================================= auto d(ll n) { set<ll, std::greater<ll>> st; FOR(i, 1, std::sqrt(n) + 10) if(n % i == 0) { st.emplace(i); st.emplace(n / i); } st.erase(n); return st; } auto solve(ll n, ll h) -> VVL { constexpr ll size = 1e5; ll now = 1; VL ok(size); REP(i, 30) { if(now >= size) { break; } ok[now] = true; now <<= 1; } ll w = n / h; if(ok[w]) { auto ans_rev = solve(n, w); VVL ans(h, VL(w)); REP(i, h)REP(j, w) { ans[i][j] = ans_rev[j][i]; } return ans; } ll pos = 0; VVL ans(h, VL(w)); auto st = d(n); REPC(t, st) { REP(_, t) { auto y = pos / w; auto x = pos % w; ans[y][x] = t; ++pos; } } return ans; } signed main() { ll n, h; cin >> n >> h; auto ans = solve(n, h); REPC(y, ans) { REPC(x, y) { cout << x << " "; }BR(); } }