Submission #151712

#	Time	Username	Problem	Language	Result	Execution time	Memory
151712		willi19	Friend (IOI14_friend)	C++14	11 / 100	41 ms	6520 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
int n,c[100100],h[100100],p[100100],edge[12][12],dp[100000];
int ans(int state)
{
    if(dp[state]!=0)
        return dp[state];
    int ret=0;
    for(int i=0;i<n;i++)
        if(state&(1<<i))
            ret+=c[i];
    for(int i=0;i<n;i++)
    {
        if((state&(1<<i))!=0)
            continue;
        bool pos=true;
        for(int j=0;j<n;j++)
            if((state&1<<j)!=0&&edge[i][j]==1)
                pos=false;
        if(pos)
            ret=max(ret,ans(state|(1<<i)));
    }
    dp[state]=ret;
    return ret;
}
int findSample(int in,int confidence[],int host[],int protocol[]){
    n=in;
  	for(int i=0;i<n;i++)
    {
      c[i]=confidence[i];
      h[i]=host[i];
      p[i]=protocol[i];
    }
    for(int i=1;i<n;i++)
    {
        if(p[i]==0)
            edge[i][h[i]]=edge[h[i]][i]=1;
        else
        {
            for(int j=0;j<n;j++)
                edge[j][i]=edge[i][j]=edge[h[i]][j];
            if(p[i]==2)
                edge[i][host[i]]=edge[host[i]][i]=1;
        }
    }
    return ans(0);
}

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