結果

問題 No.3740 Troublesome Congestion
コンテスト
ユーザー snuke
提出日時 2026-09-25 07:41:19
言語 C++23
(gcc 15.3.0 + boost 1.92.0 + ACL)
コンパイル:
g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
AC  
実行時間 1,854 ms / 2,000 ms
+ 265µs
コード長 7,275 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,963 ms
コンパイル使用メモリ 353,584 KB
実行使用メモリ 26,888 KB
最終ジャッジ日時 2026-09-25 07:42:00
合計ジャッジ時間 37,538 ms
ジャッジサーバーID
（参考情報） 		judge2_0 / judge4_0
このコードへのチャレンジ
（要ログイン）
サブタスク 配点 結果
部分点1 20 % AC * 7
部分点2 30 % AC * 12
満点 50 % AC * 26
合計 4 * 100% = 400 点
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;cin>>x;return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>ostream& operator<<(ostream&o,const vv<T>&v){for(auto&r:v)o<<r<<'\n';return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T1,class T2>pair<T1,T2>operator*(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi*b.fi,a.se*b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>void operator+=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi+=b.fi;a.se+=b.se;}
template<class T1,class T2>void operator-=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi-=b.fi;a.se-=b.se;}
template<class T1,class T2>void operator*=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi*=b.fi;a.se*=b.se;}
template<class T>void operator*=(pair<T,T>&a,T b){a.fi*=b;a.se*=b;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T1,class T2>void operator%=(vc<T1>&a,T2 b){for(T1&x:a)x%=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T1,class T2>void prepend(vc<T1>&a,const T2&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { cout<<"-1"<<'\n'; return;}
#define yes { cout<<"Yes"<<'\n'; return;}
#define ye { cout<<"Yes"<<'\n';}
#define no { cout<<"No"<<'\n'; return;}
#define yn {cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define endl '\n'
using l3 = __int128_t;
using ul3 = __uint128_t;
std::ostream &operator<<(std::ostream &o, l3 x) {
  string s;
  bool sg = x < 0;
  ul3 ux = sg?-x:x;
  do {s += '0'+ux%10; ux /= 10;} while (ux);
  if (sg) s += '-';
  reverse(rng(s));
  return o<<s;
}
random_device _rd;
struct xrand {
  static const uint64_t _x = 88172645463325252ull;
  uint64_t x;
  xrand(): x(_x ^ (_rd()+time(0))) {}
  xrand(uint64_t seed): x(_x ^ seed) {}
  uint64_t get() {
    x = x ^ (x << 7);
    return x = x ^ (x >> 9);
  }
  ull operator()() { return get();}
  ull operator()(ull n) { return get()%n;}
  ll operator()(ll l, ll r) { return get()%(r-l+1) + l;}
} rnd;
template<typename T> void shuffle(T& a) {
  for (int i = a.size(); i >= 2; --i) swap(a[i-1],a[rnd(i)]);
}
using vs = vc<string>;
void vin(vs& s){int n,m;cin>>n>>m;s=vs(n);cin>>s;}

const int N = 36, n = N-4;
const int D = 1e6;

vvl c;
vc<pair<ll,ll>> ap;

void init() {
  c = vvl(n,vl(n));
  c[0][0] = 1;
  rep(i,n)rep(j,n) {
    if (i) c[i][j] += c[i-1][j];
    if (j) c[i][j] += c[i][j-1];
  }

  vi ok(D);
  ap.resize(D);
  const int x = 10;
  rep1(s,1<<x) {
    vi dp(D,-1);
    dp[0] = -2;
    vl co(x);
    drep(i,x) if (s>>i&1) {
      co[i] = 1;
      if (s>>i>>1&1) co[i] += co[i+1];
    }
    vl sums;
    rep(i,n) {
      ll sum = 0;
      rep(j,x) if (s>>j&1) sum += c[i][j]*co[j];
      if (sum > D) break;
      sums.pb(sum);
      drep(k,D-sum) if (dp[k+sum] == -1 && dp[k] != -1) dp[k+sum] = i;
    }
    rep(i,D) if (dp[i] != -1 && !ok[i]) {
      ok[i] = 1;
      ll t = 0, k = i;
      while (k) {
        t |= 1ll<<dp[k];
        k -= sums[dp[k]];
      }
      ap[i] = {s,t};
    }
    if (suma(ok) == D) break;
  }
}

struct Solver {
  void solve(ll m) {
    vs ans(N, string(N,'.'));
    ans[1][1] = ans[1][N-2] = ans[N-2][1] = ans[N-2][N-2] = '#';
    rep(_,1e5) {
      ll s = rnd(1ll<<n), t = 0;
      ll sum = m;
      vc<l3> co(n);
      drep(i,n) if (s>>i&1) {
        co[i] = 1;
        if (s>>i>>1&1) co[i] += co[i+1];
      }
      drep(i,n) {
        l3 now = sum;
        rep(j,n) now -= c[i][j]*co[j];
        if (now < 0) continue;
        sum = now;
        t |= 1ll<<i;
      }
      if (sum >= D) continue;
      rep(i,n) ans[N-2][2+i] = "#."[s>>i&1];
      rep(i,n) ans[N-3-i][1] = "#P"[t>>i&1];
      auto [ns,nt] = ap[sum];
      rep(i,n) ans[1][N-3-i] = "#."[ns>>i&1];
      rep(i,n) ans[2+i][N-2] = "#P"[nt>>i&1];
      cout<<N<<endl;
      rep(i,N) cout<<ans[i]<<endl;
      return;
    }
    assert(false);
  }
};

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  init();
  int ts = 1;
  cin >> ts;
  rep1(ti,ts) {
    Solver solver;
    ll m; cin>>m;
    solver.solve(m);
  }

  /*
  rep(ti,100) {
    ll r = rnd(1e18);
    Solver s;
    s.solve(r);
  }
  //*/
  return 0;
}
0