-
Notifications
You must be signed in to change notification settings - Fork 0
/
doctor_prob.cpp
48 lines (47 loc) · 1.01 KB
/
doctor_prob.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
#include<bits/stdc++.h>
using namespace std;
void doct(){
int n,m,t; cin>>n>>m>>t;
vector<vector<pair<int,double>>> adj(n+1);
for(int i=0; i<m; i++){
int u,v; double prob;
cin>>u>>v>>prob;
adj[u].push_back({v,prob});
}
if(t<10){
cout<<1<<" "<<1<<endl;
return;
}
vector<double> ans(n+1);
ans[1]=1;
t=t-10;
while(t>=0){
t-=10;
vector<double> temp(n+1,0);
for(int i=1; i<=n; i++){
if(ans[i]!=0){
for(auto it:adj[i]){
int node=it.first;
double prob=it.second;
temp[node]+=(ans[i]*prob);
}
}
}
ans=temp;
}
int finalDiv=0;
double finalProb=0;
for(int i=1; i<=n; i++){
if(ans[i]>=finalProb){
finalProb=ans[i];
finalDiv=i;
}
}
cout<<finalDiv<<" "<<finalProb<<endl;
}
int main(){
int t; cin>>t;
while(t--){
doct();
}
}