제출 #889558

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889558		thunopro	Cookies (JOI23_cookies)	C++14	25 / 100	1055 ms	3224 KiB

cookies

#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009 
#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); 

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

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

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin (T &a , T b) { if (a>b) a=b ;} 
template < typename T > void chkmax (T &a , T b) { if (a<b) a=b ;}

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 , a [maxn] ; 
int m , b [maxn] ;

int is_sub ; 
void check_sub () 
{
	bool ok = true ; 
	for ( int i = 1 ; i <= n ; i ++ ) if ( a [i] != 1 ) ok = false ; 
	if ( ok == true ) 
	{
		is_sub = 1 ;
		return ; 
	}
	if ( m == 1 ) 
	{
		is_sub = 2 ;
		return ; 
	}
}

void sub1 () 
{
	const int N = 2e4+9 ; 
	int dp [N] , trace [N]; 
	memset ( dp , 0x3f , sizeof dp ) ;
	dp [0] = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		for ( int j = 1 ; j <= m ; j ++ ) 
		{
			if ( i >= b[j] ) 
			{
				if ( dp [i] > dp [i-b[j]] + 1 ) 
				{
					dp [i] = dp [i-b[j]] + 1 ;
					trace [i] = b [j] ;
				}
			}
		}
	}
	if ( dp [n] > INF ) 
	{
		cout << -1  ; re
	}
	vector<vi> res ; 
	int x = n ; 
	int num = 0 ; 
	while ( x ) 
	{
		vi t ; 
		t . pb (trace[x]) ; 
		for ( int i = 1 ; i <= trace [x] ; i ++ ) t . pb (++num) ; 
		res.pb(t) ; 
		x -= trace [x] ; 
	}
	cout << res.size () << "\n" ; 
	for ( auto x : res ) 
	{
		for ( auto y : x ) cout << y << " " ; 
		cout << "\n" ; 
	}
} 


void sub2 () 
{
	pii c [n+10] ; 
	int sum = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) c [i] = {a[i],i} , sum += a [i] ;
	if ( sum % b [1] ) 
	{
		cout << - 1 ; re
	}
	int TIME = sum / b [1] ;
	vector <vi> res ; 
	while ( TIME -- ) 
	{
		sort (c+1,c+n+1,greater<pii>()) ;
		vi ans ; 
		ans . pb (b[1]) ;  
		for ( int i = 1 ; i <= b[1] ; i ++ ) 
		{
			if ( c [i].fi == 0 ) 
			{
				cout << - 1 ; re 
			}
			c [i].fi -- ; 
			ans . pb (c[i].se) ; 
		}
		res.pb (ans) ; 
	}
	cout << res.size () << "\n" ;
	for ( auto x : res ) 
	{
		for ( auto y : x ) cout << y << " " ; 
		cout << "\n" ; 
	}
}

int total = 0 , present = 0 ; 
int num_box = INF ; 
vector<vi> res ; 
int num_choose [maxn] , _num_choose [maxn] ; 
void backtrack ( int pos ) 
{
	if ( pos == m + 1 ) 
	{
		if ( present != total ) return ;
		pii c [n+10] ; 
		for ( int i = 1 ; i <= n ; i ++ ) c [i] = {a[i],i} ; 
		vector <vi> _res ; 
		bool ok = true ; 
		for ( int i = 1 ; i <= m ; i ++ ) _num_choose [i] = num_choose [i] ; 
		while ( true ) 
		{
			int num = 0 ; 
			for ( int i = 1 ; i <= m ; i ++ ) 
			{
				if (!_num_choose[i]) continue ; 
				num = b[i] ; _num_choose[i] -- ; 
				break ; 
			}
			if ( !num ) break ; 
			vi ans ; 
			ans . pb (num) ; 
			sort (c+1,c+n+1,greater<pii>()) ; 
			for ( int i = 1 ; i <= num ; i ++ ) 
			{
				if ( c[i].fi == 0 ) 
				{
					ok = false ; break; 
				}
				c [i].fi -- , ans . pb (c[i].se) ; 
			}
			_res.pb(ans) ; 
		}
		if ( ok == true ) 
		{
			if ( _res.size () < num_box ) 
			{
				num_box = _res.size () ;
				res = _res ;  
			}
		}
		return ; 
		
	}
	for ( int i = 0 ; i <= (total-present)/b[pos] ; i ++ ) 
	{
		num_choose [pos] = i ; 
		present += i*b[pos] ; 
		backtrack (pos+1) ; 
		present -= i*b[pos] ; 
	}
}
void sub3 () 
{
	for ( int i = 1 ; i <= n ; i ++ ) total += a [i] ; 
	reverse (b+1,b+m+1) ; 
	backtrack (1) ; 
	if ( num_box == INF ) cout << - 1 ; 
	else 
	{
		cout << res.size () << "\n" ; 
		for ( auto x : res ) 
		{
			for ( auto y : x ) cout << y << " " ; 
			cout << "\n" ; 
		}
	}
}
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 >> a [i] ; 
	cin >> m ; 
	for ( int i = 1 ; i <= m ; i ++ ) cin >> b [i] ; 
	
	check_sub () ; 

	if ( is_sub == 1 ) sub1 () ; 
	else if ( is_sub == 2 ) sub2 () ; 
	else sub3 () ; 
}

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

cookies.cpp: In function 'void backtrack(int)':
cookies.cpp:183:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  183 |    if ( _res.size () < num_box )
      |         ~~~~~~~~~~~~~^~~~~~~~~
cookies.cpp: In function 'void rf()':
cookies.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 0 / 45
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15