Submission #1184293

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184293		jcolada	Friend (IOI14_friend)	C++20	100 / 100	15 ms	1860 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]){
    int cost[n], tot = 0; for(int i = 0; i < n; i++) cost[i] = confidence[i];
    for(int i = n-1; i > 0; i--){
        if(protocol[i] == 2){cost[host[i]] = max(cost[host[i]],cost[i]);}
        else if(protocol[i] == 1){cost[host[i]] += cost[i];}
        else{
            tot += cost[i];
            cost[host[i]] -= min(cost[host[i]], cost[i]);
        }
    }
    tot += cost[0];
    return tot;
}

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