oj.uz

답안 #448259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448259 2021-07-29T12:48:40 Z JovanB Bosses (BOI16_bosses) C++17
100 / 100
 783 ms 640 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
vector <int> graf[5005];
 
int cost;
bool visited[5005];
 
int mk;
 
void bfs(int v){
    visited[v] = true;
    queue <pair <int, int>> q;
    q.push({v, 1});
    while(!q.empty()){
        mk++;
        int x = q.front().first;
        int y = q.front().second;
        cost += y;
        q.pop();
        for(auto c : graf[x]){
            if(!visited[c]){
                visited[c] = 1;
                q.push({c, y+1});
            }
        }
    }
}
 
int main(){
    ios_base::sync_with_stdio(false);
    cout.precision(10);
    cout<<fixed;
 
    int n;
    cin >> n;
    for(int i=1; i<=n; i++){
        int x;
        cin >> x;
        for(int j=1; j<=x; j++){
            int a;
            cin >> a;
            graf[a].push_back(i);
        }
    }
    int mincost = 1000000000;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            visited[j] = 0;
        }
        cost = 0;
        mk = 0;
        bfs(i);
        if(mk != n) continue;
        mincost = min(mincost, cost);
    }
    cout << mincost << "\n";
    return 0;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 436 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 144 ms 528 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 546 ms 624 KB Output is correct
17 Correct 783 ms 640 KB Output is correct
18 Correct 700 ms 636 KB Output is correct