Submission #7701

#	Time	Username	Problem	Language	Result	Execution time	Memory
7701		dohyun0324	Friend (IOI14_friend)	C++98	35 / 100	0 ms	3040 KiB

friend

#include "friend.h"
#include<algorithm>
using namespace std;
int d[100010][2];
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int i;
	for(i=0;i<=n;i++) d[i][0]=confidence[i];
	for(i=n;i>=1;i--)
    {
        if(protocol[i]==0)
        {
            d[host[i]][0]+=d[i][1];
            d[host[i]][1]+=max(d[i][0],d[i][1]);
        }
        if(protocol[i]==1)
        {
            d[host[i]][0]=max(d[host[i]][0]+d[i][0],d[host[i]][0]+d[i][1]);
            d[host[i]][1]+=d[i][1];
        }
        if(protocol[i]==2)
        {
            d[host[i]][0]=max(d[host[i]][1]+d[i][0],d[i][1]+d[host[i]][0]);
            d[host[i]][1]+=d[i][1];
        }
    }
    return max(d[0][0],d[0][1]);
}

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