oj.uz

답안 #48366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
48366 2018-05-12T08:38:24 Z someone_aa Bosses (BOI16_bosses) C++17
100 / 100
 1476 ms 1592 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define ull unsigned long long
using namespace std;
const int maxn = 5100;
vector<int>g[maxn], gc[maxn];
bool visited[maxn];
ll result, temp_result;
int n;

ll dfs(int node, int parent) {
    ll tsum = 0LL;
    for(int i:gc[node]) {
        if(i!=parent) {
            tsum += dfs(i, node);
        }
    }
    temp_result += tsum + 1LL;
    return tsum + 1LL;
}

void bfs(int st) {
    for(int i=1;i<=n;i++) gc[i].clear();
    memset(visited, false ,sizeof(visited));
    queue<int>q;
    q.push(st);
    visited[st] = true;

    int cntr = 1;

    while(!q.empty()) {
        int curr = q.front();
        q.pop();

        for(int i:g[curr]) {
            if(!visited[i]) {
                visited[i] = true;
                cntr++;
                gc[curr].pb(i);
                q.push(i);
            }
        }
    }
    if(cntr == n) {
        temp_result = 0LL;
        ll temp = dfs(st, -1);
        result = min(result, temp_result);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    int t, u;
    for(int i=1;i<=n;i++) {
        cin>>t;
        for(int j=0;j<t;j++) {
            cin>>u;
            g[u].pb(i);
        }
    }

    result = LLONG_MAX;
    for(int i=1;i<=n;i++) {
        bfs(i);
    }
    cout<<result;
    return 0;
}

Compilation message

bosses.cpp: In function 'void bfs(int)':
bosses.cpp:48:12: warning: unused variable 'temp' [-Wunused-variable]
         ll temp = dfs(st, -1);
            ^~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 756 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 756 KB Output is correct
6 Correct 2 ms 756 KB Output is correct
7 Correct 2 ms 820 KB Output is correct
8 Correct 2 ms 952 KB Output is correct
9 Correct 2 ms 952 KB Output is correct
10 Correct 2 ms 952 KB Output is correct
11 Correct 2 ms 1020 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 756 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 756 KB Output is correct
6 Correct 2 ms 756 KB Output is correct
7 Correct 2 ms 820 KB Output is correct
8 Correct 2 ms 952 KB Output is correct
9 Correct 2 ms 952 KB Output is correct
10 Correct 2 ms 952 KB Output is correct
11 Correct 2 ms 1020 KB Output is correct
12 Correct 6 ms 1152 KB Output is correct
13 Correct 5 ms 1152 KB Output is correct
14 Correct 200 ms 1376 KB Output is correct
15 Correct 34 ms 1376 KB Output is correct
16 Correct 726 ms 1472 KB Output is correct
17 Correct 1435 ms 1528 KB Output is correct
18 Correct 1476 ms 1592 KB Output is correct