제출 #292219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
292219		Abdelrahman	Bosses (BOI16_bosses)	C++17	0 / 100	3 ms	640 KiB

bosses

#include <bits/stdc++.h>
#define endl '\n'
#define modulo 1000000007
#define int long long
#pragma GCC optimize("-Ofast")
#define float double
#define PI 3.141592653589793238462643383279502884
#define sinDegrees(x) sin((x) * PI / 180.0)
#define tanDegrees(x) tan((x) * PI / 180.0)
#define atanDegrees(x) atan(x)* 180.0 / PI

using namespace std;

unordered_map<int, vector<int> > mp;
bool visited[5001] = {0}, touched[5001]={0};
int finale = 0, done=0;

bool compare(pair<int, int> a, pair<int, int> b)
{
    if (a.first!=b.first)
    {
        return a.first>b.first;
    }
    else
    {
        return a.second<b.second;
    }
}

int solve(int emp)
{
    //cout<<emp<<" ";
    done++;
    vector<pair<int, int> > v;
    visited[emp]=1;
    v.push_back({emp, 1});
    finale++;
    int x=0;
    while (x!=v.size())
    {
        auto p = v[x];
        for (int i=0;i<mp[p.first].size();i++)
        {
            int a = mp[p.first][i];
            //cout<<a<<" ";
            if (visited[a])
                continue;
            done++;
            visited[a]=1;
            v.push_back({a, p.second+1});
            finale+=p.second+1;
        }
        x++;
        //cout<<q.size()<<endl;
    }

}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin>>n;

    for (int i=0;i<n;i++)
    {
        int a;
        cin>>a;
        while (a--)
        {
            int b;
            cin>>b;
            mp[b-1].push_back(i);
        }
    }

    int mini=INT_MAX;

    for (int i=0;i<n;i++)
    {
        //cout<<"NEW"<<endl;
        solve(i);
        if (done==n)
        {
            mini = min(finale, mini);
        }
        for (int j=0;j<n;j++)
        {
            visited[j]=0;
            touched[j]=0;
        }
        finale = 0;
        done=0;
    }

    cout<<mini;



}

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

bosses.cpp: In function 'long long int solve(long long int)':
bosses.cpp:39:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     while (x!=v.size())
      |            ~^~~~~~~~~~
bosses.cpp:42:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for (int i=0;i<mp[p.first].size();i++)
      |                      ~^~~~~~~~~~~~~~~~~~~
bosses.cpp:57:1: warning: no return statement in function returning non-void [-Wreturn-type]
   57 | }
      | ^

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