oj.uz

Submission #950305

# Submission time Handle Problem Language Result Execution time Memory
950305 2024-03-20T07:53:23 Z LittleOrange Bosses (BOI16_bosses) C++17
100 / 100
 598 ms 1484 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll big = 1e18;
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    ll n;
    cin >> n;
    vector<vector<ll>> ch(n);
    for(ll i = 0;i<n;i++){
        ll k;
        cin >> k;
        while(k--){
            ll p;
            cin >> p;
            ch[p-1].push_back(i);
        }
    }
    ll ans = big;
    for(ll rt = 0;rt<n;rt++){
        //cout << "Try " << rt+1 << "\n";
        vector<ll> u(n,0),p(n,rt);
        deque<ll> q;
        q.push_back(rt);
        u[rt] = 1;
        vector<ll> v;
        while(!q.empty()){
            v.push_back(q.front());
            ll i = q.front();q.pop_front();
            for(ll j : ch[i]) if(!u[j]){
                //cout << i+1 << "->" << j+1 << "\n";
                u[j] = 1;
                p[j] = i;
                q.push_back(j);
            }
        }
        if(v.size()<n) continue;
        reverse(v.begin(),v.end());
        vector<ll> h(n,1);
        for(ll i : v){
            if(p[i]!=i) h[p[i]] += h[i];
        }
        //for(ll i = 0;i<n;i++) cout << p[i] << " \n"[i+1==n];
        //for(ll i = 0;i<n;i++) cout << h[i] << " \n"[i+1==n];
        ll cur = 0;
        for(ll i : h) cur += i;
        ans = min(ans,cur);
    }
    cout << ans << "\n";
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:37:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   37 |         if(v.size()<n) continue;
      |            ~~~~~~~~^~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 568 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 101 ms 860 KB Output is correct
15 Correct 13 ms 860 KB Output is correct
16 Correct 496 ms 1484 KB Output is correct
17 Correct 598 ms 1080 KB Output is correct
18 Correct 587 ms 1216 KB Output is correct