oj.uz

Submission #290669

# Submission time Handle Problem Language Result Execution time Memory
290669 2020-09-04T10:00:06 Z Dymo Bosses (BOI16_bosses) C++14
100 / 100
 845 ms 5480 KB 
#include<bits/stdc++.h>

#define ll long long
#define pb push_back
#define all(n) n.begin(),n.end()
#define endl "\n"
#define pll pair<ll,ll>
#define ff first
#define ss second
using namespace std;
const ll maxn=2e5+500;
const ll mod=1e9+7 ;
const ll base=500;
/// con 17 ngay
vector<ll> adj[maxn];
bool dd[maxn];
ll ans=1e15;
ll ans1=0;
ll sum[maxn];

void bfs(ll u)
{
    queue<pll> q;
    q.push(make_pair(1,u));
    while (!q.empty())
    {
        auto p= q.front() ;
        q.pop();
        ll u=p.ss;
        dd[u]=1;
        ans1=ans1+p.ff;
        for (auto to:adj[u])
        {
            if (dd[to]) continue;
            dd[to]=1;
            q.push(make_pair(p.ff+1,to));
        }

    }

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("test.txt","r",stdin);
    if (fopen("Farm.INP","r"))
    {
        freopen("Farm.INP","r",stdin);
        freopen("Farm.OUT","w",stdout);
    }
    ll n;
    cin>>n ;
    for (int i=1; i<=n; i++)
    {
        ll x;
        cin>>x;
        while (x--)
        {
            ll t;
            cin>> t;
            adj[t].pb(i);
        }
    }
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
            dd[j]=0;
            ans1=0;

        bfs(i);
        bool x=false;
        for (int j=1; j<=n; j++)
        {
            if (!dd[j])
            {
                x=true;
                break;
            }
        }
        if (!x)
        {
            ans=min(ans,ans1);

        }

    }
    cout <<ans;








}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:68:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   68 |         for (int j=1; j<=n; j++)
      |         ^~~
bosses.cpp:70:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   70 |             ans1=0;
      |             ^~~~
bosses.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |         freopen("Farm.INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |         freopen("Farm.OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct
12 Correct 10 ms 5248 KB Output is correct
13 Correct 7 ms 5248 KB Output is correct
14 Correct 203 ms 5120 KB Output is correct
15 Correct 19 ms 5248 KB Output is correct
16 Correct 690 ms 5480 KB Output is correct
17 Correct 832 ms 5336 KB Output is correct
18 Correct 845 ms 5368 KB Output is correct