#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
int dp[100005][2];
int findSample(int n, int confidence[], int host[], int protocol[])
{
for(int i=0;i<n;i++)
{
dp[i][1] = confidence[i];
}
for(int i=1;i<n;i++)
{
if(protocol[i]==0)
{
dp[host[i]][0] += dp[i][1];
dp[host[i]][1] += dp[i][0];
}
else if(protocol[i]==1)
{
dp[host[i]][0] += dp[i][0];
dp[host[i]][1] += dp[i][1];
}
else
{
}
}
return max(dp[0][0], dp[0][1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |