Submission #744597

#	Time	Username	Problem	Language	Result	Execution time	Memory
744597		vjudge1	Friend (IOI14_friend)	C++11	100 / 100	25 ms	3376 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"

using namespace std;
const int MAX=1e5+10;
const int INF=(1<<30);
int X[MAX], Y[MAX];

int findSample(int n, int confidence[], int host[], int protocol[])
{
    for (int i = 0; i < n; i++)
    {
        X[i]=confidence[i];
    }
    for (int i=n-1; i>=1; i--)
    {
        if (protocol[i]==0)
        {
            X[host[i]]+=Y[i];
            Y[host[i]]=max(Y[host[i]]+X[i],Y[host[i]]+Y[i]);
        }
        if (protocol[i]==1)
        {
            X[host[i]]=max({X[host[i]]+X[i],X[host[i]]+Y[i],Y[host[i]]+X[i]});
            Y[host[i]]+=Y[i];
        }
        if (protocol[i]==2)
        {
            X[host[i]]=max(X[host[i]]+Y[i],Y[host[i]]+X[i]);
            Y[host[i]]+=Y[i];
        }
    }
    return max(X[0],Y[0]);
}

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