제출 #73600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73600		MKopchev	친구 (IOI14_friend)	C++14	46 / 100	50 ms	4460 KiB

friend

#include<bits/stdc++.h>
#include "friend.h"
using namespace std;
const int nmax=1e3+42;
vector<int> adj[nmax];
int conf[nmax];
int dp[nmax][2];
int rec(int node,int par,bool take)
{
    if(dp[node][take]!=-1)return dp[node][take];
    int ans=(take?conf[node]:0);
    if(take)
    {
        for(auto k:adj[node])
            if(k!=par)
            ans=ans+rec(k,node,0);
    }
    else
    {
        for(auto k:adj[node])
            if(k!=par)
            ans=ans+max(rec(k,node,0),rec(k,node,1));
    }
    dp[node][take]=ans;
    return ans;
}
bool edge[15][15];
int findSample(int n,int confidence[],int host[],int protocol[])
{
    int sum=confidence[0],maxi=confidence[0];
    bool zero=1,one=1,two=1;
    for(int i=1;i<n;i++)
    {
        if(protocol[i]!=0)zero=0;
        if(protocol[i]!=1)one=0;
        if(protocol[i]!=2)two=0;
        sum=sum+confidence[i];
        maxi=max(maxi,confidence[i]);
    }
    if(one)return sum;
    if(two)return maxi;
    if(zero)
    {
        for(int i=0;i<n;i++)
            conf[i]=confidence[i];
        for(int i=1;i<n;i++)
        {
            adj[host[i]].push_back(i);
            adj[i].push_back(host[i]);
        }
        memset(dp,-1,sizeof(dp));
        return max(rec(0,0,0),rec(0,0,1));
    }

    for(int i=1;i<n;i++)
    {
        if(protocol[i]==0)
        {
            edge[host[i]][i]=1;
            edge[i][host[i]]=1;
            continue;
        }
        for(int j=0;j<n;j++)
            if(edge[j][host[i]])
            {
                edge[i][j]=1;
                edge[j][i]=1;
            }
        if(protocol[i]==2)
        {
            edge[i][host[i]]=1;
            edge[host[i]][i]=1;
        }
    }

    int ans=0;
    for(int mask=0;mask<(1<<n);mask++)
    {
        int sum=0;
        for(int j=0;j<n;j++)
            if(mask&(1<<j))sum=sum+confidence[j];
        for(int j=0;j<n;j++)
            for(int k=j+1;k<n;k++)
            if(edge[j][k]&&mask&(1<<j)&&mask&(1<<k))sum=0;
        ans=max(ans,sum);
    }
    return ans;

}

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