# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336117 | sumit_kk10 | 꿈 (IOI13_dreaming) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
vector<pair<long long int, long long int> > graph[N];
bool vis[N];
long long int mx = 0;
void dfs(int source, long long int largest){
vis[source] = 1;
mx = max(mx, largest);
for(auto k : graph[source])
if(!vis[k.first])
dfs(k.first, largest + k.second);
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]){
for(int i = 0; i < M; ++i){
long long int u = A[i], v = B[i], c = T[i];
graph[u].push_back({v, c});
graph[v].push_back({u, c});
// cout << u << ' ' << v << ' ' << c << endl;
}
vector<long long int> diameters;
for(int i = 0; i < N; ++i){
if(!vis[i]){
mx = 0;
dfs(i, 0);
cout << mx << '\n';
diameters.push_back(mx);
}
}
long long int ans = 0;
for(auto k : diameters)
ans = max(ans, k);
return (ans + (L * (N - M - 1)));
}
int main(){
fast;
int n, m, l;
cin >> n >> m >> l;
int a[m], b[m], t[m];
for(int i = 0; i < m; ++i)
cin >> a[i];
for(int i = 0; i < m; ++i)
cin >> b[i];
for(int i = 0; i < m; ++i)
cin >> t[i];
cout << travelTime(n, m, l, a, b, t) << '\n';
return 0;
}