oj.uz

Submission #497848

# Submission time Handle Problem Language Result Execution time Memory
497848 2021-12-24T01:16:47 Z aSSSd Bosses (BOI16_bosses) C++14
100 / 100
 650 ms 716 KB 
//#pragma GCC optimize("O2,unroll-loops")
//#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r)
{
    return l+rng()%(r-l+1);
}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define forinc(x,a,b) for(int x=a;x<=b;x++)
#define fordec(x,a,b) for(int x=a;x>=b;x--)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<long long,long long>
#define getbit(x,i) ((x>>(i))&1)
#define batbit(x,i) (x|(1ll<<(i)))
#define tatbit(x,i) (x&~(1<<(i)))
#define gg exit(0);
#define all(a) a.begin() , a.end()
#define int long long
const int N = 5010;
int n;
vector<int> ke[N];
//f[x] = sum(f[v]) +1;
int dd[N];

int F(int x)
{
    int ret=0;
    memset(dd, 0 , sizeof dd);
    queue<int> q;
    dd[x] = 1;
    q.push(x);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        ret+=dd[u];
        for(auto v : ke[u])
        {
            if(dd[v]) continue;
            dd[v] = dd[u] + 1;
            q.push(v);
        }
    }
    forinc(i,1,n) if(!dd[i]) ret = 1e15;
    return ret;
}


main()
{
    fasty;
    cin >> n;
    forinc(i,1,n)
    {
        int num;
        cin >> num;
        while(num--)
        {
            int x;
            cin >> x;
            ke[x].pb(i);
        }
    }
    int res = 1e15;
    forinc(i,1,n)
    {
        res = min(res , F(i));
    }
    cout << res;
}

Compilation message

bosses.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main()
      | ^~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 0 ms 464 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 1 ms 464 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 4 ms 580 KB Output is correct
13 Correct 3 ms 584 KB Output is correct
14 Correct 123 ms 596 KB Output is correct
15 Correct 19 ms 592 KB Output is correct
16 Correct 502 ms 716 KB Output is correct
17 Correct 650 ms 592 KB Output is correct
18 Correct 647 ms 688 KB Output is correct