제출 #23004

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23004		ngkan146	Bosses (BOI16_bosses)	C++98	100 / 100	733 ms	2276 KiB

bosses

#include <bits/stdc++.h>
#define fi first
#define se second
#define mk make_pair
using namespace std;
typedef pair<int,int> ii;
vector <int> G[5001];
bool used[5001];
int n,ans = 999999999,tmp;
int bfs(int root){
    memset(used,0,sizeof(used));
    queue <ii> q;
    q.push(mk(root,1));
    int cnt = n,res = 0;
    used[root] = 1;
    while(q.size()){
        int u = q.front().fi,level=q.front().se;
        q.pop();
        res += level;
        cnt--;
        for(int i=0;i<G[u].size();i++){
            int v = G[u][i];
            if (used[v]) continue;
            used[v] = 1;
            q.push(mk(v,level+1));
        }
    }
    if (cnt > 0) return 999999999;
    return res;
}
void solve(int root){
    ans = min(ans,bfs(root));
}
int main(){
    //freopen("t.in.7","r",stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int k,x;
        scanf("%d",&k);
        for(int j=1;j<=k;j++) scanf("%d",&x),G[x].push_back(i);
    }
    for(int i=1;i<=n;i++) solve(i);
    printf("%d",ans);
}

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

bosses.cpp: In function 'int bfs(int)':
bosses.cpp:21:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<G[u].size();i++){
                      ^
bosses.cpp: In function 'int main()':
bosses.cpp:36:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
bosses.cpp:39:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&k);
                       ^
bosses.cpp:40:63: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int j=1;j<=k;j++) scanf("%d",&x),G[x].push_back(i);
                                                               ^

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