제출 #775379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775379		boris_mihov	Friend (IOI14_friend)	C++17	11 / 100	1091 ms	3560 KiB

friend

#include "friend.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 100000 + 10;
const int INF  = 1e9;

int n;
int mask[MAXN];
int findSample(int N, int confidence[], int host[], int protocol[])
{
    n = N;
    for (int i = 1 ; i < n ; ++i)
    {
        if (protocol[i] == 0)
        {
            mask[i] = (1 << host[i]);
        }

        if (protocol[i] == 1)
        {
            mask[i] = mask[host[i]];
        }

        if (protocol[i] == 2)
        {
            mask[i] = mask[host[i]];
            mask[i] |= (1 << host[i]);
        }

        for (int j = 0 ; j < n ; ++j)
        {
            if (mask[i] & (1 << j))
            {
                assert(i != j);
                mask[j] |= (1 << i);
            }
        }
    }

    int ans = 0;
    for (int set = 0 ; set < (1 << n) ; ++set)
    {
        int curr = 0;
        bool good = true;
        for (int i = 0 ; i < n ; ++i)
        {
            if (set & (1 << i))
            {
                curr += confidence[i];
                if (mask[i] & set)
                {
                    good = false;
                    break;
                }
            }
        }

        if (good)
        {
            ans = std::max(ans, curr);
        }
    }

	return ans;
}

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