제출 #1017229

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1017229		n3rm1n	친구 (IOI14_friend)	C++17	0 / 100	1 ms	348 KiB

friend

#include <bits/stdc++.h>
#define endl '\n'
#include "friend.h"
using namespace std;
vector < int > g[1005];
int cnt[4];
int ans = 0, dp[1005], sum[1005];
void dfs(int beg)
{
   // cout << beg << " " << sum[beg] << endl;
    dp[beg] = sum[beg];
    int other = 0;
    int nb;
    for (int j = 0; j < g[beg].size(); ++ j)
    {
        nb = g[beg][j];
        dfs(nb);
        other += dp[nb];
    }
    dp[beg] = max(dp[beg], other);
   // cout << "* " << beg << " " << dp[beg] << endl;
}
int findSample(int n, int confidence[], int host[], int protocol[])
{
    for (int i = 1; i < n; ++ i)
        g[host[i]].push_back(i);
    for (int i = 1; i < n; ++ i)
    {
        cnt[protocol[i]] ++;
    }
   // cout << cnt[1] << endl;
    if(cnt[1] == n-1)
    {
       /// cout << "here " << endl;
        for (int i = 0; i < n; ++ i)
        {
            sum[i] = confidence[i];
            for (int j = 0; j < g[i].size(); ++ j)
                sum[i] += confidence[g[i][j]];

        }
        dfs(0);
        return dp[0];
    }
   // cout << "opa" << endl;
}

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

friend.cpp: In function 'void dfs(int)':
friend.cpp:14:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int j = 0; j < g[beg].size(); ++ j)
      |                     ~~^~~~~~~~~~~~~~~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:38:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |             for (int j = 0; j < g[i].size(); ++ j)
      |                             ~~^~~~~~~~~~~~~
friend.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
   46 | }
      | ^

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