Submission #243665

#	Time	Username	Problem	Language	Result	Execution time	Memory
243665		Kubin	Friend (IOI14_friend)	C++17	100 / 100	38 ms	3516 KiB

friend

#include <bits/stdc++.h>

using namespace std;

enum Protocol
{
    IAmYourFriend = 0,
    MyFriendsAreYourFriends = 1,
    WeAreYourFriends = 2
};

int findSample(int _n, int val[], int host[], int protocol[])
{
    size_t n = _n;

    vector<array<int, 2>> T(n);
    for(size_t u = 0; u < n; u++)
        T[u][1] = val[u];

    for(size_t u = n; u --> 1; )
    {
        auto v = host[u];
        if(protocol[u] == IAmYourFriend)
            T[v] = {T[v][0] + max(T[u][0], T[u][1]), T[v][1] + T[u][0]};
        else if(protocol[u] == MyFriendsAreYourFriends)
            T[v] = {T[u][0] + T[v][0], max({T[u][1] + T[v][1], T[u][1] + T[v][0], T[u][0] + T[v][1]})};
        else if(protocol[u] == WeAreYourFriends)
            T[v] = {T[u][0] + T[v][0], max({T[u][1] + T[v][0], T[u][0] + T[v][1]})};
    }
    return max(T[0][0], T[0][1]);
}

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