oj.uz

Submission #500940

# Submission time Handle Problem Language Result Execution time Memory
500940 2022-01-01T17:43:08 Z dxz05 Bosses (BOI16_bosses) C++14
100 / 100
 1446 ms 47664 KB 
#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 222;

vector<int> g[N], g2[N];

int sum = 0;
int dfs(int v){
    int res = 1;
    for (int u : g2[v]){
        res += dfs(u);
    }
    sum += res;
    return res;
}

int n;
int bfs(int root){
    queue<int> q;
    vector<bool> used(n, false);
    q.push(root);
    used[root] = true;

    for (int i = 0; i < n; i++) g2[i].clear();

    while (!q.empty()){
        int v = q.front(); q.pop();
        for (int u : g[v]){
            if (!used[u]){
                g2[v].push_back(u);
                used[u] = true;
                q.push(u);
            }
        }
    }

    if (count(all(used), false)) return INF;

    sum = 0;
    dfs(root);

    return sum;
}

void solve(int TC) {
    cin >> n;

    for (int i = 0; i < n; i++){
        int k;
        cin >> k;
        while (k--){
            int x;
            cin >> x;
            x--;
            g[x].push_back(i);
        }
    }

    int ans = INF;
    for (int i = 0; i < n; i++){
        ans = min(ans, bfs(i));
    }

    cout << ans;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47188 KB Output is correct
2 Correct 23 ms 47280 KB Output is correct
3 Correct 24 ms 47192 KB Output is correct
4 Correct 25 ms 47280 KB Output is correct
5 Correct 29 ms 47280 KB Output is correct
6 Correct 31 ms 47180 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47188 KB Output is correct
2 Correct 23 ms 47280 KB Output is correct
3 Correct 24 ms 47192 KB Output is correct
4 Correct 25 ms 47280 KB Output is correct
5 Correct 29 ms 47280 KB Output is correct
6 Correct 31 ms 47180 KB Output is correct
7 Correct 28 ms 47252 KB Output is correct
8 Correct 24 ms 47288 KB Output is correct
9 Correct 24 ms 47180 KB Output is correct
10 Correct 24 ms 47300 KB Output is correct
11 Correct 25 ms 47308 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47188 KB Output is correct
2 Correct 23 ms 47280 KB Output is correct
3 Correct 24 ms 47192 KB Output is correct
4 Correct 25 ms 47280 KB Output is correct
5 Correct 29 ms 47280 KB Output is correct
6 Correct 31 ms 47180 KB Output is correct
7 Correct 28 ms 47252 KB Output is correct
8 Correct 24 ms 47288 KB Output is correct
9 Correct 24 ms 47180 KB Output is correct
10 Correct 24 ms 47300 KB Output is correct
11 Correct 25 ms 47308 KB Output is correct
12 Correct 30 ms 47360 KB Output is correct
13 Correct 27 ms 47436 KB Output is correct
14 Correct 237 ms 47604 KB Output is correct
15 Correct 65 ms 47488 KB Output is correct
16 Correct 746 ms 47616 KB Output is correct
17 Correct 1393 ms 47664 KB Output is correct
18 Correct 1446 ms 47664 KB Output is correct