| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 957690 | Oggy | 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>
#define file "C:\\Users\\PC VUI\\Desktop\\CWistor\\VSCODE\\name"
using namespace std;
#define ll long long
#define MAX 100100
#define fi first
#define se second
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<long long>
#define mem(a, b) memset((a), (b), sizeof((a)))
#define all(c) (c).begin(), (c).end()
const int MOD = 1e9 + 7;
const int N = 2e6 + 6;
const ll M = (ll)1e18 + 7LL;
const int INF = 1e9 + 7;
int n, k, index = 0;
vector<int> adj[N];
int vst[N];
queue<pii> q;
void run_with_file()
{
if (fopen(file".inp", "r"))
{
freopen(file".inp", "r", stdin);
freopen(file".out", "w", stdout);
}
}
int calc(int v){
q.push({v, 1});
int total = 0;
vst[v] = index;
while(!q.empty()){
pii x = q.front(); q.pop();
total+= x.se;
for(auto u : adj[x.fi]){
if(vst[u] != index){
vst[u] = index;
q.push({u, x.se + 1});
}
}
}
for(int i = 1; i <= n; ++i){
if(vst[i] != index) return INF;
}
return total;
}
void inp(){
cin >> n >> k;
for(int i = 1; i <= n; ++i){
cin >> k;
for(int j = 1; j <= k; ++j){
int v;
cin >> v;
adj[v].push_back(i);
}
}
int minx = INF;
for(int i = 1; i <= n; ++i){
index++;
minx = min(minx, calc(i));
}
cout << minx;
}
int main()
{
cin.tie(0)->sync_with_stdio(0);
run_with_file();
inp();
}