제출 #741654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
741654		bane	친구 (IOI14_friend)	C++17	0 / 100	1 ms	212 KiB

friend

//
//  friend.cpp
//  solution.cpp
//
//  Created by Marko Petrov on 14.5.23.
//
#include "friend.h"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include <climits>
#include <unordered_map>
#include <unordered_set>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]){
    int dp[n][2];
    memset(dp, 0, sizeof(dp));
    for (int i = 0; i < n; i++){
        dp[i][1] = confidence[i];
    }
    for(int i = n; i >= 1; i--){
        //1 = choose
        if (protocol[i] == 0){
            dp[host[i]][0]+= max(dp[i][0], dp[i][1]);
            dp[host[i]][1] += dp[i][0];
        }else if (protocol[i] == 1){
            dp[host[i]][1] += max(dp[i][1], dp[i][0]);
            dp[host[i]][1] = max(dp[host[i]][1], dp[i][1] + dp[host[i]][0]);
            dp[host[i]][0] += dp[i][0];
        }else{
            dp[host[i]][1] += dp[i][0];
            dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0] + dp[i][1]);
            dp[host[i]][0] += dp[i][0];
        }
    }
    return max(dp[0][0], dp[0][1]);
}

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