제출 #860866

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
860866		elotelo966	Bosses (BOI16_bosses)	C++17	100 / 100	490 ms	4440 KiB

bosses

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 1000000000005
#define mod 1000000007
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mid (start+end)/2
#define lim 100005
vector<int> v[lim];
int dis[lim],n,vis[lim];

inline int bfs(int node){
    for (int i=1;i<=n;i++){
        dis[i]=OYY;
        vis[i]=0;
    }
    queue <pair<int,int>> pq;
    pq.push({1,node});
    dis[node]=1;
    vis[node]=1;
    //cout<<node<<" "<<dis[node]<<endl;
    while(!pq.empty()){
        int nd=pq.front().second;
        pq.pop();
       // cout<<pq.top().first<<" "<<pq.top().second<<" "<<dis[nd]<<endl;
        for(int i=0;i<v[nd].size();i++){
            if(vis[v[nd][i]])continue;
            dis[v[nd][i]]=min(dis[v[nd][i]],dis[nd]+1);
            vis[v[nd][i]]=1;
            pq.push({-dis[v[nd][i]],v[nd][i]});
        }
    }
    int cev=0;
    for(int i=1;i<=n;i++){
        cev+=dis[i];
    }
   // cout<<cev<<endl;
    return cev;
}

int32_t main(){
    faster
    cin>>n;
    for(int i=1;i<=n;i++){
        int deg,tut;cin>>deg;
        for(int j=0;j<deg;j++){
            cin>>tut;
            v[tut].push_back(i);
        }
    }
    int cev=OYY;
    for(int i=1;i<=n;i++){
        cev=min(cev,bfs(i));
    }
    cout<<cev<<'\n';
    return 0;
}

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

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

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