제출 #743685

#제출 시각아이디문제언어결과실행 시간메모리
743685bane친구 (IOI14_friend)C++17
0 / 100
1 ms432 KiB
#include "friend.h" #include<bits/stdc++.h> using namespace std; int findSample(int n, int confidence[], int host[], int protocol[]){ vector<int>edges[n]; for (int i = 1; i < n; i++){ int b;cin >> b; edges[i].push_back(b); edges[b].push_back(i); } vector<vector<int>>dp(n,vector<int>(2,0)); function<void(int,int)>dfs = [&](int u, int p){ dp[u][1] = host[u]; for (int& x : edges[u]){ if (x == p)continue; dfs(x,u); dp[u][1] += dp[x][0]; dp[u][0] += max(dp[x][1], dp[x][0]); } }; dfs(0,0); return max(dp[0][0], dp[0][1]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...