結果

問題 No.519 アイドルユニット
ユーザー fumiphysfumiphys
提出日時 2019-08-02 14:29:50
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 174 ms / 1,000 ms
コード長 3,803 bytes
コンパイル時間 1,530 ms
コンパイル使用メモリ 165,764 KB
実行使用メモリ 202,120 KB
最終ジャッジ日時 2023-09-18 18:13:39
合計ジャッジ時間 4,168 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 172 ms
202,068 KB
testcase_01 AC 172 ms
202,012 KB
testcase_02 AC 44 ms
56,720 KB
testcase_03 AC 6 ms
9,472 KB
testcase_04 AC 2 ms
5,388 KB
testcase_05 AC 2 ms
5,412 KB
testcase_06 AC 2 ms
5,492 KB
testcase_07 AC 2 ms
5,472 KB
testcase_08 AC 2 ms
5,504 KB
testcase_09 AC 3 ms
5,644 KB
testcase_10 AC 3 ms
5,908 KB
testcase_11 AC 6 ms
9,552 KB
testcase_12 AC 2 ms
5,388 KB
testcase_13 AC 6 ms
9,544 KB
testcase_14 AC 6 ms
9,476 KB
testcase_15 AC 5 ms
9,556 KB
testcase_16 AC 6 ms
9,464 KB
testcase_17 AC 6 ms
9,468 KB
testcase_18 AC 6 ms
9,564 KB
testcase_19 AC 6 ms
9,676 KB
testcase_20 AC 5 ms
9,600 KB
testcase_21 AC 6 ms
9,700 KB
testcase_22 AC 6 ms
9,556 KB
testcase_23 AC 5 ms
9,476 KB
testcase_24 AC 14 ms
19,792 KB
testcase_25 AC 14 ms
19,716 KB
testcase_26 AC 14 ms
19,720 KB
testcase_27 AC 14 ms
19,740 KB
testcase_28 AC 13 ms
19,788 KB
testcase_29 AC 170 ms
202,060 KB
testcase_30 AC 172 ms
202,120 KB
testcase_31 AC 172 ms
202,112 KB
testcase_32 AC 174 ms
201,988 KB
testcase_33 AC 2 ms
5,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
int f[30][30];
ll dp[2][(1<<24)];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); rep(i, n)rep(j, n)cin >> f[i][j];
  dp[0][0] = 0;
  rep(i, n){
    rep(j, (1 << (i + 1)))dp[(i+1)&1][j] = - inf;
    rep(j, (1 << i)){
      if(dp[i&1][j] == inf)continue;
      if((i - __builtin_popcount(j) > n - i))continue;
      dp[(i+1)&1][j] = max(dp[(i+1)&1][j], dp[i&1][j]);
      for(int k = 0; k < i; k++){
        if(!((j >> k) & 1)){
          dp[(i+1)&1][j | bit(k) | bit(i)] = max(dp[(i+1)&1][j | bit(k) | bit(i)], dp[i&1][j] + f[i][k]);
        }
      }
    }
  }
  cout << dp[n&1][bit(n)-1] << endl;
  return 0;
}
0