제출 #292508

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
292508		soba	Bosses (BOI16_bosses)	C++14	100 / 100	802 ms	760 KiB

bosses

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int arr[5001];
vector<int>v[5001];
ll visited;
ll BFS(int source)
{
    queue<int>q;
    q.push(source);
    arr[source]++;
    ll node , sz , salary=1 , ret=0;
    while(!q.empty())
    {
        sz=q.size();
        while(sz--)
        {
            ret+=salary;
            node=q.front();
            q.pop();
            visited++;
            for(int i = 0 ; i  < v[node].size() ; i++ )
            {
                if(arr[v[node][i]]==0)
                {
                    q.push(v[node][i]);
                    arr[v[node][i]]++;
                }
            }
        }
        salary++;
    }
    return ret;
}
int main()
{
    int n ;
    cin >> n ;
    for(int i = 1 ; i <=n ; i++)
    {
        int x , y;
        cin >> x ;
        while(x--)
        {
            cin >> y;
            v[y].push_back(i);
        }
    }
    ll ans = INT_MAX , found ;
    for(int i = 1 ; i <= n ; i++)
    {
        memset(arr , 0 , sizeof arr);
        visited=0;
        found=BFS(i);
        if(visited==n)
            ans=min(ans , found);
    }
    cout << ans ;
}

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

bosses.cpp: In function 'll BFS(int)':
bosses.cpp:23:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             for(int i = 0 ; i  < v[node].size() ; i++ )
      |                             ~~~^~~~~~~~~~~~~~~~

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 33 / 33