제출 #166995

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166995		davitmarg	친구 (IOI14_friend)	C++17	46 / 100	39 ms	2808 KiB

friend

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000009ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

#ifndef death
#include "friend.h"
#endif

const int N = 1003;

int dp[N][2], a[N];
vector<int> g[N];

void dfs(int v, int p)
{
    dp[v][1] = a[v];
    for (int i = 0; i < g[v].size(); i++)
    {
        int to = g[v][i];
        if (to == p)
            continue;
        dfs(to, v);
        dp[v][1] += dp[to][0];
        dp[v][0] += max(dp[to][1], dp[to][0]);
    }
}

int findSample(int n, int confidence[], int host[], int protocol[])
{
    int ans = 0;
    set<int> type;
    for (int i = 1; i < n; i++)
        type.insert(protocol[i]);
    for (int i = 0; i < n; i++)
        a[i] = confidence[i];

    if (n <= 10)
    {
        for (int i = 1; i < n; i++)
        {
            if (protocol[i] != 0)
                for (int j = 0; j < g[host[i]].size(); j++)
                {
                    g[g[host[i]][j]].PB(i);
                    g[i].PB(g[host[i]][j]);
                }
            if (protocol[i] != 1)
            {
                g[host[i]].PB(i);
                g[i].PB(host[i]);
            }
        }
        for (int mask = 0; mask < (1 << n); mask++)
        {
            bool norm = 1;
            int sum = 0;
            for (int i = 0; i < n; i++)
            {
                if (((1 << i) & mask) == 0)
                    continue;
                sum += a[i];
                for (int j = 0; j < g[i].size(); j++)
                {
                    int to = g[i][j];
                    if (((1 << to) & mask) != 0)
                    {
                        norm = 0;
                        break;
                    }
                }
            }
            if (norm)
                ans = max(ans, sum);
        }
        return ans;
    }

    if (type.size() == 1)
    {
        if ((*type.begin()) == 2)
        {
            sort(confidence, confidence + n);
            ans = confidence[n - 1];
        }
        else if ((*type.begin()) == 1)
        {
            for (int i = 0; i < n; i++)
                ans += a[i];
        }
        else
        {
            for (int i = 1; i < n; i++)
            {
                g[host[i]].PB(i);
                g[i].PB(host[i]);
            }
            dfs(0, -1);
            ans = max(dp[0][1], dp[0][0]);
        }
    }

    return ans;
}

#ifdef death

int main()
{
    int conf[N], prot[N], host[N];
    int n, i;

    // Number of people
    assert(scanf("%d", &n) == 1);

    // Confidence
    for (i = 0; i < n; i++)
        assert(scanf("%d", &conf[i]) == 1);

    // Host and Protocol
    for (i = 1; i < n; i++)
        assert(scanf("%d %d", &host[i], &prot[i]) == 2);

    // Answer
    printf("%d\n", findSample(n, conf, host, prot));
    return 0;
}

#endif

/*


*/

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'void dfs(int, int)':
friend.cpp:38:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[v].size(); i++)
                     ~~^~~~~~~~~~~~~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:63:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int j = 0; j < g[host[i]].size(); j++)
                                 ~~^~~~~~~~~~~~~~~~~~~
friend.cpp:83:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int j = 0; j < g[i].size(); j++)
                                 ~~^~~~~~~~~~~~~

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