Submission #719345

#	Time	Username	Problem	Language	Result	Execution time	Memory
719345		Ahmed57	Friend (IOI14_friend)	C++14	58 / 100	23 ms	3028 KiB

friend

#include "friend.h"

#include <bits/stdc++.h>

using namespace std;

long long 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];
        dp[i][0]=0;
    }
    for(int i = n-1;i>0;i--){
        if(protocol[i]==0){
            dp[host[i]][0]+=dp[i][1];
            dp[host[i]][1]+=dp[i][0];
        }if(protocol[i]==1){
            dp[host[i]][1]+=dp[i][1];
            dp[host[i]][0]+=dp[i][0];
        }if(protocol[i]==2){
            dp[host[i]][0]+=dp[i][0];
            dp[host[i]][1]=max(dp[host[i]][1]+dp[i][0],dp[host[i]][0]+dp[i][1]);
        }
        dp[host[i]][1] = max(dp[host[i]][1],dp[host[i]][0]);
    }
    return max(dp[0][1],dp[0][0]);
}
/*signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n = 6;
    int host[] = {0,0,0,1,2,0};
    int con[] = {13,3,6,20,10,15};
    int prt[] = {0,0,1,2,1,0};
    cout<<find_sample(n,con,host,prt)<<endl;
}*/

• Subtask 1: 0 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 23 / 23
• Subtask 6: 0 / 31