Submission #592112

#	Time	Username	Problem	Language	Result	Execution time	Memory
592112		Hanksburger	Friend (IOI14_friend)	C++17	100 / 100	27 ms	2684 KiB

friend

#include <bits/stdc++.h>
using namespace std;
int findSample(int n, int c[], int h[], int p[])
{
    int ans=0;
    for (int i=n-1; i; i--)
    {
        if (!p[i])
        {
            ans+=c[i];
            c[h[i]]=max(0, c[h[i]]-c[i]);
        }
        else if (p[i]==1)
            c[h[i]]+=c[i];
        else
            c[h[i]]=max(c[h[i]], c[i]);
    }
    return ans+c[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