Submission #15688

#	Time	Username	Problem	Language	Result	Execution time	Memory
15688		ainta	친구 (IOI14_friend)	C++98	35 / 100	1 ms	3044 KiB

friend

#include "friend.h"
#include<algorithm>
using namespace std;

// Find out best sample

int Gap[101000][2];

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