oj.uz

Submission #556181

# Submission time Handle Problem Language Result Execution time Memory
556181 2022-05-02T14:50:53 Z Olympia Bosses (BOI16_bosses) C++17
67 / 100
 1500 ms 976 KB 
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > new_adj;
vector<int> val;
void dfs (int curNode, int prevNode) {
    //cout << curNode << " " << prevNode << '\n';
    val[curNode] = 1;
    for (int i: new_adj[curNode]) {
        if (i != prevNode) {
            dfs (i, curNode);
            val[curNode] += val[i];
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<vector<int> > adj;
    adj.resize(n);
    val.resize(n);
    new_adj.resize(n);
    for (int i = 0; i < n; i++) {
        int k;
        cin >> k;
        while (k--) {
            int a;
            cin >> a;
            a--;
            adj[a].push_back(i);
        }
    }
    int myMin = INT_MAX;
    for (int i = 0; i < n; i++) {
        queue<int> q;
        q.push(i);
        vector<bool> hasVisited; hasVisited.assign(n, false);
        hasVisited[i] = true;
        new_adj.clear(), new_adj.resize(n);
        while (!q.empty()) {
            int curNode = q.front();
            q.pop();
            for (int j: adj[curNode]) {
                if (!hasVisited[j]) {
                    q.push(j);
                    hasVisited[j] = true;
                    new_adj[curNode].push_back(j);
                }
            }
        }
        bool fine = true;
        for (bool j: hasVisited) {
            if (!j) {
                fine = false;
            }
        }
        if (!fine) {
            continue;
        }
        dfs(i, i);
        int ans = 0;
        for (int j: val) {
            ans += j;
        }
        myMin = min(myMin, ans);
    }
    cout << myMin << '\n';
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 452 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 463 ms 900 KB Output is correct
15 Correct 68 ms 756 KB Output is correct
16 Correct 1225 ms 852 KB Output is correct
17 Execution timed out 1565 ms 976 KB Time limit exceeded
18 Halted 0 ms 0 KB -