oj.uz

답안 #706411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
706411 2023-03-06T13:31:23 Z Alihan_8 Bosses (BOI16_bosses) C++17
100 / 100
 625 ms 708 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <int> g[n];
    for ( int i = 0; i < n; i++ ){
        int x; cin >> x;
        while ( x-- ){
            int t; cin >> t;
            g[--t].pb(i);
        }
    }
    const int inf = 1e18;
    auto bfs = [&](int st){
        vector <int> dis(n, -1);
        dis[st] = 1;
        queue <int> q; q.push(st);
        while ( !q.empty() ){
            int cur = q.front();
            q.pop();
            for ( auto to: g[cur] ){
                if ( dis[to] != -1 ) continue;
                dis[to] = dis[cur]+1;
                q.push(to);
            }
        }
        int cnt = 0;
        for ( auto i: dis ){
            cnt += i;
            if ( i == -1 ) return inf;
        }
        return cnt;
    };
    int Mn = inf;
    for ( int i = 0; i < n; i++ ){
        Mn = min(Mn, bfs(i));
    }
    cout << Mn;

    cout << '\n';
}

Compilation message

bosses.cpp: In function 'void IO(std::string)':
bosses.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 116 ms 544 KB Output is correct
15 Correct 7 ms 600 KB Output is correct
16 Correct 502 ms 708 KB Output is correct
17 Correct 625 ms 676 KB Output is correct
18 Correct 615 ms 596 KB Output is correct