Submission #119075

#	Time	Username	Problem	Language	Result	Execution time	Memory
119075		Mamnoon_Siam	Friend (IOI14_friend)	C++17	100 / 100	31 ms	3448 KiB

friend

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

using ll = long long;
const int maxn = 1e5 + 5;

int findSample(int n, int confidence[], int host[], int protocol[]){
	ll w[maxn], tot = 0;
	for(int i = 0; i < n; i++)
		w[i] = confidence[i];
	for(int i = n - 1; i >= 1; i--) {
		int A = host[i], B = i;
		if(protocol[i] == 0) {
			w[A] -= w[B];
			w[A] = max(w[A], 0LL);
			tot += w[B];
		} else if(protocol[i] == 1) {
			w[A] += w[B];
		} else {
			w[A] = max(w[A], w[B]);
		}
	}
	return tot + w[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