oj.uz

Submission #247688

# Submission time Handle Problem Language Result Execution time Memory
247688 2020-07-11T23:49:35 Z WhaleVomit Bosses (BOI16_bosses) C++14
100 / 100
 818 ms 744 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()

#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<

template<class T> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;

const int MAX_N = 5010;
int n;
vi adj[MAX_N];

int main() { FAST
    cin >> n;
    M00(i, n) {
        int k; cin >> k;
        M00(j, k) {
            int u; cin >> u; u--;
            adj[u].pb(i);
        }
    }
    ll bes = 1e18;
    M00(i, n) {
        queue<pi> q;
        vi dis(n, 1e9);
        vector<bool> vis(n);
        q.push(mp(i, 0));
        dis[i] = 0;
        while(!q.empty()) {
            pi p = q.front(); q.pop();
            if(vis[p.f]) continue;
            vis[p.f] = 1;
            for(int u: adj[p.f]) {
                if(ckmin(dis[u], dis[p.f]+1))
                    q.push(mp(u, dis[u]));
            }
        }
        bool valid = 1;
        M00(j, n) if(dis[j] == 1e9) valid = 0;
        if(!valid) continue;
        ll val = 0;
        M00(j, n) val += dis[j]+1;
        ckmin(bes, val);
    }
    finish(bes);
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 512 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 512 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 4 ms 640 KB Output is correct
14 Correct 198 ms 632 KB Output is correct
15 Correct 32 ms 640 KB Output is correct
16 Correct 642 ms 724 KB Output is correct
17 Correct 815 ms 744 KB Output is correct
18 Correct 818 ms 640 KB Output is correct