| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 951430 | Zena_Hossam | Bosses (BOI16_bosses) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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[])
{
//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]={};
while(q.size())
{
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(i,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];
}
c=min(ss,c);
for(ll i=1; i<=n; i++)
v[i].clear();
m.clear();
}
cout<<c;
}