#493665 (C++14) No.357 品物の並び替え (Middle)

• 問題: No.357 品物の並び替え (Middle)
• ユーザー: pione
• 提出日時: 2020-06-07 04:58:57
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 9 ms / 5,000 ms
• コード長: 2,028 bytes
• コンパイル時間: 1,418 ms
• コンパイル使用メモリ: 167,916 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-06 04:06:00
• 合計ジャッジ時間: 2,121 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	4 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	3 ms; 5,376 KB
testcase_12	AC	9 ms; 5,376 KB
testcase_13	AC	5 ms; 5,376 KB
testcase_14	AC	5 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	3 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;

ll dp[1001001l]; // 整列済みが集合sであるときの、最大の得点
ll score[20][20];

signed main()
{
  cin.tie( 0 ); ios::sync_with_stdio( false );
  
  ll n,m; cin>>n>>m;
  
  rep(i,m){
    ll a,b,c; cin>>a>>b>>c;
    score[a][b]=c;
  }
  
  rep(s,1<<n){
    rep(i,n) if((s>>i&1)==0){
      ll tmp=0;
      rep(j,n) if((s>>j&1)){
        tmp+=score[i][j];
      }
      chmax(dp[s|(1<<i)],dp[s]+tmp);
    }
  }
  
  ll ans=dp[(1<<n)-1];
  cout<<ans<<endl;
  
}