#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
int travelTime(int n, int m, int l, int a[], int b[], int t[]){
assert(n<=50);
vector<pair<int,int>>vct[n];
for(int i=0;i<m;i++){
vct[a[i]].push_back({b[i],t[i]});
vct[b[i]].push_back({a[i],t[i]});
}
int ans=0;
deque<int>v;
vector<int>vis(n);
for(int i=0;i<n;i++){
if(vis[i])continue;
vis[i]=1;
vector<int>vc={i};
{
deque<int>dq={i};
while(dq.size()){
int a=dq.front();
dq.pop_front();
for(auto &w:vct[a]){
if(!vis[w.first]){
vis[w.first]=1;
dq.push_back(w.first);
vc.push_back(w.first);
}
}
}
}
int f=INT_MAX,ff=0;
for(auto &w:vc){
vector<bool>vv(n);
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>dq;
dq.push({w,0});
int g=0;
while(dq.size()){
int a=dq.top().first,b=dq.top().second;
dq.pop();
if(vv[a])continue;
vv[a]=1;
g=max(g,b);
for(auto &j:vct[a]){
if(!vv[j.first]){
dq.push({j.first,j.second+b});
}
}
}
ff=max(ff,g);
f=min(f,g);
}
ans=max(ans,ff);
v.push_back(f);
}
while(v.size()>1){
sort(v.begin(),v.end());
ans=max(ans,v.back()+v[0]+l);
v.back()=max(v.back(),v[0]+l);
v.pop_front();
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
18 ms |
2548 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
18 ms |
2548 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
7 ms |
1108 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
18 ms |
2548 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |