Submission #2234870
Source Code Expand
#define w vector #define z double #define q int #define ar begin() #define ae end() #include<iostream> #include<vector> #include<algorithm> #include<limits> using namespace std;z inf=numeric_limits<z>::infinity();q main(){q n,m,r;cin>>n>>m>>r;w<w<z>>d=w<w<z>>(n,w<z>(n,inf));w<q>v;for(q i=0;i<r;i++){q l;cin>>l;v.push_back(l-1);} sort(v.ar,v.ae);for(q i=0;i<m;i++){q a,b,c;cin>>a>>b>>c;d[a-1][b-1]=c;d[b-1][a-1]=c;} for(q k=0;k<n;k++)for(q i=0;i<n;i++)for(q j=0;j<n;j++){d[i][j]=min(d[i][j],d[i][k]+d[k][j]);} q aa=1e9;do{q bb=0;for(q i=0;i<v.size()-1;i++){bb+=d[v[i]][v[i+1]];}aa=min(aa,bb);}while(next_permutation(v.ar,v.ae));cout<<aa<<endl;}
Submission Info
Submission Time | |
---|---|
Task | D - joisino's travel |
User | xuzijian629 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 658 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 24 ms | 512 KB |
02.txt | AC | 10 ms | 512 KB |
03.txt | AC | 10 ms | 512 KB |
04.txt | AC | 12 ms | 512 KB |
05.txt | AC | 14 ms | 512 KB |
06.txt | AC | 24 ms | 512 KB |
07.txt | AC | 24 ms | 512 KB |
08.txt | AC | 10 ms | 512 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |