oj.uz

Submission #951435

# Submission time Handle Problem Language Result Execution time Memory
951435 2024-03-22T00:23:35 Z Zena_Hossam Bosses (BOI16_bosses) C++14
67 / 100
 1500 ms 1372 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
using namespace std;
namespace __gnu_pbds
{
typedef tree<ll,
        null_type,
        less_equal<ll>,
        rb_tree_tag,
        tree_order_statistics_node_update> ordered_set;
}
using namespace __gnu_pbds;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double

#define ll1 long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
map<ll,ll>m;
vector<vector<ll>>v;
ll c=1e9;
void solve(ll idx)
{
    if(m[idx])return;//cout<<idx<<" ";
    ll g=0;//cout<<idx<<"\n";
    for(ll i=0; i<v[idx].size(); i++)
    {
        // cout<<idx<<" "<<v[idx][i]<<"\n";
        solve(v[idx][i]);
        g+=(m[v[idx][i]]);
    }

    m[idx]=g+1;
   // cout<<idx<<" "<<m[idx]<<"\n";
    return;
}
ll ch(ll idx,ll arr[])
{
    if(arr[idx])return 0;
    arr[idx]=1;
    for(ll  i=0; i<v[idx].size(); i++)
    {
        if(!ch(v[idx][i],arr))return 0;
    }
    return 1;
}
int main()
{
    //freopen("stdin.in","r",stdin);freopen("stdout.out","w",stdout);
    //cin>>T;ll oo=0;
    ll n;
    cin>>n;
    vector<ll>s[n+5];
    ll a[n+5]= {};
    v.resize(n+5);
    for(ll i=0; i<n; i++)
    {
        ll m;
        cin>>m;
        for(ll j=0; j<m; j++)
        {
            ll o;
            cin>>o;
            s[o].push_back(i+1);
        }
    }
    for(ll i=1; i<=n; i++)
    {
        queue<ll>q;
        ll ss=0;
        q.push(i);ll aa[n+5]={};ll k2=0;
        while(q.size())
        {k2++;
            ll a1=q.front();
            q.pop();
           // cout<<a1<<"\n";
            aa[a1]=1;
            for(ll j=0; j<s[a1].sz; j++)
            {ll o[n+5]={};
                if(aa[s[a1][j]]==0&&ch(s[a1][j],o)){aa[s[a1][j]]=1;
                v[a1].push_back(s[a1][j]);
                q.push(s[a1][j]);}
            }
        }
        for(ll ii=1; ii<=n; ii++)
        {

            if(!m[ii])
                solve(ii);
            ss+=m[ii];
        }
        if(k2==n)
        c=min(ss,c);
        for(ll i=1; i<=n; i++)
            v[i].clear();
        m.clear();
    }
    cout<<c;
}

Compilation message

bosses.cpp: In function 'void solve(long long int)':
bosses.cpp:31:18: 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]
   31 |     for(ll i=0; i<v[idx].size(); i++)
      |                 ~^~~~~~~~~~~~~~
bosses.cpp: In function 'long long int ch(long long int, long long int*)':
bosses.cpp:46:19: 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]
   46 |     for(ll  i=0; i<v[idx].size(); i++)
      |                  ~^~~~~~~~~~~~~~
bosses.cpp: In function 'int main()':
bosses.cpp:83:26: 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]
   83 |             for(ll j=0; j<s[a1].sz; j++)
      |                          ^
bosses.cpp:59:8: warning: unused variable 'a' [-Wunused-variable]
   59 |     ll a[n+5]= {};
      |        ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 53 ms 620 KB Output is correct
13 Correct 31 ms 604 KB Output is correct
14 Execution timed out 1560 ms 1372 KB Time limit exceeded
15 Halted 0 ms 0 KB -