結果

問題 No.1598 4×4 Grid
コンテスト
ユーザー noya2
提出日時 2025-03-09 02:32:27
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 4,000 ms
コード長 8,691 bytes
コンパイル時間 3,809 ms
コンパイル使用メモリ 295,472 KB
実行使用メモリ 8,608 KB
最終ジャッジ日時 2025-03-09 02:32:32
合計ジャッジ時間 4,928 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"

#line 5 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"
#include <ranges>

namespace noya2 {

struct grid {
    int h, w;
    grid (int _h = 0, int _w = 0) : h(_h), w(_w) {}
    int idx(int x, int y) const {
        return x * w + y;
    }
    std::pair<int,int> pos(int id) const {
        return {id / w, id % w};
    }
    bool operator()(int x, int y) const {
        return 0 <= x && x < h && 0 <= y && y < w;
    }
    bool operator()(int id) const {
        return operator()(id / w, id % w);
    }
    static constexpr std::array<std::pair<int,int>, 4> dxys = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
    auto adj4(int x, int y) const {
        return dxys | std::views::transform([x, y](std::pair<int,int> dxy){
            return std::pair<int,int>(dxy.first + x, dxy.second + y);
        }) | std::views::filter([this](std::pair<int,int> xy){
            return operator()(xy.first, xy.second);
        });
    }
    auto adj4(int id) const {
        return adj4(id / w, id % w) | std::ranges::views::transform([this](std::pair<int,int> xy){
            return idx(xy.first, xy.second);
        });
    }
};

} // namespace noya2
#line 4 "c.cpp"

void umekomi(){
    const int klim = 400;
    vector<vector<ll>> dp(klim+1,vector<ll>(1<<16));
    auto id = [&](int i, int j){
        return i*4 + j;
    };
    dp[0][0] = 1;
    grid g(4,4);
    rep(i,16){
        int v = i+1;
        rep(s,1<<16){
            if (popcount<uint>(s) != i) continue;
            rep(x,4) rep(y,4){
                if (s >> id(x,y) & 1) continue;
                int add = 0;
                for (auto [nx, ny] : g.adj4(x,y)){
                    if (s >> id(nx,ny) & 1){
                        add += v - 16;
                    }
                    else {
                        add += 16 - v;
                    }
                }
                int ns = s ^ (1 << id(x,y));
                rep(k,klim+1){
                    int nk = k + add;
                    if (0 <= nk && nk <= klim){
                        dp[nk][ns] += dp[k][s];
                    }
                }
            }
        }
    }
    out("vector<ll> emb = {");
    rep(k,217){
        cout << dp[k][(1<<16)-1] << ",";
    }
    cout << endl;
    out("};");
}

vector<ll> emb = {
    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,576,6336,32688,109728,292360,690720,1482192,2901904,5290232,9051184,14818296,23208336,35444224,52313280,76165896,107817376,151136456,206538688,280850520,373958336,496563792,646511552,841022448,1073940272,1373159520,1724472448,2173965112,2693936208,3356996536,4112879776,5069503864,6145698704,7500374992,9002291472,10886553960,12950023664,15534989704,18330191088,21826592520,25556185792,30214911160,35115721776,41213475560,47528745680,55374598960,63355584272,73235329704,83088661872,95252098840,107100384672,121728039728,135636185488,152817991288,168730272976,188461179128,206185000928,228279868744,247485171200,271619130776,291810650816,317478414304,337980395648,364517045992,384542256192,411098567064,429692899120,455298745848,471402797888,495019582768,507574350192,528077104696,536056894256,552532363064,555126691616,566752110520,563549800176,569825698888,560753046592,561635860016,547051629840,542801041800,523561475168,514791687840,491843064800,479502626904,453886694304,438919104360,411796882592,395006790760,367318421328,349592862160,322244522592,304279133304,278166338192,260606817328,236415450464,219798733352,198011699984,182673877024,163585063776,149759315744,133360838032,121291416320,107364586352,97039206120,85460340016,76744851464,67244513664,60024991512,52289411200,46383784240,40172660592,35384317192,30414790512,26601233192,22681003744,19659744320,16621353472,14263408928,11954242720,10179313056,8450681536,7142896704,5909870720,4978519840,4116551680,3467513504,2870172672,2417125568,2001875712,1681805056,1384848768,1159246976,944311168,780931392,633980416,518132736,414036352,332820480,262237056,208061056,159154176,122112768,90448896,67079040,47692032,33697536,22858752,15363072,9566208,5750784,3115008,1585152,663552,258048,73728,18432,
    };
    

void solve(){
    // umekomi(); return ;
    int k; in(k);
    out(emb[k]);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0