Submission #1017296

#	Time	Username	Problem	Language	Result	Execution time	Memory
1017296		vivkostov	Friend (IOI14_friend)	C++14	0 / 100	1055 ms	16384 KiB

friend

#include<bits/stdc++.h>
#define endl '\n'
#include "friend.h"
using namespace std;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int n,a,b,br[15][15],mas[15],otg,con[15];
void check()
{
    int seg=0;
    for(int i=1;i<=n;i++)
    {
        if(!mas[i])continue;
        for(int j=i+1;j<=n;j++)
        {
            if(!mas[j])continue;
            if(br[i][j])return;
        }
        seg+=con[i];
    }
    otg=max(otg,seg);
}
void rec(int step)
{
    if(step==n)
    {
        check();
        return;
    }
    for(int i=0;i<=1;i++)
    {
        mas[step+1]=i;
        rec(step+1);
        mas[step+1]=0;
    }
}
int findSample(int N, int confidence[], int host[], int protocol[])
{
    n=N;
    for(int i=1;i<=n;i++)
    {
        if(protocol[i]==0)
        {
            br[a][i]=1;
            br[i][a]=1;
        }
        if(protocol[i]==1)
        {
            for(int i=1;i<=n;i++)
            {
                br[b][i]=br[a][i];
                br[i][b]=br[i][a];
            }
        }
        if(protocol[i]==2)
        {
            for(int i=1;i<=n;i++)
            {
                br[b][i]=br[a][i];
                br[i][b]=br[i][a];
            }
            br[a][i]=1;
            br[i][a]=1;
        }
    }
    for(int i=1;i<=n;i++)
    {
        con[i]=confidence[i-1];
    }
    rec(0);
    return otg;
}
/*int main()
{
    speed();
    read();
    return 0;
}
*/

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