제출 #928792

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928792		Baizho	Bosses (BOI16_bosses)	C++14	0 / 100	1 ms	5212 KiB

bosses

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e5)+5;
const int M = ll(2e5) + 5;
const long long inf = 1e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, dis[N], par[N];
vector<int> g[N], final[N];

void djik(int u) {
	for(int i = 1; i <= n; i ++) dis[i] = 1e9;
	dis[u] = 1;
	par[u] = -1;
	queue<int> q;
	q.push(u);
	while(!q.empty()) {
		int v = q.front();
		q.pop();
		for(auto to : g[v]) {
			if(dis[to] > dis[v] + 1) {
				par[to] = v;
				q.push(to);
				dis[to] = dis[v] + 1;;
			}
		}
	}
}

int siz[N];
 
void dfs(int v, int p = -1) {
	if(siz[v]) return;
	siz[v] = 1;
	for(auto to : final[v]) {
		dfs(to, v);
		siz[v] += siz[to];
	}
}
 

void Baizho() {
	cin>>n;
	for(int i = 1; i <= n; i ++) {
		int k; cin>>k;
		while(k --) {
			int to; cin>>to;
			g[to].pb(i);
		}
	}
	int ans = 2e9;
	for(int i = 1; i <= n; i ++) {
		djik(i);
		for(int j = 1; j <= n; j ++) final[j].clear();
		for(int j = 1; j <= n; j ++) {
			final[par[j]].pb(j);
		}
		int sum = 0;
		for(int j = 1; j <= n; j ++) {
			if(!siz[j]) dfs(j);
			sum += siz[j];
		}
		ans = min(ans, sum);
	}
	cout<<ans;
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

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

bosses.cpp: In function 'void Freopen(std::string)':
bosses.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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