Submission #293910

#	Time	Username	Problem	Language	Result	Execution time	Memory
293910		alexandra_udristoiu	Friend (IOI14_friend)	C++14	100 / 100	40 ms	3576 KiB

friend

#include "friend.h"
#include<algorithm>
using namespace std;
static int d[100005][2];

int findSample(int n, int c[], int t[], int pr[]){
	int i, x;
	for(i = 0; i < n; i++){
        d[i][1] = c[i];
	}
	for(i = n - 1; i >= 1; i--){
        x = t[i];
        if(pr[i] == 0){
            d[x][1] += d[i][0];
            d[x][0] += d[i][1];
        }
        if(pr[i] == 1){
            d[x][1] += d[i][1];
            d[x][0] += d[i][0];
        }
        if(pr[i] == 2){
            d[x][1] = max(d[i][0] + d[x][1], d[i][1] + d[x][0]);
            d[x][0] += d[i][0];
        }
        d[x][1] = max(d[x][1], d[x][0]);
	}
	return d[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