제출 #233234

#제출 시각아이디문제언어결과실행 시간메모리
233234anonymous친구 (IOI14_friend)C++14
35 / 100
5 ms512 KiB
#include "friend.h"
#include <iostream>
// Find out best sample
int dp[100005][2];
int findSample(int n,int confidence[],int host[],int protocol[]){
	for (int i=n-1; i>=0; i--) {
        dp[i][0] = confidence[i];
	}
	for (int i=n-1; i>0; i--) {
        if (protocol[i] == 0) {
            dp[host[i]][0] += dp[i][1];
            dp[host[i]][1] += std::max(dp[i][0],dp[i][1]);
        } else if (protocol[i] == 1) {
            dp[host[i]][0] += std::max(dp[i][0], dp[i][1]);
            dp[host[i]][1] += dp[i][1];
        } else {
            dp[host[i]][0] = std::max(std::max(dp[host[i]][0], dp[host[i]][1]) + dp[i][1], dp[host[i]][1] + std::max(dp[i][0], dp[i][1]));
            dp[host[i]][1] += dp[i][1];
        }
	}
	return(std::max(dp[0][0], dp[0][1]));
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...