結果

問題 No.1937 Various Tournament
ユーザー milkcoffeemilkcoffee
提出日時 2022-05-13 21:48:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,229 ms / 2,000 ms
コード長 5,302 bytes
コンパイル時間 5,063 ms
コンパイル使用メモリ 277,336 KB
実行使用メモリ 19,968 KB
最終ジャッジ日時 2024-07-22 01:29:37
合計ジャッジ時間 44,092 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
19,760 KB
testcase_01 AC 1,215 ms
19,728 KB
testcase_02 AC 1,203 ms
19,912 KB
testcase_03 AC 1,211 ms
19,840 KB
testcase_04 AC 1,209 ms
19,796 KB
testcase_05 AC 14 ms
19,820 KB
testcase_06 AC 1,206 ms
19,928 KB
testcase_07 AC 1,218 ms
19,796 KB
testcase_08 AC 15 ms
19,640 KB
testcase_09 AC 1,208 ms
19,868 KB
testcase_10 AC 13 ms
19,840 KB
testcase_11 AC 1,216 ms
19,968 KB
testcase_12 AC 1,221 ms
19,840 KB
testcase_13 AC 1,207 ms
19,968 KB
testcase_14 AC 1,223 ms
19,840 KB
testcase_15 AC 1,212 ms
19,840 KB
testcase_16 AC 1,205 ms
19,908 KB
testcase_17 AC 1,220 ms
19,940 KB
testcase_18 AC 1,211 ms
19,840 KB
testcase_19 AC 1,229 ms
19,824 KB
testcase_20 AC 15 ms
19,908 KB
testcase_21 AC 14 ms
19,788 KB
testcase_22 AC 1,221 ms
19,840 KB
testcase_23 AC 1,208 ms
19,840 KB
testcase_24 AC 1,212 ms
19,756 KB
testcase_25 AC 14 ms
19,968 KB
testcase_26 AC 1,209 ms
19,792 KB
testcase_27 AC 15 ms
19,832 KB
testcase_28 AC 1,218 ms
19,776 KB
testcase_29 AC 15 ms
19,840 KB
testcase_30 AC 1,210 ms
19,828 KB
testcase_31 AC 1,208 ms
19,752 KB
testcase_32 AC 1,206 ms
19,752 KB
testcase_33 AC 1,209 ms
19,840 KB
testcase_34 AC 1,215 ms
19,820 KB
testcase_35 AC 1,213 ms
19,840 KB
testcase_36 AC 1,221 ms
19,840 KB
testcase_37 AC 15 ms
19,824 KB
testcase_38 AC 14 ms
19,864 KB
testcase_39 AC 1,205 ms
19,732 KB
testcase_40 AC 14 ms
19,776 KB
testcase_41 AC 14 ms
19,816 KB
testcase_42 AC 1,211 ms
19,796 KB
testcase_43 AC 15 ms
19,816 KB
testcase_44 AC 14 ms
19,856 KB
testcase_45 AC 1,206 ms
19,788 KB
testcase_46 AC 15 ms
19,820 KB
testcase_47 AC 14 ms
19,840 KB
testcase_48 AC 14 ms
19,840 KB
testcase_49 AC 15 ms
19,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/

#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define pb push_back
#define bit_count(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define endl "\n"

#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvvll vector< vector <vector <vector<ll> > > >
#define vvvll vector< vector< vector<ll> > >
#define vvll vector< vector<ll> >
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>

template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template <class T>
using V = vector<T>;

constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007;
//constexpr ll mod = 998244353;

constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void pt(T val)
{
    cout << val << "\n";
}
template <typename T>
void pt_vll(vector<T> &v)
{
    ll vs = v.size();
    rep(i, vs)
    {
        cout << v[i];

        if (i == vs - 1)
            cout << "\n";
        else
            cout << " ";
    }
}
ll mypow(ll a, ll n)
{
    ll ret = 1;
    if (n == 0)
        return 1;
    if (a == 0)
        return 0;
    rep(i, n)
    {
        if (ret > (ll)(9e18 + 10) / a)
            return -1;
        ret *= a;
    }
    return ret;
}
long long modpow(long long a, long long n, long long mod)
{
    long long res = 1;
    while (n > 0)
    {
        if (n & 1)
            res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
long long modinv(long long a, long long m)
{
    long long b = m, u = 1, v = 0;
    while (b)
    {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}

const int MAX = 3010000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < MAX; i++)
    {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

// 二項係数計算
long long COM(ll n, ll k)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

vector<ll> enum_div(ll n)
{ //約数全列挙
    vector<ll> ret;
    for (ll i = 1; i * i <= n; ++i)
    {
        if (n % i == 0)
        {
            ret.push_back(i);
            if (i * i != n)
            {
                ret.push_back(n / i);
            }
        }
    }
    return ret;
}

void make_prime(vector<ll> &ret, ll n)
{ //素因数分解
    ll x = n;
    for (ll i = 2; i * i <= x; i++)
    {
        while (n % i == 0)
        {
            n /= i;
            ret.push_back(i);
        }
    }
    if (n != 1)
    {
        ret.push_back(n);
    }
    return;
}

vector<bool> prime(1000010, true);
vector<ll> pri(1000010);
vector<bool> isprime(int N)
{ //素数判定
    if (N >= 0)
        prime[0] = false;
    if (N >= 1)
        prime[1] = false;
    for (ll i = 2; i * i <= N; i++)
    {
        if (!prime[i])
        {
            continue;
        }
        for (ll j = i * i; j <= N; j += i)
        {
            if (prime[j])
                pri[j] = i;
            prime[j] = false;
        }
    }
    return prime;
}

map<ll,ll> compression(vector<ll> v){
    map<ll,ll> ret;
    ll cnt = 0;
    sort(v.begin(),v.end());
    for(ll i=0; i<v.size(); i++){
        if(!ret.count(v[i])){
            ret[v[i]] = cnt;
            cnt++;
        }
    }
    return ret;
}

//素因数分解: void make_prime(vector<ll> &ret, ll n)
//素数判定　: vector<bool> isprime(int N)
//約数全列挙: vector<ll> enum_div(ll n)

vvll dp(16,vll(1<<16,INF));
vvll a(16,vll(16));
ll n,K,W;

ll dfs(ll v, ll S){
    if(!(S&(1<<v))) return 0;
	if(dp[v][S]!=INF) return dp[v][S];
    if(bit_count(S)==1){return 1;}
    
    ll res=0;
    rep(j,n){
        if(a[v][j]==0) continue;
        for(ll i=(S-1)&S;i>0;i=(i-1)&S){
            if(bit_count(i)*2!=bit_count(S)) continue;
            res+=2*dfs(v,i)*dfs(j,i^S);
        }
    }
    //cout<<v<<" "<<S<<" "<<res<<endl;
    return dp[v][S]=res;
}


void solve(){
    ll m, k, cnt = 0, sum = 0, ans = 0;
    cin>>n;
    rep(i,n){
        rep(j,n){
            cin>>a[i][j];
        }
    }
    rep(i,n){
        ans=dfs(i,(1<<n)-1);
        pt(ans);
    }
    //pt(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout << fixed << setprecision(16);
    //ll T;
    //cin>>T;
    //rep(ca,T)
    solve();
}
0