#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define FORR(i, m, n) for(int i = m;i >= n;i--) #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define llong long long #define pb(a) push_back(a) #define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++) using namespace std; typedef long long int ll; typedef pair pii; typedef pair pll; typedef tuple lltpl; int dy[8] = { 2,2,-2,-2,1,1,-1,-1 }; int dx[8] = { 1,-1,1,-1,2,-2,2,-2 }; /******************************************************************************************/ const int IINF = 1e9 + 7; const ll LINF = 1e18 + 7; const ll MOD = 1e9 + 7; template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>(a, make_v(ts...)); } template typename enable_if::value == 0>::type fill_v(T& t, const V& v) { t = v; } template typename enable_if::value != 0>::type fill_v(T& t, const V& v) { for (auto& e : t) fill_v(e, v); } // vector template istream& operator>>(istream & is, vector & vec) { for (T& x : vec) is >> x; return is; } // pair template ostream& operator<<(ostream & os, pair & pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } // vector template ostream& operator<<(ostream & os, const vector & vec) { os << "{"; for (int i = 0; i < vec.size(); i++) { os << vec[i] << (i + 1 == vec.size() ? "" : ", "); }os << "}"; return os; } // map template ostream& operator<<(ostream & os, map & map_var) { os << "{"; repi(itr, map_var) { os << *itr; itr++; if (itr != map_var.end()) os << ", "; itr--; }os << "}"; return os; } // set template ostream& operator<<(ostream & os, set & set_var) { os << "{"; repi(itr, set_var) { os << *itr; itr++; if (itr != set_var.end()) os << ", "; itr--; }os << "}"; return os; } int dp[1 << 15]; int cost[20][20]; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int N, M; cin >> N >> M; for (int i = 0; i < M; i++) { int X, Y, S; cin >> X >> Y >> S; cost[X][Y] = S; } for (int i = 0; i < (1 << N); i++) { for (int j = 0; j < N; j++) { //j:未使用 if ((i >> j) & 1)continue; int sum = 0; for (int k = 0; k < N; k++) { //k:すでに使用 if ((i >> k) & 1) { sum += cost[k][j]; } } dp[i | (1 << j)] = max(dp[i | (1 << j)], dp[i] + sum); } } cout << dp[(1 << N) - 1] << endl; }