Submission #951513

# Submission time Handle Problem Language Result Execution time Memory
951513 2024-03-22T04:38:00 Z Sir_Ahmed_Imran Bosses (BOI16_bosses) C++17
0 / 100
1 ms 348 KB
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define li long int
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pic pair<int,char>
#define all(x) (x).begin(),(x).end()
#define sum(a) accumulate(all(a),0) 
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define N 5001
int n;
int vis[N];
vector<int> a[N];
ll bfs(int x){
    ll o,r;
    o=0;
    vis[x]=r=1;
    vector<int> v{x},u;
    while(!v.empty()){
        o+=r*v.size();
        for(auto& i:v){
            for(auto& j:a[i]){
                if(vis[j]) continue;
                u.append(j);
                vis[j]=1;
            }
        }
        swap(v,u);
        u.clear();
        r++;
    }
    for(int i=1;i<=n;i++)
        vis[i]=0;
    return o;
}
void solve(){
    ll o;
    int m;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>m;
        while(m--){
            cin>>o;
            a[o].append(i);
        }
    }
    o=1e9;
    for(int i=1;i<=n;i++)
        o=min(o,bfs(i));
    cout<<o;
}
int terminator(){
    L0TA;
    solve();
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -