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 "dreaming.h"
#include<bits/stdc++.h>
using namespace std ;
const int NN = 1e5 + 5 ;
vector<pair<int , int > > adj[NN];
int sum = 0 ;
int vis[NN];
void dfs(int u){
vis[u]++;
for(auto f : adj[u]){
if(vis[f.first])continue ;
sum += f.second ;
dfs(f.first);
}
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
for(int i = 0 ; i < M ; i ++){
adj[A[i]].push_back({B[i] , T[i]});
adj[B[i]].push_back({A[i] , T[i]});
}
for(int i = 0 ; i < N ; i ++)
if(!vis[i])dfs(i);
sum += L ;
return sum ;
return 42;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |