結果
問題 | No.357 品物の並び替え (Middle) |
ユーザー |
|
提出日時 | 2023-01-01 00:57:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 6 ms / 5,000 ms |
コード長 | 3,249 bytes |
コンパイル時間 | 2,319 ms |
コンパイル使用メモリ | 253,196 KB |
最終ジャッジ日時 | 2025-02-09 22:33:37 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 18 |
ソースコード
#pragma region Macros#include <bits/extc++.h>using namespace std;using namespace __gnu_pbds;// using namespace __gnu_cxx;#define TO_STRING(var) # var#define pb emplace_back#define int ll#define endl '\n'using ll = long long;using ld = long double;const ld PI = acos(-1);const ld EPS = 1e-10;const int INF = 1 << 30;const ll INFL = 1LL << 61;// const int MOD = 998244353;const int MOD = 1000000007;__attribute__((constructor))void constructor() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);}template<int mod> class modint{public:int val = 0;modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }modint(const modint &r) { val = r.val; }modint operator -() { return modint(-val); }modint operator +(const modint &r) { return modint(*this) += r; }modint operator -(const modint &r) { return modint(*this) -= r; }modint operator *(const modint &r) { return modint(*this) *= r; }modint operator /(const modint &r) { return modint(*this) /= r; }modint &operator +=(const modint &r) {val += r.val;if (val >= mod) val -= mod;return *this;}modint &operator -=(const modint &r) {if (val < r.val) val += mod;val -= r.val;return *this;}modint &operator *=(const modint &r) {val = val * r.val % mod;return *this;}modint &operator /=(const modint &r) {int a = r.val, b = mod, u = 1, v = 0;while (b) {int t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % mod;if (val < 0) val += mod;return *this;}bool operator ==(const modint& r) { return this -> val == r.val; }bool operator <(const modint& r) { return this -> val < r.val; }bool operator !=(const modint& r) { return this -> val != r.val; }};using mint = modint<MOD>;istream &operator >>(istream &is, mint& x) {int t; is >> t;x = t;return (is);}ostream &operator <<(ostream &os, const mint& x) {return os << x.val;}mint modpow(const mint &a, int n) {if (n == 0) return 1;mint t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}int modpow(int x, int n, int mod) {int ret = 1;while (n > 0) {if (n % 2 == 1) ret = ret * x % mod;x = x * x % mod;n /= 2;}return ret;}int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }#pragma endregionsigned main() {int N, M;cin >> N >> M;vector<vector<int>> A(N,vector<int>(N));for (int i = 0; i < M; i++) {int a, b, c;cin >> a >> b >> c;A[a][b] = c;}vector<int> dp(1LL << N, -1);dp[0] = 0;for (int i = 0; i < (1LL << N); i++) {if (dp[i] == -1) continue;for (int j = 0; j < N; j++) {if (i & (1LL << j)) continue;int d = 0;for (int l = 0; l < N; l++) {if (i & (1LL << l)) d += A[l][j];}dp[i + (1LL << j)] = max(dp[i + (1LL << j)], dp[i] + d);}}cout << dp[(1LL << N) - 1] << endl;}