oj.uz

답안 #159455

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
159455 2019-10-22T19:27:53 Z a_player Bosses (BOI16_bosses) C++14
100 / 100
 995 ms 760 KB 
#include <bits/stdc++.h>

using namespace std;

vector<int> grafo[5001];
int val[5001];
bitset<5001> v;
int N;

int bfs(int in){
    v.reset();
    memset(val,0,sizeof(val));
    int s=0;
    queue<int> q;
    q.push(in);
    v[in]=1;
    val[in]=1;
    while(!q.empty()){
      int co=q.front();
      q.pop();
      s+=val[co];
      for(int i=0;i<grafo[co].size();i++){
        if(!v[grafo[co][i]]){
          val[grafo[co][i]]=val[co]+1;
          v[grafo[co][i]]=1;
          q.push(grafo[co][i]);
        }
      }
    }
    for(int i=0;i<N;i++)if(!v[i])return (int)1e9;
    return s;

}

int main(){
  cin>>N;
  for(int i=0;i<N;i++){
    int n;
    cin>>n;
    for(int j=0;j<n;j++){
      int a;
      cin>>a;
      grafo[a-1].push_back(i);
    }
  }
  int mini=bfs(0);
  for(int i=1;i<N;i++){
    mini=min(mini,bfs(i));
  }
  cout<<mini;
}

Compilation message

bosses.cpp: In function 'int bfs(int)':
bosses.cpp:22:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i=0;i<grafo[co].size();i++){
                   ~^~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 376 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 9 ms 636 KB Output is correct
14 Correct 190 ms 608 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 758 ms 632 KB Output is correct
17 Correct 995 ms 760 KB Output is correct
18 Correct 978 ms 632 KB Output is correct