Submission #4636881
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <iterator> using namespace std; typedef long long ll; const int MAXN = 210; const ll INF = 1e16; int n, m, R; ll dist[MAXN][MAXN]; int a[MAXN * MAXN], b[MAXN * MAXN], c[MAXN * MAXN]; int r[MAXN]; void warshalFloyd() { for (int k=0;k<n;k++) { for (int i=0;i<n;i++) { for (int j=0;j<n;j++) { dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); } } } } ll calc(vector<int> v) { ll d = 0; for (int i=0;i<v.size()-1;i++) { d += dist[v[i]][v[i+1]]; } return d; } void solve() { for (int i=0;i<n;i++) { for (int j=0;j<n;j++) { dist[i][j] = INF; } } for (int i=0;i<m;i++) { dist[a[i]-1][b[i]-1] = c[i]; dist[b[i]-1][a[i]-1] = c[i]; } warshalFloyd(); vector<int> v; for (int i=0;i<R;i++) { v.push_back(r[i]-1); } ll minDist = INF; do { minDist = min(minDist, calc(v)); } while (next_permutation(v.begin(), v.end())); cout << minDist << endl; } int main() { cin >> n >> m >> R; for (int i=0;i<R;i++) { cin >> r[i]; } for (int i=0;i<m;i++) { cin >> a[i] >> b[i] >> c[i]; } solve(); }
Submission Info
Submission Time | |
---|---|
Task | D - joisino's travel |
User | hashmup |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1237 Byte |
Status | WA |
Exec Time | 25 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 25 ms | 768 KB |
02.txt | AC | 12 ms | 640 KB |
03.txt | AC | 12 ms | 640 KB |
04.txt | AC | 14 ms | 640 KB |
05.txt | AC | 15 ms | 640 KB |
06.txt | WA | 24 ms | 768 KB |
07.txt | AC | 25 ms | 768 KB |
08.txt | AC | 11 ms | 640 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 |