結果

問題 No.1988 Divisor Tiling
ユーザー eQeeQe
提出日時 2022-06-25 05:02:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 13 ms / 2,000 ms
コード長 7,070 bytes
コンパイル時間 5,063 ms
コンパイル使用メモリ 282,124 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-09 01:34:52
合計ジャッジ時間 6,992 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 3 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 3 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 AC 3 ms
5,248 KB
testcase_21 AC 3 ms
5,248 KB
testcase_22 AC 3 ms
5,248 KB
testcase_23 AC 3 ms
5,248 KB
testcase_24 AC 3 ms
5,248 KB
testcase_25 AC 3 ms
5,248 KB
testcase_26 AC 3 ms
5,248 KB
testcase_27 AC 4 ms
5,248 KB
testcase_28 AC 4 ms
5,248 KB
testcase_29 AC 5 ms
5,248 KB
testcase_30 AC 8 ms
5,248 KB
testcase_31 AC 13 ms
5,248 KB
testcase_32 AC 2 ms
5,248 KB
testcase_33 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<atcoder/all>
#include<bits/stdc++.h>
using namespace atcoder;
using namespace std;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fin(...) return pt(__VA_ARGS__)
#define eb(...) emplace_back(__VA_ARGS__)
#define ef(...) emplace_front(__VA_ARGS__)
#define elif(...) else if(__VA_ARGS__)
#define overload4(a,b,c,d,e,...) e
#define rep1(b) for(ll _i=0;_i<(ll)(b);_i++)
#define rep2(i,b) for(ll i=0;i<(ll)(b);i++)
#define rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(a) for(ll _i=(ll)(a);_i>=0;_i--)
#define rrep2(i,a) for(ll i=(ll)(a);i>=0;i--)
#define rrep3(i,a,b) for(ll i=(ll)(a);i>=(ll)(b);i--)
#define rrep4(i,a,b,c) for(ll i=(ll)(a);i>=(ll)(b);i-=(ll)(c))
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;lin(__VA_ARGS__)
using ll=long long;
using ld=long double;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
using v4=vector<v3>;
using pll=pair<ll,ll>;
using mll=map<ll,ll>;
using mint=modint998244353;
ll inf=3e18;
ld pi=acosl(-1);
ld eps=1e-10;
template<class T>ll sgn(const T&a){return(a>eps)-(a<-eps);}
template<class T>ll sgn(const T&a,const T&b){return sgn(a-b);}
template<class T>vector<T>&operator++(vector<T>&v){for(T&x:v)x++;return v;}
template<class T>vector<T>&operator--(vector<T>&v){for(T&x:v)x--;return v;}
template<class T>vector<T> operator++(vector<T>&v,int){vector<T>r=v;++v;return r;}
template<class T>vector<T> operator--(vector<T>&v,int){vector<T>r=v;--v;return r;}
template<class T>using max_priority_queue=std::priority_queue<T>;
template<class T>using min_priority_queue=std::priority_queue<T,vector<T>,greater<T>>;
template<class T,class U>bool chmax(T&a,const U&b){return a<b?a=b,1:0;}
template<class T,class U>bool chmin(T&a,const U&b){return a>b?a=b,1:0;}
template<class T>T max(const vector<T>&a){return *max_element(all(a));}
template<class T>T min(const vector<T>&a){return *min_element(all(a));}
template<class...T>constexpr auto max(T...a){return max(initializer_list<common_type_t<T...>>{a...});}
template<class...T>constexpr auto min(T...a){return min(initializer_list<common_type_t<T...>>{a...});}
template<class T,class...A>T gcd(const T&a,const A&...b){return gcd(a,gcd(b...));}
template<class T>T sum(const vector<T>&a){return accumulate(all(a),T(0));}
template<class T>T popcnt(T a){return __builtin_popcountll(a);}
template<class T>ll lbp(const vector<T>&a,const T&b){return lower_bound(all(a),b)-a.begin();}
template<class T>ll ubp(const vector<T>&a,const T&b){return upper_bound(all(a),b)-a.begin();}
template<class T>pair<T,T>mima(const T&a,const T&b){return{min(a,b),max(a,b)};}
template<class T>pair<T,T>mima(const pair<T,T>&p){auto[a,b]=p;return mima(a,b);}
template<class T>T at(const vector<T>&v,const ll&i){ll n=v.size();return v[(i%n+n)%n];}
template<class T>void sort(vector<T>&v){sort(all(v));}
template<class T,class F>void sort(vector<T>&v,const F&f){sort(all(v),f);}
template<class T>void rev(vector<T>&v){reverse(all(v));}
template<class T>void uni(vector<T>&v){sort(all(v));v.erase(unique(all(v)),v.end());}
void sort(string&s){sort(all(s));}
void rev(string&s){reverse(all(s));}
v1 iota(ll n,ll s=0){v1 a(n);iota(all(a),s);return a;}
void emplace_front(v1&v,ll x=0){v.emplace(v.begin(),x);}


struct fast_ios{fast_ios(){cin.tie(nullptr);ios::sync_with_stdio(false);cout<<fixed<<setprecision(10);};}fast_ios_;
istream&operator>>(istream&is,mint&x){ll t;is>>t;x=t;return is;}
ostream&operator<<(ostream&os,const mint&x){return os<<x.val();}
template<class T,class U>istream&operator>>(istream&is,pair<T,U>&p){return is>>p.first>>p.second;}
template<class T,class U>ostream&operator<<(ostream&os,const pair<T,U>&p){return os<<p.first<<" "<<p.second;}
template<class T>istream&operator>>(istream&is,vector<T>&v){for(T&x:v)is>>x;return is;}
template<class T>ostream&operator<<(ostream&os,const vector<T>&v){rep(i,v.size())os<<v[i]<<(i==(ll)v.size()-1?"":" ");return os;}
template<class T>ostream&operator<<(ostream&os,const vector<vector<T>>&v){rep(i,v.size())os<<v[i]<<(i==(ll)v.size()-1?"":"\n");return os;}
template<class T>ostream&operator<<(ostream&os,const set<T>&v){for(auto&x:v)os<<x<<(x==*v.rbegin()?"":" ");return os;}
template<class T,class U>ostream&operator<<(ostream&os,const map<T,U>&m){for(auto&[k,v]:m)os<<k<<" "<<v<<(k==(m.rbegin()->first)?"":"\n");return os;}
template<class T,class U,class V>ostream&operator<<(ostream&os,const tuple<T,U,V>&t){return os<<get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
ll pt(){cout<<endl;return 0;}
ll db(){cerr<<'\n';return 0;}
template<class T,class...A>ll pt(const T&a,const A&...b){cout<<a;((cout<<' '<<b),...);cout<<'\n';return 0;}
template<class T,class...A>ll db(const T&a,const A&...b){cerr<<a;((cerr<<' '<<b),...);cerr<<'\n';return 0;}
template<class T>void lin(T&a){cin>>a;}
template<class...T>void lin(T&...a){(cin>>...>>a);}
template<class...T>void vin(const ll k,vector<T>&...a){(cin>>...>>a[k]);}
template<class T,class...A>void vin(vector<T>&a,A&...b){rep(i,a.size())vin(i,a,b...);}


template<class V,class T>void resize(vector<V>&v,const T&a){v.resize(a);}
template<class V,class T,class...A>void resize(vector<V>&vv,const T&a,const A&...b){vv.resize(a);for(V&v:vv)resize(v,b...);}
template<class V,class T>void fill(V&v,const T&x){v=x;}
template<class V,class T>void fill(vector<V>&vv,const T&x){for(V&v:vv)fill(v,x);}
void com(v1&v,v1&h){for(ll&x:h)x=lbp(v,x);}
template<class...T>void com(v1&v,v1&h,T&...t){for(ll&x:h)x=lbp(v,x);com(v,t...);}
template<class...T>v1 compress(T&...a){v1 v;for(auto&e:{a...})copy(all(e),back_inserter(v));uni(v);com(v,a...);return v;}
template<class T>T binsearch(function<bool(T)>j,T ok,T ng){T D=(*typeid(ok).name()=='x'?1:eps);while(abs(ok-ng)>D){T m=(ok+ng)/2;(j(m)?ok:ng)=m;}return ok;}
v1 divisor(ll n){mll m;for(ll i=1;i*i<=n;i++){if(n%i==0){m[i]++;m[n/i]++;}}v1 v;for(auto[x,_]:m)v.eb(x);return v;}
mll factor(ll n){mll m;for(ll i=2;i*i<=n;i++){while(n%i==0){m[i]++;n/=i;}}if(n>1)m[n]++;return m;}
ll mpow(ll x,ll n,ll m=0){ll r=1;while(n>0){if(n&1){r*=x;if(m)r%=m;}x*=x;if(m)x%=m;n>>=1;}return r;}
ll minv(ll a,ll m){ll b=m,u=1,v=0;while(b){ll t=a/b;a-=t*b;swap(a,b);u-=t*v;swap(u,v);}u%=m;if(u<0)u+=m;return u;}
ll lsqrt(ll x){ll r=sqrtl(x)-1;while(r+1<=x/(r+1))r++;return r;}
ll llog2(ll n){ll r=0;while(n){n>>=1;r++;}return r;}
mint mhash(mint a){return a*(a+1346)*(a+9185);}
ll bit(ll n){return 1LL<<n;}
v1 dx={-1,0,1,0,-1,1,1,-1};
v1 dy={0,-1,0,1,-1,-1,1,1};
using S=ll;
S op(S a,S b){return a+b;}
S e(){return 0;}

int main(){
  LL(N,H);
  ll W=N/H;
  
  ll t=H;
  while(t%2==0)t>>=1;
  if(t>1)swap(H,W);
  
  v1 div=divisor(N);
  v1 v;
  for(ll x:div){ll t=x;while(t--)v.eb(x);}
  
  v2 g;
  rep(i,H){
    v1 u(W);
    copy(v.begin()+i*W,v.begin()+(i+1)*W,u.begin());
    g.eb(u);
  }
  
  if(t>1){
    rep(j,W){
      rep(i,H)cout<<g[i][j]<<" ";pt();
    }
  }else{
    pt(g);
  }
}
0