제출 #900119

#제출 시각아이디문제언어결과실행 시간메모리
900119PetrixBosses (BOI16_bosses)C++17
100 / 100
566 ms768 KiB
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int n;
vector<vector<int>> v;
vector<int> viz;

void curat(){
    int i;
    for(i=0;i<=n;i++) viz[i]=0;
}

bool vf(){
    int i;
    for(i=1;i<=n;i++){
        if(!viz[i]) return 0;
    }
    return 1;
}

int main()
{
    int i,j,k,min1,sum,nod,depth,a;
    cin>>n;
    viz.resize(n+1);v.resize(n+1);
    for(i=1;i<=n;i++){
        cin>>k;
        for(j=0;j<k;j++){
            cin>>a;
            v[a].push_back(i);
        }
    }
    min1=1e9;
    for(j=1;j<=n;j++){
        sum=1;
        queue<pair<int,int>> s;
        s.push({j,1});
        curat();viz[j]=1;
        while(!s.empty()){
            nod=s.front().first;
            depth=s.front().second+1;
            s.pop();
            for(i=0;i<v[nod].size();i++){
                if(!viz[v[nod][i]]){
                    viz[v[nod][i]]=1;
                    sum+=depth;
                    s.push({v[nod][i],depth});
                }
            }
        }
        if(vf())
            min1=min(sum,min1);
    }
    cout<<min1;
    return 0;
}

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

bosses.cpp: In function 'int main()':
bosses.cpp:45:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             for(i=0;i<v[nod].size();i++){
      |                     ~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...