Submission #28923

#	Time	Username	Problem	Language	Result	Execution time	Memory
28923		noobprogrammer	Friend (IOI14_friend)	C++14	100 / 100	36 ms	3972 KiB

friend

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

int p[100010] , q[100010] ;

int findSample(int n,int confi[],int host[],int prt[]){
	int ans = 0;
	for(int i = 0 ; i< n; i++) p[i] = confi[i] ; 
	for(int i=n-1;i>0;i--){
		int x = host[i] ; int y = i ; 
		int u = 0 , nu = 0 ; 
		if(prt[i] == 0){
			u = p[x] + q[y] ; nu = max(p[y] + q[x] , q[x] + q[y]) ;
		}
		else if(prt[i] == 1){
			u = max(max(p[x] + p[y] , p[x] + q[y]) , p[y] + q[x]) ;
			nu = q[x] + q[y] ; 
		}
		else{
			u = max(p[x] + q[y] , p[y] + q[x]) ;
			nu = q[x] + q[y] ; 
		}
		p[x] = u ; q[x] = nu ; 
		ans = max(ans , max(u  , nu )) ;

	}
	return ans;
}

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