oj.uz

Submission #245803

# Submission time Handle Problem Language Result Execution time Memory
245803 2020-07-07T12:49:30 Z uacoder123 Bosses (BOI16_bosses) C++14
100 / 100
 758 ms 760 KB 
 #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
 
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
vi al[5001];
int t=0;
int bfs(int node)
{
  int vis[5001]={},ans=1,l=2;
  queue<int> q1,q2;
  q1.push(node);
  t++;
  vis[node]=1;
  while(q1.size())
  {
    int f=q1.front();
    for(int i=0;i<al[f].size();++i)
    {
      if(!vis[al[f][i]])
      {
        vis[al[f][i]]=1;
        ans+=l;
        q2.push(al[f][i]);
        t++;
      }
    }
    q1.pop();
    if(q1.size()==0)
    {
      swap(q1,q2);
      l++;
    }
  }
  return(ans);
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int test=1;
  for(;test>0;--test)
  {
    int n,ans=100000000;
    cin>>n;
    for(int i=1;i<=n;++i)
    {
      int f,s;
      cin>>f;
      for(int j=0;j<f;++j)
      {
        cin>>s;
        al[s].pb(i);
      }
    }
    for(int i=1;i<=n;++i)
    {
      t=0;
      int pans=bfs(i);
      if(t==n)
        ans=min(ans,pans);
    }
    cout<<ans<<endl;
  }
  return(0);
}

Compilation message

bosses.cpp: In function 'int bfs(int)':
bosses.cpp:29:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<al[f].size();++i)
                 ~^~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 436 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 436 KB Output is correct
12 Correct 9 ms 640 KB Output is correct
13 Correct 8 ms 640 KB Output is correct
14 Correct 167 ms 640 KB Output is correct
15 Correct 12 ms 640 KB Output is correct
16 Correct 642 ms 760 KB Output is correct
17 Correct 758 ms 760 KB Output is correct
18 Correct 748 ms 640 KB Output is correct