LeetCode Weekly Contest 179
問題文
省略
省略
C++に変換後のコードはこちら
#define main dummy_main
{}
#undef main
int M, A[100], B[100];
graph g;
double dp[100], nx[100];
class Solution {
public:
double frogPosition(int N, vector<vector<int>>& edges, int t, int target) {
dummy_main();
M = edges.size();
rep(i,M) (A[i], B[i]) = (edges[i][0]-1, edges[i][1]-1);
g.setEdgeRootedTree(N,M,A,B);
rep(i,N) dp[i] = 0;
dp[0] = 1;
rep(t){
rep(i,N) nx[i] = 0;
rep(i,N) if(g.es[i]==0) nx[i] += dp[i];
rep(i,N) rep[g.edge[i]](j,g.es[i]) nx[j] += dp[i] / g.es[i];
rep(i,N) dp[i] = nx[i];
}
return dp[target-1];
}
};
Current time: 2024年04月30日09時07分14秒
Last modified: 2020年03月29日02時21分35秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る
Logged in as: unknown user (not login)