結果
問題 | No.357 品物の並び替え (Middle) |
ユーザー |
|
提出日時 | 2016-04-06 00:04:05 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 7 ms / 5,000 ms |
コード長 | 2,700 bytes |
コンパイル時間 | 1,414 ms |
コンパイル使用メモリ | 160,988 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-04 02:06:47 |
合計ジャッジ時間 | 2,281 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>#define EPS 1e-9#define INF 1070000000LL#define MOD 1000000007LL#define fir first#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)#define numa(x,a) for(auto x: a)#define ite iterator#define mp make_pair#define rep(i,n) rep2(i,0,n)#define rep2(i,m,n) for(int i=m;i<(n);i++)#define pb push_back#define pf push_front#define sec second#define sz(x) ((int)(x).size())#define ALL( c ) (c).begin(), (c).end()#define gcd(a,b) __gcd(a,b)#define mem(x,n) memset(x,n,sizeof(x))#define endl "\n"using namespace std;template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t);deploy<POS + 1, TUPLE, Ts...>(os, t); }template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e <<(--remain == 0 ? "}" : ", "); return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain== 0 ? "}" : ", "); return os; }template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }using ll = long long;int score[15][15];int N,M;int memo[1<<15];//parbestint solve(){memo[0] = 0;for (int bit = 0, fin = (1<<N); bit < fin; bit++) {vector <int> par;vector <int> ch;for (int i = 0; i < N; i++) {if (bit & (1<<i)) {par.pb(i);}else{ch.pb(i);}}numa(v, ch){int ret = 0;numa(p, par){ret += score[p][v];}int nbit = bit ^ (1<<v);memo[nbit] = max(memo[nbit], memo[bit] + ret);}}return memo[(1<<N) - 1];}int main(){cin.tie(0);ios_base::sync_with_stdio(0);cin >> N >> M;rep(i,M){int x,y,z;cin >> x >> y >> z;score[x][y] = z;}cout << solve() << endl;return 0;}