-
Notifications
You must be signed in to change notification settings - Fork 0
/
Holiday_Accomodation.cpp
51 lines (51 loc) · 1.1 KB
/
Holiday_Accomodation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include<iostream>
#include<list>
using namespace std;
class Graph{
int V;
list<pair<int,int>>*L;
public:
Graph(int v)
{
V=v;
L=new list<pair<int,int>>[v];
}
void AddEdge(int u,int v,int cost)
{
L[u].push_back(make_pair(v,cost));
L[v].push_back(make_pair(u,cost));
}
int dfsHelper(int node, bool *visited, int *count, int &ans)
{
visited[node]=true;
count[node]=1;
for(auto nbr_pair:L[node])
{
int nbr=nbr_pair.first;
if(!visited[nbr])
{
count[node]+=dfsHelper(nbr, visited, count, ans);
int nx=count[nbr];
int ny=V-nx;
ans+=2*min(nx,ny)*nbr_pair.second;
}
}
return count[node];
}
int dfs()
{
bool *visited=new bool[V]();
int *count=new int[V]();
int ans=0;
dfsHelper(0,visited,count,ans);
return ans;
}
};
int main()
{
Graph G(4);
G.AddEdge(0, 1, 3);
G.AddEdge(1, 2, 2);
G.AddEdge(2, 3, 2);
cout<<G.dfs()<<endl;
}