제출 #1017408

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1017408		serkanrashid	친구 (IOI14_friend)	C++14	19 / 100	48 ms	65536 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
#define endl "\n"

using namespace std;

const int maxn = 1024;

vector<int>g[maxn];
int dp[maxn][2],con[maxn];

void dfs(int beg, int par)
{
    dp[beg][0] = dp[beg][1] = 0;

    int sum[2] = {0,0};
    for(int nb : g[beg])
    {
        if(nb==par) continue;
        dfs(nb,beg);
        sum[0] += dp[nb][0];
        sum[1] += dp[nb][1];
    }
    dp[beg][0] = sum[1];
    dp[beg][1] = max(dp[beg][0] , sum[0] + con[beg]);
}

int findSample(int n, int confidence[], int host[], int protocol[])
{
    for(int i = 0; i < n; i++) con[i] = confidence[i];
    for(int i = 1; i < n; i++)
    {
        if(protocol[i]==0)
        {
            g[host[i]].push_back(i);
            g[i].push_back(host[i]);
        }
        if(protocol[i]==1)
        {
            for(int nb : g[host[i]])
            {
                g[nb].push_back(i);
                g[i].push_back(nb);
            }
        }
        if(protocol[i]==2)
        {
            for(int nb : g[host[i]])
            {
                g[nb].push_back(i);
                g[i].push_back(nb);
            }
            g[host[i]].push_back(i);
            g[i].push_back(host[i]);
        }
    }
    dfs(0,0);
    return max(dp[0][0],dp[0][1]);
}

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