Submission #210206

#	Time	Username	Problem	Language	Result	Execution time	Memory
210206		mohamedsobhi777	Friend (IOI14_friend)	C++14	100 / 100	42 ms	2808 KiB

friend

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

using namespace std ; 

const int N = 1e5 + 5 ; 

int findSample(int n , int confidence[] , int host[] , int protocol[]){
    int sol[n+1];
    for(int i = 0 ; i < n; i++)
        sol[i] = confidence[i] ; 
    int ret = 0 ; 
    for(int i  = n-1 ; i>0 ; i--){
        int p = protocol[i] ; 
        if(!p){
            ret+=sol[i] ; 
            sol[host[i]] = max(0 , sol[host[i]] - sol[i]) ; 
        }
        else if(p==1){
            sol[host[i]] +=sol[i] ; 
        }
        else{
            sol[host[i]] = max(sol[host[i]]  ,sol[i]) ; 
        }
    }
    return sol[0] + ret ; 
}

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