oj.uz

Submission #21907

# Submission time Handle Problem Language Result Execution time Memory
21907 2017-04-26T20:57:41 Z iletavcioski Bosses (BOI16_bosses) C++
100 / 100
 879 ms 2468 KB 
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
int main()
{
    ios_base::sync_with_stdio(false);
    int n;
    cin>>n;
    vector<vector<int> > v;
    vector<int> vec;
    v.insert(v.begin(),n+1,vec);
    for(int i=0;i<n;i++)
    {
        int k;
        cin>>k;
        for(int j=0;j<k;j++)
        {
            int a;
            cin>>a;
            a--;
            v[a].push_back(i);
        }
    }
    ll maxi=1e18;
    for(int i=0;i<n;i++)
    {
        vector<int> vi(n+1,false);
        vi[i]=true;
        queue<int> qi;
        qi.push(i);
        queue<int> qs;
        qs.push(1);
        ll brojac=0;
        int broj=1;
        while(!qi.empty())
        {
            int topi=qi.front();
            qi.pop();
            int tops=qs.front();
            qs.pop();
            brojac+=(ll)tops;
            for(int j=0;j<v[topi].size();j++)
            {
                if(!vi[v[topi][j]])
                {
                    vi[v[topi][j]]=true;
                    broj++;
                    qi.push(v[topi][j]);
                    qs.push(tops+1);
                }
            }
        }
        if(broj==n)
        maxi=min(maxi,brojac);
    }
    cout<<maxi<<endl;
    return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:44:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0;j<v[topi].size();j++)
                          ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2188 KB Output is correct
2 Correct 0 ms 2188 KB Output is correct
3 Correct 0 ms 2188 KB Output is correct
4 Correct 0 ms 2188 KB Output is correct
5 Correct 0 ms 2188 KB Output is correct
6 Correct 0 ms 2188 KB Output is correct
7 Correct 0 ms 2188 KB Output is correct
8 Correct 0 ms 2188 KB Output is correct
9 Correct 0 ms 2188 KB Output is correct
10 Correct 0 ms 2188 KB Output is correct
11 Correct 0 ms 2188 KB Output is correct
12 Correct 3 ms 2188 KB Output is correct
13 Correct 3 ms 2188 KB Output is correct
14 Correct 186 ms 2336 KB Output is correct
15 Correct 19 ms 2336 KB Output is correct
16 Correct 806 ms 2468 KB Output is correct
17 Correct 869 ms 2468 KB Output is correct
18 Correct 879 ms 2468 KB Output is correct