oj.uz

Submission #970833

# Submission time Handle Problem Language Result Execution time Memory
970833 2024-04-27T11:10:55 Z hariaakas646 Bosses (BOI16_bosses) C++14
67 / 100
 1500 ms 1324 KB 
#pragma GCC optimize("O3","unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;


void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

vvi graph;
vvi tree;
vb vis;
int tot = 0;

int dfs(int x) {
    int v = 1;
    for(auto e : tree[x]) {
        v += dfs(e);
    }
    tot += v;
    return v;
}

int main() {
    // usaco();
    int n;
    scd(n);

    graph = vvi(n+1);

    forr(i, 1, n+1) {
        int k;
        scd(k);
        frange(_, k) {
            int b;
            scd(b);
            graph[b].pb(i);
        }
    }

    int mi = 2e9;

    forr(i, 1, n+1) {
        vis = vb(n+1);
        tree = vvi(n+1);
        queue<pii> q;
        q.push(mp(i, 0));
        while(q.size()) {
            auto p = q.front();
            q.pop();
            if(vis[p.f]) continue;
            vis[p.f] = true;
            tree[p.s].pb(p.f);
            for(auto e : graph[p.f]) {if(vis[e]) continue; q.push(mp(e, p.f));}
        }
        bool done = true;
        forr(j, 1, n+1) done = done && vis[j];
        if(done) {
            tot = 0;
            dfs(i);
            mi = min(mi, tot);
        }
    }
    printf("%d", mi);
}

Compilation message

bosses.cpp: In function 'void usaco()':
bosses.cpp:31:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp: In function 'int main()':
bosses.cpp:6:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bosses.cpp:52:5: note: in expansion of macro 'scd'
   52 |     scd(n);
      |     ^~~
bosses.cpp:6:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bosses.cpp:58:9: note: in expansion of macro 'scd'
   58 |         scd(k);
      |         ^~~
bosses.cpp:6:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bosses.cpp:61:13: note: in expansion of macro 'scd'
   61 |             scd(b);
      |             ^~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 16 ms 348 KB Output is correct
13 Correct 12 ms 604 KB Output is correct
14 Correct 441 ms 996 KB Output is correct
15 Correct 36 ms 1004 KB Output is correct
16 Correct 1351 ms 1076 KB Output is correct
17 Execution timed out 1574 ms 1324 KB Time limit exceeded
18 Halted 0 ms 0 KB -