結果

問題 No.1988 Divisor Tiling
ユーザー woodywoody
提出日時 2022-06-24 23:09:51
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 12 ms / 2,000 ms
コード長 5,678 bytes
コンパイル時間 4,476 ms
コンパイル使用メモリ 237,296 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 18:49:56
合計ジャッジ時間 5,330 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
using namespace std;
using namespace atcoder;
using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
struct math_lib{
vvl div,mul;
void div_init(int n){
div.resize(n+1);
mul.resize(n+1);
for(ll i = 1;i <= n;i++){
for(ll j = i;j <= n;j+=i){
div[j].pb(i);
mul[i].pb(j);
}
}
return;
}
vl divisor(ll x){
vl res;
for(ll i=1;i*i<=x;i++){
if (x%i != 0) continue;
res.pb(i);
if (i*i != x) res.pb(x/i);
}
sort(rng(res));
return res;
}
ll sqrt(ll x) {
ll l = 0, r = ll(2e9)+1;
while (l+1<r) {
ll c = (l+r)/2;
if (c*c <= x) l = c; else r = c;
}
return l;
}
ll logx(ll x,int a){
ll tmp=1;
ll ret=0;
while(tmp <= x){
if (tmp >= LLONG_MAX/a) break;
tmp *= a;
ret++;
}
ret--;
return ret;
}
ll pow(ll x , ll a){
assert(x > 0);
assert(a >= 0);
ll ret = 1;
rep(_,a){
assert (ret < LLONG_MAX/x);
ret *= x;
}
return ret;
}
ll base(ll x,int a){
ll ans=0,y;
for (ll i=0;x>0;i++){
y = x/a;
ans += (x - y*a)*pow(10,i);
x = y;
}
return ans;
}
string baseS(ll x,int a){
string ans;
ll y;
for (ll i=0;x>0;i++){
y = x/a;
ans += '0' + (x - y*a);
x = y;
}
reverse(rng(ans));
return ans;
}
} math;
// .div.mul : div[i]mul[i]i
// .div_init(n) : div,mulnn < 1e6 ~ 1e7
// .divisor(x) : xx64bit
// .sqrt(x) : floor(sqrt(x))x64bit
// .logx(x , a) : floor(loga(x))x64bit
// .pow(x , a) : x^a
// .base(x , a) : x(10)a1 <= a <= 10ll
// .baseS(x , a) : x(10)a1 <= a <= 10string
int main(){
ll n,h; cin>>n>>h;
ll l = 1;
while(n % (l * 2) == 0) l *= 2;
bool ok = false;
ll k = l * 2 - 1;
if (h % k == 0) ok = true;
if (ok) h = n/h;
ll rh = n/h;
vvl ans(h , vl(rh));
vl v = math.divisor(n);
int li = 0;
fore(y , v){
if (y%h != 0 || y == n || y%k != 0) continue;
int wid = y / h;
repx(i,li,wid+li) rep(j,h) ans[j][i] = y;
li += wid;
}
ll now = 1;
li = 0;
while(h % (now*2) == 0){
repx(i,li,now*2-1) rep(j,k) ans[i][rh-j-1] = now * k;
now *= 2;
li = now - 1;
}
now = 1;
li = 0;
while(n % now == 0){
repx(i,li,now*2-1) ans[h-1][rh-i-1] = now;
now *= 2;
li = now - 1;
}
if (ok){
rep(i,rh){
rep(j,h) cout << ans[j][i] << " ";
cout << endl;
}
}else{
rep(i,h){
rep(j,rh) cout << ans[i][j] << " ";
cout << endl;
}
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0