Submission #313563

#	Time	Username	Problem	Language	Result	Execution time	Memory
313563		kylych03	Friend (IOI14_friend)	C++14	100 / 100	37 ms	2452 KiB

friend

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

int findSample(int n,int con[],int host[],int protocol[]){
	int res = 0;

	for(int i = n-1; i>0 ;i--){
        if(protocol[i]==0){
            res+=con[i];
            con[host[i]] = max(0, con[host[i]] - con[i]);
        }
        if(protocol[i]==1){
            con[host[i]] +=con[i];
        }
        if(protocol[i]==2){
            con[host[i]] = max(con[i], con[host[i]]);
        }

	}
	return res + con[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