Submission #385885

#	Time	Username	Problem	Language	Result	Execution time	Memory
385885		ParsaAlizadeh	Friend (IOI14_friend)	C++17	100 / 100	39 ms	3052 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
 
int findSample(int n, int confidence[], int host[], int protocol[]){
    vector<int> c(confidence, confidence + n);
    int ans = 0;
    for (int i = n - 1; i >= 1; i--) {
        if (protocol[i] == 0) {
            c[host[i]] -= c[i];
            ans += c[i];
            c[host[i]] = max(c[host[i]], 0);
        }
        if (protocol[i] == 1) {
            c[host[i]] += c[i];
        }
        if (protocol[i] == 2) {
            c[host[i]] = max(c[host[i]], c[i]);
        }
    };
    ans += c[0];
    return ans;
}

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