結果
問題 | No.114 遠い未来 |
ユーザー |
|
提出日時 | 2015-10-31 10:55:06 |
言語 | C++11 (gcc 11.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,667 bytes |
コンパイル時間 | 1,096 ms |
コンパイル使用メモリ | 98,612 KB |
実行使用メモリ | 11,244 KB |
最終ジャッジ日時 | 2023-10-11 07:08:11 |
合計ジャッジ時間 | 31,540 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
5,000 KB |
testcase_01 | AC | 4,357 ms
11,176 KB |
testcase_02 | WA | - |
testcase_03 | AC | 242 ms
11,160 KB |
testcase_04 | AC | 2 ms
4,996 KB |
testcase_05 | AC | 17 ms
5,016 KB |
testcase_06 | AC | 2,590 ms
11,204 KB |
testcase_07 | AC | 1 ms
4,352 KB |
testcase_08 | AC | 2 ms
5,008 KB |
testcase_09 | AC | 28 ms
5,040 KB |
testcase_10 | AC | 1,455 ms
7,084 KB |
testcase_11 | TLE | - |
testcase_12 | WA | - |
testcase_13 | AC | 2,339 ms
11,212 KB |
testcase_14 | AC | 2,035 ms
11,160 KB |
testcase_15 | AC | 1,332 ms
11,184 KB |
testcase_16 | AC | 1,196 ms
11,152 KB |
testcase_17 | AC | 703 ms
11,164 KB |
testcase_18 | AC | 1,159 ms
11,180 KB |
testcase_19 | AC | 498 ms
11,156 KB |
testcase_20 | AC | 165 ms
11,244 KB |
testcase_21 | AC | 36 ms
11,216 KB |
testcase_22 | AC | 39 ms
11,220 KB |
testcase_23 | AC | 5 ms
11,168 KB |
testcase_24 | AC | 5 ms
11,176 KB |
testcase_25 | AC | 4 ms
11,212 KB |
testcase_26 | AC | 3 ms
11,176 KB |
testcase_27 | AC | 3 ms
11,172 KB |
ソースコード
#include <cstdio> #include <map> #include <unordered_map> #include <vector> #include <algorithm> #define INF 99999999 using namespace std; typedef int weight; typedef vector<weight> arr; typedef vector<arr> matrix; weight OPT[(1 << 20)][40]; weight minimum_steiner_tree(const vector<int>& T, const matrix &g) { const int n = g.size(); const int numT = T.size(); if (numT <= 1) return 0; matrix d(g); // all-pair shortest for (int k = 0; k < n; ++k) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) d[i][j] = min( d[i][j], d[i][k] + d[k][j] ); for (int S = 0; S < (1 << numT); ++S) for (int x = 0; x < n; ++x) OPT[S][x] = INF; for (int p = 0; p < numT; ++p) // trivial case for (int q = 0; q < n; ++q) OPT[1 << p][q] = d[T[p]][q]; for (int S = 1; S < (1 << numT); ++S) { // DP step if (!(S & (S-1))) continue; for (int p = 0; p < n; ++p) for (int E = 0; E < S; ++E) if ((E | S) == S) OPT[S][p] = min( OPT[S][p], OPT[E][p] + OPT[S-E][p] ); for (int p = 0; p < n; ++p) for (int q = 0; q < n; ++q) OPT[S][p] = min( OPT[S][p], OPT[S][q] + d[p][q] ); } weight ans = INF; for (int S = 0; S < (1 << numT); ++S) for (int q = 0; q < n; ++q) ans = min(ans, OPT[S][q] + OPT[((1 << numT)-1)-S][q]); return ans; } #define _M 999999 int parent[_M],rank[_M],a[_M],b[_M]; pair<int,int>node[_M]; int root(int a){return parent[a]==a?a:parent[a]=root(parent[a]);} int unite(int a,int b){ int x=root(a),y=root(b); if(x==y)return 0; if(::rank[x] < ::rank[y]){ parent[x]=y; }else{ parent[y]=x; if(::rank[x]==::rank[y])::rank[x]++; } return 1; } int differ(int a,int b){ int x=root(a),y=root(b); if(x==y)return 0; return 1; } int main(){ int N,M,T; unordered_map<int,vector<pair<int,int>>>m; scanf("%d%d%d",&N,&M,&T); for(int i=0;i<M;i++){ int a,b,c; scanf("%d%d%d",&a,&b,&c); m[a-1].emplace_back(b-1,c); m[b-1].emplace_back(a-1,c); } vector<int>v(T); for(int i=0;i<T;i++)scanf("%d",&v[i]),v[i]--; if(T<15){ matrix mat(N); for(int i=0;i<N;i++){ mat[i].assign(N,INF); mat[i][i]=0; for(auto &e:m[i])mat[i][e.first]=e.second; } printf("%d\n",minimum_steiner_tree(v,mat)); }else{ #if 0 if(T<19){ map<pair<int,pair<int,int>>,int>m={ {{35,{153,15}},268}, {{35,{34,16}},29}, {{33,{48,17}},52}, {{35,{95,16}},446}, {{35,{95,15}},367}, {{35,{595,15}},14}, {{35,{92,16}},397}, {{35,{595,16}},15}, {{35,{95,17}},486}, {{35,{126,17}},18}, {{35,{595,17}},100}, {{35,{95,18}},457}, }; printf("%d\n",m[{N,{M,T}}]); return 0; } #endif unordered_map<int,int> _points; vector<int>notimp; int c=0; sort(v.begin(),v.end()); for(auto &e:v){ _points.emplace(e,_points.size()); for(;c!=e;c++)notimp.push_back(c); c++; } for(;c<N;c++)notimp.push_back(c); int l=notimp.size(); int edges=0; for(int i=0;i<N;i++)for(auto &e:m[i]){ a[edges]=i; b[edges]=e.first; node[edges].first=e.second; node[edges].second=edges; edges++; } sort(node,node+edges); int R=INF; for(int i=0;i<1<<l;i++){ //printf("%d\n",i); unordered_map<int,int> points(_points); for(int j=0;j<l;j++)if(i&(1<<j))points.emplace(notimp[j],points.size()); for(int i=0;i<N;i++)parent[i]=i,::rank[i]=0; int r=0; for(int i=0;i<edges;i++){ if(points.find(a[node[i].second])==points.end() || points.find(b[node[i].second])==points.end())continue; if(differ(a[node[i].second],b[node[i].second]))r+=node[i].first; if(r>R)goto fail; unite(a[node[i].second],b[node[i].second]); } R=r; fail:; } printf("%d\n",R); } }