Submission #967517

#	Time	Username	Problem	Language	Result	Execution time	Memory
967517		12345678	Friend (IOI14_friend)	C++17	100 / 100	21 ms	3560 KiB

friend

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

using namespace std;

const int nx=1e5+5;

int p[nx], q[nx];

int findSample(int n,int confidence[],int host[],int protocol[]){
    for (int i=0; i<n; i++) p[i]=confidence[i];
    for (int i=n-1; i>0; i--)
    {
        if (protocol[i]==0)
        {
            p[host[i]]=p[host[i]]+q[i];
            q[host[i]]=max(q[host[i]]+q[i], q[host[i]]+p[i]);
        }
        if (protocol[i]==1)
        {
            p[host[i]]=max({p[host[i]]+p[i], p[host[i]]+q[i], q[host[i]]+p[i]});
            q[host[i]]=q[host[i]]+q[i];
        }
        if (protocol[i]==2)
        {
            p[host[i]]=max(p[host[i]]+q[i], q[host[i]]+p[i]);
            q[host[i]]=q[host[i]]+q[i];
        }
    }
	return max(p[0], q[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