結果
問題 | No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木 |
ユーザー | SSRS |
提出日時 | 2021-12-09 00:15:35 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,161 bytes |
コンパイル時間 | 1,890 ms |
コンパイル使用メモリ | 183,116 KB |
実行使用メモリ | 16,964 KB |
最終ジャッジ日時 | 2023-09-23 11:44:22 |
合計ジャッジ時間 | 6,041 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
4,376 KB |
testcase_01 | AC | 5 ms
4,376 KB |
testcase_02 | AC | 5 ms
4,380 KB |
testcase_03 | AC | 5 ms
4,380 KB |
testcase_04 | AC | 5 ms
4,384 KB |
testcase_05 | AC | 5 ms
4,380 KB |
testcase_06 | AC | 5 ms
4,380 KB |
testcase_07 | AC | 5 ms
4,384 KB |
testcase_08 | AC | 5 ms
4,384 KB |
testcase_09 | AC | 5 ms
4,380 KB |
testcase_10 | AC | 5 ms
4,380 KB |
testcase_11 | AC | 5 ms
4,380 KB |
testcase_12 | AC | 5 ms
4,376 KB |
testcase_13 | AC | 5 ms
4,380 KB |
testcase_14 | AC | 43 ms
5,204 KB |
testcase_15 | AC | 192 ms
13,296 KB |
testcase_16 | AC | 188 ms
13,336 KB |
testcase_17 | AC | 28 ms
4,484 KB |
testcase_18 | AC | 119 ms
9,400 KB |
testcase_19 | AC | 39 ms
4,908 KB |
testcase_20 | AC | 140 ms
10,448 KB |
testcase_21 | AC | 241 ms
16,108 KB |
testcase_22 | AC | 247 ms
16,384 KB |
testcase_23 | AC | 59 ms
6,256 KB |
testcase_24 | AC | 259 ms
16,964 KB |
testcase_25 | AC | 54 ms
5,756 KB |
testcase_26 | AC | 41 ms
4,908 KB |
testcase_27 | AC | 118 ms
9,396 KB |
testcase_28 | AC | 24 ms
4,380 KB |
testcase_29 | AC | 16 ms
4,380 KB |
testcase_30 | AC | 234 ms
15,708 KB |
testcase_31 | AC | 8 ms
4,380 KB |
testcase_32 | AC | 18 ms
4,380 KB |
testcase_33 | AC | 105 ms
8,376 KB |
testcase_34 | AC | 5 ms
4,380 KB |
testcase_35 | AC | 6 ms
4,376 KB |
testcase_36 | AC | 4 ms
4,380 KB |
testcase_37 | AC | 6 ms
4,380 KB |
testcase_38 | AC | 6 ms
4,380 KB |
testcase_39 | WA | - |
testcase_40 | AC | 6 ms
4,380 KB |
testcase_41 | AC | 6 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; const int LOG = 24; const long long INF = 100000000000000000; int main(){ vector<int> C(26); for (int i = 0; i < 26; i++){ cin >> C[i]; C[i]--; } vector<int> K(26); for (int i = 0; i < 26; i++){ cin >> K[i]; } int N; cin >> N; vector<string> S(N); vector<int> A(N), B(N), E(N); for (int i = 0; i < N; i++){ cin >> S[i] >> A[i] >> B[i] >> E[i]; A[i]--; B[i]--; } vector<int> s(N, 0); for (int i = 0; i < N; i++){ int L = S[i].size(); for (int j = 0; j < L; j++){ s[i] |= 1 << (S[i][j] - 'A'); } } vector<long long> sum(16, 0); for (int i = 0; i < 26; i++){ vector<vector<long long>> P(16, vector<long long>(16, -INF)); for (int j = 0; j < N; j++){ if ((s[j] >> i & 1) == 1){ P[A[j]][B[j]] = max(P[A[j]][B[j]], (long long) E[j]); P[B[j]][A[j]] = max(P[B[j]][A[j]], (long long) E[j]); } } for (int j = 0; j < 16; j++){ P[j][j] = 0; } vector<vector<vector<long long>>> dp(LOG, vector<vector<long long>>(16, vector<long long>(16, -INF))); dp[0] = P; for (int j = 0; j < LOG - 1; j++){ for (int k = 0; k < 16; k++){ for (int m = 0; m < 16; m++){ for (int n = 0; n < 16; n++){ dp[j + 1][k][n] = max(dp[j + 1][k][n], dp[j][k][m] + dp[j][m][n]); } } } } vector<vector<long long>> c(16, vector<long long>(16, -INF)); for (int j = 0; j < 16; j++){ c[j][j] = 0; } for (int j = 0; j < LOG; j++){ if ((K[i] >> j & 1) == 1){ vector<vector<long long>> c2(16, vector<long long>(16, -INF)); for (int k = 0; k < 16; k++){ for (int m = 0; m < 16; m++){ for (int n = 0; n < 16; n++){ c2[k][n] = max(c2[k][n], c[k][m] + dp[j][m][n]); } } } swap(c, c2); } } for (int j = 0; j < 16; j++){ sum[j] += c[C[i]][j]; } } long long mx = -INF; for (int i = 0; i < 16; i++){ mx = max(mx, sum[i]); } if (mx < 0){ cout << "Impossible" << endl; } else { cout << mx << endl; } }