Submission #422074

#	Time	Username	Problem	Language	Result	Execution time	Memory
422074		Peti	Friend (IOI14_friend)	C++14	8 / 100	1 ms	332 KiB

friend

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

using namespace std;

// Find out best sample
int findSample(int n,int confidence[], int host[], int protocol[]){
    vector<pair<int, int>> v(n, make_pair(0, 0));
    for(int i = 0; i < n; i++)
        v[i].first = confidence[i];
    for(int i = n-1; i > 0; i--){
        if(protocol[i] == 0){
            v[host[i]].first += v[i].second;
            v[host[i]].second += v[i].first;
            //v[host[i]].second = max(v[host[i]].second, v[host[i]].first - confidence[host[i]]);
        } else if(protocol[i] == 1){
            v[host[i]].first += v[i].first;
            v[host[i]].second += v[i].second;
            //v[host[i]].second = max(v[host[i]].second, v[host[i]].first - confidence[host[i]]);
        } else{
            v[host[i]].first = max(v[host[i]].first + v[i].second, v[host[i]].first + v[i].first - confidence[host[i]]);
            v[host[i]].second += v[i].second;
            //v[host[i]].second = max(v[host[i]].second, v[host[i]].first - confidence[host[i]]);
        }
    }

	return max(v[0].first, v[0].second);
}

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