結果

問題 No.1988 Divisor Tiling
ユーザー ecottea
提出日時 2022-06-24 21:57:40
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 6,988 bytes
コンパイル時間 4,209 ms
コンパイル使用メモリ 245,876 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 17:51:37
合計ジャッジ時間 9,671 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18 RE * 14
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004004004004004LL;
double EPS = 1e-12; // 調
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}
#define rep(i, n) for(int i = 0, i##_len = ll(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
// Visual Studio
#ifdef _MSC_VER
#include "local.hpp"
// gcc
#else
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define input_from_file(f)
#define output_to_file(f)
#endif
#endif //
//--------------AtCoder --------------
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
//using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
//----------------------------------------
//O(√n)
/*
* n ds
*/
void divisors(ll n, vl& ds) {
// verify : https://algo-method.com/tasks/346
ds.clear();
if (n == 1) {
ds.push_back(1);
return;
}
ll i = 1;
for (; i * i < n; i++) {
if (n % i == 0) {
ds.push_back(i);
ds.push_back(n / i);
}
}
if (i * i == n) ds.push_back(i);
sort(all(ds));
}
// 1
void WA() {
ll n, h;
cin >> n >> h;
vl ds;
divisors(n, ds);
ds.pop_back();
if (h == 1) {
int c = 0;
repe(d, ds) rep(hoge, d) {
cout << d;
if (c < n - 1) cout << " ";
c++;
}
cout << endl;
}
else if (h == 2) {
int m = sz(ds);
int c = 0;
rep(i, m - 1) rep(hoge, ds[i]) {
cout << ds[i];
if (c < n / 2 - 1) cout << " ";
c++;
}
cout << endl;
c = 0;
rep(hoge, ds[m - 1]) {
cout << ds[m - 1];
if (c < n / 2 - 1) cout << " ";
c++;
}
cout << endl;
}
else if (n == h) {
repe(d, ds) rep(hoge, d) cout << d << endl;
}
else if (n == 2 * h) {
int m = sz(ds);
rep(i, m - 1) rep(hoge, ds[i]) cout << ds[i] << " " << ds[m - 1] << endl;
}
else {
cout << -1 << endl;
}
}
//O(h w)
/*
* a[0..h)[0..w) b
*/
template <class T> void transpose(const vector<vector<T>>& a, vector<vector<T>>& b) {
// verify : https://yukicoder.me/problems/no/1974
int h = sz(a), w = sz(a[0]);
b = vector<vector<T>>(w, vector<T>(h));
rep(i, h) {
rep(j, w) {
b[j][i] = a[i][j];
}
}
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n, h;
cin >> n >> h;
vl ds;
divisors(n, ds);
ds.pop_back();
map<int, int> mel{ {6, 3}, {28, 7}, {496, 31}, {8418, 127} };
map<int, int> pow{ {6, 1}, {28, 2}, {496, 4}, {8418, 6} };
bool swap_flag = false;
if (h % mel[n] == 0) {
h = n / h;
swap_flag = true;
}
int w = n / h;
vvi res(h, vi(w));
int k = h / 2, i0 = 0;
while(k >= 1) {
repi(i, i0, i0 + k - 1) {
rep(j, w) {
res[i][j] = k * w;
}
}
i0 += k;
k /= 2;
}
int j0 = 0;
repe(d, ds) {
if (d >= w) continue;
repi(j, j0, j0 + d - 1) {
res[h - 1][j] = d;
}
j0 += d;
}
if (swap_flag) {
vvi res2;
transpose(res, res2);
res = res2;
swap(h, w);
}
rep(i, h) {
rep(j, w) {
cout << res[i][j] << " ";
}
cout << endl;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0