Submission #1155474

#	Time	Username	Problem	Language	Result	Execution time	Memory
1155474		alexdd	Friend (IOI14_friend)	C++20	58 / 100	16 ms	2372 KiB

friend

#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=n-1;i>0;i--)
    {
        if(protocol[i]==0)
        {
            dp[host[i]][0] += max(dp[i][1], dp[i][0]);
            dp[host[i]][1] += dp[i][0];
        }
        else if(protocol[i]==1)
        {
            dp[host[i]][0] += dp[i][0];
            dp[host[i]][1] += max(dp[i][1], dp[i][0]);
        }
        else
        {

        }
        dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0]);
    }
    int mxm=0;
    for(int i=0;i<n;i++)
        mxm = max(mxm, max(dp[i][0],dp[i][1]));
    return mxm;
}

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