제출 #292257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
292257		Ahmad_Hasan	Bosses (BOI16_bosses)	C++17	0 / 100	1 ms	256 KiB

bosses

#include <bits/stdc++.h>

using namespace std;
vector<vector<int> >adj;
vector<vector<int> >adj2;
vector<int>vis;
vector<int>vis2;
pair<int,int> dfs(int cr){
    vis[cr]=1;
    pair<int,int>tmp;
    tmp.first=0,tmp.second=0;
    int cntc=0,cnttl=0;
    for(int i=0;i<adj2[cr].size();i++){
        if(!vis[adj2[cr][i]]){
            tmp=dfs(adj2[cr][i]);
            cntc+=tmp.first;
            cnttl+=tmp.second;
        }
    }
    return {cntc+1,cnttl+cntc+1};
}

void bfs(int cr){
    queue<int>q;
    q.push(cr);
    while(!q.empty()){
        int ncr=q.front();  q.pop();
        vis2[ncr]=1;
        for(int i=0;i<adj[ncr].size();i++){
            if(!vis2[adj[ncr][i]]){
                adj2[ncr].push_back(adj[ncr][i]);
                q.push(adj[ncr][i]);
            }
        }
    }
}


int main()
{///{}
    int n;
    cin>>n;
    adj=vector<vector<int> >(n+1);
    for(int i=1;i<=n;i++){
        int nt;
        cin>>nt;
        while(nt--){
            int tm;
            cin>>tm;
            adj[tm].push_back(i);
        }
    }
    int ans=INT_MAX;
    for(int i=1;i<=n;i++){
        vis=vector<int> (n+1);
        vis2=vector<int> (n+1);
        adj2=vector<vector<int> > (n+1);
        bfs(i);
        ans=min(ans,dfs(i).second);
    }
    cout<<ans<<'\n';

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bosses.cpp: In function 'std::pair<int, int> dfs(int)':
bosses.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=0;i<adj2[cr].size();i++){
      |                 ~^~~~~~~~~~~~~~~~
bosses.cpp: In function 'void bfs(int)':
bosses.cpp:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int i=0;i<adj[ncr].size();i++){
      |                     ~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 22
• Subtask 2: 0 / 45
• Subtask 3: 0 / 33