結果
| 問題 | No.1442 I-wate Shortest Path Problem |
| ユーザー |
 first_vil
|
| 提出日時 | 2021-02-01 00:31:17 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,535 bytes |
| コンパイル時間 | 2,783 ms |
| コンパイル使用メモリ | 230,532 KB |
| 最終ジャッジ日時 | 2025-01-18 10:27:38 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 21 TLE * 4 |
ソースコード
//https://yukicoder.me/submissions/611754// This solution is correct// O(nlgn + 2^k * k^2 * q) (With optimization, Should still TLE)#pragma GCC optimize("O3")// Exported by Exporter.exe// Included from Slow.cpp// Compile flags -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -DDEBUG -ggdb3 -fmax-errors=2#include <bits/stdc++.h>using namespace std;#define PB push_back#define F first#define S second#define MP make_pair#define MTP make_tupletypedef long long int ll;constexpr int kN = int(1E5 + 10);constexpr int kLgn = 17;// constexpr int kMod = 998244353;// constexpr int kInf = 0x3f3f3f3f;constexpr ll kInf = 0x3f3f3f3f3f3f3f3f;// constexpr double kPi = acos(-1);// constexpr double kEps = 1E-9;template <typename T> T ABS(T n) {return n >= 0 ? n : -n;}// Included from C:\Users\ianli\Desktop\CP\template\Various\Fast_IO.cppstatic inline char Get_Raw_Char() {static char buf[1 << 16], *p = buf, *end = buf;if (p == end) {if ((end = buf + fread(buf, 1, 1 << 16, stdin)) == buf) return '\0';p = buf;}return *p++;}static inline int Get_Digit() {char c = Get_Raw_Char();while (!isdigit(c)) c = Get_Raw_Char();return int(c - '0');}static inline int Get_PInt() {char c = Get_Raw_Char();int ret;while (!isdigit(c)) c = Get_Raw_Char();ret = int(c - '0');while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');return ret;}static inline int Get_Int() {char c = Get_Raw_Char();bool neg = false;int ret;while (!isdigit(c)) {if (c == '-') neg = true;c = Get_Raw_Char();}ret = int(c - '0');while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');if (neg) return -ret;return ret;}static inline long long int Get_ll() {char c = Get_Raw_Char();bool neg = false;long long int ret;while (!isdigit(c)) {if (c == '-') neg = true;c = Get_Raw_Char();}ret = int(c - '0');while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');if (neg) return -ret;return ret;}static inline long long int Get_Pll() {char c = Get_Raw_Char();long long int ret;while (!isdigit(c)) c = Get_Raw_Char();ret = int(c - '0');while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');return ret;}template <typename T> static inline void Read_P(T &n) {static_assert(is_integral<T>::value);char c = Get_Raw_Char();while (!isdigit(c)) c = Get_Raw_Char();n = int(c - '0');while (isdigit(c = Get_Raw_Char())) n = n * 10 + int(c - '0');return ;}template <typename T> static inline void Read(T &n) {static_assert(is_integral<T>::value);char c = Get_Raw_Char();bool neg = false;while (!isdigit(c)) {if (c == '-') neg = true;c = Get_Raw_Char();}n = int(c - '0');while (isdigit(c = Get_Raw_Char())) n = n * 10 + int(c - '0');if (neg) n = -n;return ;}template <typename T> static inline void Read_Digit(T &n) {static_assert(is_integral<T>::value);char c = Get_Raw_Char();while (!isdigit(c)) c = Get_Raw_Char();n = int(c - '0');return ;}template <typename T, typename... Targs> static inline void Read(T &n, Targs&... Fargs) {Read(n);return Read(Fargs...);}template <typename T, typename... Targs> static inline void Read_Digit(T &n, Targs&... Fargs) {Read_Digit(n);return Read_Digit(Fargs...);}template <typename T, typename... Targs> static inline void Read_P(T &n, Targs&... Fargs) {Read_P(n);return Read_P(Fargs...);}// End of C:\Users\ianli\Desktop\CP\template\Various\Fast_IO.cppint m[12], p[12], x[12][kN], u[kN], v[kN], dep[kN];ll ans[kN], fa[kLgn][kN], dis[12][kN], dis_color[12][12], dis_color_tmp[12][12];vector<pair<int, int>> graph[kN];void dfs(int cur, int from) {for (pair<int, int> i : graph[cur]) if (i.F != from) {fa[0][i.F] = cur;dis[0][i.F] = dis[0][cur] + i.S;dep[i.F] = dep[cur] + 1;dfs(i.F, cur);}return ;}int LCA(int l, int r) {if (dep[l] < dep[r]) swap(l, r);for (int i = kLgn - 1; i >= 0; i--) if (dep[fa[i][l]] >= dep[r]) l = fa[i][l];if (l == r) return l;for (int i = kLgn - 1; i >= 0; i--) if (fa[i][l] != fa[i][r]) l = fa[i][l], r = fa[i][r];return fa[0][l];}int main() {//ios::sync_with_stdio(false);//cin.tie(0);//freopen("file_name", "r", stdin);//freopen("file_name", "w", stdout);//fstream input, output;//input.open("file_name", ios::in);//output.open("file_name", ios::out);int n, k, q;Read_P(n, k);for (int i = 2; i <= n; i++) {int l, r, c;Read_P(l, r, c);graph[l].PB(MP(r, c));graph[r].PB(MP(l, c));}for (int i = 1; i <= k; i++) {Read_P(m[i], p[i]);for (int j = 1; j <= m[i]; j++) Read_P(x[i][j]);}Read_P(q);for (int i = 1; i <= q; i++) Read_P(u[i], v[i]);memset(dis, 0x3f, sizeof(dis));memset(dis_color, 0x3f, sizeof(dis_color));dis[0][1] = 0;dfs(1, 1);fa[0][1] = 1;for (int i = 1; i < kLgn; i++) {#pragma unrollfor (int j = 1; j <= n; j++) fa[i][j] = fa[i - 1][fa[i - 1][j]];}#pragma unrollfor (int i = 1; i <= q; i++) ans[i] = dis[0][u[i]] + dis[0][v[i]] - dis[0][LCA(u[i], v[i])] * 2;for (int i = 1; i <= k; i++) {priority_queue<ll, vector<ll>, greater<ll>> pq;for (int j = 1; j <= m[i]; j++) pq.push(x[i][j]);#pragma unrollfor (int j = 1; j <= m[i]; j++) dis[i][x[i][j]] = 0;while (!pq.empty()) {int cur = pq.top() & 0xfffff;ll ndis = pq.top() >> 20;pq.pop();if (ndis > dis[i][cur]) continue;for (pair<int, int> j : graph[cur]) if (dis[i][j.F] > ndis + j.S)pq.push((dis[i][j.F] = ndis + j.S) << 20 | j.F);}for (int j = i + 1; j <= k; j++) for (int c = 1; c <= m[j]; c++)dis_color[i][j] = min(dis_color[i][j], dis[i][x[j][c]]);}for (int i = 1; i <= k; i++) dis_color[i][i] = 0;for (int i = 1; i <= k; i++) for (int j = i + 1; j <= k; j++) dis_color[j][i] = dis_color[i][j];int tot = 1 << k;for (int mask = 1; mask < tot; mask++) {vector<int> vec;for (int i = 1; i <= k; i++) if (mask & (1 << (i - 1))) vec.PB(i);memcpy(dis_color_tmp, dis_color, sizeof(dis_color));//for (int i : vec) for (int j : vec) dis_color_tmp[i][j] = dis_color[i][j];for (int c : vec) for (int i : vec) for (int j : vec)dis_color_tmp[i][j] = min(dis_color_tmp[i][j], dis_color_tmp[i][c] + dis_color_tmp[c][j]);ll tmp = 0;for (int i : vec) tmp += p[i];for (int i = 1; i <= q; i++) for (int a : vec) for (int b : vec)ans[i] = min(ans[i], dis[a][u[i]] + dis[b][v[i]] + dis_color_tmp[a][b] + tmp);}for (int i = 1; i <= q; i++) printf("%lld\n", ans[i]);//input.close();//output.close();}// End of Slow.cpp