oj.uz

Submission #641781

# Submission time Handle Problem Language Result Execution time Memory
641781 2022-09-17T15:33:58 Z Ronin13 Bosses (BOI16_bosses) C++14
100 / 100
 820 ms 668 KB 
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
const int NMAX = 5001;
vector <vector <ll> >g(NMAX);
ll ans = 0;
int ansi;
ll mn = 1e9;
vector <bool> used(NMAX);
vector <ll> d(NMAX);
int n;
void bfs(int x){
    used[x] = true;
    d[x] = 1;
    queue <int> q;
    q.push(x);
    while(!q.empty()){
        int v = q.front();
        q.pop();
        for(int to : g[v]){
            if(used[to]) continue;
            q.push(to);
            used[to] = true;
            d[to] = d[v] + 1;
        }
    }
    for(int i  = 1; i <= n; i++){
        if(!used[i]){
            ans = 1e9;
            break;
        }
        else ans += d[i];
    }
}

int main(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        int x; cin >> x;
        for(int j = 1; j <= x; j++) {
            int y; cin >> y;
            g[y].pb(i);
        }
    }
    for(int i = 1; i <= n; i++){
        bfs(i);
        mn = min(ans, mn);
        for(int j = 1; j <= n; j++){
            used[j] = false;
            d[j] = 0;
        }
        ans = 0;
    }
    cout << mn;
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 6 ms 596 KB Output is correct
13 Correct 5 ms 596 KB Output is correct
14 Correct 192 ms 564 KB Output is correct
15 Correct 50 ms 468 KB Output is correct
16 Correct 580 ms 668 KB Output is correct
17 Correct 820 ms 660 KB Output is correct
18 Correct 790 ms 652 KB Output is correct