oj.uz

Submission #42397

# Submission time Handle Problem Language Result Execution time Memory
42397 2018-02-26T16:33:34 Z XmtosX Bosses (BOI16_bosses) C++14
67 / 100
 1500 ms 1260 KB 
#include <bits/stdc++.h>
using namespace std;
int n,k,lvl[5004],ans,sz[5004],cnt,cur;
vector <int> v1[5004],v[5004];
void bfs (int x)
{
    queue <int> q;
    memset(lvl,0,sizeof lvl);
    lvl[x]=1;
    for (int i=1;i<=n;i++)
        v1[i].clear();
    q.push(x);
    cnt=0;
    while (!q.empty())
    {
        int a= (q.front());
        q.pop();
        cnt++;
        for (int i=0;i<v[a].size();i++)
        {
            if (!lvl[v[a][i]])
            {
                v1[a].push_back(v[a][i]);
                q.push(v[a][i]);
                lvl[v[a][i]]=lvl[a]+1;
            }
        }
    }
}
void dfs (int x)
{
    sz[x]=1;
    for (int i=0;i<v1[x].size();i++)
    {
        dfs(v1[x][i]);
        sz[x]+=sz[v1[x][i]];
    }
    cur+=sz[x];
}
int main()
{
    cin >>n;
    for (int i=1;i<=n;i++)
    {
        cin >>k;
        for (int j=0;j<k;j++)
        {
            int a;
            cin >>a;
            v[a].push_back(i);
        }
    }
    ans=1e9;
    for (int i=1;i<=n;i++)
    {
        bfs(i);
        if (cnt==n)
        {
            cur=0;
            dfs(i);
            ans=min(ans,cur);
        }
    }
    cout<<ans;
    return 0;
}

Compilation message

bosses.cpp: In function 'void bfs(int)':
bosses.cpp:19:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<v[a].size();i++)
                       ^
bosses.cpp: In function 'void dfs(int)':
bosses.cpp:33:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v1[x].size();i++)
                   ^

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 2 ms 680 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 2 ms 680 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 2 ms 768 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 2 ms 680 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 9 ms 804 KB Output is correct
13 Correct 7 ms 804 KB Output is correct
14 Correct 205 ms 1136 KB Output is correct
15 Correct 41 ms 1136 KB Output is correct
16 Correct 832 ms 1260 KB Output is correct
17 Execution timed out 1536 ms 1260 KB Time limit exceeded
18 Halted 0 ms 0 KB -