제출 #890365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890365		thunopro	Bosses (BOI16_bosses)	C++14	0 / 100	4 ms	17756 KiB

bosses

#include<bits/stdc++.h>
using namespace std ; 
#define maxn 300009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1
#define re exit(0);
#define list LIST 
#define _lower(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()+1

const int mod = 1e9+7 ; 
const int INF = 1e9 ;
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ;
typedef vector<ll> vl ;  
typedef pair<ll,ll> pll ; 
typedef vector<pll> vll ; 

void add ( int&a , int b ) { if ((a+=b) > mod ) a -= mod ; } 
void sub ( int&a , int b ) { if ((a-=b) < 0 ) a += mod ; } 
template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}

void rf ( ) 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow ( a , n / 2 ) ; 
	if ( n % 2 ) return ( 1ll * res * res % mod * a % mod ) ; 
	else return ( 1ll * res * res % mod ) ; 
}
int n ; 

vi list [maxn] ; 
int sz [maxn] ; 

int res = INF  ; 
vi adjList [maxn] ; 
int dp [maxn] ; 
int par [maxn] ; 
bool check_sub1 () 
{
	int sum = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) sum += sz [i] ; 
	return ( n <= 10 && sum <= 20 ) ; 
}

void dfs_sub1 ( int u ) 
{
	dp [u] = 0 ; 
	int sum = 0 ; 
	for ( auto v : adjList [u] ) 
	{
		dfs_sub1 (v) ; 
		sum += dp [v] ; 
	}
	dp [u] = sum + 1 ; 
}
void backtrack ( int pos ) 
{
	if ( pos == n + 1 ) 
	{
		for ( int elim = 1 ; elim <= n ; elim ++ ) 
		{
			for ( int i = 1 ; i <= n ; i ++ ) adjList [i] . clear () ; 
			for ( int i = 1 ; i <= n ; i ++ ) 
			{
				if ( i != elim ) adjList [par[i]] . pb (i) ; 
			}
			for ( int i = 1 ; i <= n ; i ++ ) dp [i] = -1 ; 
			dfs_sub1 (elim) ; 
			int sum = 0 ; 
			bool ok = true ; 
			for ( int i = 1 ; i <= n ; i ++ ) 
			{
				if ( dp [i] == - 1 ) ok = false ; 
				sum += dp [i] ; 
			}
			if ( ok ) res = min (res,sum) ; 
		}
		return ; 
	}
	for ( int i = 1 ; i <= sz [pos] ; i ++ ) 
	{
		par [pos] = list [pos][i-1] ; 
		backtrack (pos+1) ; 
	}
}
void sub1 () 
{
	backtrack (1) ; 	
	cout << res ; re
}
int main ( ) 
{
	ios_base :: sync_with_stdio (0) ; 
	cin.tie(0) ; cout.tie(0) ;
//	rf () ; 
	cin >> n ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		cin >> sz [i] ; 
		for ( int j = 1 ; j <= sz [i] ; j ++ ) 
		{
			int x ; cin >> x ; 
			list [i] . pb (x) ; 
		}
	}
	
	if ( check_sub1 () ) sub1 () ; 
}




//-std=c++11

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

bosses.cpp: In function 'void rf()':
bosses.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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