結果
問題 | No.2310 [Cherry 5th Tune A] Against Regret |
ユーザー | 👑 AngrySadEight |
提出日時 | 2023-02-21 02:31:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,794 bytes |
コンパイル時間 | 7,172 ms |
コンパイル使用メモリ | 305,260 KB |
実行使用メモリ | 10,880 KB |
最終ジャッジ日時 | 2024-09-15 21:46:15 |
合計ジャッジ時間 | 19,287 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | TLE | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ ll N; cin >> N; vvl X(N + 1, vl(N + 1)); rep(i,N + 1){ rep(j,N + 1){ cin >> X[i][j]; } } ll Q; cin >> Q; vvl count(N + 1, vl(N + 1)); for (ll i = 0; i <= N; i++){ count[i][i] = 1; for (ll j = i + 1; j <= N; j++){ for (ll k = i; k < j; k++){ count[i][j] = (count[i][j] + count[i][k] * X[k][j]) % mod2; } } } while(Q--){ ll K; cin >> K; vl A(K); vl B(K); vl C(K); rep(i,K){ cin >> A[i] >> B[i] >> C[i]; } ll ans = 0; for (ll i = 0; i < (1 << K); i++){ vl vec(0); for (ll j = 0; j < K; j++){ if ((i >> j) & 1) vec.push_back(j); } if (vec.size() == 0){ ans = (ans + count[0][N]) % mod2; } else{ do{ ll now = 0; ll count_sub = 1; for (ll j = 0; j < vec.size(); j++){ if (A[vec[j]] != now) count_sub = (count_sub * count[now][A[vec[j]]]) % mod2; count_sub = (count_sub * C[vec[j]]) % mod2; now = B[vec[j]]; } if (now != N) count_sub = (count_sub * count[now][N]) % mod2; ans = (ans + count_sub) % mod2; }while(next_permutation(all(vec))); } } cout << ans << endl; } }