# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
776256 | m_bezrutchka | Friend (IOI14_friend) | C++14 | 0 ms | 0 KiB |
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 <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 112345;
int dp[2][MAXN];
int confidence[MAXN];
int host[MAXN], protocol[MAXN];
int n;
int solve() {
for (int i = 0; i < n; i++) {
dp[0][i] = 0;
dp[1][i] = confidence[i];
}
for (int i = n - 1; i > 0; i--) {
int w = i;
int v = host[i];
if (protocol[i] == 0) {
// IAmYourFriend
dp[1][v] = dp[1][v] + dp[0][w];
dp[0][v] = dp[0][v] + max(dp[0][w], dp[1][w]);
} else if (protocol[i] == 1) {
// MyFriendsAreYourFriends
dp[1][v] = max(dp[0][v] + dp[1][w], max(dp[1][v] + dp[0][w], dp[1][v] + dp[1][w]));
dp[0][v] = dp[0][v] + dp[0][w];
} else {
// WeAreYourFriends
dp[1][v] = max(dp[0][v] + dp[1][w], dp[1][v] + dp[0][w]);
dp[0][v] = dp[0][v] + dp[0][w];
}
}
return max(dp[0][0], dp[1][0]);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &confidence[i]);
}
for (int i = 1; i < n; i++) {
scanf("%d %d", &host[i], &protocol[i]);
}
printf("%d\n", solve());
return 0;
}