oj.uz

Submission #503697

# Submission time Handle Problem Language Result Execution time Memory
503697 2022-01-08T15:39:16 Z banterbry Bosses (BOI16_bosses) C++17
0 / 100
 1 ms 588 KB 
// Factos 👍👀
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long 
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
 
int N, ans = (1<<30), dp[5010], vis[5010];
vector<int> adj[5010], go[5010];
vector<int> order;
queue<int> q;
 
void dfs(int x) {
    for (auto i: go[x]) {
        dfs(i);
    }
    order.pb(x);
}
 
int32_t main() {
    fast;
    cin >> N;
    for (int i = 1; i <= N; ++i) {
        int k; cin >> k;
        for (int j = 0; j < k; ++j) {
            int x; cin >> x;
            adj[x].pb(i);
        }
    }
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) go[j].clear();
        memset(vis, 0, sizeof vis);
        order.clear();
        q.push(i);
        vis[i] = 1;
        while (q.size()) {
            int x = q.front(); q.pop();
            for (auto v: adj[x]) {
                if (vis[v]) continue;
                vis[v] = 1;
                go[x].pb(v);
                q.push(v);
            }
        }
        dfs(i); 
        memset(dp, 0, sizeof dp);
        int cur = 0;
        for (auto i: order) {
            if (!vis[i]) {
                cur = (1<<30);
                break;
            }
            int sum = 0;
            for (auto j: go[i]) sum += dp[j];
            dp[i] = sum + 1;
            cur += dp[i];
        }
        ans = min(ans, cur);
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 0 ms 588 KB Output is correct
3 Incorrect 1 ms 588 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 0 ms 588 KB Output is correct
3 Incorrect 1 ms 588 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 0 ms 588 KB Output is correct
3 Incorrect 1 ms 588 KB Output isn't correct
4 Halted 0 ms 0 KB -