Submission #54720

#	Time	Username	Problem	Language	Result	Execution time	Memory
54720		SpaimaCarpatilor	Friend (IOI14_friend)	C++17	100 / 100	37 ms	5512 KiB

friend

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

using namespace std;

int p[100009], q[100009];

int findSample (int N, int confidence[], int host[], int protocol[])
{
    for (int i=0; i<N; i++)
        p[i] = confidence[i], q[i] = 0;
    for (int i=N - 1; i>0; i--)
    {
        int j = host[i], oldP = p[j], oldQ = q[j];
        if (protocol[i] == 0)
            p[j] = oldP + q[i],
            q[j] = oldQ + max (p[i], q[i]);
        else
        if (protocol[i] == 1)
            p[j] = max ({oldP + p[i], oldP + q[i], oldQ + p[i]}),
            q[j] = oldQ + q[i];
        else
            p[j] = max (oldP + q[i], oldQ + p[i]),
            q[j] = oldQ + 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