結果

問題 No.1937 Various Tournament
ユーザー miscalc
提出日時 2022-05-13 23:24:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,551 bytes
コンパイル時間 4,429 ms
コンパイル使用メモリ 264,540 KB
最終ジャッジ日時 2025-01-29 07:40:03
ジャッジサーバーID
（参考情報） 		judge4 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16 TLE * 31
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//*/
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll mypowl(ll A, ll B) {ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << 
    '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
ll N;
vector<vector<ll>> S;
ll winner(vector<ll> &A)
{
  if (A.size() == 1)
    return A.front();
  vector<ll> B;
  for (ll i = 0; i < A.size(); i += 2)
  {
    if (S.at(A.at(i)).at(A.at(i + 1)))
      B.push_back(A.at(i));
    else
      B.push_back(A.at(i + 1));
  }
  return winner(B);
}
map<vector<ll>, vector<ll>> mp;
vector<ll> solve(vector<ll> &A)
{
  ll K = A.size();
  if (K == 1)
  {
    vector<ll> res(N, 0);
    res.at(A.front()) = 1;
    return res;
  }
  /*
  if (mp.find(A) != mp.end())
    return mp[A];
  //*/
  vector<ll> P(K, 1);
  for (ll i = 0; i < K / 2; i++)
  {
    P.at(i) = 0;
  }
  vector<ll> res(N, 0);
  do
  {
    vector<ll> B, C;
    for (ll i = 0; i < K; i++)
    {
      if (P.at(i) == 0)
        B.push_back(A.at(i));
      else
        C.push_back(A.at(i));
    }
    vector<ll> ans1 = solve(B), ans2 = solve(C);
    for (ll i = 0; i < N; i++)
    {
      for (ll j = 0; j < N; j++)
      {
        ll tmp = ans1.at(i) * ans2.at(j);
        if (S.at(i).at(j))
          res.at(i) += tmp;
        else
          res.at(j) += tmp;
      }
    }
  } while (next_permutation(P.begin(), P.end()));
  /*
  printvec(A);
  printvec(res);
  //*/
  mp[A] = res;
  return res;
}
int main()
{
  cin >> N;
  S.resize(N);
  for (ll i = 0; i < N; i++)
  {
    S.at(i).resize(N);
    for (ll j = 0; j < N; j++)
    {
      cin >> S.at(i).at(j);
    }
  }
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    A.at(i) = i;
  }
  vector<ll> ans = solve(A);
  printvect(ans);
  return 0;
  if (N <= 8)
  {
    vector<ll> ans(N, 0);
    vector<ll> P(N);
    for (ll i = 0; i < N; i++)
    {
      P.at(i) = i;
    }
    do
    {
      ll w = winner(P);
      ans.at(w)++;
    } while (next_permutation(P.begin(), P.end()));
    printvect(ans);
  }
  else if (N == 16)
  {
    vector<ll> P(N, 1);
    for (ll i = 0; i < N / 2; i++)
    {
      P.at(i) = 0;
    }
    do
    {
      vector<ll> A, B;
      for (ll i = 0; i < N; i++)
      {
        if (P.at(i) == 0)
          A.push_back(i);
        else
          B.push_back(i);
      }
    } while (next_permutation(P.begin(), P.end()));
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0