結果

問題 No.1598 4×4 Grid
ユーザー rniyarniya
提出日時 2021-07-09 22:49:26
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 296 ms / 4,000 ms
コード長 5,170 bytes
コンパイル時間 2,213 ms
コンパイル使用メモリ 206,088 KB
実行使用メモリ 116,212 KB
最終ジャッジ日時 2023-09-14 10:27:45
合計ジャッジ時間 4,658 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 12 ms
10,652 KB
testcase_01 AC 96 ms
36,288 KB
testcase_02 AC 103 ms
37,404 KB
testcase_03 AC 206 ms
59,756 KB
testcase_04 AC 243 ms
75,108 KB
testcase_05 AC 286 ms
107,008 KB
testcase_06 AC 296 ms
116,212 KB
testcase_07 AC 8 ms
6,708 KB
testcase_08 AC 98 ms
36,336 KB
testcase_09 AC 253 ms
81,492 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
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, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int MAX = 16;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int K;
    cin >> K;

    vector<pair<int, int>> add;
    auto idx = [&](int x, int y) { return 4 * x + y; };
    for (int x = 0; x < 4; x++) {
        for (int y = 0; y < 4; y++) {
            for (int i = 0; i < 2; i++) {
                int nx = x + dx[i], ny = y + dy[i];
                if (4 <= nx || 4 <= ny) continue;
                add.emplace_back(idx(x, y), idx(nx, ny));
            }
        }
    }
    vector<vector<ll>> dp(1 << MAX, vector<ll>(K + 1, 0));
    dp[0][0] = 1;
    for (int mask = 0; mask < (1 << MAX); mask++) {
        for (int sum = 0; sum <= K; sum++) {
            if (dp[mask][sum] == 0) continue;
            int nsum = sum;
            for (auto& p : add) {
                int a = p.first, b = p.second;
                nsum += ((mask >> a & 1) ^ (mask >> b & 1));
            }
            if (nsum > K) continue;
            for (int i = 0; i < MAX; i++) {
                if (mask >> i & 1) continue;
                dp[mask | 1 << i][nsum] += dp[mask][sum];
            }
        }
    }

    ll ans = dp[(1 << MAX) - 1][K];
    cout << ans << '\n';
    return 0;
}
0