結果
問題 | No.1284 Flip Game |
ユーザー |
|
提出日時 | 2020-11-06 22:04:06 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 2,057 bytes |
コンパイル時間 | 2,248 ms |
コンパイル使用メモリ | 210,044 KB |
最終ジャッジ日時 | 2025-01-15 20:43:22 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
#include <bits/stdc++.h> #define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i)) #define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i)) #define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i)) #define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i)) #define ALL(x) ::std::begin(x), ::std::end(x) using namespace std; template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >; int64_t solve(int n, const vector<vector<int64_t> >& c) { vector<int> three(n + 1); three[0] = 1; REP (i, n) { three[i + 1] = 3 * three[i]; } // dijkstra vector<vector<int64_t> > dist(n, vector<int64_t>(three[n], INT64_MAX)); reversed_priority_queue<tuple<int64_t, int, int> > que; REP (p, n) { dist[p][three[p]] = 0; que.emplace(0, p, three[p]); } while (not que.empty()) { int64_t dist_q_s; int q, s; tie(dist_q_s, q, s) = que.top(); que.pop(); if (dist[q][s] < dist_q_s) continue; vector<int> cur(n); { int t = s; REP (p, n) { cur[p] = t % 3; t /= 3; } } REP (p, n) if (cur[p] != 2 and p != q) { int t = s + three[p]; if (dist[q][s] + c[q][p] < dist[p][t]) { dist[p][t] = dist[q][s] + c[q][p]; que.emplace(dist[p][t], p, t); } } } int64_t ans = INT64_MAX; REP (p, n) { ans = min(ans, dist[p][three[n] - 1]); ans = min(ans, dist[p][three[n] - 1 - three[p]]); } return ans; } // generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator) int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); constexpr char endl = '\n'; int N; cin >> N; vector<vector<int64_t> > c(N, vector<int64_t>(N)); REP (j, N) { REP (i, N) { cin >> c[j][i]; } } auto ans = solve(N, c); cout << ans << endl; return 0; }