結果
問題 | No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木 |
ユーザー | Forested |
提出日時 | 2021-12-09 14:24:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 208 ms / 2,000 ms |
コード長 | 3,670 bytes |
コンパイル時間 | 1,337 ms |
コンパイル使用メモリ | 122,576 KB |
最終ジャッジ日時 | 2025-01-26 07:15:35 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 42 |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cmath> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <tuple> #include <utility> #include <unordered_map> #include <unordered_set> #include <vector> #define OVERRIDE(a, b, c, d, ...) d #define REP2(i, n) for (i32 i = 0; i < (n); ++i) #define REP3(i, m, n) for (i32 i = (m); i < (n); ++i) #define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__) #define PER(i, n) for (i32 i = (n) - 1; i >= 0; --i) #define ALL(x) begin(x), end(x) using namespace std; using u32 = unsigned int; using u64 = unsigned long long; using u128 = __uint128_t; using i32 = signed int; using i64 = signed long long; using i128 = __int128_t; template <typename T> using Vec = vector<T>; template <typename T> bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template <typename T> bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } [[maybe_unused]] constexpr i32 inf = 1000000100; [[maybe_unused]] constexpr i64 inf64 = 3000000000000000100; struct SetIO { SetIO() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); } } set_io; const int cmax = 16; array<array<i64, cmax>, cmax> cat(const array<array<i64, cmax>, cmax> &a, const array<array<i64, cmax>, cmax> &b) { array<array<i64, cmax>, cmax> c; REP(i, cmax) REP(j, cmax) c[i][j] = -inf64; REP(i, cmax) REP(j, cmax) REP(k, cmax) { if (a[i][j] == -inf64 || b[j][k] == -inf64) continue; chmax(c[i][k], a[i][j] + b[j][k]); } return c; } array<array<i64, cmax>, cmax> doubling(array<array<i64, cmax>, cmax> a, i32 k) { array<array<i64, cmax>, cmax> self = a; array<array<i64, cmax>, cmax> ret; REP(i, cmax) REP(j, cmax) { ret[i][j] = (i == j ? 0 : -inf64); } while (k) { if (k % 2) { ret = cat(ret, self); } self = cat(self, self); k /= 2; } return ret; } string dbg(i64 x) { if (x == -inf64) { return "Impossible"; } else { return to_string(x); } } int main() { array<i32, 26> c; REP(i, 26) { cin >> c[i]; --c[i]; } array<i32, 26> k; REP(i, 26) cin >> k[i]; i32 n; cin >> n; Vec<string> s(n); Vec<i32> a(n), b(n); Vec<i64> e(n); REP(i, n) { cin >> s[i] >> a[i] >> b[i] >> e[i]; --a[i]; --b[i]; } array<array<array<i64, cmax>, cmax>, 26> dbs; REP(ch, 26) { array<array<i64, cmax>, cmax> mat; REP(i, cmax) REP(j, cmax) mat[i][j] = -inf64; REP(i, cmax) mat[i][i] = 0; REP(i, n) { bool cont = false; for (char c : s[i]) { if (c == 'A' + ch) cont = true; } if (cont) { chmax(mat[a[i]][b[i]], e[i]); chmax(mat[b[i]][a[i]], e[i]); } } dbs[ch] = doubling(mat, k[ch]); } /*REP(ch, 1) { REP(i, 10) REP(j, 10) { cout << dbg(dbs[ch][i][j]) << " \n"[j + 1 == 10]; } cout << "\n"; }*/ i64 ans = -inf64; REP(to, cmax) { i64 sum = 0; REP(ch, 26) { if (dbs[ch][c[ch]][to] == -inf64 || sum == -inf64) { sum = -inf64; } else { sum += dbs[ch][c[ch]][to]; } } chmax(ans, sum); } cout << dbg(ans) << '\n'; }