답안 #975155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975155 2024-05-04T13:53:12 Z momo50 Bosses (BOI16_bosses) C++14
100 / 100
398 ms 780 KB
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans=LLONG_MAX,tmp=0;
int cnt=0;

bool vis[5007];
vector<int> g[5007];

void bfs(int src)
{
    queue<pair<int,ll>> q;
    q.emplace(src,1);
    vis[src]=true;
    while(!q.empty())
    {
        auto [u,dis]=q.front();
        q.pop();
        cnt++;
        tmp+=dis;
        for(auto v:g[u])
        {
            if(vis[v])continue;
            vis[v]=true;
            q.emplace(v,dis+1);
        }
    }
}   

int main()
{
    cin.tie(nullptr)->ios::sync_with_stdio(false);

    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;
        while(k--)
        {
            int a;
            cin>>a;
            g[a].emplace_back(i);
        }
    }

    for(int i=1;i<=n;i++)
    {
        cnt=0,tmp=0;
        memset(vis,false,sizeof(vis));
        bfs(i);
        if(cnt!=n)continue;
        ans=min(ans,tmp);
    }
    cout<<ans;
    return 0;
}

Compilation message

bosses.cpp: In function 'void bfs(int)':
bosses.cpp:17:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   17 |         auto [u,dis]=q.front();
      |              ^
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 89 ms 672 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 398 ms 604 KB Output is correct
17 Correct 387 ms 780 KB Output is correct
18 Correct 370 ms 604 KB Output is correct