Submission #868252

#	Time	Username	Problem	Language	Result	Execution time	Memory
868252		abcvuitunggio	Friend (IOI14_friend)	C++17	100 / 100	19 ms	1896 KiB

friend

#include "friend.h"
#include <algorithm>
using namespace std;
int findSample(int n,int c[],int h[],int p[]){
    int a[n]={0};
    while (--n){
        if (p[n]){
            c[h[n]]=max(max(c[h[n]]+a[n],c[n]+a[h[n]]),(p[n]>1?0:c[h[n]]+c[n]));
            a[h[n]]+=a[n];
            continue;
        }
        c[h[n]]+=a[n];
        a[h[n]]+=max(c[n],a[n]);
    }
    return max(c[0],a[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