#include "friend.h"
#include <bits/stdc++.h>
#define MAXN 100007
using namespace std;
vector<int> g[MAXN],w[MAXN];
int p[MAXN],c[MAXN],dp[2][MAXN],y[MAXN],t[MAXN];
void dfs(int s)
{
for(int i=0;i<g[s].size();i++) dfs(g[s][i]);
for(int i=0;i<g[s].size();i++)
{
if(w[s][i]==0 || w[s][i]==2) dp[1][s]+=y[g[s][i]];
if(w[s][i]==1) dp[1][s]+=max(dp[0][g[s][i]],dp[1][g[s][i]]);
if(w[s][i]==0) y[s]+=max(dp[0][g[s][i]],dp[1][g[s][i]]);
if(w[s][i]==1 || w[s][i]==2) y[s]+=y[g[s][i]];
}
dp[1][s]+=c[s];
if(g[s].size()==0) return;
vector<int> kr;
for(int i=0;i<g[s].size();i++) kr.push_back(0);
for(int i=(int)kr.size()-1;i>=0;i--)
{
if(i!=(int)kr.size()-1) kr[i]=kr[i+1];
if(w[s][i]==0) kr[i]+=max(dp[0][g[s][i]],dp[1][g[s][i]]);
if(w[s][i]!=0) kr[i]+=y[g[s][i]];
}
int sum=0,mx=kr[0];
for(int i=0;i<g[s].size();i++)
{
if(w[s][i]==0) for(int j=0;j<g[g[s][i]].size();j++)
{
if(t[g[g[s][i]][j]]==0) sum+=max(dp[0][g[g[s][i]][j]],dp[1][g[g[s][i]][j]]);
else sum+=y[g[g[s][i]][j]];
}
if(w[s][i]!=0)
{
int t=sum+max(dp[1][g[s][i]],dp[0][g[s][i]]);
if(i!=(int)kr.size()-1) t+=kr[i+1];
mx=max(mx,t);
}
if(w[s][i]==1) sum+=max(dp[1][g[s][i]],dp[0][g[s][i]]);
if(w[s][i]==2) sum+=y[g[s][i]];
}
dp[0][s]=mx;
}
int findSample(int n,int confidence[],int host[],int protocol[])
{
for(int i=0;i<n;i++) c[i]=confidence[i];
for(int i=1;i<n;i++) {p[i]=host[i]; g[p[i]].push_back(i); w[p[i]].push_back(protocol[i]); t[i]=protocol[i];}
dfs(0);
return max(dp[0][0],dp[1][0]);
}
Compilation message
friend.cpp: In function 'void dfs(int)':
friend.cpp:9:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<g[s].size();i++) dfs(g[s][i]);
~^~~~~~~~~~~~
friend.cpp:10:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<g[s].size();i++)
~^~~~~~~~~~~~
friend.cpp:20:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<g[s].size();i++) kr.push_back(0);
~^~~~~~~~~~~~
friend.cpp:28:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<g[s].size();i++)
~^~~~~~~~~~~~
friend.cpp:30:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(w[s][i]==0) for(int j=0;j<g[g[s][i]].size();j++)
~^~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 3 |
Correct |
9 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 5 |
Correct |
7 ms |
5172 KB |
Output is correct |
| 6 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 7 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 8 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 10 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 11 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 12 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 13 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 14 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 15 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 16 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 17 |
Correct |
7 ms |
4992 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 2 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 3 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 4 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 5 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 6 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 7 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 8 |
Correct |
9 ms |
5120 KB |
Output is correct |
| 9 |
Correct |
8 ms |
5152 KB |
Output is correct |
| 10 |
Correct |
9 ms |
5120 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 2 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 3 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 4 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 5 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 6 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 7 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 8 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 9 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 10 |
Correct |
8 ms |
5120 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 2 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 3 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 5 |
Correct |
9 ms |
5248 KB |
Output is correct |
| 6 |
Correct |
9 ms |
5120 KB |
Output is correct |
| 7 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 8 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 9 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 10 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 11 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 12 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 13 |
Correct |
9 ms |
5120 KB |
Output is correct |
| 14 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 15 |
Correct |
8 ms |
5120 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
9 ms |
4992 KB |
Output is correct |
| 3 |
Correct |
7 ms |
5152 KB |
Output is correct |
| 4 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 5 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 6 |
Correct |
8 ms |
5004 KB |
Output is correct |
| 7 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 8 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
8 ms |
5248 KB |
Output is correct |
| 10 |
Correct |
8 ms |
5248 KB |
Output is correct |
| 11 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 12 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 13 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 14 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 15 |
Correct |
8 ms |
5040 KB |
Output is correct |
| 16 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 17 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 18 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 19 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 20 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 21 |
Correct |
8 ms |
5120 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 3 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 4 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 5 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 6 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 7 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 8 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 10 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 11 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 12 |
Correct |
96 ms |
13304 KB |
Output is correct |
| 13 |
Correct |
42 ms |
9080 KB |
Output is correct |
| 14 |
Correct |
78 ms |
12152 KB |
Output is correct |
| 15 |
Correct |
79 ms |
12152 KB |
Output is correct |
